%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC285-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 : n010.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:42 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 43
% Syntax : Number of formulae : 174 ( 43 unt; 0 def)
% Number of atoms : 494 ( 104 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 646 ( 326 ~; 318 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 229 ( 19 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
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(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_12,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_11,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
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(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause175,axiom,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_13,negated_conjecture,
( memberP(sk7,sk8)
| memberP(sk6,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause62,axiom,
( ~ ssItem(X1)
| leq(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause62) ).
cnf(co1_16,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(c_0_41,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_43,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_44,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_41 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_42 ).
cnf(c_0_46,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_47,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_43 ).
cnf(c_0_50,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(X1,cons(X2,X3)) != X4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_48 ).
cnf(c_0_52,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_53,axiom,
ssList(nil),
clause8 ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( ~ duplicatefreeP(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ singletonP(X2)
| ~ memberP(X1,skaf44(X2))
| app(X1,X2) != X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| memberP(X1,skaf44(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_57,plain,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| app(X1,X1) != X2 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_58,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_59,plain,
( ~ duplicatefreeP(app(X1,X1))
| ~ ssList(X1)
| ~ ssList(app(X1,X1))
| ~ singletonP(X1) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_58]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(app(X1,X1))
| ~ singletonP(X1)
| epred2_0 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_61 ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_62 ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| epred2_0 ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_71,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| epred2_0 ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_68 ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_69 ).
fof(c_0_74,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_70 ).
cnf(c_0_76,plain,
( ~ ssItem(X1)
| epred2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_53])]) ).
cnf(c_0_77,negated_conjecture,
ssItem(sk8),
co1_12 ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_79,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_11 ).
cnf(c_0_80,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| X1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_82,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_75,c_0_74]),c_0_58]) ).
cnf(c_0_83,negated_conjecture,
epred2_0,
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_78 ).
cnf(c_0_85,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_87,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(spm,[status(thm)],[c_0_81,c_0_67]) ).
cnf(c_0_88,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_74]) ).
cnf(c_0_89,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_91,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_92,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_93,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_96,negated_conjecture,
( ~ ssList(app(sk6,cons(sk5,nil)))
| sk3 != nil
| app(sk6,cons(sk5,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).
cnf(c_0_97,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_98,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_72]),c_0_53])]) ).
cnf(c_0_99,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_90 ).
cnf(c_0_102,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_103,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_91,c_0_80]) ).
cnf(c_0_104,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_105,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_94 ).
cnf(c_0_106,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_95 ).
cnf(c_0_108,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| app(sk6,cons(sk5,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_64]),c_0_97])]) ).
cnf(c_0_109,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_110,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_100 ).
cnf(c_0_111,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk4)
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),c_0_104])]) ).
cnf(c_0_112,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_113,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| tl(X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_114,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_106 ).
cnf(c_0_115,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_116,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_97])]),c_0_109]) ).
cnf(c_0_117,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_99])]) ).
cnf(c_0_118,negated_conjecture,
( ~ segmentP(nil,sk4)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_103]),c_0_53])]) ).
cnf(c_0_119,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_112 ).
cnf(c_0_120,negated_conjecture,
( ~ neq(sk4,nil)
| tl(sk3) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_103])]) ).
cnf(c_0_121,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_115 ).
cnf(c_0_122,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_53])]) ).
cnf(c_0_123,negated_conjecture,
( sk4 != nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_104])]) ).
cnf(c_0_124,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_125,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_126,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_127,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_128,negated_conjecture,
( sk4 = nil
| tl(sk3) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_104]),c_0_53])]) ).
cnf(c_0_129,negated_conjecture,
sk4 != nil,
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_130,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_131,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_132,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_124 ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_125 ).
cnf(c_0_134,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_126 ).
cnf(c_0_135,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_127 ).
cnf(c_0_136,negated_conjecture,
tl(sk3) = nil,
inference(sr,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_137,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_130 ).
cnf(c_0_138,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
c_0_131 ).
cnf(c_0_139,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk6,app(cons(sk5,nil),sk7)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_132]),c_0_97]),c_0_86])]) ).
cnf(c_0_140,plain,
( ~ ssList(X2)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_99])]) ).
cnf(c_0_141,plain,
( ~ ssList(X3)
| ~ memberP(cons(X1,X3),X2)
| memberP(X3,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_99]),c_0_99])]) ).
cnf(c_0_142,negated_conjecture,
cons(hd(sk3),nil) = sk3,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_103])]),c_0_122]) ).
cnf(c_0_143,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_99])]) ).
cnf(c_0_144,plain,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X1)
| app(X3,cons(X2,X4)) != X1
| memberP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_99])]) ).
cnf(c_0_145,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk6,cons(sk5,sk7)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_86])]) ).
cnf(c_0_146,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_147,negated_conjecture,
( ~ memberP(sk3,X1)
| hd(sk3) = X1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_53])]),c_0_143]) ).
cnf(c_0_148,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(sk5,nil))
| sk3 != X1
| memberP(X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_86]),c_0_97])]) ).
cnf(c_0_149,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_146 ).
cnf(c_0_150,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| hd(sk3) = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_103])]) ).
cnf(c_0_151,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ memberP(X2,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_99])]) ).
cnf(c_0_152,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_153,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| cons(sk5,nil) = sk3 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_150]),c_0_136]),c_0_103])]),c_0_122]) ).
cnf(c_0_154,negated_conjecture,
( ~ ssList(app(sk6,cons(sk5,nil)))
| ~ memberP(sk7,X1)
| memberP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_85]),c_0_86])]) ).
cnf(c_0_155,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_152 ).
cnf(c_0_156,negated_conjecture,
cons(sk5,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_117]),c_0_53])]) ).
cnf(c_0_157,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ memberP(sk7,X1)
| memberP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_64]),c_0_97])]) ).
cnf(c_0_158,negated_conjecture,
( memberP(sk7,sk8)
| memberP(sk6,sk8) ),
co1_13 ).
cnf(c_0_159,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_99])]) ).
cnf(c_0_160,negated_conjecture,
app(sk6,cons(sk5,sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_156]),c_0_103])]) ).
cnf(c_0_161,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| memberP(sk3,sk8)
| memberP(sk6,sk8) ),
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_162,negated_conjecture,
( ~ ssList(cons(sk5,sk7))
| ~ memberP(sk6,X1)
| memberP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_97])]) ).
cnf(c_0_163,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk3,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_156]),c_0_103])]) ).
cnf(c_0_164,negated_conjecture,
( ~ memberP(sk3,X1)
| sk5 = X1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_156]),c_0_53])]),c_0_143]) ).
cnf(c_0_165,negated_conjecture,
( ~ ssList(cons(sk5,sk7))
| memberP(sk3,sk8) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_166,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause62]) ).
cnf(c_0_167,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_168,negated_conjecture,
( ~ ssList(cons(sk5,sk7))
| sk5 = sk8 ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_169,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
c_0_166 ).
cnf(c_0_170,negated_conjecture,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
c_0_167 ).
cnf(c_0_171,negated_conjecture,
sk5 = sk8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_117]),c_0_86])]) ).
cnf(c_0_172,plain,
leq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_99])]) ).
cnf(c_0_173,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_171]),c_0_172])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC285-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n010.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 08:12:46 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.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.14/5.54 % Version: 3.5.1
% 0.14/5.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.54 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.54 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.54 % Starting sh5l with 300s (1) cores
% 0.14/5.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 441392 completed with status 0
% 0.14/5.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/5.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.54 % No SInE strategy applied
% 0.14/5.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/5.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/5.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/5.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/5.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/5.54 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 441400 completed with status 0
% 0.14/5.54 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.14/5.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.54 % No SInE strategy applied
% 0.14/5.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/5.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/5.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/5.54 % Preprocessing time : 0.004 s
% 0.14/5.54 % Presaturation interreduction done
% 0.14/5.54
% 0.14/5.54 % Proof found!
% 0.14/5.54 % SZS status Unsatisfiable
% 0.14/5.54 % SZS output start CNFRefutation
% See solution above
% 0.14/5.54 % Parsed axioms : 202
% 0.14/5.54 % Removed by relevancy pruning/SinE : 0
% 0.14/5.54 % Initial clauses : 202
% 0.14/5.54 % Removed in clause preprocessing : 0
% 0.14/5.54 % Initial clauses in saturation : 202
% 0.14/5.54 % Processed clauses : 868
% 0.14/5.54 % ...of these trivial : 9
% 0.14/5.54 % ...subsumed : 179
% 0.14/5.54 % ...remaining for further processing : 680
% 0.14/5.54 % Other redundant clauses eliminated : 143
% 0.14/5.54 % Clauses deleted for lack of memory : 0
% 0.14/5.54 % Backward-subsumed : 30
% 0.14/5.54 % Backward-rewritten : 154
% 0.14/5.54 % Generated clauses : 2470
% 0.14/5.54 % ...of the previous two non-redundant : 2197
% 0.14/5.54 % ...aggressively subsumed : 0
% 0.14/5.54 % Contextual simplify-reflections : 9
% 0.14/5.54 % Paramodulations : 2282
% 0.14/5.54 % Factorizations : 0
% 0.14/5.54 % NegExts : 0
% 0.14/5.54 % Equation resolutions : 174
% 0.14/5.54 % Disequality decompositions : 0
% 0.14/5.54 % Total rewrite steps : 2074
% 0.14/5.54 % ...of those cached : 1901
% 0.14/5.54 % Propositional unsat checks : 0
% 0.14/5.54 % Propositional check models : 0
% 0.14/5.54 % Propositional check unsatisfiable : 0
% 0.14/5.54 % Propositional clauses : 0
% 0.14/5.54 % Propositional clauses after purity: 0
% 0.14/5.54 % Propositional unsat core size : 0
% 0.14/5.54 % Propositional preprocessing time : 0.000
% 0.14/5.54 % Propositional encoding time : 0.000
% 0.14/5.54 % Propositional solver time : 0.000
% 0.14/5.54 % Success case prop preproc time : 0.000
% 0.14/5.54 % Success case prop encoding time : 0.000
% 0.14/5.54 % Success case prop solver time : 0.000
% 0.14/5.54 % Current number of processed clauses : 281
% 0.14/5.54 % Positive orientable unit clauses : 69
% 0.14/5.54 % Positive unorientable unit clauses: 0
% 0.14/5.54 % Negative unit clauses : 11
% 0.14/5.54 % Non-unit-clauses : 201
% 0.14/5.54 % Current number of unprocessed clauses: 1626
% 0.14/5.54 % ...number of literals in the above : 10192
% 0.14/5.54 % Current number of archived formulas : 0
% 0.14/5.54 % Current number of archived clauses : 393
% 0.14/5.54 % Clause-clause subsumption calls (NU) : 19057
% 0.14/5.54 % Rec. Clause-clause subsumption calls : 6505
% 0.14/5.54 % Non-unit clause-clause subsumptions : 140
% 0.14/5.54 % Unit Clause-clause subsumption calls : 1690
% 0.14/5.54 % Rewrite failures with RHS unbound : 0
% 0.14/5.54 % BW rewrite match attempts : 47
% 0.14/5.54 % BW rewrite match successes : 40
% 0.14/5.54 % Condensation attempts : 0
% 0.14/5.54 % Condensation successes : 0
% 0.14/5.54 % Termbank termtop insertions : 49597
% 0.14/5.54 % Search garbage collected termcells : 537
% 0.14/5.54
% 0.14/5.54 % -------------------------------------------------
% 0.14/5.54 % User time : 0.095 s
% 0.14/5.54 % System time : 0.009 s
% 0.14/5.54 % Total time : 0.104 s
% 0.14/5.54 % Maximum resident set size: 4068 pages
% 0.14/5.54
% 0.14/5.54 % -------------------------------------------------
% 0.14/5.54 % User time : 0.471 s
% 0.14/5.54 % System time : 0.042 s
% 0.14/5.54 % Total time : 0.513 s
% 0.14/5.54 % Maximum resident set size: 5120 pages
% 0.14/5.54 % E exiting
%------------------------------------------------------------------------------