TSTP Solution File: HEN007-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HEN007-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:00 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 48 ( 0 equ; 23 neg)
% Maximal clause size : 4 ( 1 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 : 40 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(xQyLEz_implies_xQzLEy,axiom,
( less_equal(X5,X2)
| ~ quotient(X1,X2,X3)
| ~ less_equal(X3,X4)
| ~ quotient(X1,X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',xQyLEz_implies_xQzLEy) ).
cnf(zQy,hypothesis,
quotient(z,y,zQy),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',zQy) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',closure) ).
cnf(transitivity_of_less_equal,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',transitivity_of_less_equal) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',xLEy) ).
cnf(zQx,hypothesis,
quotient(z,x,zQx),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',zQx) ).
cnf(divisor_existence,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',divisor_existence) ).
cnf(x_divde_zero_is_x,axiom,
quotient(X1,zero,X1),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',x_divde_zero_is_x) ).
cnf(prove_zQyLEzQx,negated_conjecture,
~ less_equal(zQy,zQx),
file('/export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p',prove_zQyLEzQx) ).
cnf(c_0_9,axiom,
( less_equal(X5,X2)
| ~ quotient(X1,X2,X3)
| ~ less_equal(X3,X4)
| ~ quotient(X1,X4,X5) ),
xQyLEz_implies_xQzLEy ).
cnf(c_0_10,hypothesis,
quotient(z,y,zQy),
zQy ).
cnf(c_0_11,hypothesis,
( less_equal(zQy,X1)
| ~ quotient(z,X1,X2)
| ~ less_equal(X2,y) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_13,axiom,
( less_equal(X1,X3)
| ~ less_equal(X1,X2)
| ~ less_equal(X2,X3) ),
transitivity_of_less_equal ).
cnf(c_0_14,hypothesis,
less_equal(x,y),
xLEy ).
cnf(c_0_15,hypothesis,
( less_equal(zQy,X1)
| ~ less_equal(divide(z,X1),y) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( less_equal(X1,y)
| ~ less_equal(X1,x) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( less_equal(divide(X1,X2),X3)
| ~ quotient(X1,X3,X4)
| ~ less_equal(X4,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_18,hypothesis,
quotient(z,x,zQx),
zQx ).
cnf(c_0_19,hypothesis,
( less_equal(zQy,X1)
| ~ less_equal(divide(z,X1),x) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
( less_equal(divide(z,X1),x)
| ~ less_equal(zQx,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( less_equal(X3,X1)
| ~ quotient(X1,X2,X3) ),
divisor_existence ).
cnf(c_0_22,axiom,
quotient(X1,zero,X1),
x_divde_zero_is_x ).
cnf(c_0_23,negated_conjecture,
~ less_equal(zQy,zQx),
prove_zQyLEzQx ).
cnf(c_0_24,hypothesis,
( less_equal(zQy,X1)
| ~ less_equal(zQx,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN007-2 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n019.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 11:19:51 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.97lvDcJmKw/E---3.1_11555.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11639 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHUSM-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11644 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FHUSM-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 19
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 19
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 19
% 0.21/0.51 # Processed clauses : 227
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 85
% 0.21/0.51 # ...remaining for further processing : 140
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 15
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 429
% 0.21/0.51 # ...of the previous two non-redundant : 273
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 429
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 191
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 106
% 0.21/0.51 # Positive orientable unit clauses : 26
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 3
% 0.21/0.51 # Non-unit-clauses : 77
% 0.21/0.51 # Current number of unprocessed clauses: 47
% 0.21/0.51 # ...number of literals in the above : 124
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 34
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 988
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 798
% 0.21/0.51 # Non-unit clause-clause subsumptions : 87
% 0.21/0.51 # Unit Clause-clause subsumption calls : 76
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 40
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4284
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1636 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.052 s
% 0.21/0.51 # System time : 0.009 s
% 0.21/0.51 # Total time : 0.061 s
% 0.21/0.51 # Maximum resident set size: 1684 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------