%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC003-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 : n014.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.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 16 unt; 4 nHn; 47 RR)
% Number of literals : 109 ( 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_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,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/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_21,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
cnf(co1_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
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(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,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_16]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_21,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_14 ).
cnf(c_0_22,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
c_0_19 ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_22])]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_35,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_28,c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_33 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_34 ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_22])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_40 ).
cnf(c_0_45,negated_conjecture,
cons(sk5,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_37])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_43]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 07:48:19 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.22/0.58 % Version: 3.5.1
% 0.22/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 % Starting sh5l with 300s (1) cores
% 0.22/0.58 % sh5l with pid 3563496 completed with status 0
% 0.22/0.58 % Result found by sh5l
% 0.22/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 % Starting sh5l with 300s (1) cores
% 0.22/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.58 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.58 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.58 % SubtermCWHack with pid 3563502 completed with status 0
% 0.22/0.58 % Result found by SubtermCWHack
% 0.22/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.58 % Starting sh5l with 300s (1) cores
% 0.22/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.58 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.58 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.58 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.58 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.58 % Preprocessing time : 0.002 s
% 0.22/0.58
% 0.22/0.58 % Proof found!
% 0.22/0.58 % SZS status Unsatisfiable
% 0.22/0.58 % SZS output start CNFRefutation
% See solution above
% 0.22/0.58 % Parsed axioms : 207
% 0.22/0.58 % Removed by relevancy pruning/SinE : 57
% 0.22/0.58 % Initial clauses : 150
% 0.22/0.58 % Removed in clause preprocessing : 0
% 0.22/0.58 % Initial clauses in saturation : 150
% 0.22/0.58 % Processed clauses : 410
% 0.22/0.58 % ...of these trivial : 11
% 0.22/0.58 % ...subsumed : 128
% 0.22/0.58 % ...remaining for further processing : 271
% 0.22/0.58 % Other redundant clauses eliminated : 23
% 0.22/0.58 % Clauses deleted for lack of memory : 0
% 0.22/0.58 % Backward-subsumed : 8
% 0.22/0.58 % Backward-rewritten : 12
% 0.22/0.58 % Generated clauses : 1023
% 0.22/0.58 % ...of the previous two non-redundant : 803
% 0.22/0.58 % ...aggressively subsumed : 0
% 0.22/0.58 % Contextual simplify-reflections : 16
% 0.22/0.58 % Paramodulations : 996
% 0.22/0.58 % Factorizations : 0
% 0.22/0.58 % NegExts : 0
% 0.22/0.58 % Equation resolutions : 28
% 0.22/0.58 % Disequality decompositions : 0
% 0.22/0.58 % Total rewrite steps : 897
% 0.22/0.58 % ...of those cached : 872
% 0.22/0.58 % Propositional unsat checks : 0
% 0.22/0.58 % Propositional check models : 0
% 0.22/0.58 % Propositional check unsatisfiable : 0
% 0.22/0.58 % Propositional clauses : 0
% 0.22/0.58 % Propositional clauses after purity: 0
% 0.22/0.58 % Propositional unsat core size : 0
% 0.22/0.58 % Propositional preprocessing time : 0.000
% 0.22/0.58 % Propositional encoding time : 0.000
% 0.22/0.58 % Propositional solver time : 0.000
% 0.22/0.58 % Success case prop preproc time : 0.000
% 0.22/0.58 % Success case prop encoding time : 0.000
% 0.22/0.58 % Success case prop solver time : 0.000
% 0.22/0.58 % Current number of processed clauses : 240
% 0.22/0.58 % Positive orientable unit clauses : 46
% 0.22/0.58 % Positive unorientable unit clauses: 0
% 0.22/0.58 % Negative unit clauses : 0
% 0.22/0.58 % Non-unit-clauses : 194
% 0.22/0.58 % Current number of unprocessed clauses: 529
% 0.22/0.58 % ...number of literals in the above : 2828
% 0.22/0.58 % Current number of archived formulas : 0
% 0.22/0.58 % Current number of archived clauses : 20
% 0.22/0.58 % Clause-clause subsumption calls (NU) : 4981
% 0.22/0.58 % Rec. Clause-clause subsumption calls : 2344
% 0.22/0.58 % Non-unit clause-clause subsumptions : 152
% 0.22/0.58 % Unit Clause-clause subsumption calls : 46
% 0.22/0.58 % Rewrite failures with RHS unbound : 0
% 0.22/0.58 % BW rewrite match attempts : 3
% 0.22/0.58 % BW rewrite match successes : 3
% 0.22/0.58 % Condensation attempts : 0
% 0.22/0.58 % Condensation successes : 0
% 0.22/0.58 % Termbank termtop insertions : 23692
% 0.22/0.58 % Search garbage collected termcells : 695
% 0.22/0.58
% 0.22/0.58 % -------------------------------------------------
% 0.22/0.58 % User time : 0.031 s
% 0.22/0.58 % System time : 0.004 s
% 0.22/0.58 % Total time : 0.035 s
% 0.22/0.58 % Maximum resident set size: 4072 pages
% 0.22/0.58
% 0.22/0.58 % -------------------------------------------------
% 0.22/0.58 % User time : 0.035 s
% 0.22/0.58 % System time : 0.008 s
% 0.22/0.58 % Total time : 0.044 s
% 0.22/0.58 % Maximum resident set size: 5120 pages
% 0.22/0.58 % E exiting
%------------------------------------------------------------------------------