%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:44:16 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 9 unt; 4 nHn; 29 RR)
% Number of literals : 58 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
cnf(divides_only_less_or_equal,axiom,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
cnf(b_less_than_c,hypothesis,
less(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_less_than_c) ).
cnf(impossible_c_divides_a,negated_conjecture,
divides(c,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impossible_c_divides_a) ).
cnf(b_greater_equal_a,hypothesis,
~ less(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_greater_equal_a) ).
cnf(transitivity,axiom,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
cnf(smaller_number,axiom,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
cnf(less_lemma,axiom,
( ~ less(X1,X2)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
cnf(c_0_8,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_9,plain,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
inference(fof_simplification,[status(thm)],[divides_only_less_or_equal]) ).
cnf(c_0_10,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
less(b,c),
b_less_than_c ).
cnf(c_0_12,plain,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
divides(c,a),
impossible_c_divides_a ).
cnf(c_0_14,hypothesis,
~ less(b,a),
inference(fof_simplification,[status(thm)],[b_greater_equal_a]) ).
cnf(c_0_15,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity]) ).
cnf(c_0_16,hypothesis,
( ~ less(c,X1)
| less(b,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( equalish(c,a)
| less(c,a) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
~ less(b,a),
c_0_14 ).
cnf(c_0_19,plain,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
inference(fof_simplification,[status(thm)],[smaller_number]) ).
cnf(c_0_20,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
equalish(c,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
( ~ equalish(X1,c)
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ less(X1,X2)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2) ),
inference(fof_simplification,[status(thm)],[less_lemma]) ).
cnf(c_0_25,negated_conjecture,
( ~ equalish(add(successor(X2),X1),c)
| less(X1,a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ less(X1,X2)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
( ~ less(X1,c)
| less(X1,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n026.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 02:01:52 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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
% 0.25/0.60 % Version: 3.5.1
% 0.25/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.60 % Starting sh5l with 300s (1) cores
% 0.25/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1132316 completed with status 0
% 0.25/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.25/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.60 % No SInE strategy applied
% 0.25/0.60 % Search class: FGUNM-FFSF21-MFFFFFNN
% 0.25/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.25/0.61 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1132325 completed with status 0
% 0.25/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.25/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.61 % No SInE strategy applied
% 0.25/0.61 % Search class: FGUNM-FFSF21-MFFFFFNN
% 0.25/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.61 % Preprocessing time : 0.002 s
% 0.25/0.61 % Presaturation interreduction done
% 0.25/0.61
% 0.25/0.61 % Proof found!
% 0.25/0.61 % SZS status Unsatisfiable
% 0.25/0.61 % SZS output start CNFRefutation
% See solution above
% 0.25/0.61 % Parsed axioms : 19
% 0.25/0.61 % Removed by relevancy pruning/SinE : 0
% 0.25/0.61 % Initial clauses : 19
% 0.25/0.61 % Removed in clause preprocessing : 0
% 0.25/0.61 % Initial clauses in saturation : 19
% 0.25/0.61 % Processed clauses : 64
% 0.25/0.61 % ...of these trivial : 0
% 0.25/0.61 % ...subsumed : 2
% 0.25/0.61 % ...remaining for further processing : 62
% 0.25/0.61 % Other redundant clauses eliminated : 0
% 0.25/0.61 % Clauses deleted for lack of memory : 0
% 0.25/0.61 % Backward-subsumed : 1
% 0.25/0.61 % Backward-rewritten : 1
% 0.25/0.61 % Generated clauses : 99
% 0.25/0.61 % ...of the previous two non-redundant : 62
% 0.25/0.61 % ...aggressively subsumed : 0
% 0.25/0.61 % Contextual simplify-reflections : 0
% 0.25/0.61 % Paramodulations : 99
% 0.25/0.61 % Factorizations : 0
% 0.25/0.61 % NegExts : 0
% 0.25/0.61 % Equation resolutions : 0
% 0.25/0.61 % Disequality decompositions : 0
% 0.25/0.61 % Total rewrite steps : 30
% 0.25/0.61 % ...of those cached : 15
% 0.25/0.61 % Propositional unsat checks : 0
% 0.25/0.61 % Propositional check models : 0
% 0.25/0.61 % Propositional check unsatisfiable : 0
% 0.25/0.61 % Propositional clauses : 0
% 0.25/0.61 % Propositional clauses after purity: 0
% 0.25/0.61 % Propositional unsat core size : 0
% 0.25/0.61 % Propositional preprocessing time : 0.000
% 0.25/0.61 % Propositional encoding time : 0.000
% 0.25/0.61 % Propositional solver time : 0.000
% 0.25/0.61 % Success case prop preproc time : 0.000
% 0.25/0.61 % Success case prop encoding time : 0.000
% 0.25/0.61 % Success case prop solver time : 0.000
% 0.25/0.61 % Current number of processed clauses : 41
% 0.25/0.61 % Positive orientable unit clauses : 18
% 0.25/0.61 % Positive unorientable unit clauses: 0
% 0.25/0.61 % Negative unit clauses : 2
% 0.25/0.61 % Non-unit-clauses : 21
% 0.25/0.61 % Current number of unprocessed clauses: 35
% 0.25/0.61 % ...number of literals in the above : 62
% 0.25/0.61 % Current number of archived formulas : 0
% 0.25/0.61 % Current number of archived clauses : 21
% 0.25/0.61 % Clause-clause subsumption calls (NU) : 99
% 0.25/0.61 % Rec. Clause-clause subsumption calls : 74
% 0.25/0.61 % Non-unit clause-clause subsumptions : 3
% 0.25/0.61 % Unit Clause-clause subsumption calls : 0
% 0.25/0.61 % Rewrite failures with RHS unbound : 0
% 0.25/0.61 % BW rewrite match attempts : 3
% 0.25/0.61 % BW rewrite match successes : 1
% 0.25/0.61 % Condensation attempts : 0
% 0.25/0.61 % Condensation successes : 0
% 0.25/0.61 % Termbank termtop insertions : 1509
% 0.25/0.61 % Search garbage collected termcells : 26
% 0.25/0.61
% 0.25/0.61 % -------------------------------------------------
% 0.25/0.61 % User time : 0.008 s
% 0.25/0.61 % System time : 0.005 s
% 0.25/0.61 % Total time : 0.013 s
% 0.25/0.61 % Maximum resident set size: 3648 pages
% 0.25/0.61
% 0.25/0.61 % -------------------------------------------------
% 0.25/0.61 % User time : 0.038 s
% 0.25/0.61 % System time : 0.019 s
% 0.25/0.61 % Total time : 0.057 s
% 0.25/0.61 % Maximum resident set size: 4864 pages
% 0.25/0.61 % E exiting
%------------------------------------------------------------------------------