%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA021-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 12:02:46 PM UTC 2026
% Result : Unsatisfiable 172.90s 30.39s
% Output : CNFRefutation 172.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 17 unt; 4 nHn; 14 RR)
% Number of literals : 35 ( 20 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Nat_OSuc__pred_0,axiom,
( ~ c_less(c_0,X1,tc_nat)
| c_Suc(c_minus(X1,c_Suc(c_0),tc_nat)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_OSuc__pred_0) ).
cnf(cls_Nat_OOne__nat__def_0,axiom,
c_1 = c_Suc(c_0),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_OOne__nat__def_0) ).
cnf(cls_Nat_Oadd__Suc__right_0,axiom,
c_plus(X1,c_Suc(X2),tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oadd__Suc__right_0) ).
cnf(cls_Nat_Oadd__0__right_0,axiom,
c_plus(X1,c_0,tc_nat) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oadd__0__right_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Nat_Onot__gr0_0,axiom,
( X1 = c_0
| c_less(c_0,X1,tc_nat) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__gr0_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
v_x != c_0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_8,plain,
( ~ c_less(c_0,X1,tc_nat)
| c_Suc(c_minus(X1,c_Suc(c_0),tc_nat)) = X1 ),
inference(fof_simplification,[status(thm)],[cls_Nat_OSuc__pred_0]) ).
cnf(c_0_9,plain,
( ~ c_less(c_0,X1,tc_nat)
| c_Suc(c_minus(X1,c_Suc(c_0),tc_nat)) = X1 ),
c_0_8 ).
cnf(c_0_10,axiom,
c_1 = c_Suc(c_0),
cls_Nat_OOne__nat__def_0 ).
cnf(c_0_11,axiom,
c_plus(X1,c_Suc(X2),tc_nat) = c_Suc(c_plus(X1,X2,tc_nat)),
cls_Nat_Oadd__Suc__right_0 ).
cnf(c_0_12,axiom,
c_plus(X1,c_0,tc_nat) = X1,
cls_Nat_Oadd__0__right_0 ).
cnf(c_0_13,plain,
( ~ c_less(c_0,X1,tc_nat)
| c_Suc(c_minus(X1,c_1,tc_nat)) = X1 ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
c_Suc(X1) = c_plus(X1,c_1,tc_nat),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
cls_conjecture_2 ).
cnf(c_0_16,plain,
( ~ c_less(c_0,X1,tc_nat)
| c_plus(c_minus(X1,c_1,tc_nat),c_1,tc_nat) = X1 ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( X1 = c_0
| c_less(c_0,X1,tc_nat) ),
cls_Nat_Onot__gr0_0 ).
cnf(c_0_18,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_19,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_plus(X1,c_1,tc_nat)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_plus(X1,c_1,tc_nat)),t_a),t_a),t_a),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,plain,
( X1 = c_0
| c_plus(c_minus(X1,c_1,tc_nat),c_1,tc_nat) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
v_x != c_0,
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_22,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_f(X1),t_a),c_times(v_c,c_HOL_Oabs(v_h(X1),t_a),t_a),t_a)
| X1 = c_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
v_x != c_0,
c_0_21 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA021-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.49 % Computer : n003.cluster.edu
% 0.19/0.49 % Model : x86_64 x86_64
% 0.19/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.49 % Memory : 8046.5625MB
% 0.19/0.49 % OS : Linux 6.8.0-71-generic
% 0.19/0.49 % CPULimit : 300
% 0.19/0.49 % WCLimit : 300
% 0.19/0.49 % DateTime : Mon Sep 21 13:25:46 UTC 2026
% 0.19/0.49 % CPUTime :
% 0.19/0.50 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.58 Running first-order theorem proving
% 0.23/0.58 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/benchmark/theBenchmark.p
% 172.90/30.39 % Version: 3.5.1
% 172.90/30.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 172.90/30.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 172.90/30.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 172.90/30.39 % Starting new_bool_3 with 300s (1) cores
% 172.90/30.39 % Starting new_bool_1 with 300s (1) cores
% 172.90/30.39 % Starting sh5l with 300s (1) cores
% 172.90/30.39 % new_bool_3 with pid 204074 completed with status 0
% 172.90/30.39 % Result found by new_bool_3
% 172.90/30.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 172.90/30.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 172.90/30.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 172.90/30.39 % Starting new_bool_3 with 300s (1) cores
% 172.90/30.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 172.90/30.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 172.90/30.39 % Search class: FGHSM-SSLM32-MFFFFFNN
% 172.90/30.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 172.90/30.39 % Starting SubtermCWHack with 28s (1) cores
% 172.90/30.39 % SubtermCWHack with pid 204077 completed with status 8
% 172.90/30.39 % Starting new_bool_3 with 31s (1) cores
% 172.90/30.39 % new_bool_3 with pid 204240 completed with status 0
% 172.90/30.39 % Result found by new_bool_3
% 172.90/30.39 % Preprocessing class: FMLMSMSMSSSNFFN.
% 172.90/30.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 172.90/30.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 172.90/30.39 % Starting new_bool_3 with 300s (1) cores
% 172.90/30.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 172.90/30.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 172.90/30.39 % Search class: FGHSM-SSLM32-MFFFFFNN
% 172.90/30.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 172.90/30.39 % Starting SubtermCWHack with 28s (1) cores
% 172.90/30.39 % SubtermCWHack with pid 204077 completed with status 8
% 172.90/30.39 % Starting new_bool_3 with 31s (1) cores
% 172.90/30.39 % Preprocessing time : 0.016 s
% 172.90/30.39 % Presaturation interreduction done
% 172.90/30.39
% 172.90/30.39 % Proof found!
% 172.90/30.39 % SZS status Unsatisfiable
% 172.90/30.39 % SZS output start CNFRefutation
% See solution above
% 172.90/30.39 % Parsed axioms : 2791
% 172.90/30.39 % Removed by relevancy pruning/SinE : 1604
% 172.90/30.39 % Initial clauses : 1187
% 172.90/30.39 % Removed in clause preprocessing : 0
% 172.90/30.39 % Initial clauses in saturation : 1187
% 172.90/30.39 % Processed clauses : 10859
% 172.90/30.39 % ...of these trivial : 107
% 172.90/30.39 % ...subsumed : 6463
% 172.90/30.39 % ...remaining for further processing : 4289
% 172.90/30.39 % Other redundant clauses eliminated : 279
% 172.90/30.39 % Clauses deleted for lack of memory : 0
% 172.90/30.39 % Backward-subsumed : 371
% 172.90/30.39 % Backward-rewritten : 405
% 172.90/30.39 % Generated clauses : 34471
% 172.90/30.39 % ...of the previous two non-redundant : 28186
% 172.90/30.39 % ...aggressively subsumed : 0
% 172.90/30.39 % Contextual simplify-reflections : 80
% 172.90/30.39 % Paramodulations : 34155
% 172.90/30.39 % Factorizations : 1
% 172.90/30.39 % NegExts : 0
% 172.90/30.39 % Equation resolutions : 315
% 172.90/30.39 % Disequality decompositions : 0
% 172.90/30.39 % Total rewrite steps : 23823
% 172.90/30.39 % ...of those cached : 22367
% 172.90/30.39 % Propositional unsat checks : 0
% 172.90/30.39 % Propositional check models : 0
% 172.90/30.39 % Propositional check unsatisfiable : 0
% 172.90/30.39 % Propositional clauses : 0
% 172.90/30.39 % Propositional clauses after purity: 0
% 172.90/30.39 % Propositional unsat core size : 0
% 172.90/30.39 % Propositional preprocessing time : 0.000
% 172.90/30.39 % Propositional encoding time : 0.000
% 172.90/30.39 % Propositional solver time : 0.000
% 172.90/30.39 % Success case prop preproc time : 0.000
% 172.90/30.39 % Success case prop encoding time : 0.000
% 172.90/30.39 % Success case prop solver time : 0.000
% 172.90/30.39 % Current number of processed clauses : 2398
% 172.90/30.39 % Positive orientable unit clauses : 341
% 172.90/30.39 % Positive unorientable unit clauses: 2
% 172.90/30.39 % Negative unit clauses : 278
% 172.90/30.39 % Non-unit-clauses : 1777
% 172.90/30.39 % Current number of unprocessed clauses: 18717
% 172.90/30.39 % ...number of literals in the above : 66059
% 172.90/30.39 % Current number of archived formulas : 0
% 172.90/30.39 % Current number of archived clauses : 1891
% 172.90/30.39 % Clause-clause subsumption calls (NU) : 1565923
% 172.90/30.39 % Rec. Clause-clause subsumption calls : 911208
% 172.90/30.39 % Non-unit clause-clause subsumptions : 2885
% 172.90/30.39 % Unit Clause-clause subsumption calls : 28074
% 172.90/30.39 % Rewrite failures with RHS unbound : 3
% 172.90/30.39 % BW rewrite match attempts : 669
% 172.90/30.39 % BW rewrite match successes : 133
% 172.90/30.39 % Condensation attempts : 0
% 172.90/30.39 % Condensation successes : 0
% 172.90/30.39 % Termbank termtop insertions : 615303
% 172.90/30.39 % Search garbage collected termcells : 6487
% 172.90/30.39
% 172.90/30.39 % -------------------------------------------------
% 172.90/30.39 % User time : 28.560 s
% 172.90/30.39 % System time : 0.848 s
% 172.90/30.39 % Total time : 29.408 s
% 172.90/30.39 % Maximum resident set size: 7224 pages
% 172.90/30.39
% 172.90/30.39 % -------------------------------------------------
% 172.90/30.39 % User time : 28.656 s
% 172.90/30.39 % System time : 0.860 s
% 172.90/30.39 % Total time : 29.516 s
% 172.90/30.39 % Maximum resident set size: 6400 pages
% 172.90/30.39 % E exiting
%------------------------------------------------------------------------------