%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN986+1.003 : 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 : n017.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 03:41:41 PM UTC 2026
% Result : Theorem 0.16s 5.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 77 ( 38 ~; 31 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 16 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 5 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hyp2,axiom,
! [X1,X2,X3,X4] :
( r(X1,X2,X3)
=> ( r(X3,X2,X4)
=> r(X1,succ(X2),X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN002+0.ax',hyp2) ).
fof(hyp1,axiom,
! [X1] : r(X1,zero,succ(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(ck,conjecture,
? [X5,X6,X4,X7] :
( r(zero,X4,X7)
& r(zero,X6,X4)
& r(zero,X5,X6)
& r(zero,zero,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
fof(c_0_3,plain,
! [X13,X14,X15,X16] :
( r(X13,succ(X14),X16)
| ~ r(X15,X14,X16)
| ~ r(X13,X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])])]) ).
fof(c_0_4,plain,
! [X12] : r(X12,zero,succ(X12)),
inference(variable_rename,[status(thm)],[hyp1]) ).
cnf(c_0_5,plain,
( ~ r(X3,X2,X4)
| ~ r(X1,X2,X3)
| r(X1,succ(X2),X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
r(X1,zero,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ r(X1,zero,X2)
| r(X1,succ(zero),succ(X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( ~ r(X3,zero,X2)
| ~ r(X1,succ(zero),X3)
| r(X1,succ(succ(zero)),succ(X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( ~ r(X1,zero,X3)
| ~ r(succ(X3),zero,X2)
| r(X1,succ(succ(zero)),succ(X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( ~ r(X1,zero,X2)
| r(X1,succ(succ(zero)),succ(succ(succ(X2)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
fof(c_0_11,negated_conjecture,
~ ? [X5,X6,X4,X7] :
( r(zero,X4,X7)
& r(zero,X6,X4)
& r(zero,X5,X6)
& r(zero,zero,X5) ),
inference(assume_negation,[status(cth)],[ck]) ).
cnf(c_0_12,plain,
( ~ r(X3,zero,X2)
| ~ r(X1,succ(succ(zero)),X3)
| r(X1,succ(succ(succ(zero))),succ(succ(succ(X2)))) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
fof(c_0_13,negated_conjecture,
! [X8,X9,X10,X11] :
( ~ r(zero,X10,X11)
| ~ r(zero,X9,X10)
| ~ r(zero,X8,X9)
| ~ r(zero,zero,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_14,plain,
( ~ r(X1,zero,X3)
| ~ r(succ(succ(succ(X3))),zero,X2)
| r(X1,succ(succ(succ(zero))),succ(succ(succ(X2)))) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ r(zero,X3,X4)
| ~ r(zero,X2,X3)
| ~ r(zero,X1,X2)
| ~ r(zero,zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( ~ r(X1,zero,X2)
| r(X1,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(X2)))))))) ),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X2,X3)
| ~ r(zero,succ(zero),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_18,plain,
( ~ r(X3,zero,X2)
| ~ r(X1,succ(succ(succ(zero))),X3)
| r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X2)))))))) ),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ r(zero,X2,X3)
| ~ r(zero,zero,X1)
| ~ r(zero,succ(X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,plain,
( ~ r(X1,zero,X3)
| ~ r(succ(succ(succ(succ(succ(succ(succ(X3))))))),zero,X2)
| r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X2)))))))) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ r(zero,zero,X1)
| ~ r(zero,succ(succ(succ(X1))),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_6])]) ).
cnf(c_0_22,plain,
( ~ r(X1,zero,X2)
| r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(X2)))))))))))))))) ),
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
cnf(c_0_23,negated_conjecture,
~ r(zero,zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN986+1.003 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.38 % Computer : n017.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.38 % CPULimit : 300
% 0.13/5.38 % WCLimit : 300
% 0.13/5.38 % DateTime : Mon Sep 21 11:27:18 UTC 2026
% 0.13/5.38 % CPUTime :
% 0.13/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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/5.45 % Version: 3.5.1
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45 % Starting sh5l with 300s (1) cores
% 0.16/5.45 % new_bool_3 with pid 2202492 completed with status 0
% 0.16/5.45 % Result found by new_bool_3
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % SubtermCWHack with pid 2202497 completed with status 0
% 0.16/5.45 % Result found by SubtermCWHack
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % Preprocessing time : 0.001 s
% 0.16/5.45
% 0.16/5.45 % Proof found!
% 0.16/5.45 % SZS status Theorem
% 0.16/5.45 % SZS output start CNFRefutation
% See solution above
% 0.16/5.45 % Parsed axioms : 3
% 0.16/5.45 % Removed by relevancy pruning/SinE : 0
% 0.16/5.45 % Initial clauses : 3
% 0.16/5.45 % Removed in clause preprocessing : 0
% 0.16/5.45 % Initial clauses in saturation : 3
% 0.16/5.45 % Processed clauses : 21
% 0.16/5.45 % ...of these trivial : 0
% 0.16/5.45 % ...subsumed : 1
% 0.16/5.45 % ...remaining for further processing : 20
% 0.16/5.45 % Other redundant clauses eliminated : 0
% 0.16/5.45 % Clauses deleted for lack of memory : 0
% 0.16/5.45 % Backward-subsumed : 6
% 0.16/5.45 % Backward-rewritten : 0
% 0.16/5.45 % Generated clauses : 21
% 0.16/5.45 % ...of the previous two non-redundant : 20
% 0.16/5.45 % ...aggressively subsumed : 0
% 0.16/5.45 % Contextual simplify-reflections : 0
% 0.16/5.45 % Paramodulations : 21
% 0.16/5.45 % Factorizations : 0
% 0.16/5.45 % NegExts : 0
% 0.16/5.45 % Equation resolutions : 0
% 0.16/5.45 % Disequality decompositions : 0
% 0.16/5.45 % Total rewrite steps : 2
% 0.16/5.45 % ...of those cached : 1
% 0.16/5.45 % Propositional unsat checks : 0
% 0.16/5.45 % Propositional check models : 0
% 0.16/5.45 % Propositional check unsatisfiable : 0
% 0.16/5.45 % Propositional clauses : 0
% 0.16/5.45 % Propositional clauses after purity: 0
% 0.16/5.45 % Propositional unsat core size : 0
% 0.16/5.45 % Propositional preprocessing time : 0.000
% 0.16/5.45 % Propositional encoding time : 0.000
% 0.16/5.45 % Propositional solver time : 0.000
% 0.16/5.45 % Success case prop preproc time : 0.000
% 0.16/5.45 % Success case prop encoding time : 0.000
% 0.16/5.45 % Success case prop solver time : 0.000
% 0.16/5.45 % Current number of processed clauses : 14
% 0.16/5.45 % Positive orientable unit clauses : 1
% 0.16/5.45 % Positive unorientable unit clauses: 0
% 0.16/5.45 % Negative unit clauses : 1
% 0.16/5.45 % Non-unit-clauses : 12
% 0.16/5.45 % Current number of unprocessed clauses: 2
% 0.16/5.45 % ...number of literals in the above : 6
% 0.16/5.45 % Current number of archived formulas : 0
% 0.16/5.45 % Current number of archived clauses : 6
% 0.16/5.45 % Clause-clause subsumption calls (NU) : 105
% 0.16/5.45 % Rec. Clause-clause subsumption calls : 86
% 0.16/5.45 % Non-unit clause-clause subsumptions : 2
% 0.16/5.45 % Unit Clause-clause subsumption calls : 12
% 0.16/5.45 % Rewrite failures with RHS unbound : 0
% 0.16/5.45 % BW rewrite match attempts : 0
% 0.16/5.45 % BW rewrite match successes : 0
% 0.16/5.45 % Condensation attempts : 0
% 0.16/5.45 % Condensation successes : 0
% 0.16/5.45 % Termbank termtop insertions : 1045
% 0.16/5.45 % Search garbage collected termcells : 65
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.003 s
% 0.16/5.45 % System time : 0.002 s
% 0.16/5.45 % Total time : 0.005 s
% 0.16/5.45 % Maximum resident set size: 3584 pages
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.005 s
% 0.16/5.45 % System time : 0.005 s
% 0.16/5.45 % Total time : 0.011 s
% 0.16/5.45 % Maximum resident set size: 4608 pages
% 0.16/5.45 % E exiting
%------------------------------------------------------------------------------