%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC004-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 : n013.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:34 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.55s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 15 unt; 4 nHn; 46 RR)
% Number of literals : 108 ( 28 equ; 66 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_19,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
c_0_15 ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_20]),c_0_20]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_21])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_20]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_20]),c_0_21])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(cons(sk5,nil),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_32 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_33 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_37 ).
cnf(c_0_42,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_20]),c_0_21])]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
cons(sk5,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_36])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_42]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC004-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n013.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 07:47:50 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.25/0.55 % Version: 3.5.1
% 0.25/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.55 % Starting sh5l with 300s (1) cores
% 0.25/0.55 % new_bool_3 with pid 296807 completed with status 0
% 0.25/0.55 % Result found by new_bool_3
% 0.25/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.55 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.25/0.55 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.25/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.55 % SubtermCWHack with pid 296810 completed with status 0
% 0.25/0.55 % Result found by SubtermCWHack
% 0.25/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.55 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.25/0.55 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.25/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.55 % Preprocessing time : 0.001 s
% 0.25/0.55
% 0.25/0.55 % Proof found!
% 0.25/0.55 % SZS status Unsatisfiable
% 0.25/0.55 % SZS output start CNFRefutation
% See solution above
% 0.25/0.55 % Parsed axioms : 205
% 0.25/0.55 % Removed by relevancy pruning/SinE : 164
% 0.25/0.55 % Initial clauses : 41
% 0.25/0.55 % Removed in clause preprocessing : 0
% 0.25/0.55 % Initial clauses in saturation : 41
% 0.25/0.55 % Processed clauses : 137
% 0.25/0.55 % ...of these trivial : 7
% 0.25/0.55 % ...subsumed : 56
% 0.25/0.55 % ...remaining for further processing : 74
% 0.25/0.55 % Other redundant clauses eliminated : 9
% 0.25/0.55 % Clauses deleted for lack of memory : 0
% 0.25/0.55 % Backward-subsumed : 4
% 0.25/0.55 % Backward-rewritten : 6
% 0.25/0.55 % Generated clauses : 303
% 0.25/0.55 % ...of the previous two non-redundant : 248
% 0.25/0.55 % ...aggressively subsumed : 0
% 0.25/0.55 % Contextual simplify-reflections : 0
% 0.25/0.55 % Paramodulations : 291
% 0.25/0.55 % Factorizations : 0
% 0.25/0.55 % NegExts : 0
% 0.25/0.55 % Equation resolutions : 13
% 0.25/0.55 % Disequality decompositions : 0
% 0.25/0.55 % Total rewrite steps : 298
% 0.25/0.55 % ...of those cached : 286
% 0.25/0.55 % Propositional unsat checks : 0
% 0.25/0.55 % Propositional check models : 0
% 0.25/0.55 % Propositional check unsatisfiable : 0
% 0.25/0.55 % Propositional clauses : 0
% 0.25/0.55 % Propositional clauses after purity: 0
% 0.25/0.55 % Propositional unsat core size : 0
% 0.25/0.55 % Propositional preprocessing time : 0.000
% 0.25/0.55 % Propositional encoding time : 0.000
% 0.25/0.55 % Propositional solver time : 0.000
% 0.25/0.55 % Success case prop preproc time : 0.000
% 0.25/0.55 % Success case prop encoding time : 0.000
% 0.25/0.55 % Success case prop solver time : 0.000
% 0.25/0.55 % Current number of processed clauses : 61
% 0.25/0.55 % Positive orientable unit clauses : 13
% 0.25/0.55 % Positive unorientable unit clauses: 0
% 0.25/0.55 % Negative unit clauses : 0
% 0.25/0.55 % Non-unit-clauses : 48
% 0.25/0.55 % Current number of unprocessed clauses: 149
% 0.25/0.55 % ...number of literals in the above : 678
% 0.25/0.55 % Current number of archived formulas : 0
% 0.25/0.55 % Current number of archived clauses : 10
% 0.25/0.55 % Clause-clause subsumption calls (NU) : 363
% 0.25/0.55 % Rec. Clause-clause subsumption calls : 285
% 0.25/0.55 % Non-unit clause-clause subsumptions : 60
% 0.25/0.55 % Unit Clause-clause subsumption calls : 2
% 0.25/0.55 % Rewrite failures with RHS unbound : 0
% 0.25/0.55 % BW rewrite match attempts : 3
% 0.25/0.55 % BW rewrite match successes : 3
% 0.25/0.55 % Condensation attempts : 0
% 0.25/0.55 % Condensation successes : 0
% 0.25/0.55 % Termbank termtop insertions : 7331
% 0.25/0.55 % Search garbage collected termcells : 941
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.013 s
% 0.25/0.55 % System time : 0.003 s
% 0.25/0.55 % Total time : 0.015 s
% 0.25/0.55 % Maximum resident set size: 4072 pages
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.017 s
% 0.25/0.55 % System time : 0.007 s
% 0.25/0.55 % Total time : 0.024 s
% 0.25/0.55 % Maximum resident set size: 4864 pages
% 0.25/0.55 % E exiting
%------------------------------------------------------------------------------