%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX239-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:14:21 PM UTC 2026
% Result : Unsatisfiable 0.87s 0.65s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 12 RR)
% Number of literals : 55 ( 54 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 4 con; 0-4 aty)
% Number of variables : 85 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_077,axiom,
eps2(y(X1,X2)) = andb(eps2(X1),eps2(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_077) ).
cnf(axiom_087,axiom,
rec(X1,nil2) = eps2(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_087) ).
cnf(axiom_075,axiom,
eps2(eps) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_075) ).
cnf(axiom_078,axiom,
eps2(star(X1)) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_078) ).
cnf(axiom_081,axiom,
step(atom(X1),X2) = aux(X2,X1,eq(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_081) ).
cnf(axiom_095,axiom,
reck2(atom(X1),cons2(X2,nil2)) = eq(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_095) ).
cnf(axiom_110,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_110) ).
cnf(axiom,axiom,
aux(X1,X2,btrue) = eps,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_073,axiom,
andb(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_073) ).
cnf(goal,negated_conjecture,
eq2(prop_same(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_084,axiom,
step(star(X1),X2) = y(step(X1,X2),star(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_084) ).
cnf(axiom_088,axiom,
rec(X1,cons2(X2,X3)) = rec(step(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_088) ).
cnf(axiom_100,axiom,
reck2(star(X1),cons2(X2,X3)) = aux3(X1,X2,X3,notb(eps2(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_100) ).
cnf(axiom_101,axiom,
prop_same(X1,X2) = eq2(rec(X1,X2),reck2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_101) ).
cnf(axiom_071,axiom,
notb(btrue) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_071) ).
cnf(axiom_005,axiom,
aux3(X1,X2,X3,bfalse) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_109,axiom,
eq2(btrue,bfalse) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_109) ).
cnf(axiom_111,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_111) ).
cnf(c_0_18,axiom,
eps2(y(X1,X2)) = andb(eps2(X1),eps2(X2)),
axiom_077 ).
cnf(c_0_19,axiom,
rec(X1,nil2) = eps2(X1),
axiom_087 ).
cnf(c_0_20,axiom,
eps2(eps) = btrue,
axiom_075 ).
cnf(c_0_21,axiom,
eps2(star(X1)) = btrue,
axiom_078 ).
cnf(c_0_22,plain,
rec(y(X1,X2),nil2) = andb(rec(X1,nil2),rec(X2,nil2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
rec(eps,nil2) = btrue,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_24,axiom,
step(atom(X1),X2) = aux(X2,X1,eq(X1,X2)),
axiom_081 ).
cnf(c_0_25,axiom,
reck2(atom(X1),cons2(X2,nil2)) = eq(X1,X2),
axiom_095 ).
cnf(c_0_26,axiom,
eq(X1,X1) = btrue,
axiom_110 ).
cnf(c_0_27,plain,
rec(star(X1),nil2) = btrue,
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_28,plain,
andb(rec(X1,nil2),btrue) = rec(y(X1,eps),nil2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
step(atom(X1),X2) = aux(X2,X1,reck2(atom(X1),cons2(X2,nil2))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
reck2(atom(X1),cons2(X1,nil2)) = btrue,
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_31,axiom,
aux(X1,X2,btrue) = eps,
axiom ).
cnf(c_0_32,axiom,
andb(btrue,X1) = X1,
axiom_073 ).
cnf(c_0_33,negated_conjecture,
eq2(prop_same(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_34,plain,
rec(y(X1,star(X2)),nil2) = rec(y(X1,eps),nil2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_28]) ).
cnf(c_0_35,axiom,
step(star(X1),X2) = y(step(X1,X2),star(X1)),
axiom_084 ).
cnf(c_0_36,axiom,
rec(X1,cons2(X2,X3)) = rec(step(X1,X2),X3),
axiom_088 ).
cnf(c_0_37,plain,
step(atom(X1),X1) = eps,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_38,plain,
rec(y(eps,X1),nil2) = rec(X1,nil2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_32]) ).
cnf(c_0_39,axiom,
reck2(star(X1),cons2(X2,X3)) = aux3(X1,X2,X3,notb(eps2(X1))),
axiom_100 ).
cnf(c_0_40,negated_conjecture,
eq2(prop_same(X1,X2),bfalse) != btrue,
c_0_33 ).
cnf(c_0_41,axiom,
prop_same(X1,X2) = eq2(rec(X1,X2),reck2(X1,X2)),
axiom_101 ).
cnf(c_0_42,plain,
rec(y(step(X1,X2),eps),nil2) = rec(star(X1),cons2(X2,nil2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,plain,
step(star(atom(X1)),X1) = y(eps,star(atom(X1))),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_44,plain,
rec(y(y(eps,X1),X2),nil2) = rec(y(X1,X2),nil2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_38]),c_0_22]) ).
cnf(c_0_45,plain,
rec(y(star(X1),X2),nil2) = rec(X2,nil2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_32]) ).
cnf(c_0_46,plain,
reck2(star(X1),cons2(X2,X3)) = aux3(X1,X2,X3,notb(rec(X1,nil2))),
inference(rw,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_47,axiom,
notb(btrue) = bfalse,
axiom_071 ).
cnf(c_0_48,axiom,
aux3(X1,X2,X3,bfalse) = bfalse,
axiom_005 ).
cnf(c_0_49,negated_conjecture,
eq2(eq2(rec(X1,X2),reck2(X1,X2)),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,plain,
rec(star(star(atom(X1))),cons2(X1,nil2)) = btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_23]) ).
cnf(c_0_51,plain,
reck2(star(star(X1)),cons2(X2,X3)) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_27]),c_0_47]),c_0_48]) ).
cnf(c_0_52,axiom,
eq2(btrue,bfalse) = bfalse,
axiom_109 ).
cnf(c_0_53,axiom,
eq2(X1,X1) = btrue,
axiom_111 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX239-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n013.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 10:37:35 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.87/0.65 % Version: 3.5.1
% 0.87/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.87/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.87/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.87/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.87/0.65 % Starting sh5l with 300s (1) cores
% 0.87/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 558372 completed with status 0
% 0.87/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.87/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.87/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.87/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.87/0.65 % No SInE strategy applied
% 0.87/0.65 % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.87/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.87/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.87/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.87/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.87/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.87/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.87/0.65 % SubtermCWHack with pid 558377 completed with status 0
% 0.87/0.65 % Result found by SubtermCWHack
% 0.87/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.87/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.87/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.87/0.65 % No SInE strategy applied
% 0.87/0.65 % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.87/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.87/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.87/0.65 % Preprocessing time : 0.003 s
% 0.87/0.65
% 0.87/0.65 % Proof found!
% 0.87/0.65 % SZS status Unsatisfiable
% 0.87/0.65 % SZS output start CNFRefutation
% See solution above
% 0.87/0.65 % Parsed axioms : 113
% 0.87/0.65 % Removed by relevancy pruning/SinE : 0
% 0.87/0.65 % Initial clauses : 113
% 0.87/0.65 % Removed in clause preprocessing : 3
% 0.87/0.65 % Initial clauses in saturation : 110
% 0.87/0.65 % Processed clauses : 556
% 0.87/0.65 % ...of these trivial : 45
% 0.87/0.65 % ...subsumed : 99
% 0.87/0.65 % ...remaining for further processing : 412
% 0.87/0.65 % Other redundant clauses eliminated : 0
% 0.87/0.65 % Clauses deleted for lack of memory : 0
% 0.87/0.65 % Backward-subsumed : 0
% 0.87/0.65 % Backward-rewritten : 25
% 0.87/0.65 % Generated clauses : 3751
% 0.87/0.65 % ...of the previous two non-redundant : 2701
% 0.87/0.65 % ...aggressively subsumed : 0
% 0.87/0.65 % Contextual simplify-reflections : 0
% 0.87/0.65 % Paramodulations : 3751
% 0.87/0.65 % Factorizations : 0
% 0.87/0.65 % NegExts : 0
% 0.87/0.65 % Equation resolutions : 0
% 0.87/0.65 % Disequality decompositions : 0
% 0.87/0.65 % Total rewrite steps : 3570
% 0.87/0.65 % ...of those cached : 2445
% 0.87/0.65 % Propositional unsat checks : 0
% 0.87/0.65 % Propositional check models : 0
% 0.87/0.65 % Propositional check unsatisfiable : 0
% 0.87/0.65 % Propositional clauses : 0
% 0.87/0.65 % Propositional clauses after purity: 0
% 0.87/0.65 % Propositional unsat core size : 0
% 0.87/0.65 % Propositional preprocessing time : 0.000
% 0.87/0.65 % Propositional encoding time : 0.000
% 0.87/0.65 % Propositional solver time : 0.000
% 0.87/0.65 % Success case prop preproc time : 0.000
% 0.87/0.65 % Success case prop encoding time : 0.000
% 0.87/0.65 % Success case prop solver time : 0.000
% 0.87/0.65 % Current number of processed clauses : 387
% 0.87/0.65 % Positive orientable unit clauses : 353
% 0.87/0.65 % Positive unorientable unit clauses: 0
% 0.87/0.65 % Negative unit clauses : 34
% 0.87/0.65 % Non-unit-clauses : 0
% 0.87/0.65 % Current number of unprocessed clauses: 2164
% 0.87/0.65 % ...number of literals in the above : 2164
% 0.87/0.65 % Current number of archived formulas : 0
% 0.87/0.65 % Current number of archived clauses : 28
% 0.87/0.65 % Clause-clause subsumption calls (NU) : 0
% 0.87/0.65 % Rec. Clause-clause subsumption calls : 0
% 0.87/0.65 % Non-unit clause-clause subsumptions : 0
% 0.87/0.65 % Unit Clause-clause subsumption calls : 534
% 0.87/0.65 % Rewrite failures with RHS unbound : 0
% 0.87/0.65 % BW rewrite match attempts : 410
% 0.87/0.65 % BW rewrite match successes : 25
% 0.87/0.65 % Condensation attempts : 0
% 0.87/0.65 % Condensation successes : 0
% 0.87/0.65 % Termbank termtop insertions : 52704
% 0.87/0.65 % Search garbage collected termcells : 2
% 0.87/0.65
% 0.87/0.65 % -------------------------------------------------
% 0.87/0.65 % User time : 0.080 s
% 0.87/0.65 % System time : 0.009 s
% 0.87/0.65 % Total time : 0.089 s
% 0.87/0.65 % Maximum resident set size: 3444 pages
% 0.87/0.65
% 0.87/0.65 % -------------------------------------------------
% 0.87/0.65 % User time : 0.354 s
% 0.87/0.65 % System time : 0.049 s
% 0.87/0.65 % Total time : 0.403 s
% 0.87/0.65 % Maximum resident set size: 4864 pages
% 0.87/0.65 % E exiting
%------------------------------------------------------------------------------