%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM022-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:51:13 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 10 unt; 4 nHn; 30 RR)
% Number of literals : 61 ( 0 equ; 31 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 : 47 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
cnf(transitivity,axiom,
( ~ equalish(X3,X1)
| ~ equalish(X1,X2)
| equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
cnf(less_lemma,axiom,
( ~ less(X1,X2)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
cnf(divides_only_less_or_equal,axiom,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
cnf(prove_a_less_than_d,negated_conjecture,
~ less(a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_less_than_d) ).
cnf(a_less_than_b,hypothesis,
less(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_less_than_b) ).
cnf(smaller_number,axiom,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
cnf(b_divides_d,hypothesis,
divides(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_divides_d) ).
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,
( ~ equalish(X3,X1)
| ~ equalish(X1,X2)
| equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity]) ).
cnf(c_0_10,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_11,plain,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
inference(fof_simplification,[status(thm)],[divides_only_less_or_equal]) ).
cnf(c_0_12,negated_conjecture,
~ less(a,d),
inference(fof_simplification,[status(thm)],[prove_a_less_than_d]) ).
cnf(c_0_13,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
c_0_8 ).
cnf(c_0_14,hypothesis,
less(a,b),
a_less_than_b ).
cnf(c_0_15,plain,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
inference(fof_simplification,[status(thm)],[smaller_number]) ).
cnf(c_0_16,plain,
( ~ equalish(X3,X1)
| ~ equalish(X1,X2)
| equalish(X3,X2) ),
c_0_9 ).
cnf(c_0_17,plain,
( ~ less(X1,X2)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2) ),
c_0_10 ).
cnf(c_0_18,plain,
( ~ divides(X1,X2)
| equalish(X1,X2)
| less(X1,X2) ),
c_0_11 ).
cnf(c_0_19,hypothesis,
divides(b,d),
b_divides_d ).
cnf(c_0_20,negated_conjecture,
~ less(a,d),
c_0_12 ).
cnf(c_0_21,hypothesis,
( ~ less(b,X1)
| less(a,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( ~ equalish(add(successor(X1),X2),X3)
| less(X2,X3) ),
c_0_15 ).
cnf(c_0_23,plain,
( ~ less(X2,X1)
| ~ equalish(X1,X3)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X2)),X2),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,hypothesis,
( less(b,d)
| equalish(b,d) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ less(b,d),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ less(X1,X3)
| ~ equalish(X3,X2)
| less(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
equalish(b,d),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
( ~ less(X1,b)
| less(X1,d) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM022-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:57:05 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % sh5l with pid 4126765 completed with status 0
% 0.14/0.43 % Result found by sh5l
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 4126766 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 10
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 10
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 10
% 0.14/0.43 % Processed clauses : 19
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 19
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 0
% 0.14/0.43 % Generated clauses : 19
% 0.14/0.43 % ...of the previous two non-redundant : 14
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 18
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 1
% 0.14/0.43 % ...of those cached : 0
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 18
% 0.14/0.43 % Positive orientable unit clauses : 3
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 2
% 0.14/0.43 % Non-unit-clauses : 13
% 0.14/0.43 % Current number of unprocessed clauses: 3
% 0.14/0.43 % ...number of literals in the above : 11
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 1
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 8
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 8
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 4
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 0
% 0.14/0.43 % BW rewrite match successes : 0
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 457
% 0.14/0.43 % Search garbage collected termcells : 20
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.002 s
% 0.14/0.43 % System time : 0.002 s
% 0.14/0.43 % Total time : 0.005 s
% 0.14/0.43 % Maximum resident set size: 3640 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.005 s
% 0.14/0.43 % System time : 0.006 s
% 0.14/0.43 % Total time : 0.011 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------