%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC309-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 : n003.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:53 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 14 unt; 9 nHn; 40 RR)
% Number of literals : 99 ( 39 equ; 59 neg)
% Maximal clause size : 4 ( 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; 5 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
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(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_12,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_13,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_14,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != sk4 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_18 ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk4 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_25 ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_30,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_28 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_35,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC309-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.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:16:31 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.48 % Version: 3.5.1
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % sh5l with pid 3832636 completed with status 0
% 0.12/0.48 % Result found by sh5l
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.48 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.48 % SubtermCWHack with pid 3832644 completed with status 0
% 0.12/0.48 % Result found by SubtermCWHack
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.48 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.48 % Preprocessing time : 0.003 s
% 0.12/0.48
% 0.12/0.48 % Proof found!
% 0.12/0.48 % SZS status Unsatisfiable
% 0.12/0.48 % SZS output start CNFRefutation
% See solution above
% 0.12/0.48 % Parsed axioms : 195
% 0.12/0.48 % Removed by relevancy pruning/SinE : 30
% 0.12/0.48 % Initial clauses : 165
% 0.12/0.48 % Removed in clause preprocessing : 0
% 0.12/0.48 % Initial clauses in saturation : 165
% 0.12/0.48 % Processed clauses : 360
% 0.12/0.48 % ...of these trivial : 0
% 0.12/0.48 % ...subsumed : 131
% 0.12/0.48 % ...remaining for further processing : 229
% 0.12/0.48 % Other redundant clauses eliminated : 33
% 0.12/0.48 % Clauses deleted for lack of memory : 0
% 0.12/0.48 % Backward-subsumed : 4
% 0.12/0.48 % Backward-rewritten : 9
% 0.12/0.48 % Generated clauses : 659
% 0.12/0.48 % ...of the previous two non-redundant : 522
% 0.12/0.48 % ...aggressively subsumed : 0
% 0.12/0.48 % Contextual simplify-reflections : 15
% 0.12/0.48 % Paramodulations : 622
% 0.12/0.48 % Factorizations : 0
% 0.12/0.48 % NegExts : 0
% 0.12/0.48 % Equation resolutions : 38
% 0.12/0.48 % Disequality decompositions : 0
% 0.12/0.48 % Total rewrite steps : 433
% 0.12/0.48 % ...of those cached : 404
% 0.12/0.48 % Propositional unsat checks : 0
% 0.12/0.48 % Propositional check models : 0
% 0.12/0.48 % Propositional check unsatisfiable : 0
% 0.12/0.48 % Propositional clauses : 0
% 0.12/0.48 % Propositional clauses after purity: 0
% 0.12/0.48 % Propositional unsat core size : 0
% 0.12/0.48 % Propositional preprocessing time : 0.000
% 0.12/0.48 % Propositional encoding time : 0.000
% 0.12/0.48 % Propositional solver time : 0.000
% 0.12/0.48 % Success case prop preproc time : 0.000
% 0.12/0.48 % Success case prop encoding time : 0.000
% 0.12/0.48 % Success case prop solver time : 0.000
% 0.12/0.48 % Current number of processed clauses : 201
% 0.12/0.48 % Positive orientable unit clauses : 45
% 0.12/0.48 % Positive unorientable unit clauses: 0
% 0.12/0.48 % Negative unit clauses : 0
% 0.12/0.48 % Non-unit-clauses : 156
% 0.12/0.48 % Current number of unprocessed clauses: 327
% 0.12/0.48 % ...number of literals in the above : 1917
% 0.12/0.48 % Current number of archived formulas : 0
% 0.12/0.48 % Current number of archived clauses : 13
% 0.12/0.48 % Clause-clause subsumption calls (NU) : 7023
% 0.12/0.48 % Rec. Clause-clause subsumption calls : 2461
% 0.12/0.48 % Non-unit clause-clause subsumptions : 150
% 0.12/0.48 % Unit Clause-clause subsumption calls : 68
% 0.12/0.48 % Rewrite failures with RHS unbound : 0
% 0.12/0.48 % BW rewrite match attempts : 3
% 0.12/0.48 % BW rewrite match successes : 3
% 0.12/0.48 % Condensation attempts : 0
% 0.12/0.48 % Condensation successes : 0
% 0.12/0.48 % Termbank termtop insertions : 18329
% 0.12/0.48 % Search garbage collected termcells : 617
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.028 s
% 0.12/0.48 % System time : 0.005 s
% 0.12/0.48 % Total time : 0.033 s
% 0.12/0.48 % Maximum resident set size: 4320 pages
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.033 s
% 0.12/0.48 % System time : 0.008 s
% 0.12/0.48 % Total time : 0.042 s
% 0.12/0.48 % Maximum resident set size: 5120 pages
% 0.12/0.48 % E exiting
%------------------------------------------------------------------------------