%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC005-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:42:34 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 66 ( 17 unt; 20 nHn; 66 RR)
% Number of literals : 184 ( 69 equ; 110 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 : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| tl(sk4) != X1
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_17,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_19,negated_conjecture,
neq(sk2,nil),
c_0_17 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| tl(sk4) != X1
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ neq(X2,nil)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_23 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| tl(sk4) != X1
| ~ ssList(X1)
| sk3 = X1 ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| app(app(nil,X1),sk1) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])])]),c_0_28])]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| tl(sk4) = sk1 ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_22])])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| app(app(nil,X1),sk1) != sk4
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27])]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(tl(sk4))
| sk4 = nil
| tl(sk4) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_27]),c_0_36])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_37 ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| app(X1,sk1) != sk4
| nil = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_26]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_39 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_40 ).
cnf(c_0_46,negated_conjecture,
( sk4 = nil
| tl(sk4) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,sk1) != sk4
| cons(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28])]) ).
cnf(c_0_48,negated_conjecture,
( sk4 = nil
| cons(hd(sk4),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_36])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| sk4 = nil
| cons(hd(sk4),nil) = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_49 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| sk4 = nil
| cons(hd(sk4),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_36])]) ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_52 ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = nil
| cons(hd(sk4),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
( sk4 = nil
| cons(hd(sk4),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_51]),c_0_36])]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_27])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_59 ).
cnf(c_0_62,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_51]),c_0_36])]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_64,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_22,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC005-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:54:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 % Version: 3.5.1
% 0.20/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 % Starting sh5l with 300s (1) cores
% 0.20/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2603893 completed with status 0
% 0.20/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.49 % No SInE strategy applied
% 0.20/0.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.49 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.49 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2603899 completed with status 0
% 0.20/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.49 % No SInE strategy applied
% 0.20/0.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.49 % Preprocessing time : 0.004 s
% 0.20/0.49 % Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 % Proof found!
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start CNFRefutation
% See solution above
% 0.20/0.49 % Parsed axioms : 197
% 0.20/0.49 % Removed by relevancy pruning/SinE : 0
% 0.20/0.49 % Initial clauses : 197
% 0.20/0.49 % Removed in clause preprocessing : 0
% 0.20/0.49 % Initial clauses in saturation : 197
% 0.20/0.49 % Processed clauses : 491
% 0.20/0.49 % ...of these trivial : 5
% 0.20/0.49 % ...subsumed : 35
% 0.20/0.49 % ...remaining for further processing : 451
% 0.20/0.49 % Other redundant clauses eliminated : 68
% 0.20/0.49 % Clauses deleted for lack of memory : 0
% 0.20/0.49 % Backward-subsumed : 8
% 0.20/0.49 % Backward-rewritten : 28
% 0.20/0.49 % Generated clauses : 760
% 0.20/0.49 % ...of the previous two non-redundant : 646
% 0.20/0.49 % ...aggressively subsumed : 0
% 0.20/0.49 % Contextual simplify-reflections : 4
% 0.20/0.49 % Paramodulations : 688
% 0.20/0.49 % Factorizations : 0
% 0.20/0.49 % NegExts : 0
% 0.20/0.49 % Equation resolutions : 73
% 0.20/0.49 % Disequality decompositions : 0
% 0.20/0.49 % Total rewrite steps : 814
% 0.20/0.49 % ...of those cached : 738
% 0.20/0.49 % Propositional unsat checks : 0
% 0.20/0.49 % Propositional check models : 0
% 0.20/0.49 % Propositional check unsatisfiable : 0
% 0.20/0.49 % Propositional clauses : 0
% 0.20/0.49 % Propositional clauses after purity: 0
% 0.20/0.49 % Propositional unsat core size : 0
% 0.20/0.49 % Propositional preprocessing time : 0.000
% 0.20/0.49 % Propositional encoding time : 0.000
% 0.20/0.49 % Propositional solver time : 0.000
% 0.20/0.49 % Success case prop preproc time : 0.000
% 0.20/0.49 % Success case prop encoding time : 0.000
% 0.20/0.49 % Success case prop solver time : 0.000
% 0.20/0.49 % Current number of processed clauses : 205
% 0.20/0.49 % Positive orientable unit clauses : 63
% 0.20/0.49 % Positive unorientable unit clauses: 0
% 0.20/0.49 % Negative unit clauses : 5
% 0.20/0.49 % Non-unit-clauses : 137
% 0.20/0.49 % Current number of unprocessed clauses: 531
% 0.20/0.49 % ...number of literals in the above : 3267
% 0.20/0.49 % Current number of archived formulas : 0
% 0.20/0.49 % Current number of archived clauses : 222
% 0.20/0.49 % Clause-clause subsumption calls (NU) : 12842
% 0.20/0.49 % Rec. Clause-clause subsumption calls : 1703
% 0.20/0.49 % Non-unit clause-clause subsumptions : 42
% 0.20/0.49 % Unit Clause-clause subsumption calls : 75
% 0.20/0.49 % Rewrite failures with RHS unbound : 0
% 0.20/0.49 % BW rewrite match attempts : 3
% 0.20/0.49 % BW rewrite match successes : 3
% 0.20/0.49 % Condensation attempts : 0
% 0.20/0.49 % Condensation successes : 0
% 0.20/0.49 % Termbank termtop insertions : 25913
% 0.20/0.49 % Search garbage collected termcells : 559
% 0.20/0.49
% 0.20/0.49 % -------------------------------------------------
% 0.20/0.49 % User time : 0.046 s
% 0.20/0.49 % System time : 0.009 s
% 0.20/0.49 % Total time : 0.055 s
% 0.20/0.49 % Maximum resident set size: 4016 pages
% 0.20/0.49
% 0.20/0.49 % -------------------------------------------------
% 0.20/0.49 % User time : 0.180 s
% 0.20/0.49 % System time : 0.029 s
% 0.20/0.49 % Total time : 0.209 s
% 0.20/0.49 % Maximum resident set size: 4864 pages
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------