%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC153-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 02:43:14 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.65s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 51 ( 26 unt; 0 nHn; 51 RR)
% Number of literals : 156 ( 20 equ; 110 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause130,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause130) ).
cnf(co1_7,negated_conjecture,
( ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_15,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk3 = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_16,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X6,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_18,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ~ leq(sk5,sk6)
| ssItem(sk10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk10,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_8,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_0_15,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause130]) ).
cnf(c_0_16,negated_conjecture,
( ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_18,negated_conjecture,
sk3 = sk1,
co1_6 ).
cnf(c_0_19,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
leq(sk6,sk5),
co1_16 ).
cnf(c_0_21,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_23,negated_conjecture,
( ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_26,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_27,negated_conjecture,
ssList(sk7),
co1_12 ).
cnf(c_0_28,negated_conjecture,
( ~ leq(sk5,sk6)
| sk6 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
leq(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_21]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X6,X2) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_31,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_33,negated_conjecture,
( ~ leq(sk5,sk6)
| ssItem(sk10) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_34,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk10,sk6) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_35,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X6,X2) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
leq(sk5,sk5),
inference(rw,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( ~ leq(sk5,sk6)
| ssItem(sk10) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X6) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_40,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk10,sk6) ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk8,X1)
| leq(X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_31]),c_0_31]),c_0_36]),c_0_31]),c_0_22]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
memberP(sk8,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_29])]) ).
cnf(c_0_43,negated_conjecture,
ssItem(sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
( ~ memberP(X4,X6)
| ~ ssItem(X6)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X6) ),
c_0_39 ).
cnf(c_0_45,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk5,nil)),sk9) = sk3,
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_46,negated_conjecture,
( ~ leq(sk10,sk5)
| ~ leq(sk5,sk10) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_29])]),c_0_31]) ).
cnf(c_0_47,negated_conjecture,
leq(sk10,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk8,X1)
| leq(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_36]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
~ leq(sk5,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_43])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC153-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n009.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 08:00:15 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.29/0.65 % Version: 3.5.1
% 0.29/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.65 % Starting sh5l with 300s (1) cores
% 0.29/0.65 % new_bool_1 with pid 1262743 completed with status 0
% 0.29/0.65 % Result found by new_bool_1
% 0.29/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.65 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.29/0.65 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.29/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.65 % SubtermCWHack with pid 1262746 completed with status 0
% 0.29/0.65 % Result found by SubtermCWHack
% 0.29/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.65 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.29/0.65 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.29/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.65 % Preprocessing time : 0.002 s
% 0.29/0.65
% 0.29/0.65 % Proof found!
% 0.29/0.65 % SZS status Unsatisfiable
% 0.29/0.65 % SZS output start CNFRefutation
% See solution above
% 0.29/0.65 % Parsed axioms : 204
% 0.29/0.65 % Removed by relevancy pruning/SinE : 157
% 0.29/0.65 % Initial clauses : 47
% 0.29/0.65 % Removed in clause preprocessing : 0
% 0.29/0.65 % Initial clauses in saturation : 47
% 0.29/0.65 % Processed clauses : 133
% 0.29/0.65 % ...of these trivial : 1
% 0.29/0.65 % ...subsumed : 49
% 0.29/0.65 % ...remaining for further processing : 83
% 0.29/0.65 % Other redundant clauses eliminated : 8
% 0.29/0.65 % Clauses deleted for lack of memory : 0
% 0.29/0.65 % Backward-subsumed : 0
% 0.29/0.65 % Backward-rewritten : 11
% 0.29/0.65 % Generated clauses : 336
% 0.29/0.65 % ...of the previous two non-redundant : 262
% 0.29/0.65 % ...aggressively subsumed : 0
% 0.29/0.65 % Contextual simplify-reflections : 6
% 0.29/0.65 % Paramodulations : 325
% 0.29/0.65 % Factorizations : 0
% 0.29/0.65 % NegExts : 0
% 0.29/0.65 % Equation resolutions : 12
% 0.29/0.65 % Disequality decompositions : 0
% 0.29/0.65 % Total rewrite steps : 291
% 0.29/0.65 % ...of those cached : 274
% 0.29/0.65 % Propositional unsat checks : 0
% 0.29/0.65 % Propositional check models : 0
% 0.29/0.65 % Propositional check unsatisfiable : 0
% 0.29/0.65 % Propositional clauses : 0
% 0.29/0.65 % Propositional clauses after purity: 0
% 0.29/0.65 % Propositional unsat core size : 0
% 0.29/0.65 % Propositional preprocessing time : 0.000
% 0.29/0.65 % Propositional encoding time : 0.000
% 0.29/0.65 % Propositional solver time : 0.000
% 0.29/0.65 % Success case prop preproc time : 0.000
% 0.29/0.65 % Success case prop encoding time : 0.000
% 0.29/0.65 % Success case prop solver time : 0.000
% 0.29/0.65 % Current number of processed clauses : 69
% 0.29/0.65 % Positive orientable unit clauses : 17
% 0.29/0.65 % Positive unorientable unit clauses: 0
% 0.29/0.65 % Negative unit clauses : 1
% 0.29/0.65 % Non-unit-clauses : 51
% 0.29/0.65 % Current number of unprocessed clauses: 173
% 0.29/0.65 % ...number of literals in the above : 1057
% 0.29/0.65 % Current number of archived formulas : 0
% 0.29/0.65 % Current number of archived clauses : 11
% 0.29/0.65 % Clause-clause subsumption calls (NU) : 910
% 0.29/0.65 % Rec. Clause-clause subsumption calls : 243
% 0.29/0.65 % Non-unit clause-clause subsumptions : 54
% 0.29/0.65 % Unit Clause-clause subsumption calls : 17
% 0.29/0.65 % Rewrite failures with RHS unbound : 0
% 0.29/0.65 % BW rewrite match attempts : 6
% 0.29/0.65 % BW rewrite match successes : 5
% 0.29/0.65 % Condensation attempts : 0
% 0.29/0.65 % Condensation successes : 0
% 0.29/0.65 % Termbank termtop insertions : 10154
% 0.29/0.65 % Search garbage collected termcells : 933
% 0.29/0.65
% 0.29/0.65 % -------------------------------------------------
% 0.29/0.65 % User time : 0.012 s
% 0.29/0.65 % System time : 0.006 s
% 0.29/0.65 % Total time : 0.018 s
% 0.29/0.65 % Maximum resident set size: 4076 pages
% 0.29/0.65
% 0.29/0.65 % -------------------------------------------------
% 0.29/0.65 % User time : 0.020 s
% 0.29/0.65 % System time : 0.013 s
% 0.29/0.65 % Total time : 0.032 s
% 0.29/0.65 % Maximum resident set size: 5120 pages
% 0.29/0.65 % E exiting
%------------------------------------------------------------------------------