%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC320-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 : n002.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:55 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 52 ( 12 unt; 5 nHn; 52 RR)
% Number of literals : 109 ( 54 equ; 58 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_13,negated_conjecture,
( app(X2,cons(X1,nil)) != sk2
| app(cons(X1,nil),X2) != sk1
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
c_0_12 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_18,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk1 ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,sk6) = sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sk1 != nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
( sk1 != nil
| cons(sk5,sk6) = sk1 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( sk1 != nil
| ssList(sk6) ),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( sk1 != nil
| ssItem(sk5) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
co1_12 ).
cnf(c_0_35,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( app(X2,cons(X1,nil)) != sk2
| app(cons(X1,nil),X2) != sk1
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_39,negated_conjecture,
( neq(sk4,nil)
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_24]),c_0_24]) ).
cnf(c_0_40,negated_conjecture,
sk4 != nil,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( app(X2,cons(X1,nil)) != sk2
| app(cons(X1,nil),X2) != sk1
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
c_0_37 ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( ssItem(sk5)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( ssList(sk6)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk1
| app(X1,cons(X2,nil)) != sk4 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_24]),c_0_24]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_43])]) ).
cnf(c_0_49,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_44,c_0_40]) ).
cnf(c_0_50,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_51,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_46,c_0_47]),c_0_48]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC320-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n002.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 08:18:04 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % new_bool_3 with pid 2849154 completed with status 0
% 0.24/0.62 % Result found by new_bool_3
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % SubtermCWHack with pid 2849157 completed with status 0
% 0.24/0.62 % Result found by SubtermCWHack
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % Preprocessing time : 0.003 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Unsatisfiable
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 200
% 0.24/0.62 % Removed by relevancy pruning/SinE : 164
% 0.24/0.62 % Initial clauses : 36
% 0.24/0.62 % Removed in clause preprocessing : 0
% 0.24/0.62 % Initial clauses in saturation : 36
% 0.24/0.62 % Processed clauses : 110
% 0.24/0.62 % ...of these trivial : 1
% 0.24/0.62 % ...subsumed : 30
% 0.24/0.62 % ...remaining for further processing : 79
% 0.24/0.62 % Other redundant clauses eliminated : 8
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 11
% 0.24/0.62 % Backward-rewritten : 7
% 0.24/0.62 % Generated clauses : 235
% 0.24/0.62 % ...of the previous two non-redundant : 177
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 4
% 0.24/0.62 % Paramodulations : 222
% 0.24/0.62 % Factorizations : 0
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 10
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 215
% 0.24/0.62 % ...of those cached : 203
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 54
% 0.24/0.62 % Positive orientable unit clauses : 13
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 4
% 0.24/0.62 % Non-unit-clauses : 37
% 0.24/0.62 % Current number of unprocessed clauses: 93
% 0.24/0.62 % ...number of literals in the above : 441
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 22
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 244
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 164
% 0.24/0.62 % Non-unit clause-clause subsumptions : 28
% 0.24/0.62 % Unit Clause-clause subsumption calls : 22
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 5
% 0.24/0.62 % BW rewrite match successes : 5
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 6459
% 0.24/0.62 % Search garbage collected termcells : 940
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.014 s
% 0.24/0.62 % System time : 0.006 s
% 0.24/0.62 % Total time : 0.020 s
% 0.24/0.62 % Maximum resident set size: 3812 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.022 s
% 0.24/0.62 % System time : 0.013 s
% 0.24/0.62 % Total time : 0.035 s
% 0.24/0.62 % Maximum resident set size: 4864 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------