TSTP Solution File: HEN010-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN010-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:53 EDT 2023
% Result : Unsatisfiable 4.91s 1.11s
% Output : CNFRefutation 4.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 18 unt; 0 nHn; 33 RR)
% Number of literals : 84 ( 10 equ; 47 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(one_inversion_equals_three,axiom,
( X2 = X4
| ~ quotient(identity,X1,X2)
| ~ quotient(identity,X2,X3)
| ~ quotient(identity,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',one_inversion_equals_three) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',closure) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',divisor_existence) ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',identity_divide_idQ_idQa) ).
cnf(quotient_property,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',quotient_property) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',x_divde_zero_is_x) ).
cnf(identity_divide_idQa,hypothesis,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',identity_divide_idQa) ).
cnf(transitivity_of_less_equal,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',transitivity_of_less_equal) ).
cnf(x_divide_x_is_zero,axiom,
quotient(X1,X1,zero),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',x_divide_x_is_zero) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',identity_divide_a) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',less_equal_quotient) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',less_equal_and_equal) ).
cnf(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox/tmp/tmp.Tcmnh4yNIB/E---3.1_28452.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
cnf(c_0_13,axiom,
( X2 = X4
| ~ quotient(identity,X1,X2)
| ~ quotient(identity,X2,X3)
| ~ quotient(identity,X3,X4) ),
one_inversion_equals_three ).
cnf(c_0_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_16,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
identity_divide_idQ_idQa ).
cnf(c_0_17,axiom,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
quotient_property ).
cnf(c_0_18,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_19,plain,
( X1 = divide(identity,X2)
| ~ quotient(identity,X1,X2)
| ~ quotient(identity,X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,hypothesis,
quotient(identity,idQa,idQ_idQa),
identity_divide_idQa ).
cnf(c_0_21,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
transitivity_of_less_equal ).
cnf(c_0_22,hypothesis,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,zero)
| ~ quotient(X5,X4,X2)
| ~ quotient(X6,X4,X1)
| ~ quotient(X6,X3,X5) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,axiom,
quotient(X1,X1,zero),
x_divide_x_is_zero ).
cnf(c_0_25,hypothesis,
( divide(identity,idQ_idQa) = idQa
| ~ quotient(identity,X1,idQa) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,hypothesis,
quotient(identity,a,idQa),
identity_divide_a ).
cnf(c_0_27,hypothesis,
( less_equal(X1,idQa)
| ~ less_equal(X1,idQa_Q__idQ_idQa) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_29,plain,
( less_equal(X1,X2)
| ~ quotient(X3,X4,X2)
| ~ quotient(X5,X4,X1)
| ~ quotient(X5,X4,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,hypothesis,
divide(identity,idQ_idQa) = idQa,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_32,hypothesis,
( less_equal(X1,idQa)
| ~ quotient(X1,idQa_Q__idQ_idQa,zero) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,hypothesis,
( less_equal(X1,idQa_Q__idQ_idQa)
| ~ quotient(X2,idQ_idQa,idQa)
| ~ quotient(X2,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_34,hypothesis,
quotient(identity,idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_35,hypothesis,
( idQa = X1
| ~ quotient(X1,idQa_Q__idQ_idQa,zero)
| ~ less_equal(idQa,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,hypothesis,
( less_equal(X1,idQa_Q__idQ_idQa)
| ~ quotient(identity,idQ_idQa,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
prove_idQa_equals_idQa_Q__idQ_idQa ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]),c_0_34])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HEN010-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:14:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.Tcmnh4yNIB/E---3.1_28452.p
% 4.91/1.11 # Version: 3.1pre001
% 4.91/1.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.91/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.91/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.91/1.11 # Starting new_bool_3 with 300s (1) cores
% 4.91/1.11 # Starting new_bool_1 with 300s (1) cores
% 4.91/1.11 # Starting sh5l with 300s (1) cores
% 4.91/1.11 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28559 completed with status 0
% 4.91/1.11 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.91/1.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.91/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.91/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.91/1.11 # No SInE strategy applied
% 4.91/1.11 # Search class: FHUSM-FFSS22-SFFFFFNN
% 4.91/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.91/1.11 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.91/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.91/1.11 # Starting new_bool_3 with 136s (1) cores
% 4.91/1.11 # Starting new_bool_1 with 136s (1) cores
% 4.91/1.11 # Starting sh5l with 136s (1) cores
% 4.91/1.11 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28565 completed with status 0
% 4.91/1.11 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.91/1.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.91/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.91/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.91/1.11 # No SInE strategy applied
% 4.91/1.11 # Search class: FHUSM-FFSS22-SFFFFFNN
% 4.91/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.91/1.11 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.91/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.91/1.11 # Preprocessing time : 0.001 s
% 4.91/1.11 # Presaturation interreduction done
% 4.91/1.11
% 4.91/1.11 # Proof found!
% 4.91/1.11 # SZS status Unsatisfiable
% 4.91/1.11 # SZS output start CNFRefutation
% See solution above
% 4.91/1.11 # Parsed axioms : 22
% 4.91/1.11 # Removed by relevancy pruning/SinE : 0
% 4.91/1.11 # Initial clauses : 22
% 4.91/1.11 # Removed in clause preprocessing : 0
% 4.91/1.11 # Initial clauses in saturation : 22
% 4.91/1.11 # Processed clauses : 19422
% 4.91/1.11 # ...of these trivial : 25
% 4.91/1.11 # ...subsumed : 17882
% 4.91/1.11 # ...remaining for further processing : 1515
% 4.91/1.11 # Other redundant clauses eliminated : 0
% 4.91/1.11 # Clauses deleted for lack of memory : 0
% 4.91/1.11 # Backward-subsumed : 152
% 4.91/1.11 # Backward-rewritten : 1
% 4.91/1.11 # Generated clauses : 70895
% 4.91/1.11 # ...of the previous two non-redundant : 57281
% 4.91/1.11 # ...aggressively subsumed : 0
% 4.91/1.11 # Contextual simplify-reflections : 7
% 4.91/1.11 # Paramodulations : 70895
% 4.91/1.11 # Factorizations : 0
% 4.91/1.11 # NegExts : 0
% 4.91/1.11 # Equation resolutions : 0
% 4.91/1.11 # Total rewrite steps : 29034
% 4.91/1.11 # Propositional unsat checks : 0
% 4.91/1.11 # Propositional check models : 0
% 4.91/1.11 # Propositional check unsatisfiable : 0
% 4.91/1.11 # Propositional clauses : 0
% 4.91/1.11 # Propositional clauses after purity: 0
% 4.91/1.11 # Propositional unsat core size : 0
% 4.91/1.11 # Propositional preprocessing time : 0.000
% 4.91/1.11 # Propositional encoding time : 0.000
% 4.91/1.11 # Propositional solver time : 0.000
% 4.91/1.11 # Success case prop preproc time : 0.000
% 4.91/1.11 # Success case prop encoding time : 0.000
% 4.91/1.11 # Success case prop solver time : 0.000
% 4.91/1.11 # Current number of processed clauses : 1340
% 4.91/1.11 # Positive orientable unit clauses : 90
% 4.91/1.11 # Positive unorientable unit clauses: 0
% 4.91/1.11 # Negative unit clauses : 92
% 4.91/1.11 # Non-unit-clauses : 1158
% 4.91/1.11 # Current number of unprocessed clauses: 37215
% 4.91/1.11 # ...number of literals in the above : 119133
% 4.91/1.11 # Current number of archived formulas : 0
% 4.91/1.11 # Current number of archived clauses : 175
% 4.91/1.11 # Clause-clause subsumption calls (NU) : 217826
% 4.91/1.11 # Rec. Clause-clause subsumption calls : 144760
% 4.91/1.11 # Non-unit clause-clause subsumptions : 6336
% 4.91/1.11 # Unit Clause-clause subsumption calls : 15022
% 4.91/1.11 # Rewrite failures with RHS unbound : 0
% 4.91/1.11 # BW rewrite match attempts : 116
% 4.91/1.11 # BW rewrite match successes : 1
% 4.91/1.11 # Condensation attempts : 0
% 4.91/1.11 # Condensation successes : 0
% 4.91/1.11 # Termbank termtop insertions : 643354
% 4.91/1.11
% 4.91/1.11 # -------------------------------------------------
% 4.91/1.11 # User time : 0.580 s
% 4.91/1.11 # System time : 0.014 s
% 4.91/1.11 # Total time : 0.594 s
% 4.91/1.11 # Maximum resident set size: 1648 pages
% 4.91/1.11
% 4.91/1.11 # -------------------------------------------------
% 4.91/1.11 # User time : 3.017 s
% 4.91/1.11 # System time : 0.029 s
% 4.91/1.11 # Total time : 3.046 s
% 4.91/1.11 # Maximum resident set size: 1684 pages
% 4.91/1.11 % E---3.1 exiting
% 4.91/1.11 % E---3.1 exiting
%------------------------------------------------------------------------------