%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC218-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 : n020.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:30 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of clauses : 59 ( 31 unt; 3 nHn; 59 RR)
% Number of literals : 114 ( 43 equ; 58 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_11,negated_conjecture,
app(app(sk5,cons(sk7,nil)),sk6) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_10,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_17,negated_conjecture,
~ neq(sk1,nil),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_19,negated_conjecture,
app(app(sk5,cons(sk7,nil)),sk6) = sk3,
co1_11 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
~ neq(sk1,nil),
c_0_17 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_26,negated_conjecture,
app(app(sk5,cons(sk7,nil)),sk6) = sk1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
app(app(sk5,cons(sk7,nil)),sk6) = nil,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(app(sk5,cons(sk7,nil)))
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
ssItem(sk7),
co1_10 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_40,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_41,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_24])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
app(sk5,nil) = sk4,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_45,negated_conjecture,
sk5 = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_34])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
app(app(sk4,cons(sk7,nil)),nil) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_41]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(app(sk4,cons(sk7,nil)))
| app(sk4,cons(sk7,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_24])]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| app(sk4,cons(sk7,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_33]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_50]),c_0_49])]) ).
cnf(c_0_52,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_38]),c_0_24])]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| app(nil,cons(sk7,nil)) = nil ),
inference(rw,[status(thm)],[c_0_50,c_0_52]) ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| cons(sk7,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_53]),c_0_24])]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
cons(sk7,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_37]),c_0_38]),c_0_24])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_38]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC218-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:06:18 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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.16/0.51 % Version: 3.5.1
% 0.16/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 % Starting sh5l with 300s (1) cores
% 0.16/0.51 % new_bool_3 with pid 2447774 completed with status 0
% 0.16/0.51 % Result found by new_bool_3
% 0.16/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.51 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.16/0.51 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.16/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.51 % SubtermCWHack with pid 2447777 completed with status 0
% 0.16/0.51 % Result found by SubtermCWHack
% 0.16/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.51 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.16/0.51 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.16/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.51 % Preprocessing time : 0.003 s
% 0.16/0.51
% 0.16/0.51 % Proof found!
% 0.16/0.51 % SZS status Unsatisfiable
% 0.16/0.51 % SZS output start CNFRefutation
% See solution above
% 0.16/0.51 % Parsed axioms : 197
% 0.16/0.51 % Removed by relevancy pruning/SinE : 164
% 0.16/0.51 % Initial clauses : 33
% 0.16/0.51 % Removed in clause preprocessing : 0
% 0.16/0.51 % Initial clauses in saturation : 33
% 0.16/0.51 % Processed clauses : 63
% 0.16/0.51 % ...of these trivial : 1
% 0.16/0.51 % ...subsumed : 4
% 0.16/0.51 % ...remaining for further processing : 58
% 0.16/0.51 % Other redundant clauses eliminated : 6
% 0.16/0.51 % Clauses deleted for lack of memory : 0
% 0.16/0.51 % Backward-subsumed : 4
% 0.16/0.51 % Backward-rewritten : 23
% 0.16/0.51 % Generated clauses : 84
% 0.16/0.51 % ...of the previous two non-redundant : 62
% 0.16/0.51 % ...aggressively subsumed : 0
% 0.16/0.51 % Contextual simplify-reflections : 0
% 0.16/0.51 % Paramodulations : 78
% 0.16/0.51 % Factorizations : 0
% 0.16/0.51 % NegExts : 0
% 0.16/0.51 % Equation resolutions : 7
% 0.16/0.51 % Disequality decompositions : 0
% 0.16/0.51 % Total rewrite steps : 127
% 0.16/0.51 % ...of those cached : 111
% 0.16/0.51 % Propositional unsat checks : 0
% 0.16/0.51 % Propositional check models : 0
% 0.16/0.51 % Propositional check unsatisfiable : 0
% 0.16/0.51 % Propositional clauses : 0
% 0.16/0.51 % Propositional clauses after purity: 0
% 0.16/0.51 % Propositional unsat core size : 0
% 0.16/0.51 % Propositional preprocessing time : 0.000
% 0.16/0.51 % Propositional encoding time : 0.000
% 0.16/0.51 % Propositional solver time : 0.000
% 0.16/0.51 % Success case prop preproc time : 0.000
% 0.16/0.51 % Success case prop encoding time : 0.000
% 0.16/0.51 % Success case prop solver time : 0.000
% 0.16/0.51 % Current number of processed clauses : 28
% 0.16/0.51 % Positive orientable unit clauses : 12
% 0.16/0.51 % Positive unorientable unit clauses: 0
% 0.16/0.51 % Negative unit clauses : 1
% 0.16/0.51 % Non-unit-clauses : 15
% 0.16/0.51 % Current number of unprocessed clauses: 26
% 0.16/0.51 % ...number of literals in the above : 99
% 0.16/0.51 % Current number of archived formulas : 0
% 0.16/0.51 % Current number of archived clauses : 27
% 0.16/0.51 % Clause-clause subsumption calls (NU) : 55
% 0.16/0.51 % Rec. Clause-clause subsumption calls : 40
% 0.16/0.51 % Non-unit clause-clause subsumptions : 4
% 0.16/0.51 % Unit Clause-clause subsumption calls : 4
% 0.16/0.51 % Rewrite failures with RHS unbound : 0
% 0.16/0.51 % BW rewrite match attempts : 9
% 0.16/0.51 % BW rewrite match successes : 9
% 0.16/0.51 % Condensation attempts : 0
% 0.16/0.51 % Condensation successes : 0
% 0.16/0.51 % Termbank termtop insertions : 3827
% 0.16/0.51 % Search garbage collected termcells : 918
% 0.16/0.51
% 0.16/0.51 % -------------------------------------------------
% 0.16/0.51 % User time : 0.009 s
% 0.16/0.51 % System time : 0.006 s
% 0.16/0.51 % Total time : 0.015 s
% 0.16/0.51 % Maximum resident set size: 3808 pages
% 0.16/0.51
% 0.16/0.51 % -------------------------------------------------
% 0.16/0.51 % User time : 0.017 s
% 0.16/0.51 % System time : 0.012 s
% 0.16/0.51 % Total time : 0.029 s
% 0.16/0.51 % Maximum resident set size: 4864 pages
% 0.16/0.51 % E exiting
%------------------------------------------------------------------------------