%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO691-1.001 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:48:34 PM UTC 2026
% Result : Unsatisfiable 8.63s 1.64s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 15 RR)
% Number of literals : 48 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rewrite_sequence_succ,axiom,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_succ) ).
cnf(rewrite_top,axiom,
( ~ top(X1,X2)
| step(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_top) ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_zero) ).
cnf(rule_1,axiom,
top(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(rewrite_left,axiom,
( ~ step(X1,X2)
| step(f(X1,X3),f(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_left) ).
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
cnf(c_0_6,plain,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
inference(fof_simplification,[status(thm)],[rewrite_sequence_succ]) ).
cnf(c_0_7,plain,
( ~ top(X1,X2)
| step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_top]) ).
cnf(c_0_8,plain,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
c_0_6 ).
cnf(c_0_9,axiom,
seq(zero,X1,X1),
rewrite_sequence_zero ).
cnf(c_0_10,plain,
( ~ top(X1,X2)
| step(X1,X2) ),
c_0_7 ).
cnf(c_0_11,axiom,
top(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
rule_1 ).
cnf(c_0_12,plain,
( ~ step(X1,X2)
| seq(succ(zero),X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
step(f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ step(X1,X2)
| step(f(X1,X3),f(X2,X3)) ),
inference(fof_simplification,[status(thm)],[rewrite_left]) ).
cnf(c_0_15,plain,
seq(succ(zero),f(f(f(X1,a),X2),f(X3,a)),f(f(X3,f(f(X2,a),a)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ step(X1,X2)
| step(f(X1,X3),f(X2,X3)) ),
c_0_14 ).
cnf(c_0_17,plain,
( ~ step(f(f(X3,f(f(X2,a),a)),X1),X4)
| seq(succ(succ(zero)),f(f(f(X1,a),X2),f(X3,a)),X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,plain,
step(f(f(f(f(X1,a),X2),f(X3,a)),X4),f(f(f(X3,f(f(X2,a),a)),X1),X4)),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_19,plain,
seq(succ(succ(zero)),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),f(f(f(f(X2,a),f(f(X4,a),a)),X3),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( ~ step(f(f(f(f(X2,a),f(f(X4,a),a)),X3),X1),X5)
| seq(succ(succ(succ(zero))),f(f(f(X1,a),X2),f(f(f(X3,a),X4),a)),X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_21,plain,
step(f(f(f(f(f(X1,a),X2),f(X3,a)),X4),X5),f(f(f(f(X3,f(f(X2,a),a)),X1),X4),X5)),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_22,plain,
seq(succ(succ(succ(zero))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),f(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ step(f(f(f(f(f(X4,a),f(f(a,a),a)),X2),X3),X1),X5)
| seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),X4),a)),X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_24,plain,
step(f(f(f(f(f(f(X1,a),X2),f(X3,a)),X4),X5),X6),f(f(f(f(f(X3,f(f(X2,a),a)),X1),X4),X5),X6)),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_25,plain,
seq(succ(succ(succ(succ(zero)))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),f(X4,a)),a)),f(f(f(f(f(f(a,a),f(f(a,a),a)),X4),X2),X3),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
inference(fof_simplification,[status(thm)],[prove]) ).
cnf(c_0_27,plain,
( ~ step(f(f(f(f(f(f(a,a),f(f(a,a),a)),X4),X2),X3),X1),X5)
| seq(succ(succ(succ(succ(succ(zero))))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),f(X4,a)),a)),X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ seq(succ(succ(succ(succ(succ(zero))))),X1,X1),
c_0_26 ).
cnf(c_0_29,plain,
seq(succ(succ(succ(succ(succ(zero))))),f(f(f(X1,a),f(X2,a)),f(f(f(X3,a),f(f(X4,a),a)),a)),f(f(f(f(f(X4,f(f(f(f(a,a),a),a),a)),a),X2),X3),X1)),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYO691-1.001 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n018.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 12:11:28 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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
% 8.63/1.64 % Version: 3.5.1
% 8.63/1.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.63/1.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.63/1.64 % Starting new_bool_3 with 300s (1) cores
% 8.63/1.64 % Starting new_bool_1 with 300s (1) cores
% 8.63/1.64 % Starting sh5l with 300s (1) cores
% 8.63/1.64 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1843087 completed with status 0
% 8.63/1.64 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.63/1.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.63/1.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.63/1.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.63/1.64 % No SInE strategy applied
% 8.63/1.64 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.63/1.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.63/1.64 % Starting SubtermCWHack with 136s (1) cores
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.63/1.64 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.63/1.64 % Starting new_bool_3 with 136s (1) cores
% 8.63/1.64 % new_bool_3 with pid 1843098 completed with status 0
% 8.63/1.64 % Result found by new_bool_3
% 8.63/1.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.63/1.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.63/1.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.63/1.64 % No SInE strategy applied
% 8.63/1.64 % Search class: FHUNS-FFSF21-MFFFFFNN
% 8.63/1.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.63/1.64 % Starting SubtermCWHack with 136s (1) cores
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.63/1.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 8.63/1.64 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 8.63/1.64 % Starting new_bool_3 with 136s (1) cores
% 8.63/1.64 % Preprocessing time : 0.002 s
% 8.63/1.64 % Presaturation interreduction done
% 8.63/1.64
% 8.63/1.64 % Proof found!
% 8.63/1.64 % SZS status Unsatisfiable
% 8.63/1.64 % SZS output start CNFRefutation
% See solution above
% 8.63/1.64 % Parsed axioms : 7
% 8.63/1.64 % Removed by relevancy pruning/SinE : 0
% 8.63/1.64 % Initial clauses : 7
% 8.63/1.64 % Removed in clause preprocessing : 0
% 8.63/1.64 % Initial clauses in saturation : 7
% 8.63/1.64 % Processed clauses : 620
% 8.63/1.64 % ...of these trivial : 29
% 8.63/1.64 % ...subsumed : 0
% 8.63/1.64 % ...remaining for further processing : 591
% 8.63/1.64 % Other redundant clauses eliminated : 0
% 8.63/1.64 % Clauses deleted for lack of memory : 0
% 8.63/1.64 % Backward-subsumed : 0
% 8.63/1.64 % Backward-rewritten : 0
% 8.63/1.64 % Generated clauses : 25816
% 8.63/1.64 % ...of the previous two non-redundant : 25812
% 8.63/1.64 % ...aggressively subsumed : 0
% 8.63/1.64 % Contextual simplify-reflections : 0
% 8.63/1.64 % Paramodulations : 25816
% 8.63/1.64 % Factorizations : 0
% 8.63/1.64 % NegExts : 0
% 8.63/1.64 % Equation resolutions : 0
% 8.63/1.64 % Disequality decompositions : 0
% 8.63/1.64 % Total rewrite steps : 32
% 8.63/1.64 % ...of those cached : 0
% 8.63/1.64 % Propositional unsat checks : 0
% 8.63/1.64 % Propositional check models : 0
% 8.63/1.64 % Propositional check unsatisfiable : 0
% 8.63/1.64 % Propositional clauses : 0
% 8.63/1.64 % Propositional clauses after purity: 0
% 8.63/1.64 % Propositional unsat core size : 0
% 8.63/1.64 % Propositional preprocessing time : 0.000
% 8.63/1.64 % Propositional encoding time : 0.000
% 8.63/1.64 % Propositional solver time : 0.000
% 8.63/1.64 % Success case prop preproc time : 0.000
% 8.63/1.64 % Success case prop encoding time : 0.000
% 8.63/1.64 % Success case prop solver time : 0.000
% 8.63/1.64 % Current number of processed clauses : 584
% 8.63/1.64 % Positive orientable unit clauses : 354
% 8.63/1.64 % Positive unorientable unit clauses: 0
% 8.63/1.64 % Negative unit clauses : 1
% 8.63/1.64 % Non-unit-clauses : 229
% 8.63/1.64 % Current number of unprocessed clauses: 25205
% 8.63/1.64 % ...number of literals in the above : 25205
% 8.63/1.64 % Current number of archived formulas : 0
% 8.63/1.64 % Current number of archived clauses : 7
% 8.63/1.64 % Clause-clause subsumption calls (NU) : 21447
% 8.63/1.64 % Rec. Clause-clause subsumption calls : 21447
% 8.63/1.64 % Non-unit clause-clause subsumptions : 0
% 8.63/1.64 % Unit Clause-clause subsumption calls : 0
% 8.63/1.64 % Rewrite failures with RHS unbound : 0
% 8.63/1.64 % BW rewrite match attempts : 21792
% 8.63/1.64 % BW rewrite match successes : 0
% 8.63/1.64 % Condensation attempts : 0
% 8.63/1.64 % Condensation successes : 0
% 8.63/1.64 % Termbank termtop insertions : 1329614
% 8.63/1.64 % Search garbage collected termcells : 14
% 8.63/1.64
% 8.63/1.64 % -------------------------------------------------
% 8.63/1.64 % User time : 1.030 s
% 8.63/1.64 % System time : 0.055 s
% 8.63/1.64 % Total time : 1.085 s
% 8.63/1.64 % Maximum resident set size: 3636 pages
% 8.63/1.64
% 8.63/1.64 % -------------------------------------------------
% 8.63/1.64 % User time : 5.170 s
% 8.63/1.64 % System time : 0.145 s
% 8.63/1.64 % Total time : 5.315 s
% 8.63/1.64 % Maximum resident set size: 4608 pages
% 8.63/1.64 % E exiting
%------------------------------------------------------------------------------