%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO691-1.000 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:52:08 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 57 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rewrite_sequence_succ,axiom,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_succ) ).
cnf(rewrite_sequence_zero,axiom,
seq(zero,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_zero) ).
cnf(rewrite_right,axiom,
( ~ step(X1,X2)
| step(f(X3,X1),f(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_right) ).
cnf(rewrite_left,axiom,
( ~ step(X1,X2)
| step(f(X1,X3),f(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_left) ).
cnf(rewrite_top,axiom,
( ~ top(X1,X2)
| step(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_top) ).
cnf(rule_1,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(prove,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
cnf(c_0_7,plain,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
inference(fof_simplification,[status(thm)],[rewrite_sequence_succ]) ).
cnf(c_0_8,plain,
( ~ step(X3,X4)
| ~ seq(X1,X2,X3)
| seq(succ(X1),X2,X4) ),
c_0_7 ).
cnf(c_0_9,axiom,
seq(zero,X1,X1),
rewrite_sequence_zero ).
cnf(c_0_10,plain,
( ~ step(X1,X2)
| seq(succ(zero),X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( ~ step(X1,X2)
| step(f(X3,X1),f(X3,X2)) ),
inference(fof_simplification,[status(thm)],[rewrite_right]) ).
cnf(c_0_12,plain,
( ~ step(X1,X3)
| ~ step(X3,X2)
| seq(succ(succ(zero)),X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,plain,
( ~ step(X1,X2)
| step(f(X3,X1),f(X3,X2)) ),
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,
( ~ step(X4,X3)
| ~ step(X1,f(X2,X4))
| seq(succ(succ(zero)),X1,f(X2,X3)) ),
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,
( ~ top(X1,X2)
| step(X1,X2) ),
inference(fof_simplification,[status(thm)],[rewrite_top]) ).
cnf(c_0_18,plain,
( ~ step(X1,X3)
| ~ step(X2,X4)
| seq(succ(succ(zero)),f(X1,X2),f(X3,X4)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ top(X1,X2)
| step(X1,X2) ),
c_0_17 ).
cnf(c_0_20,axiom,
top(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
rule_1 ).
cnf(c_0_21,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
inference(fof_simplification,[status(thm)],[prove]) ).
cnf(c_0_22,plain,
( ~ step(X1,X4)
| ~ step(X2,X5)
| ~ step(f(X4,X5),X3)
| seq(succ(succ(succ(zero))),f(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_23,plain,
step(f(f(X1,X2),f(X3,a)),f(f(X3,f(X2,a)),X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ seq(succ(succ(succ(zero))),X1,X1),
c_0_21 ).
cnf(c_0_25,plain,
( ~ step(X1,f(X5,X4))
| ~ step(X2,f(X3,a))
| seq(succ(succ(succ(zero))),f(X1,X2),f(f(X3,f(X4,a)),X5)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ step(X3,f(X1,a))
| ~ step(f(X1,f(X2,a)),f(X3,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ step(f(X1,f(X2,a)),f(f(X1,X2),a)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYO691-1.000 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.48 % Computer : n019.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Mon Sep 21 12:10:05 UTC 2026
% 0.22/0.49 % CPUTime :
% 0.22/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.56 Running first-order theorem proving
% 0.26/0.56 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.26/0.62 % Version: 3.5.1
% 0.26/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % Starting sh5l with 300s (1) cores
% 0.26/0.62 % sh5l with pid 2531418 completed with status 0
% 0.26/0.62 % Result found by sh5l
% 0.26/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % Starting sh5l with 300s (1) cores
% 0.26/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.62 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.26/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.62 % SubtermCWHack with pid 2531424 completed with status 0
% 0.26/0.62 % Result found by SubtermCWHack
% 0.26/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % Starting sh5l with 300s (1) cores
% 0.26/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.62 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.26/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.62 % Preprocessing time : 0.002 s
% 0.26/0.62
% 0.26/0.62 % Proof found!
% 0.26/0.62 % SZS status Unsatisfiable
% 0.26/0.62 % SZS output start CNFRefutation
% See solution above
% 0.26/0.62 % Parsed axioms : 7
% 0.26/0.62 % Removed by relevancy pruning/SinE : 0
% 0.26/0.62 % Initial clauses : 7
% 0.26/0.62 % Removed in clause preprocessing : 0
% 0.26/0.62 % Initial clauses in saturation : 7
% 0.26/0.62 % Processed clauses : 92
% 0.26/0.62 % ...of these trivial : 0
% 0.26/0.62 % ...subsumed : 15
% 0.26/0.62 % ...remaining for further processing : 77
% 0.26/0.62 % Other redundant clauses eliminated : 0
% 0.26/0.62 % Clauses deleted for lack of memory : 0
% 0.26/0.62 % Backward-subsumed : 0
% 0.26/0.62 % Backward-rewritten : 0
% 0.26/0.62 % Generated clauses : 170
% 0.26/0.62 % ...of the previous two non-redundant : 169
% 0.26/0.62 % ...aggressively subsumed : 0
% 0.26/0.62 % Contextual simplify-reflections : 0
% 0.26/0.62 % Paramodulations : 170
% 0.26/0.62 % Factorizations : 0
% 0.26/0.62 % NegExts : 0
% 0.26/0.62 % Equation resolutions : 0
% 0.26/0.62 % Disequality decompositions : 0
% 0.26/0.62 % Total rewrite steps : 0
% 0.26/0.62 % ...of those cached : 0
% 0.26/0.62 % Propositional unsat checks : 0
% 0.26/0.62 % Propositional check models : 0
% 0.26/0.62 % Propositional check unsatisfiable : 0
% 0.26/0.62 % Propositional clauses : 0
% 0.26/0.62 % Propositional clauses after purity: 0
% 0.26/0.62 % Propositional unsat core size : 0
% 0.26/0.62 % Propositional preprocessing time : 0.000
% 0.26/0.62 % Propositional encoding time : 0.000
% 0.26/0.62 % Propositional solver time : 0.000
% 0.26/0.62 % Success case prop preproc time : 0.000
% 0.26/0.62 % Success case prop encoding time : 0.000
% 0.26/0.62 % Success case prop solver time : 0.000
% 0.26/0.62 % Current number of processed clauses : 77
% 0.26/0.62 % Positive orientable unit clauses : 3
% 0.26/0.62 % Positive unorientable unit clauses: 0
% 0.26/0.62 % Negative unit clauses : 2
% 0.26/0.62 % Non-unit-clauses : 72
% 0.26/0.62 % Current number of unprocessed clauses: 84
% 0.26/0.62 % ...number of literals in the above : 254
% 0.26/0.62 % Current number of archived formulas : 0
% 0.26/0.62 % Current number of archived clauses : 0
% 0.26/0.62 % Clause-clause subsumption calls (NU) : 2888
% 0.26/0.62 % Rec. Clause-clause subsumption calls : 2264
% 0.26/0.62 % Non-unit clause-clause subsumptions : 15
% 0.26/0.62 % Unit Clause-clause subsumption calls : 71
% 0.26/0.62 % Rewrite failures with RHS unbound : 0
% 0.26/0.62 % BW rewrite match attempts : 0
% 0.26/0.62 % BW rewrite match successes : 0
% 0.26/0.62 % Condensation attempts : 0
% 0.26/0.62 % Condensation successes : 0
% 0.26/0.62 % Termbank termtop insertions : 4678
% 0.26/0.62 % Search garbage collected termcells : 14
% 0.26/0.62
% 0.26/0.62 % -------------------------------------------------
% 0.26/0.62 % User time : 0.019 s
% 0.26/0.62 % System time : 0.002 s
% 0.26/0.62 % Total time : 0.021 s
% 0.26/0.62 % Maximum resident set size: 3636 pages
% 0.26/0.62
% 0.26/0.62 % -------------------------------------------------
% 0.26/0.62 % User time : 0.019 s
% 0.26/0.62 % System time : 0.011 s
% 0.26/0.62 % Total time : 0.030 s
% 0.26/0.62 % Maximum resident set size: 4608 pages
% 0.26/0.62 % E exiting
%------------------------------------------------------------------------------