TSTP Solution File: HEN007-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HEN007-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:02:31 EDT 2024
% Result : Unsatisfiable 0.69s 0.56s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 16 unt; 0 nHn; 29 RR)
% Number of literals : 73 ( 0 equ; 42 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
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.jT442tACwh/E---3.1_15330.p',quotient_property) ).
cnf(quotient_less_equal,axiom,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',quotient_less_equal) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',x_divde_zero_is_x) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',xLEy) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',divisor_existence) ).
cnf(transitivity_of_less_equal,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',transitivity_of_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',closure) ).
cnf(zQy,hypothesis,
quotient(z,y,zQy),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',zQy) ).
cnf(prove_zQyLEzQx,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',prove_zQyLEzQx) ).
cnf(zQx,hypothesis,
quotient(z,x,zQx),
file('/export/starexec/sandbox/tmp/tmp.jT442tACwh/E---3.1_15330.p',zQx) ).
cnf(c_0_10,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_11,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_12,plain,
( less_equal(X7,X8)
| ~ quotient(X1,X2,X3)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X4,X6)
| ~ quotient(X6,X5,X7)
| ~ quotient(X3,X4,X8) ),
c_0_10 ).
cnf(c_0_13,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_14,plain,
( quotient(X1,X2,zero)
| ~ less_equal(X1,X2) ),
c_0_11 ).
cnf(c_0_15,hypothesis,
less_equal(x,y),
xLEy ).
cnf(c_0_16,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_17,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_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
quotient(x,y,zero),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_equal]) ).
cnf(c_0_20,plain,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_21,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_22,hypothesis,
( less_equal(X1,X2)
| ~ quotient(X3,y,X2)
| ~ quotient(X4,y,X1)
| ~ quotient(X4,x,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
c_0_19 ).
cnf(c_0_24,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
( less_equal(X1,divide(X2,y))
| ~ quotient(X3,y,X1)
| ~ quotient(X3,x,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,hypothesis,
quotient(z,y,zQy),
zQy ).
cnf(c_0_27,negated_conjecture,
~ less_equal(zQy,zQx),
inference(fof_simplification,[status(thm)],[prove_zQyLEzQx]) ).
cnf(c_0_28,plain,
( less_equal(X1,X2)
| ~ less_equal(X1,divide(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
( less_equal(zQy,divide(X1,y))
| ~ quotient(z,x,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ less_equal(zQy,zQx),
c_0_27 ).
cnf(c_0_31,hypothesis,
( less_equal(zQy,X1)
| ~ quotient(z,x,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,hypothesis,
quotient(z,x,zQx),
zQx ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN007-6 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 08:44:50 EDT 2024
% 0.15/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.jT442tACwh/E---3.1_15330.p
% 0.69/0.56 # Version: 3.1.0
% 0.69/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.69/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.69/0.56 # Starting sh5l with 300s (1) cores
% 0.69/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15408 completed with status 0
% 0.69/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.69/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.56 # No SInE strategy applied
% 0.69/0.56 # Search class: FHUSM-FFSS22-SFFFFFNN
% 0.69/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.56 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.69/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.69/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.69/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.69/0.56 # Starting sh5l with 136s (1) cores
% 0.69/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15413 completed with status 0
% 0.69/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.69/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.56 # No SInE strategy applied
% 0.69/0.56 # Search class: FHUSM-FFSS22-SFFFFFNN
% 0.69/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.56 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.69/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.69/0.56 # Preprocessing time : 0.001 s
% 0.69/0.56 # Presaturation interreduction done
% 0.69/0.56
% 0.69/0.56 # Proof found!
% 0.69/0.56 # SZS status Unsatisfiable
% 0.69/0.56 # SZS output start CNFRefutation
% See solution above
% 0.69/0.56 # Parsed axioms : 18
% 0.69/0.56 # Removed by relevancy pruning/SinE : 0
% 0.69/0.56 # Initial clauses : 18
% 0.69/0.56 # Removed in clause preprocessing : 0
% 0.69/0.56 # Initial clauses in saturation : 18
% 0.69/0.56 # Processed clauses : 1800
% 0.69/0.56 # ...of these trivial : 10
% 0.69/0.56 # ...subsumed : 1353
% 0.69/0.56 # ...remaining for further processing : 437
% 0.69/0.56 # Other redundant clauses eliminated : 0
% 0.69/0.56 # Clauses deleted for lack of memory : 0
% 0.69/0.56 # Backward-subsumed : 63
% 0.69/0.56 # Backward-rewritten : 0
% 0.69/0.56 # Generated clauses : 4627
% 0.69/0.56 # ...of the previous two non-redundant : 3423
% 0.69/0.56 # ...aggressively subsumed : 0
% 0.69/0.56 # Contextual simplify-reflections : 0
% 0.69/0.56 # Paramodulations : 4627
% 0.69/0.56 # Factorizations : 0
% 0.69/0.56 # NegExts : 0
% 0.69/0.56 # Equation resolutions : 0
% 0.69/0.56 # Disequality decompositions : 0
% 0.69/0.56 # Total rewrite steps : 2115
% 0.69/0.56 # ...of those cached : 1947
% 0.69/0.56 # Propositional unsat checks : 0
% 0.69/0.56 # Propositional check models : 0
% 0.69/0.56 # Propositional check unsatisfiable : 0
% 0.69/0.56 # Propositional clauses : 0
% 0.69/0.56 # Propositional clauses after purity: 0
% 0.69/0.56 # Propositional unsat core size : 0
% 0.69/0.56 # Propositional preprocessing time : 0.000
% 0.69/0.56 # Propositional encoding time : 0.000
% 0.69/0.56 # Propositional solver time : 0.000
% 0.69/0.56 # Success case prop preproc time : 0.000
% 0.69/0.56 # Success case prop encoding time : 0.000
% 0.69/0.56 # Success case prop solver time : 0.000
% 0.69/0.56 # Current number of processed clauses : 356
% 0.69/0.56 # Positive orientable unit clauses : 54
% 0.69/0.56 # Positive unorientable unit clauses: 0
% 0.69/0.56 # Negative unit clauses : 15
% 0.69/0.56 # Non-unit-clauses : 287
% 0.69/0.56 # Current number of unprocessed clauses: 1502
% 0.69/0.56 # ...number of literals in the above : 4772
% 0.69/0.56 # Current number of archived formulas : 0
% 0.69/0.56 # Current number of archived clauses : 81
% 0.69/0.56 # Clause-clause subsumption calls (NU) : 24169
% 0.69/0.56 # Rec. Clause-clause subsumption calls : 20687
% 0.69/0.56 # Non-unit clause-clause subsumptions : 1233
% 0.69/0.56 # Unit Clause-clause subsumption calls : 1442
% 0.69/0.56 # Rewrite failures with RHS unbound : 0
% 0.69/0.56 # BW rewrite match attempts : 83
% 0.69/0.56 # BW rewrite match successes : 0
% 0.69/0.56 # Condensation attempts : 0
% 0.69/0.56 # Condensation successes : 0
% 0.69/0.56 # Termbank termtop insertions : 42473
% 0.69/0.56 # Search garbage collected termcells : 34
% 0.69/0.56
% 0.69/0.56 # -------------------------------------------------
% 0.69/0.56 # User time : 0.066 s
% 0.69/0.56 # System time : 0.002 s
% 0.69/0.56 # Total time : 0.068 s
% 0.69/0.56 # Maximum resident set size: 1632 pages
% 0.69/0.56
% 0.69/0.56 # -------------------------------------------------
% 0.69/0.56 # User time : 0.324 s
% 0.69/0.56 # System time : 0.006 s
% 0.69/0.56 # Total time : 0.330 s
% 0.69/0.56 # Maximum resident set size: 1696 pages
% 0.69/0.56 % E---3.1 exiting
% 0.69/0.56 % E exiting
%------------------------------------------------------------------------------