%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC308-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 : n017.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:48 PM UTC 2026
% Result : Unsatisfiable 0.77s 0.71s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 13 unt; 12 nHn; 55 RR)
% Number of literals : 183 ( 69 equ; 125 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 4 ( 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 : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
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(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(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(c_0_15,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(nil,sk2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk2) != X4
| tl(sk2) != X2
| sk1 != X1 ),
inference(cn,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_17 ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssItem(hd(sk2))
| ~ neq(nil,sk2)
| app(tl(sk2),cons(hd(sk2),nil)) != sk3 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])])])])]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_21 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssItem(hd(sk2))
| app(tl(sk2),cons(hd(sk2),nil)) != sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_26 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_30,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_31,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| app(tl(sk2),cons(hd(sk2),nil)) != sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_29 ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_34,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(cons(hd(sk2),nil))
| app(tl(sk2),cons(hd(sk2),nil)) != sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk2
| app(X1,cons(X2,nil)) = sk3 ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_36 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(hd(sk2))
| app(tl(sk2),cons(hd(sk2),nil)) != sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != sk2
| app(X1,cons(X2,nil)) = sk3 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_28]),c_0_25])]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssItem(hd(sk2))
| sk2 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44])]),c_0_25])]),c_0_45]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(tl(sk2))
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_28]),c_0_25])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_47 ).
cnf(c_0_50,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_51,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_25])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC308-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.17/0.44 % Computer : n017.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 08:09:26 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.52 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.77/0.71 % Version: 3.5.1
% 0.77/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.77/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.77/0.71 % Starting sh5l with 300s (1) cores
% 0.77/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1862719 completed with status 0
% 0.77/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.77/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.77/0.71 % No SInE strategy applied
% 0.77/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.77/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.77/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.77/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.77/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.77/0.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.77/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1862724 completed with status 0
% 0.77/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.77/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.77/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.77/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.77/0.71 % No SInE strategy applied
% 0.77/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.77/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.77/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.77/0.71 % Preprocessing time : 0.005 s
% 0.77/0.71 % Presaturation interreduction done
% 0.77/0.71
% 0.77/0.71 % Proof found!
% 0.77/0.71 % SZS status Unsatisfiable
% 0.77/0.71 % SZS output start CNFRefutation
% See solution above
% 0.77/0.71 % Parsed axioms : 195
% 0.77/0.71 % Removed by relevancy pruning/SinE : 0
% 0.77/0.71 % Initial clauses : 195
% 0.77/0.71 % Removed in clause preprocessing : 0
% 0.77/0.71 % Initial clauses in saturation : 195
% 0.77/0.71 % Processed clauses : 683
% 0.77/0.71 % ...of these trivial : 3
% 0.77/0.71 % ...subsumed : 184
% 0.77/0.71 % ...remaining for further processing : 496
% 0.77/0.71 % Other redundant clauses eliminated : 123
% 0.77/0.71 % Clauses deleted for lack of memory : 0
% 0.77/0.71 % Backward-subsumed : 16
% 0.77/0.71 % Backward-rewritten : 21
% 0.77/0.71 % Generated clauses : 1548
% 0.77/0.71 % ...of the previous two non-redundant : 1312
% 0.77/0.71 % ...aggressively subsumed : 0
% 0.77/0.71 % Contextual simplify-reflections : 23
% 0.77/0.71 % Paramodulations : 1424
% 0.77/0.71 % Factorizations : 0
% 0.77/0.71 % NegExts : 0
% 0.77/0.71 % Equation resolutions : 128
% 0.77/0.71 % Disequality decompositions : 0
% 0.77/0.71 % Total rewrite steps : 1334
% 0.77/0.71 % ...of those cached : 1242
% 0.77/0.71 % Propositional unsat checks : 0
% 0.77/0.71 % Propositional check models : 0
% 0.77/0.71 % Propositional check unsatisfiable : 0
% 0.77/0.71 % Propositional clauses : 0
% 0.77/0.71 % Propositional clauses after purity: 0
% 0.77/0.71 % Propositional unsat core size : 0
% 0.77/0.71 % Propositional preprocessing time : 0.000
% 0.77/0.71 % Propositional encoding time : 0.000
% 0.77/0.71 % Propositional solver time : 0.000
% 0.77/0.71 % Success case prop preproc time : 0.000
% 0.77/0.71 % Success case prop encoding time : 0.000
% 0.77/0.71 % Success case prop solver time : 0.000
% 0.77/0.71 % Current number of processed clauses : 248
% 0.77/0.71 % Positive orientable unit clauses : 65
% 0.77/0.71 % Positive unorientable unit clauses: 0
% 0.77/0.71 % Negative unit clauses : 2
% 0.77/0.71 % Non-unit-clauses : 181
% 0.77/0.71 % Current number of unprocessed clauses: 964
% 0.77/0.71 % ...number of literals in the above : 6026
% 0.77/0.71 % Current number of archived formulas : 0
% 0.77/0.71 % Current number of archived clauses : 224
% 0.77/0.71 % Clause-clause subsumption calls (NU) : 15876
% 0.77/0.71 % Rec. Clause-clause subsumption calls : 3103
% 0.77/0.71 % Non-unit clause-clause subsumptions : 197
% 0.77/0.71 % Unit Clause-clause subsumption calls : 176
% 0.77/0.71 % Rewrite failures with RHS unbound : 0
% 0.77/0.71 % BW rewrite match attempts : 7
% 0.77/0.71 % BW rewrite match successes : 7
% 0.77/0.71 % Condensation attempts : 0
% 0.77/0.71 % Condensation successes : 0
% 0.77/0.71 % Termbank termtop insertions : 38890
% 0.77/0.71 % Search garbage collected termcells : 557
% 0.77/0.71
% 0.77/0.71 % -------------------------------------------------
% 0.77/0.71 % User time : 0.107 s
% 0.77/0.71 % System time : 0.008 s
% 0.77/0.71 % Total time : 0.115 s
% 0.77/0.71 % Maximum resident set size: 3812 pages
% 0.77/0.71
% 0.77/0.71 % -------------------------------------------------
% 0.77/0.71 % User time : 0.457 s
% 0.77/0.71 % System time : 0.042 s
% 0.77/0.71 % Total time : 0.499 s
% 0.77/0.71 % Maximum resident set size: 5120 pages
% 0.77/0.71 % E exiting
%------------------------------------------------------------------------------