%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM420-1.000 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:01 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.54s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 25 unt; 5 nHn; 30 RR)
% Number of literals : 74 ( 40 equ; 37 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 : 45 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_34,negated_conjecture,
( ~ less(plus(n0,n1),p__0)
| less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_34) ).
cnf(clause_44,negated_conjecture,
( X1 != p__0
| less(n1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).
cnf(clause_24,negated_conjecture,
( plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0))
| ~ less(X1,p__0)
| ~ less(n0,p__0)
| ~ less(n0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_36,negated_conjecture,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_36) ).
cnf(axiom_8,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
cnf(axiom_30,axiom,
less(n0,plus(X1,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_30) ).
cnf(axiom_14,axiom,
plus(n1,plus(X1,n1)) != n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
cnf(clause_18,negated_conjecture,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(axiom_20,axiom,
times(n1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
cnf(axiom_6,axiom,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
cnf(axiom_15,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).
cnf(clause_48,negated_conjecture,
( times(s_1(X1),s_4(X1)) = X1
| X1 = n1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_48) ).
cnf(clause_53,negated_conjecture,
( s_1(X1) = p__0
| X1 = n1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_53) ).
cnf(c_0_13,negated_conjecture,
( ~ less(plus(n0,n1),p__0)
| less(n0,p__0) ),
inference(fof_simplification,[status(thm)],[clause_34]) ).
cnf(c_0_14,negated_conjecture,
( X1 != p__0
| less(n1,X1) ),
inference(fof_simplification,[status(thm)],[clause_44]) ).
cnf(c_0_15,negated_conjecture,
( plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0))
| ~ less(X1,p__0)
| ~ less(n0,p__0)
| ~ less(n0,X1) ),
inference(fof_simplification,[status(thm)],[clause_24]) ).
cnf(c_0_16,negated_conjecture,
( ~ less(plus(n0,n1),p__0)
| less(n0,p__0) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
plus(n0,n1) = n1,
clause_36 ).
cnf(c_0_18,negated_conjecture,
( X1 != p__0
| less(n1,X1) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0))
| ~ less(X1,p__0)
| ~ less(n0,p__0)
| ~ less(n0,X1) ),
c_0_15 ).
cnf(c_0_20,axiom,
plus(n0,X1) = X1,
axiom_8 ).
cnf(c_0_21,negated_conjecture,
( ~ less(n1,p__0)
| less(n0,p__0) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
less(n1,p__0),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ less(n0,X1)
| ~ less(X1,p__0)
| ~ less(n0,p__0)
| plus(X1,times(X2,p__0)) != times(X3,p__0) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
less(n0,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,axiom,
less(n0,plus(X1,n1)),
axiom_30 ).
cnf(c_0_26,negated_conjecture,
( ~ less(n0,X1)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != times(X3,p__0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_28,plain,
plus(n1,plus(X1,n1)) != n1,
inference(fof_simplification,[status(thm)],[axiom_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_30,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_26,c_0_22]),c_0_27])]) ).
cnf(c_0_31,axiom,
times(n1,X1) = X1,
axiom_20 ).
cnf(c_0_32,plain,
plus(n1,plus(X1,n1)) != n1,
c_0_28 ).
cnf(c_0_33,axiom,
plus(X1,X2) = plus(X2,X1),
axiom_6 ).
cnf(c_0_34,negated_conjecture,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
times(X1,p__0) != plus(n1,p__0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
times(X1,X2) = times(X2,X1),
axiom_15 ).
cnf(c_0_37,negated_conjecture,
( times(s_1(X1),s_4(X1)) = X1
| X1 = n1 ),
clause_48 ).
cnf(c_0_38,negated_conjecture,
( s_1(X1) = p__0
| X1 = n1 ),
clause_53 ).
cnf(c_0_39,plain,
plus(n1,plus(n1,X1)) != n1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
plus(n1,s_7(p__0)) = p__0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_33]),c_0_24])]) ).
cnf(c_0_41,negated_conjecture,
times(p__0,X1) != plus(n1,p__0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( X1 = n1
| times(p__0,s_4(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
plus(n1,p__0) != n1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM420-1.000 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:33:14 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 Running first-order theorem proving
% 0.16/0.46 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/benchmark/theBenchmark.p
% 0.16/0.53 % Version: 3.5.1
% 0.16/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 % Starting sh5l with 300s (1) cores
% 0.16/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1999036 completed with status 0
% 0.16/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.53 % No SInE strategy applied
% 0.16/0.53 % Search class: FGHSM-FFMF21-DFFFFFNN
% 0.16/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.53 % Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1999041 completed with status 0
% 0.16/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.54 % No SInE strategy applied
% 0.16/0.54 % Search class: FGHSM-FFMF21-DFFFFFNN
% 0.16/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.54 % Preprocessing time : 0.003 s
% 0.16/0.54 % Presaturation interreduction done
% 0.16/0.54
% 0.16/0.54 % Proof found!
% 0.16/0.54 % SZS status Unsatisfiable
% 0.16/0.54 % SZS output start CNFRefutation
% See solution above
% 0.16/0.54 % Parsed axioms : 91
% 0.16/0.54 % Removed by relevancy pruning/SinE : 0
% 0.16/0.54 % Initial clauses : 91
% 0.16/0.54 % Removed in clause preprocessing : 35
% 0.16/0.54 % Initial clauses in saturation : 56
% 0.16/0.54 % Processed clauses : 302
% 0.16/0.54 % ...of these trivial : 8
% 0.16/0.54 % ...subsumed : 139
% 0.16/0.54 % ...remaining for further processing : 155
% 0.16/0.54 % Other redundant clauses eliminated : 10
% 0.16/0.54 % Clauses deleted for lack of memory : 0
% 0.16/0.54 % Backward-subsumed : 2
% 0.16/0.54 % Backward-rewritten : 9
% 0.16/0.54 % Generated clauses : 672
% 0.16/0.54 % ...of the previous two non-redundant : 614
% 0.16/0.54 % ...aggressively subsumed : 0
% 0.16/0.54 % Contextual simplify-reflections : 0
% 0.16/0.54 % Paramodulations : 656
% 0.16/0.54 % Factorizations : 3
% 0.16/0.54 % NegExts : 0
% 0.16/0.54 % Equation resolutions : 13
% 0.16/0.54 % Disequality decompositions : 0
% 0.16/0.54 % Total rewrite steps : 215
% 0.16/0.54 % ...of those cached : 103
% 0.16/0.54 % Propositional unsat checks : 0
% 0.16/0.54 % Propositional check models : 0
% 0.16/0.54 % Propositional check unsatisfiable : 0
% 0.16/0.54 % Propositional clauses : 0
% 0.16/0.54 % Propositional clauses after purity: 0
% 0.16/0.54 % Propositional unsat core size : 0
% 0.16/0.54 % Propositional preprocessing time : 0.000
% 0.16/0.54 % Propositional encoding time : 0.000
% 0.16/0.54 % Propositional solver time : 0.000
% 0.16/0.54 % Success case prop preproc time : 0.000
% 0.16/0.54 % Success case prop encoding time : 0.000
% 0.16/0.54 % Success case prop solver time : 0.000
% 0.16/0.54 % Current number of processed clauses : 101
% 0.16/0.54 % Positive orientable unit clauses : 19
% 0.16/0.54 % Positive unorientable unit clauses: 4
% 0.16/0.54 % Negative unit clauses : 43
% 0.16/0.54 % Non-unit-clauses : 35
% 0.16/0.54 % Current number of unprocessed clauses: 400
% 0.16/0.54 % ...number of literals in the above : 761
% 0.16/0.54 % Current number of archived formulas : 0
% 0.16/0.54 % Current number of archived clauses : 50
% 0.16/0.54 % Clause-clause subsumption calls (NU) : 117
% 0.16/0.54 % Rec. Clause-clause subsumption calls : 89
% 0.16/0.54 % Non-unit clause-clause subsumptions : 18
% 0.16/0.54 % Unit Clause-clause subsumption calls : 119
% 0.16/0.54 % Rewrite failures with RHS unbound : 0
% 0.16/0.54 % BW rewrite match attempts : 92
% 0.16/0.54 % BW rewrite match successes : 84
% 0.16/0.54 % Condensation attempts : 0
% 0.16/0.54 % Condensation successes : 0
% 0.16/0.54 % Termbank termtop insertions : 8089
% 0.16/0.54 % Search garbage collected termcells : 117
% 0.16/0.54
% 0.16/0.54 % -------------------------------------------------
% 0.16/0.54 % User time : 0.019 s
% 0.16/0.54 % System time : 0.007 s
% 0.16/0.54 % Total time : 0.026 s
% 0.16/0.54 % Maximum resident set size: 3636 pages
% 0.16/0.54
% 0.16/0.54 % -------------------------------------------------
% 0.16/0.54 % User time : 0.096 s
% 0.16/0.54 % System time : 0.022 s
% 0.16/0.54 % Total time : 0.118 s
% 0.16/0.54 % Maximum resident set size: 4608 pages
% 0.16/0.54 % E exiting
%------------------------------------------------------------------------------