%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM020-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:15 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 28 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity,axiom,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
cnf(successor_substitution,axiom,
( ~ equalish(X1,X2)
| equalish(successor(X1),successor(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-0.ax',successor_substitution) ).
cnf(deny_addition_lemma,negated_conjecture,
~ equalish(add(a,successor(n0)),successor(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',deny_addition_lemma) ).
cnf(addition,axiom,
equalish(add(X1,successor(X2)),successor(add(X1,X2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-0.ax',addition) ).
cnf(adding_zero,axiom,
equalish(add(X1,n0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-0.ax',adding_zero) ).
cnf(c_0_5,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity]) ).
cnf(c_0_6,plain,
( ~ equalish(X1,X2)
| equalish(successor(X1),successor(X2)) ),
inference(fof_simplification,[status(thm)],[successor_substitution]) ).
cnf(c_0_7,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
c_0_5 ).
cnf(c_0_8,plain,
( ~ equalish(X1,X2)
| equalish(successor(X1),successor(X2)) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
~ equalish(add(a,successor(n0)),successor(a)),
inference(fof_simplification,[status(thm)],[deny_addition_lemma]) ).
cnf(c_0_10,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,successor(X3))
| equalish(X1,successor(X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
equalish(add(X1,successor(X2)),successor(add(X1,X2))),
addition ).
cnf(c_0_12,negated_conjecture,
~ equalish(add(a,successor(n0)),successor(a)),
c_0_9 ).
cnf(c_0_13,plain,
( ~ equalish(add(X1,X2),X3)
| equalish(add(X1,successor(X2)),successor(X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
equalish(add(X1,n0),X1),
adding_zero ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM020-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n026.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 02:01:21 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % new_bool_3 with pid 1131112 completed with status 0
% 0.11/0.43 % Result found by new_bool_3
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 1131117 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Unsatisfiable
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 12
% 0.11/0.43 % Removed by relevancy pruning/SinE : 3
% 0.11/0.43 % Initial clauses : 9
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 9
% 0.11/0.43 % Processed clauses : 165
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 105
% 0.11/0.44 % ...remaining for further processing : 60
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 583
% 0.11/0.44 % ...of the previous two non-redundant : 491
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 583
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 79
% 0.11/0.44 % ...of those cached : 63
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 60
% 0.11/0.44 % Positive orientable unit clauses : 10
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 2
% 0.11/0.44 % Non-unit-clauses : 48
% 0.11/0.44 % Current number of unprocessed clauses: 326
% 0.11/0.44 % ...number of literals in the above : 797
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 0
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 935
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 935
% 0.11/0.44 % Non-unit clause-clause subsumptions : 105
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 5
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 6642
% 0.11/0.44 % Search garbage collected termcells : 24
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3636 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.009 s
% 0.11/0.44 % System time : 0.005 s
% 0.11/0.44 % Total time : 0.014 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------