%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO038-1.003.003 : TPTP v9.3.1. Released v5.3.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 03:45:20 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 40 ( 33 unt; 0 nHn; 31 RR)
% Number of literals : 47 ( 14 equ; 23 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax3,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
cnf(ax1,axiom,
f(X1,one) = s(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
cnf(ax5,axiom,
( ~ d(X1)
| d(s(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
cnf(ax2,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
cnf(conj,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
cnf(ax4,axiom,
d(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(c_0_6,axiom,
f(s(X1),s(X2)) = f(X1,f(s(X1),X2)),
ax3 ).
cnf(c_0_7,axiom,
f(X1,one) = s(one),
ax1 ).
cnf(c_0_8,plain,
( ~ d(X1)
| d(s(X1)) ),
inference(fof_simplification,[status(thm)],[ax5]) ).
cnf(c_0_9,plain,
f(s(X1),s(one)) = f(X1,s(one)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ d(X1)
| d(s(X1)) ),
c_0_8 ).
cnf(c_0_11,axiom,
f(one,s(X1)) = s(s(f(one,X1))),
ax2 ).
cnf(c_0_12,plain,
f(X1,f(X1,s(one))) = f(s(X1),s(s(one))),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,plain,
( ~ d(s(f(one,X1)))
| d(f(one,s(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
f(one,s(one)) = s(s(s(one))),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
inference(fof_simplification,[status(thm)],[conj]) ).
cnf(c_0_16,plain,
f(s(X1),f(X1,s(one))) = f(s(s(X1)),s(s(one))),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,plain,
( ~ d(s(f(one,s(f(one,X1)))))
| d(f(one,f(one,s(X1)))) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,plain,
f(s(one),s(s(one))) = f(one,s(s(s(one)))),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
c_0_15 ).
cnf(c_0_20,plain,
f(s(s(one)),s(s(one))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,plain,
( ~ d(f(one,s(f(one,X1))))
| d(f(one,f(one,s(X1)))) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_22,plain,
f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_23,plain,
f(one,s(s(one))) = s(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
~ d(f(s(one),s(s(s(one))))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
~ d(f(one,s(s(s(s(s(s(one)))))))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
~ d(s(f(one,s(s(s(s(s(one)))))))),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_27,plain,
~ d(f(one,s(s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_28,plain,
~ d(s(f(one,s(s(s(s(one))))))),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_29,plain,
~ d(f(one,s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_30,plain,
~ d(s(f(one,s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_31,plain,
~ d(f(one,s(s(s(one))))),
inference(spm,[status(thm)],[c_0_30,c_0_10]) ).
cnf(c_0_32,plain,
( ~ d(s(s(s(s(s(one))))))
| d(f(one,s(s(s(one))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_7]),c_0_23]) ).
cnf(c_0_33,plain,
~ d(s(s(s(s(s(one)))))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
~ d(s(s(s(s(one))))),
inference(spm,[status(thm)],[c_0_33,c_0_10]) ).
cnf(c_0_35,plain,
~ d(s(s(s(one)))),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_36,plain,
~ d(s(s(one))),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_37,plain,
~ d(s(one)),
inference(spm,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_38,axiom,
d(one),
ax4 ).
cnf(c_0_39,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_10]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO038-1.003.003 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n003.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 11:35:46 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.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 % new_bool_1 with pid 4188068 completed with status 0
% 0.14/0.43 % Result found by new_bool_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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHUSS-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 6 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 4188074 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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHUSS-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 6 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 : 6
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 6
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 6
% 0.14/0.43 % Processed clauses : 43
% 0.14/0.43 % ...of these trivial : 1
% 0.14/0.43 % ...subsumed : 5
% 0.14/0.43 % ...remaining for further processing : 37
% 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 : 1
% 0.14/0.43 % Backward-rewritten : 1
% 0.14/0.43 % Generated clauses : 105
% 0.14/0.43 % ...of the previous two non-redundant : 88
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 105
% 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 : 127
% 0.14/0.43 % ...of those cached : 88
% 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 : 35
% 0.14/0.43 % Positive orientable unit clauses : 17
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 13
% 0.14/0.43 % Non-unit-clauses : 5
% 0.14/0.43 % Current number of unprocessed clauses: 51
% 0.14/0.43 % ...number of literals in the above : 62
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 2
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 17
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 17
% 0.14/0.43 % Non-unit clause-clause subsumptions : 5
% 0.14/0.43 % Unit Clause-clause subsumption calls : 79
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 7
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 2243
% 0.14/0.43 % Search garbage collected termcells : 5
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.002 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.005 s
% 0.14/0.43 % Maximum resident set size: 3632 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.002 s
% 0.14/0.43 % System time : 0.008 s
% 0.14/0.43 % Total time : 0.010 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------