TSTP Solution File: NUM420-1.000 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 18:55:39 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 24 unt; 5 nHn; 25 RR)
% Number of literals : 63 ( 36 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_34,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_34) ).
cnf(clause_36,negated_conjecture,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_36) ).
cnf(clause_44,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_44) ).
cnf(clause_24,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_24) ).
cnf(axiom_8,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_8) ).
cnf(axiom_30,axiom,
less(n0,plus(X1,n1)),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_30) ).
cnf(axiom_20,axiom,
times(n1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_20) ).
cnf(axiom_14,axiom,
plus(n1,plus(X1,n1)) != n1,
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_14) ).
cnf(axiom_6,axiom,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_6) ).
cnf(clause_18,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_18) ).
cnf(axiom_15,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',axiom_15) ).
cnf(clause_48,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_48) ).
cnf(clause_53,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0 ),
file('/export/starexec/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p',clause_53) ).
cnf(c_0_13,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
clause_34 ).
cnf(c_0_14,negated_conjecture,
plus(n0,n1) = n1,
clause_36 ).
cnf(c_0_15,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
clause_44 ).
cnf(c_0_16,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
clause_24 ).
cnf(c_0_17,axiom,
plus(n0,X1) = X1,
axiom_8 ).
cnf(c_0_18,negated_conjecture,
( less(n0,p__0)
| ~ less(n1,p__0) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
less(n1,p__0),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( plus(X1,times(X2,p__0)) != times(X3,p__0)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
less(n0,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,axiom,
less(n0,plus(X1,n1)),
axiom_30 ).
cnf(c_0_23,negated_conjecture,
( plus(X1,times(X2,p__0)) != times(X3,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
plus(n1,times(X1,p__0)) != times(X2,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24])]) ).
cnf(c_0_26,axiom,
times(n1,X1) = X1,
axiom_20 ).
cnf(c_0_27,axiom,
plus(n1,plus(X1,n1)) != n1,
axiom_14 ).
cnf(c_0_28,axiom,
plus(X1,X2) = plus(X2,X1),
axiom_6 ).
cnf(c_0_29,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
clause_18 ).
cnf(c_0_30,negated_conjecture,
times(X1,p__0) != plus(n1,p__0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
times(X1,X2) = times(X2,X1),
axiom_15 ).
cnf(c_0_32,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
clause_48 ).
cnf(c_0_33,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0 ),
clause_53 ).
cnf(c_0_34,plain,
plus(n1,plus(n1,X1)) != n1,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
plus(n1,s_7(p__0)) = p__0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
times(p__0,X1) != plus(n1,p__0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( times(p__0,s_4(X1)) = X1
| X1 = n1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
plus(n1,p__0) != n1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 14:42:46 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.e6wt5klv7B/E---3.1_16471.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16549 completed with status 0
% 0.17/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSM-FFMF21-DFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46 # Starting sh5l with 136s (1) cores
% 0.17/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16554 completed with status 0
% 0.17/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGHSM-FFMF21-DFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 91
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 91
% 0.17/0.46 # Removed in clause preprocessing : 35
% 0.17/0.46 # Initial clauses in saturation : 56
% 0.17/0.46 # Processed clauses : 302
% 0.17/0.46 # ...of these trivial : 8
% 0.17/0.46 # ...subsumed : 139
% 0.17/0.46 # ...remaining for further processing : 155
% 0.17/0.46 # Other redundant clauses eliminated : 10
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 2
% 0.17/0.46 # Backward-rewritten : 9
% 0.17/0.46 # Generated clauses : 672
% 0.17/0.46 # ...of the previous two non-redundant : 614
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 656
% 0.17/0.46 # Factorizations : 3
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 13
% 0.17/0.46 # Total rewrite steps : 215
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 101
% 0.17/0.46 # Positive orientable unit clauses : 19
% 0.17/0.46 # Positive unorientable unit clauses: 4
% 0.17/0.46 # Negative unit clauses : 43
% 0.17/0.46 # Non-unit-clauses : 35
% 0.17/0.46 # Current number of unprocessed clauses: 400
% 0.17/0.46 # ...number of literals in the above : 761
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 50
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 117
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 89
% 0.17/0.46 # Non-unit clause-clause subsumptions : 18
% 0.17/0.46 # Unit Clause-clause subsumption calls : 119
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 92
% 0.17/0.46 # BW rewrite match successes : 84
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 7438
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.013 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.017 s
% 0.17/0.46 # Maximum resident set size: 1736 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.078 s
% 0.17/0.46 # System time : 0.006 s
% 0.17/0.46 # Total time : 0.084 s
% 0.17/0.46 # Maximum resident set size: 1728 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------