%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC279-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:46 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.46s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 17 unt; 2 nHn; 36 RR)
% Number of literals : 87 ( 11 equ; 53 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( ~ leq(sk8,sk5)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_9,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_17,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_13,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
( memberP(sk7,sk8)
| memberP(sk6,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_15,negated_conjecture,
( ~ leq(sk5,sk8)
| memberP(sk6,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(c_0_12,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_13,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_12 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_16,negated_conjecture,
( ~ leq(sk8,sk5)
| memberP(sk7,sk8) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_17,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssItem(sk5),
co1_9 ).
cnf(c_0_20,negated_conjecture,
ssList(sk7),
co1_11 ).
cnf(c_0_21,negated_conjecture,
ssList(sk6),
co1_10 ).
cnf(c_0_22,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( ~ leq(sk8,sk5)
| memberP(sk7,sk8) ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk6,X1)
| leq(X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(sk8),
co1_13 ).
cnf(c_0_27,negated_conjecture,
( memberP(sk7,sk8)
| memberP(sk6,sk8) ),
co1_14 ).
cnf(c_0_28,negated_conjecture,
( ~ leq(sk5,sk8)
| memberP(sk6,sk8) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_29,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk7,X1)
| leq(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
memberP(sk7,sk8),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ leq(sk5,sk8)
| memberP(sk6,sk8) ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
~ leq(sk8,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
memberP(sk6,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31]),c_0_26])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_34]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC279-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 08:11:28 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.31/0.46 % Version: 3.5.1
% 0.31/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.46 % Starting sh5l with 300s (1) cores
% 0.31/0.46 % new_bool_3 with pid 1282383 completed with status 0
% 0.31/0.46 % Result found by new_bool_3
% 0.31/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.46 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.31/0.46 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.31/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.46 % SubtermCWHack with pid 1282386 completed with status 0
% 0.31/0.46 % Result found by SubtermCWHack
% 0.31/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.46 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.31/0.46 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.31/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.46 % Preprocessing time : 0.001 s
% 0.31/0.46
% 0.31/0.46 % Proof found!
% 0.31/0.46 % SZS status Unsatisfiable
% 0.31/0.46 % SZS output start CNFRefutation
% See solution above
% 0.31/0.46 % Parsed axioms : 202
% 0.31/0.46 % Removed by relevancy pruning/SinE : 149
% 0.31/0.46 % Initial clauses : 53
% 0.31/0.46 % Removed in clause preprocessing : 0
% 0.31/0.46 % Initial clauses in saturation : 53
% 0.31/0.46 % Processed clauses : 158
% 0.31/0.46 % ...of these trivial : 3
% 0.31/0.46 % ...subsumed : 41
% 0.31/0.46 % ...remaining for further processing : 114
% 0.31/0.46 % Other redundant clauses eliminated : 9
% 0.31/0.46 % Clauses deleted for lack of memory : 0
% 0.31/0.46 % Backward-subsumed : 20
% 0.31/0.46 % Backward-rewritten : 7
% 0.31/0.46 % Generated clauses : 463
% 0.31/0.46 % ...of the previous two non-redundant : 342
% 0.31/0.46 % ...aggressively subsumed : 0
% 0.31/0.46 % Contextual simplify-reflections : 6
% 0.31/0.46 % Paramodulations : 451
% 0.31/0.46 % Factorizations : 0
% 0.31/0.46 % NegExts : 0
% 0.31/0.46 % Equation resolutions : 13
% 0.31/0.46 % Disequality decompositions : 0
% 0.31/0.46 % Total rewrite steps : 405
% 0.31/0.46 % ...of those cached : 391
% 0.31/0.46 % Propositional unsat checks : 0
% 0.31/0.46 % Propositional check models : 0
% 0.31/0.46 % Propositional check unsatisfiable : 0
% 0.31/0.46 % Propositional clauses : 0
% 0.31/0.46 % Propositional clauses after purity: 0
% 0.31/0.46 % Propositional unsat core size : 0
% 0.31/0.46 % Propositional preprocessing time : 0.000
% 0.31/0.46 % Propositional encoding time : 0.000
% 0.31/0.46 % Propositional solver time : 0.000
% 0.31/0.46 % Success case prop preproc time : 0.000
% 0.31/0.46 % Success case prop encoding time : 0.000
% 0.31/0.46 % Success case prop solver time : 0.000
% 0.31/0.46 % Current number of processed clauses : 83
% 0.31/0.46 % Positive orientable unit clauses : 15
% 0.31/0.46 % Positive unorientable unit clauses: 0
% 0.31/0.46 % Negative unit clauses : 3
% 0.31/0.46 % Non-unit-clauses : 65
% 0.31/0.46 % Current number of unprocessed clauses: 204
% 0.31/0.46 % ...number of literals in the above : 1077
% 0.31/0.46 % Current number of archived formulas : 0
% 0.31/0.46 % Current number of archived clauses : 27
% 0.31/0.46 % Clause-clause subsumption calls (NU) : 832
% 0.31/0.46 % Rec. Clause-clause subsumption calls : 349
% 0.31/0.46 % Non-unit clause-clause subsumptions : 54
% 0.31/0.46 % Unit Clause-clause subsumption calls : 69
% 0.31/0.46 % Rewrite failures with RHS unbound : 0
% 0.31/0.46 % BW rewrite match attempts : 6
% 0.31/0.46 % BW rewrite match successes : 6
% 0.31/0.46 % Condensation attempts : 0
% 0.31/0.46 % Condensation successes : 0
% 0.31/0.46 % Termbank termtop insertions : 11098
% 0.31/0.46 % Search garbage collected termcells : 910
% 0.31/0.46
% 0.31/0.46 % -------------------------------------------------
% 0.31/0.46 % User time : 0.008 s
% 0.31/0.46 % System time : 0.005 s
% 0.31/0.46 % Total time : 0.013 s
% 0.31/0.46 % Maximum resident set size: 3816 pages
% 0.31/0.46
% 0.31/0.46 % -------------------------------------------------
% 0.31/0.46 % User time : 0.012 s
% 0.31/0.46 % System time : 0.009 s
% 0.31/0.46 % Total time : 0.021 s
% 0.31/0.46 % Maximum resident set size: 5120 pages
% 0.31/0.46 % E exiting
%------------------------------------------------------------------------------