TSTP Solution File: HEN009-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:51:02 EDT 2023
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 32 unt; 0 nHn; 34 RR)
% Number of literals : 72 ( 29 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(property_of_divide3,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',property_of_divide3) ).
cnf(id_divide_a_is_b,hypothesis,
divide(identity,a) = b,
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',id_divide_a_is_b) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',identity_is_largest) ).
cnf(property_of_divide1,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',property_of_divide1) ).
cnf(id_divide_b_is_c,hypothesis,
divide(identity,b) = c,
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',id_divide_b_is_c) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',less_equal_and_equal) ).
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.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.rB8MWjNLaz/E---3.1_25470.p',quotient_property) ).
cnf(id_divide_c_is_d,hypothesis,
divide(identity,c) = d,
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',id_divide_c_is_d) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',zero_is_smallest) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',quotient_less_equal2) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',zero_divide_anything_is_zero) ).
cnf(prove_b_equals_d,negated_conjecture,
b != d,
file('/export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p',prove_b_equals_d) ).
cnf(c_0_14,axiom,
( less_equal(divide(X1,X3),divide(X2,X3))
| ~ less_equal(X1,X2) ),
property_of_divide3 ).
cnf(c_0_15,hypothesis,
divide(identity,a) = b,
id_divide_a_is_b ).
cnf(c_0_16,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_17,axiom,
( less_equal(divide(X1,X3),X2)
| ~ less_equal(divide(X1,X2),X3) ),
property_of_divide1 ).
cnf(c_0_18,hypothesis,
less_equal(divide(X1,a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,hypothesis,
( less_equal(divide(identity,X1),a)
| ~ less_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,hypothesis,
divide(identity,b) = c,
id_divide_b_is_c ).
cnf(c_0_21,hypothesis,
less_equal(b,b),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_23,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_24,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_25,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_26,hypothesis,
divide(identity,c) = d,
id_divide_c_is_d ).
cnf(c_0_27,hypothesis,
less_equal(c,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( divide(X1,X2) = divide(X3,X2)
| ~ less_equal(divide(X1,X2),divide(X3,X2))
| ~ less_equal(X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_29,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_31,hypothesis,
less_equal(divide(divide(identity,X1),divide(c,X1)),divide(d,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,hypothesis,
divide(c,a) = zero,
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_33,hypothesis,
less_equal(divide(X1,b),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16])]) ).
cnf(c_0_34,plain,
( divide(X1,X2) = zero
| ~ less_equal(X1,divide(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,hypothesis,
less_equal(divide(b,zero),divide(d,a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15]) ).
cnf(c_0_36,axiom,
( less_equal(X1,X2)
| divide(X1,X2) != zero ),
quotient_less_equal2 ).
cnf(c_0_37,hypothesis,
( less_equal(divide(identity,X1),b)
| ~ less_equal(c,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_38,hypothesis,
less_equal(c,c),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_39,plain,
( divide(X1,X2) = X1
| ~ less_equal(X1,divide(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_40,plain,
( divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2)
| ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_41,hypothesis,
divide(divide(b,zero),d) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_43,plain,
( X1 = X2
| divide(X2,X1) != zero
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_44,hypothesis,
less_equal(d,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
b != d,
prove_b_equals_d ).
cnf(c_0_46,plain,
( divide(X1,X2) = X1
| divide(X1,divide(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_47,hypothesis,
divide(divide(b,d),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_42]),c_0_30])]) ).
cnf(c_0_48,hypothesis,
divide(b,d) != zero,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_47])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN009-6 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 11:36:14 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rB8MWjNLaz/E---3.1_25470.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25554 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FHUSM-FFSS22-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.53 # Starting sh5l with 136s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25561 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FHUSM-FFSS22-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 17
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 17
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 17
% 0.20/0.53 # Processed clauses : 733
% 0.20/0.53 # ...of these trivial : 10
% 0.20/0.53 # ...subsumed : 433
% 0.20/0.53 # ...remaining for further processing : 290
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 76
% 0.20/0.53 # Backward-rewritten : 5
% 0.20/0.53 # Generated clauses : 4016
% 0.20/0.53 # ...of the previous two non-redundant : 2281
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 1
% 0.20/0.53 # Paramodulations : 4016
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Total rewrite steps : 4024
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 193
% 0.20/0.53 # Positive orientable unit clauses : 66
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 33
% 0.20/0.53 # Non-unit-clauses : 94
% 0.20/0.53 # Current number of unprocessed clauses: 1482
% 0.20/0.53 # ...number of literals in the above : 2768
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 97
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 668
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 660
% 0.20/0.54 # Non-unit clause-clause subsumptions : 184
% 0.20/0.54 # Unit Clause-clause subsumption calls : 611
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 28
% 0.20/0.54 # BW rewrite match successes : 2
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 39163
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.050 s
% 0.20/0.54 # System time : 0.003 s
% 0.20/0.54 # Total time : 0.053 s
% 0.20/0.54 # Maximum resident set size: 1604 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.249 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.257 s
% 0.20/0.54 # Maximum resident set size: 1680 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------