%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC013-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 : n004.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:36 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 15 unt; 7 nHn; 40 RR)
% Number of literals : 117 ( 36 equ; 79 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 : 7 ( 7 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(nil,sk2)
| hd(sk2) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| sk1 != X1
| ~ ssList(X1) ),
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(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_11,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| hd(sk2) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| sk1 != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| hd(sk2) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| sk1 != X1
| ~ ssList(X1) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X2
| cons(X2,nil) != X1
| ~ ssItem(X2)
| ~ ssList(X1)
| sk3 = X1 ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| cons(hd(sk4),nil) != sk1 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14]),c_0_14]),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(sk2),
co1_2 ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_17])])])]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_21 ).
cnf(c_0_25,axiom,
ssList(nil),
clause8 ).
cnf(c_0_26,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_27 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_30 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(hd(sk4))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_33 ).
cnf(c_0_36,negated_conjecture,
nil = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_26])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
neq(sk4,sk4),
inference(rw,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC013-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.15/0.40 % Computer : n004.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 07:49:06 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 Running first-order theorem proving
% 0.19/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.21/0.54 % Version: 3.5.1
% 0.21/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 % Starting sh5l with 300s (1) cores
% 0.21/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2637014 completed with status 0
% 0.21/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.54 % No SInE strategy applied
% 0.21/0.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.54 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2637023 completed with status 0
% 0.21/0.54 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.21/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.54 % No SInE strategy applied
% 0.21/0.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.54 % Preprocessing time : 0.005 s
% 0.21/0.54
% 0.21/0.54 % Proof found!
% 0.21/0.54 % SZS status Unsatisfiable
% 0.21/0.54 % SZS output start CNFRefutation
% See solution above
% 0.21/0.54 % Parsed axioms : 197
% 0.21/0.54 % Removed by relevancy pruning/SinE : 0
% 0.21/0.54 % Initial clauses : 197
% 0.21/0.54 % Removed in clause preprocessing : 0
% 0.21/0.54 % Initial clauses in saturation : 197
% 0.21/0.54 % Processed clauses : 208
% 0.21/0.54 % ...of these trivial : 5
% 0.21/0.54 % ...subsumed : 6
% 0.21/0.54 % ...remaining for further processing : 197
% 0.21/0.54 % Other redundant clauses eliminated : 62
% 0.21/0.54 % Clauses deleted for lack of memory : 0
% 0.21/0.54 % Backward-subsumed : 2
% 0.21/0.54 % Backward-rewritten : 39
% 0.21/0.54 % Generated clauses : 406
% 0.21/0.54 % ...of the previous two non-redundant : 362
% 0.21/0.54 % ...aggressively subsumed : 0
% 0.21/0.54 % Contextual simplify-reflections : 1
% 0.21/0.54 % Paramodulations : 342
% 0.21/0.54 % Factorizations : 0
% 0.21/0.54 % NegExts : 0
% 0.21/0.54 % Equation resolutions : 67
% 0.21/0.54 % Disequality decompositions : 0
% 0.21/0.54 % Total rewrite steps : 280
% 0.21/0.54 % ...of those cached : 223
% 0.21/0.54 % Propositional unsat checks : 0
% 0.21/0.54 % Propositional check models : 0
% 0.21/0.54 % Propositional check unsatisfiable : 0
% 0.21/0.54 % Propositional clauses : 0
% 0.21/0.54 % Propositional clauses after purity: 0
% 0.21/0.54 % Propositional unsat core size : 0
% 0.21/0.54 % Propositional preprocessing time : 0.000
% 0.21/0.54 % Propositional encoding time : 0.000
% 0.21/0.54 % Propositional solver time : 0.000
% 0.21/0.54 % Success case prop preproc time : 0.000
% 0.21/0.54 % Success case prop encoding time : 0.000
% 0.21/0.54 % Success case prop solver time : 0.000
% 0.21/0.54 % Current number of processed clauses : 131
% 0.21/0.54 % Positive orientable unit clauses : 50
% 0.21/0.54 % Positive unorientable unit clauses: 0
% 0.21/0.54 % Negative unit clauses : 1
% 0.21/0.54 % Non-unit-clauses : 80
% 0.21/0.54 % Current number of unprocessed clauses: 351
% 0.21/0.54 % ...number of literals in the above : 1662
% 0.21/0.54 % Current number of archived formulas : 0
% 0.21/0.54 % Current number of archived clauses : 41
% 0.21/0.54 % Clause-clause subsumption calls (NU) : 4490
% 0.21/0.54 % Rec. Clause-clause subsumption calls : 580
% 0.21/0.54 % Non-unit clause-clause subsumptions : 7
% 0.21/0.54 % Unit Clause-clause subsumption calls : 81
% 0.21/0.54 % Rewrite failures with RHS unbound : 0
% 0.21/0.54 % BW rewrite match attempts : 1
% 0.21/0.54 % BW rewrite match successes : 1
% 0.21/0.54 % Condensation attempts : 0
% 0.21/0.54 % Condensation successes : 0
% 0.21/0.54 % Termbank termtop insertions : 14877
% 0.21/0.54 % Search garbage collected termcells : 565
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.035 s
% 0.21/0.54 % System time : 0.009 s
% 0.21/0.54 % Total time : 0.044 s
% 0.21/0.54 % Maximum resident set size: 4068 pages
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.125 s
% 0.21/0.54 % System time : 0.024 s
% 0.21/0.54 % Total time : 0.150 s
% 0.21/0.54 % Maximum resident set size: 5120 pages
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------