TSTP Solution File: HEN006-7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HEN006-7 : 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:49 EDT 2023
% Result : Unsatisfiable 3.38s 0.98s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 21 unt; 0 nHn; 37 RR)
% Number of literals : 99 ( 10 equ; 55 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 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 : 100 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',divisor_existence) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',closure) ).
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.T5sxyxzvgq/E---3.1_31756.p',quotient_property) ).
cnf(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',quotient_less_equal) ).
cnf(xQyLEz,hypothesis,
less_equal(xQy,z),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',xQyLEz) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',x_divde_zero_is_x) ).
cnf(less_equal_and_equal,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',less_equal_quotient) ).
cnf(xQz,hypothesis,
quotient(x,z,xQz),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',xQz) ).
cnf(well_defined,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',well_defined) ).
cnf(zero_divide_anything_is_zero,axiom,
quotient(zero,X1,zero),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',zero_divide_anything_is_zero) ).
cnf(xQy,hypothesis,
quotient(x,y,xQy),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',xQy) ).
cnf(prove_xQzLEy,negated_conjecture,
~ less_equal(xQz,y),
file('/export/starexec/sandbox/tmp/tmp.T5sxyxzvgq/E---3.1_31756.p',prove_xQzLEy) ).
cnf(c_0_13,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_14,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_15,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_16,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
quotient_less_equal ).
cnf(c_0_17,hypothesis,
less_equal(xQy,z),
xQyLEz ).
cnf(c_0_18,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_19,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X4,X5,X3)
| ~ quotient(X6,X5,X2)
| ~ quotient(X7,X5,X1)
| ~ quotient(X7,X6,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,hypothesis,
quotient(xQy,z,zero),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,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_15,c_0_18]) ).
cnf(c_0_23,plain,
quotient(divide(X1,X2),X1,zero),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,hypothesis,
( less_equal(divide(X1,X2),zero)
| ~ quotient(X3,z,X2)
| ~ quotient(X4,z,X1)
| ~ quotient(X4,X3,xQy) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( less_equal(X1,X2)
| ~ quotient(X3,divide(X4,X5),X6)
| ~ quotient(X6,X4,X2)
| ~ quotient(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
( X1 = X2
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X1) ),
less_equal_and_equal ).
cnf(c_0_27,axiom,
( less_equal(X1,X2)
| ~ quotient(X1,X2,zero) ),
less_equal_quotient ).
cnf(c_0_28,hypothesis,
( less_equal(divide(X1,divide(X2,z)),zero)
| ~ quotient(X3,z,X1)
| ~ quotient(X3,X2,xQy) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_29,hypothesis,
quotient(x,z,xQz),
xQz ).
cnf(c_0_30,axiom,
( X3 = X4
| ~ quotient(X1,X2,X3)
| ~ quotient(X1,X2,X4) ),
well_defined ).
cnf(c_0_31,axiom,
quotient(zero,X1,zero),
zero_divide_anything_is_zero ).
cnf(c_0_32,plain,
( less_equal(X1,X2)
| ~ quotient(divide(X3,divide(X4,X5)),X4,X2)
| ~ quotient(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ quotient(X2,X1,zero)
| ~ less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,hypothesis,
( less_equal(divide(xQz,divide(X1,z)),zero)
| ~ quotient(x,X1,xQy) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( X1 = zero
| ~ quotient(zero,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( less_equal(X1,divide(divide(X2,divide(X3,X4)),X3))
| ~ quotient(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_37,hypothesis,
( divide(xQz,divide(X1,z)) = zero
| ~ quotient(x,X1,xQy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
cnf(c_0_38,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_39,hypothesis,
( less_equal(X1,zero)
| ~ quotient(x,X2,xQy)
| ~ quotient(xQz,X2,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,hypothesis,
quotient(x,y,xQy),
xQy ).
cnf(c_0_41,hypothesis,
( less_equal(X1,zero)
| ~ quotient(xQz,y,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,hypothesis,
( X1 = zero
| ~ quotient(xQz,y,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_41]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
~ less_equal(xQz,y),
prove_xQzLEy ).
cnf(c_0_44,hypothesis,
divide(xQz,y) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_14]) ).
cnf(c_0_45,negated_conjecture,
~ quotient(xQz,y,zero),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HEN006-7 : TPTP v8.1.2. Released v1.0.0.
% 0.08/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:13:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.T5sxyxzvgq/E---3.1_31756.p
% 3.38/0.98 # Version: 3.1pre001
% 3.38/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.38/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.38/0.98 # Starting new_bool_3 with 300s (1) cores
% 3.38/0.98 # Starting new_bool_1 with 300s (1) cores
% 3.38/0.98 # Starting sh5l with 300s (1) cores
% 3.38/0.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31915 completed with status 0
% 3.38/0.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.38/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.38/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.38/0.98 # No SInE strategy applied
% 3.38/0.98 # Search class: FHUSM-FFSS22-SFFFFFNN
% 3.38/0.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.38/0.98 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.38/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.38/0.98 # Starting new_bool_3 with 136s (1) cores
% 3.38/0.98 # Starting new_bool_1 with 136s (1) cores
% 3.38/0.98 # Starting sh5l with 136s (1) cores
% 3.38/0.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31920 completed with status 0
% 3.38/0.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.38/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.38/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.38/0.98 # No SInE strategy applied
% 3.38/0.98 # Search class: FHUSM-FFSS22-SFFFFFNN
% 3.38/0.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.38/0.98 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.38/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.38/0.98 # Preprocessing time : 0.001 s
% 3.38/0.98 # Presaturation interreduction done
% 3.38/0.98
% 3.38/0.98 # Proof found!
% 3.38/0.98 # SZS status Unsatisfiable
% 3.38/0.98 # SZS output start CNFRefutation
% See solution above
% 3.38/0.98 # Parsed axioms : 17
% 3.38/0.98 # Removed by relevancy pruning/SinE : 0
% 3.38/0.98 # Initial clauses : 17
% 3.38/0.98 # Removed in clause preprocessing : 0
% 3.38/0.98 # Initial clauses in saturation : 17
% 3.38/0.98 # Processed clauses : 8416
% 3.38/0.98 # ...of these trivial : 5
% 3.38/0.98 # ...subsumed : 6967
% 3.38/0.98 # ...remaining for further processing : 1444
% 3.38/0.98 # Other redundant clauses eliminated : 0
% 3.38/0.98 # Clauses deleted for lack of memory : 0
% 3.38/0.98 # Backward-subsumed : 395
% 3.38/0.98 # Backward-rewritten : 70
% 3.38/0.98 # Generated clauses : 33708
% 3.38/0.98 # ...of the previous two non-redundant : 24452
% 3.38/0.98 # ...aggressively subsumed : 0
% 3.38/0.98 # Contextual simplify-reflections : 0
% 3.38/0.98 # Paramodulations : 33708
% 3.38/0.98 # Factorizations : 0
% 3.38/0.98 # NegExts : 0
% 3.38/0.98 # Equation resolutions : 0
% 3.38/0.98 # Total rewrite steps : 20105
% 3.38/0.98 # Propositional unsat checks : 0
% 3.38/0.98 # Propositional check models : 0
% 3.38/0.98 # Propositional check unsatisfiable : 0
% 3.38/0.98 # Propositional clauses : 0
% 3.38/0.98 # Propositional clauses after purity: 0
% 3.38/0.98 # Propositional unsat core size : 0
% 3.38/0.98 # Propositional preprocessing time : 0.000
% 3.38/0.98 # Propositional encoding time : 0.000
% 3.38/0.98 # Propositional solver time : 0.000
% 3.38/0.98 # Success case prop preproc time : 0.000
% 3.38/0.98 # Success case prop encoding time : 0.000
% 3.38/0.98 # Success case prop solver time : 0.000
% 3.38/0.98 # Current number of processed clauses : 962
% 3.38/0.98 # Positive orientable unit clauses : 51
% 3.38/0.98 # Positive unorientable unit clauses: 0
% 3.38/0.98 # Negative unit clauses : 39
% 3.38/0.98 # Non-unit-clauses : 872
% 3.38/0.98 # Current number of unprocessed clauses: 13485
% 3.38/0.98 # ...number of literals in the above : 50679
% 3.38/0.98 # Current number of archived formulas : 0
% 3.38/0.98 # Current number of archived clauses : 482
% 3.38/0.98 # Clause-clause subsumption calls (NU) : 719328
% 3.38/0.98 # Rec. Clause-clause subsumption calls : 586263
% 3.38/0.98 # Non-unit clause-clause subsumptions : 6726
% 3.38/0.98 # Unit Clause-clause subsumption calls : 22967
% 3.38/0.98 # Rewrite failures with RHS unbound : 0
% 3.38/0.98 # BW rewrite match attempts : 78
% 3.38/0.98 # BW rewrite match successes : 14
% 3.38/0.98 # Condensation attempts : 0
% 3.38/0.98 # Condensation successes : 0
% 3.38/0.98 # Termbank termtop insertions : 406886
% 3.38/0.98
% 3.38/0.98 # -------------------------------------------------
% 3.38/0.98 # User time : 0.454 s
% 3.38/0.98 # System time : 0.010 s
% 3.38/0.98 # Total time : 0.464 s
% 3.38/0.98 # Maximum resident set size: 1608 pages
% 3.38/0.98
% 3.38/0.98 # -------------------------------------------------
% 3.38/0.98 # User time : 2.298 s
% 3.38/0.98 # System time : 0.029 s
% 3.38/0.98 # Total time : 2.327 s
% 3.38/0.98 # Maximum resident set size: 1684 pages
% 3.38/0.98 % E---3.1 exiting
% 3.38/0.98 % E---3.1 exiting
%------------------------------------------------------------------------------