TSTP Solution File: HEN007-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:50:50 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of clauses : 40 ( 34 unt; 0 nHn; 12 RR)
% Number of literals : 48 ( 16 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 53 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',less_equal_and_equal) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',quotient_less_equal2) ).
cnf(a_LE_b,hypothesis,
less_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',a_LE_b) ).
cnf(prove_c_divide_b_LE_c_divide_a,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
file('/export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p',prove_c_divide_b_LE_c_divide_a) ).
cnf(c_0_8,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_9,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_10,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_11,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_13,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_16,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_18,plain,
divide(divide(X1,X1),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]) ).
cnf(c_0_19,plain,
less_equal(divide(X1,X1),zero),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,zero),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_21,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_12])]) ).
cnf(c_0_22,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_22]),c_0_12])]) ).
cnf(c_0_24,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_25,hypothesis,
less_equal(a,b),
a_LE_b ).
cnf(c_0_26,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_24]),c_0_12])]) ).
cnf(c_0_27,hypothesis,
divide(a,b) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_28,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_29,hypothesis,
less_equal(divide(divide(X1,b),zero),divide(divide(X1,a),b)),
inference(spm,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_30,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_28]),c_0_9])]) ).
cnf(c_0_31,plain,
less_equal(divide(divide(X1,X2),zero),divide(divide(X1,divide(X2,X3)),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_32,hypothesis,
less_equal(divide(X1,b),divide(divide(X1,a),b)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
less_equal(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_34,hypothesis,
divide(divide(X1,b),divide(divide(X1,a),b)) = zero,
inference(spm,[status(thm)],[c_0_8,c_0_32]) ).
cnf(c_0_35,hypothesis,
less_equal(divide(divide(X1,b),divide(X1,a)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_14]) ).
cnf(c_0_36,hypothesis,
divide(divide(X1,b),divide(X1,a)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_35]),c_0_30]) ).
cnf(c_0_37,negated_conjecture,
~ less_equal(divide(c,b),divide(c,a)),
prove_c_divide_b_LE_c_divide_a ).
cnf(c_0_38,hypothesis,
less_equal(divide(X1,b),divide(X1,a)),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN007-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 11:14:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.7toMigQa5Q/E---3.1_770.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 939 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 950 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSS-FFSF22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 9
% 0.21/0.52 # Removed by relevancy pruning/SinE : 1
% 0.21/0.52 # Initial clauses : 8
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 8
% 0.21/0.52 # Processed clauses : 92
% 0.21/0.52 # ...of these trivial : 4
% 0.21/0.52 # ...subsumed : 22
% 0.21/0.52 # ...remaining for further processing : 66
% 0.21/0.52 # Other redundant clauses eliminated : 2
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 24
% 0.21/0.52 # Generated clauses : 636
% 0.21/0.52 # ...of the previous two non-redundant : 212
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 634
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 2
% 0.21/0.52 # Total rewrite steps : 990
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 34
% 0.21/0.52 # Positive orientable unit clauses : 24
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 10
% 0.21/0.52 # Current number of unprocessed clauses: 114
% 0.21/0.52 # ...number of literals in the above : 122
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 32
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 56
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 56
% 0.21/0.52 # Non-unit clause-clause subsumptions : 22
% 0.21/0.52 # Unit Clause-clause subsumption calls : 4
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 75
% 0.21/0.52 # BW rewrite match successes : 16
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 6444
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1644 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 1676 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------