%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC014-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 : n001.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:42:37 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.45s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 60 ( 22 unt; 4 nHn; 60 RR)
% Number of literals : 134 ( 53 equ; 79 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_15,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| app(sk1,X2) != X1
| tl(sk2) != X2
| ~ ssList(X2)
| sk2 != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_19 ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
c_0_20 ).
cnf(c_0_30,negated_conjecture,
cons(sk5,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_23]),c_0_24])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
app(sk1,sk6) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_23]),c_0_23]),c_0_24])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_23]),c_0_24])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_33])]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_42,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| app(sk1,X2) != X1
| tl(sk2) != X2
| ~ ssList(X2)
| sk2 != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
cons(sk5,sk6) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_39]),c_0_36])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_40 ).
cnf(c_0_47,axiom,
ssList(nil),
clause8 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_41 ).
cnf(c_0_49,negated_conjecture,
( sk2 != nil
| app(sk1,nil) = sk2 ),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| app(sk1,X2) != X1
| tl(sk2) != X2
| ~ ssList(X2)
| sk2 != X1
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_51,negated_conjecture,
tl(sk2) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_36])]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_54,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_30]),c_0_33]),c_0_47])]) ).
cnf(c_0_55,negated_conjecture,
( sk2 != nil
| sk1 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37])]) ).
cnf(c_0_56,negated_conjecture,
~ neq(nil,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_23]),c_0_24])])])]),c_0_35]),c_0_36]),c_0_35]),c_0_52])]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_53 ).
cnf(c_0_58,negated_conjecture,
sk2 != nil,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_47]),c_0_52])]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC014-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 07:54:44 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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.09/0.45 % Version: 3.5.1
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % Starting sh5l with 300s (1) cores
% 0.09/0.45 % new_bool_3 with pid 2605368 completed with status 0
% 0.09/0.45 % Result found by new_bool_3
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.09/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.45 % SubtermCWHack with pid 2605372 completed with status 0
% 0.09/0.45 % Result found by SubtermCWHack
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.09/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.45 % Preprocessing time : 0.002 s
% 0.09/0.45
% 0.09/0.45 % Proof found!
% 0.09/0.45 % SZS status Unsatisfiable
% 0.09/0.45 % SZS output start CNFRefutation
% See solution above
% 0.09/0.45 % Parsed axioms : 203
% 0.09/0.45 % Removed by relevancy pruning/SinE : 129
% 0.09/0.45 % Initial clauses : 74
% 0.09/0.45 % Removed in clause preprocessing : 0
% 0.09/0.45 % Initial clauses in saturation : 74
% 0.09/0.45 % Processed clauses : 155
% 0.09/0.45 % ...of these trivial : 8
% 0.09/0.45 % ...subsumed : 47
% 0.09/0.45 % ...remaining for further processing : 100
% 0.09/0.45 % Other redundant clauses eliminated : 21
% 0.09/0.45 % Clauses deleted for lack of memory : 0
% 0.09/0.45 % Backward-subsumed : 3
% 0.09/0.45 % Backward-rewritten : 2
% 0.09/0.45 % Generated clauses : 260
% 0.09/0.45 % ...of the previous two non-redundant : 166
% 0.09/0.45 % ...aggressively subsumed : 0
% 0.09/0.45 % Contextual simplify-reflections : 0
% 0.09/0.45 % Paramodulations : 236
% 0.09/0.45 % Factorizations : 0
% 0.09/0.45 % NegExts : 0
% 0.09/0.45 % Equation resolutions : 26
% 0.09/0.45 % Disequality decompositions : 0
% 0.09/0.45 % Total rewrite steps : 329
% 0.09/0.45 % ...of those cached : 312
% 0.09/0.45 % Propositional unsat checks : 0
% 0.09/0.45 % Propositional check models : 0
% 0.09/0.45 % Propositional check unsatisfiable : 0
% 0.09/0.45 % Propositional clauses : 0
% 0.09/0.45 % Propositional clauses after purity: 0
% 0.09/0.45 % Propositional unsat core size : 0
% 0.09/0.45 % Propositional preprocessing time : 0.000
% 0.09/0.45 % Propositional encoding time : 0.000
% 0.09/0.45 % Propositional solver time : 0.000
% 0.09/0.45 % Success case prop preproc time : 0.000
% 0.09/0.45 % Success case prop encoding time : 0.000
% 0.09/0.45 % Success case prop solver time : 0.000
% 0.09/0.45 % Current number of processed clauses : 88
% 0.09/0.45 % Positive orientable unit clauses : 22
% 0.09/0.45 % Positive unorientable unit clauses: 0
% 0.09/0.45 % Negative unit clauses : 4
% 0.09/0.45 % Non-unit-clauses : 62
% 0.09/0.45 % Current number of unprocessed clauses: 79
% 0.09/0.45 % ...number of literals in the above : 429
% 0.09/0.45 % Current number of archived formulas : 0
% 0.09/0.45 % Current number of archived clauses : 5
% 0.09/0.45 % Clause-clause subsumption calls (NU) : 527
% 0.09/0.45 % Rec. Clause-clause subsumption calls : 242
% 0.09/0.45 % Non-unit clause-clause subsumptions : 31
% 0.09/0.45 % Unit Clause-clause subsumption calls : 64
% 0.09/0.45 % Rewrite failures with RHS unbound : 0
% 0.09/0.45 % BW rewrite match attempts : 2
% 0.09/0.45 % BW rewrite match successes : 2
% 0.09/0.45 % Condensation attempts : 0
% 0.09/0.45 % Condensation successes : 0
% 0.09/0.45 % Termbank termtop insertions : 7953
% 0.09/0.45 % Search garbage collected termcells : 867
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.013 s
% 0.09/0.45 % System time : 0.002 s
% 0.09/0.45 % Total time : 0.015 s
% 0.09/0.45 % Maximum resident set size: 4072 pages
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.018 s
% 0.09/0.45 % System time : 0.007 s
% 0.09/0.45 % Total time : 0.024 s
% 0.09/0.45 % Maximum resident set size: 5120 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------