%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC313-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 : 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:45:49 PM UTC 2026
% Result : Unsatisfiable 0.67s 0.63s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 12 unt; 9 nHn; 46 RR)
% Number of literals : 120 ( 58 equ; 69 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; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,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_7) ).
cnf(co1_10,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
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(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_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_11,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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_7]) ).
cnf(c_0_14,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_15,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk2
| app(X1,cons(X2,nil)) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[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) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != sk2
| sk2 = nil ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_20 ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk2
| sk2 = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_28,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]),c_0_26])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_27 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_32,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_28 ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(hd(sk2))
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_36,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_37,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_16]),c_0_17]) ).
cnf(c_0_38,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38]),c_0_41])]) ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC313-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n001.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:20:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.67/0.63 % Version: 3.5.1
% 0.67/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.67/0.63 % Starting sh5l with 300s (1) cores
% 0.67/0.63 % sh5l with pid 2656753 completed with status 0
% 0.67/0.63 % Result found by sh5l
% 0.67/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.67/0.63 % Starting sh5l with 300s (1) cores
% 0.67/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.67/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.67/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.67/0.63 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.67/0.63 % SubtermCWHack with pid 2656756 completed with status 0
% 0.67/0.63 % Result found by SubtermCWHack
% 0.67/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.67/0.63 % Starting sh5l with 300s (1) cores
% 0.67/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.67/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.67/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.67/0.63 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.67/0.63 % Preprocessing time : 0.003 s
% 0.67/0.63
% 0.67/0.63 % Proof found!
% 0.67/0.63 % SZS status Unsatisfiable
% 0.67/0.63 % SZS output start CNFRefutation
% See solution above
% 0.67/0.63 % Parsed axioms : 197
% 0.67/0.63 % Removed by relevancy pruning/SinE : 30
% 0.67/0.63 % Initial clauses : 167
% 0.67/0.63 % Removed in clause preprocessing : 0
% 0.67/0.63 % Initial clauses in saturation : 167
% 0.67/0.63 % Processed clauses : 365
% 0.67/0.63 % ...of these trivial : 0
% 0.67/0.63 % ...subsumed : 131
% 0.67/0.63 % ...remaining for further processing : 234
% 0.67/0.63 % Other redundant clauses eliminated : 34
% 0.67/0.63 % Clauses deleted for lack of memory : 0
% 0.67/0.63 % Backward-subsumed : 3
% 0.67/0.63 % Backward-rewritten : 13
% 0.67/0.63 % Generated clauses : 665
% 0.67/0.63 % ...of the previous two non-redundant : 527
% 0.67/0.63 % ...aggressively subsumed : 0
% 0.67/0.63 % Contextual simplify-reflections : 15
% 0.67/0.63 % Paramodulations : 627
% 0.67/0.63 % Factorizations : 0
% 0.67/0.63 % NegExts : 0
% 0.67/0.63 % Equation resolutions : 39
% 0.67/0.63 % Disequality decompositions : 0
% 0.67/0.63 % Total rewrite steps : 449
% 0.67/0.63 % ...of those cached : 418
% 0.67/0.63 % Propositional unsat checks : 0
% 0.67/0.63 % Propositional check models : 0
% 0.67/0.63 % Propositional check unsatisfiable : 0
% 0.67/0.63 % Propositional clauses : 0
% 0.67/0.63 % Propositional clauses after purity: 0
% 0.67/0.63 % Propositional unsat core size : 0
% 0.67/0.63 % Propositional preprocessing time : 0.000
% 0.67/0.63 % Propositional encoding time : 0.000
% 0.67/0.63 % Propositional solver time : 0.000
% 0.67/0.63 % Success case prop preproc time : 0.000
% 0.67/0.63 % Success case prop encoding time : 0.000
% 0.67/0.63 % Success case prop solver time : 0.000
% 0.67/0.63 % Current number of processed clauses : 203
% 0.67/0.63 % Positive orientable unit clauses : 46
% 0.67/0.63 % Positive unorientable unit clauses: 0
% 0.67/0.63 % Negative unit clauses : 0
% 0.67/0.63 % Non-unit-clauses : 157
% 0.67/0.63 % Current number of unprocessed clauses: 329
% 0.67/0.63 % ...number of literals in the above : 1945
% 0.67/0.63 % Current number of archived formulas : 0
% 0.67/0.63 % Current number of archived clauses : 16
% 0.67/0.63 % Clause-clause subsumption calls (NU) : 7182
% 0.67/0.63 % Rec. Clause-clause subsumption calls : 2504
% 0.67/0.63 % Non-unit clause-clause subsumptions : 149
% 0.67/0.63 % Unit Clause-clause subsumption calls : 199
% 0.67/0.63 % Rewrite failures with RHS unbound : 0
% 0.67/0.63 % BW rewrite match attempts : 4
% 0.67/0.63 % BW rewrite match successes : 4
% 0.67/0.63 % Condensation attempts : 0
% 0.67/0.63 % Condensation successes : 0
% 0.67/0.63 % Termbank termtop insertions : 18586
% 0.67/0.63 % Search garbage collected termcells : 625
% 0.67/0.63
% 0.67/0.63 % -------------------------------------------------
% 0.67/0.63 % User time : 0.030 s
% 0.67/0.63 % System time : 0.008 s
% 0.67/0.63 % Total time : 0.038 s
% 0.67/0.63 % Maximum resident set size: 4068 pages
% 0.67/0.63
% 0.67/0.63 % -------------------------------------------------
% 0.67/0.63 % User time : 0.038 s
% 0.67/0.63 % System time : 0.015 s
% 0.67/0.63 % Total time : 0.053 s
% 0.67/0.63 % Maximum resident set size: 5120 pages
% 0.67/0.63 % E exiting
%------------------------------------------------------------------------------