%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC204-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 : n026.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:22 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.64s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 56 ( 20 unt; 21 nHn; 56 RR)
% Number of literals : 134 ( 53 equ; 65 neg)
% Maximal clause size : 7 ( 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 : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
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)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_16,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_22,negated_conjecture,
~ neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,axiom,
ssList(nil),
clause8 ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,negated_conjecture,
nil = sk1,
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_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(app(sk1,tl(sk4)))
| ~ neq(sk1,sk4)
| app(sk1,tl(sk4)) = sk4 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_19])])])]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_30 ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(app(sk1,tl(sk4)))
| sk4 = sk1
| app(sk1,tl(sk4)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_24]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| sk1 = X1 ),
inference(rw,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_34 ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(app(sk1,tl(sk4)))
| sk4 = sk1
| app(sk1,tl(sk4)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| app(sk1,X1) = X1 ),
inference(rw,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(tl(sk4))
| sk4 = sk1
| tl(sk4) = sk4 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| sk1 = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(rw,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_45,negated_conjecture,
( sk4 = sk1
| tl(sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_32])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_43 ).
cnf(c_0_48,negated_conjecture,
( sk4 = sk1
| cons(hd(sk4),sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_32])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_46 ).
cnf(c_0_50,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_32])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| sk1 = X1 ),
inference(rw,[status(thm)],[c_0_49,c_0_28]) ).
cnf(c_0_52,negated_conjecture,
neq(sk4,sk1),
inference(rw,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_53,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_32])]) ).
cnf(c_0_54,negated_conjecture,
~ neq(sk1,sk1),
inference(rw,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC204-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n026.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 08:07:37 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 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.49/0.64 % Version: 3.5.1
% 0.49/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.64 % Starting sh5l with 300s (1) cores
% 0.49/0.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1798526 completed with status 0
% 0.49/0.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.49/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.64 % No SInE strategy applied
% 0.49/0.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.49/0.64 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.49/0.64 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.49/0.64 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.49/0.64 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.49/0.64 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1798535 completed with status 0
% 0.49/0.64 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.49/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.49/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.49/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.64 % No SInE strategy applied
% 0.49/0.64 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.49/0.64 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.49/0.64 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.49/0.64 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.49/0.64 % Preprocessing time : 0.005 s
% 0.49/0.64
% 0.49/0.64 % Proof found!
% 0.49/0.64 % SZS status Unsatisfiable
% 0.49/0.64 % SZS output start CNFRefutation
% See solution above
% 0.49/0.64 % Parsed axioms : 197
% 0.49/0.64 % Removed by relevancy pruning/SinE : 0
% 0.49/0.64 % Initial clauses : 197
% 0.49/0.64 % Removed in clause preprocessing : 0
% 0.49/0.64 % Initial clauses in saturation : 197
% 0.49/0.64 % Processed clauses : 426
% 0.49/0.64 % ...of these trivial : 5
% 0.49/0.64 % ...subsumed : 100
% 0.49/0.64 % ...remaining for further processing : 321
% 0.49/0.64 % Other redundant clauses eliminated : 102
% 0.49/0.64 % Clauses deleted for lack of memory : 0
% 0.49/0.64 % Backward-subsumed : 10
% 0.49/0.64 % Backward-rewritten : 75
% 0.49/0.64 % Generated clauses : 1164
% 0.49/0.64 % ...of the previous two non-redundant : 969
% 0.49/0.64 % ...aggressively subsumed : 0
% 0.49/0.64 % Contextual simplify-reflections : 8
% 0.49/0.64 % Paramodulations : 1058
% 0.49/0.64 % Factorizations : 0
% 0.49/0.64 % NegExts : 0
% 0.49/0.64 % Equation resolutions : 108
% 0.49/0.64 % Disequality decompositions : 0
% 0.49/0.64 % Total rewrite steps : 1253
% 0.49/0.64 % ...of those cached : 1163
% 0.49/0.64 % Propositional unsat checks : 0
% 0.49/0.64 % Propositional check models : 0
% 0.49/0.64 % Propositional check unsatisfiable : 0
% 0.49/0.64 % Propositional clauses : 0
% 0.49/0.64 % Propositional clauses after purity: 0
% 0.49/0.64 % Propositional unsat core size : 0
% 0.49/0.64 % Propositional preprocessing time : 0.000
% 0.49/0.64 % Propositional encoding time : 0.000
% 0.49/0.64 % Propositional solver time : 0.000
% 0.49/0.64 % Success case prop preproc time : 0.000
% 0.49/0.64 % Success case prop encoding time : 0.000
% 0.49/0.64 % Success case prop solver time : 0.000
% 0.49/0.64 % Current number of processed clauses : 212
% 0.49/0.64 % Positive orientable unit clauses : 61
% 0.49/0.64 % Positive unorientable unit clauses: 0
% 0.49/0.64 % Negative unit clauses : 3
% 0.49/0.64 % Non-unit-clauses : 148
% 0.49/0.64 % Current number of unprocessed clauses: 723
% 0.49/0.64 % ...number of literals in the above : 4063
% 0.49/0.64 % Current number of archived formulas : 0
% 0.49/0.64 % Current number of archived clauses : 85
% 0.49/0.64 % Clause-clause subsumption calls (NU) : 9074
% 0.49/0.64 % Rec. Clause-clause subsumption calls : 1610
% 0.49/0.64 % Non-unit clause-clause subsumptions : 102
% 0.49/0.64 % Unit Clause-clause subsumption calls : 125
% 0.49/0.64 % Rewrite failures with RHS unbound : 0
% 0.49/0.64 % BW rewrite match attempts : 4
% 0.49/0.64 % BW rewrite match successes : 4
% 0.49/0.64 % Condensation attempts : 0
% 0.49/0.64 % Condensation successes : 0
% 0.49/0.64 % Termbank termtop insertions : 29416
% 0.49/0.64 % Search garbage collected termcells : 551
% 0.49/0.64
% 0.49/0.64 % -------------------------------------------------
% 0.49/0.64 % User time : 0.075 s
% 0.49/0.64 % System time : 0.006 s
% 0.49/0.64 % Total time : 0.082 s
% 0.49/0.64 % Maximum resident set size: 4068 pages
% 0.49/0.64
% 0.49/0.64 % -------------------------------------------------
% 0.49/0.64 % User time : 0.263 s
% 0.49/0.64 % System time : 0.032 s
% 0.49/0.64 % Total time : 0.295 s
% 0.49/0.64 % Maximum resident set size: 4864 pages
% 0.49/0.64 % E exiting
%------------------------------------------------------------------------------