TSTP Solution File: SWC079-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC079-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:27:28 EDT 2024
% Result : Unsatisfiable 1.97s 0.65s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 40
% Syntax : Number of clauses : 167 ( 26 unt; 52 nHn; 159 RR)
% Number of literals : 501 ( 179 equ; 297 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 213 ( 10 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,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,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(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
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(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause170,axiom,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause170) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(c_0_40,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_41,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_42,negated_conjecture,
neq(sk2,nil),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_44,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_46,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_49,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_50,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_51,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_52,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_53,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_46])])])]) ).
cnf(c_0_54,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_55,axiom,
ssList(nil),
clause8 ).
cnf(c_0_56,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_57,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_49 ).
cnf(c_0_58,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_59,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_51 ).
cnf(c_0_60,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_52 ).
cnf(c_0_61,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_62,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_63,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_64,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]) ).
cnf(c_0_65,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_66,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_67,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_61 ).
cnf(c_0_68,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_62 ).
cnf(c_0_69,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_63 ).
cnf(c_0_70,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_71,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_60]),c_0_56])]) ).
cnf(c_0_72,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_65 ).
cnf(c_0_73,plain,
( nil = X1
| app(tl(X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69]) ).
cnf(c_0_74,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_70 ).
cnf(c_0_75,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_76,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_77,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_78,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_79,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_55])]) ).
cnf(c_0_80,plain,
( nil = X1
| tl(X1) != app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_55])]),c_0_59]) ).
cnf(c_0_81,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_75 ).
cnf(c_0_82,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_76 ).
cnf(c_0_83,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_84,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_77 ).
cnf(c_0_85,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_78 ).
cnf(c_0_86,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_60]),c_0_56])]) ).
cnf(c_0_87,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_88,plain,
( app(cons(X1,X2),nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_72]),c_0_82]) ).
cnf(c_0_89,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_83 ).
cnf(c_0_90,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_91,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_92,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_93,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_94,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_95,plain,
( app(X1,nil) != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_55])]) ).
cnf(c_0_96,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_91 ).
cnf(c_0_97,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_72]),c_0_55])]) ).
cnf(c_0_98,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_99,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_60]),c_0_56])]) ).
cnf(c_0_100,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_101,negated_conjecture,
( hd(sk1) = hd(sk4)
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_86]),c_0_55])]) ).
cnf(c_0_102,plain,
( app(X1,app(X2,nil)) != nil
| ~ singletonP(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_55])]),c_0_68]) ).
cnf(c_0_103,negated_conjecture,
( sk4 = nil
| singletonP(sk1)
| ~ ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_97,c_0_86]) ).
cnf(c_0_104,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_98 ).
cnf(c_0_105,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_99]),c_0_56])]) ).
cnf(c_0_106,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_100 ).
cnf(c_0_107,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_108,negated_conjecture,
( hd(sk1) = hd(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_60]),c_0_56])]) ).
cnf(c_0_109,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_110,plain,
( app(X1,X2) != nil
| ~ singletonP(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_102,c_0_74]) ).
cnf(c_0_111,negated_conjecture,
( app(sk1,nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_99]),c_0_55])]) ).
cnf(c_0_112,negated_conjecture,
( sk4 = nil
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_60]),c_0_56])]) ).
cnf(c_0_113,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_104]),c_0_68]) ).
cnf(c_0_114,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_59]),c_0_56])]) ).
cnf(c_0_115,negated_conjecture,
( sk4 = nil
| X1 = nil
| cons(X2,X1) != sk1
| ~ ssItem(hd(sk4))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_86]),c_0_55])]) ).
cnf(c_0_116,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_107 ).
cnf(c_0_117,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_118,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_119,negated_conjecture,
( sk4 = nil
| sk1 = nil
| ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_108]),c_0_109])]) ).
cnf(c_0_120,negated_conjecture,
( sk4 = nil
| sk1 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_109]),c_0_55])]),c_0_112]) ).
cnf(c_0_121,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_122,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_123,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_109])]) ).
cnf(c_0_124,negated_conjecture,
( skaf82(sk1) = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]),c_0_118])])]),c_0_109])]),c_0_119]),c_0_120]) ).
cnf(c_0_125,plain,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause170]) ).
cnf(c_0_126,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_121 ).
cnf(c_0_127,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_122 ).
cnf(c_0_128,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_59]),c_0_56])]) ).
cnf(c_0_129,negated_conjecture,
( cons(skaf83(sk1),nil) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_124]),c_0_109])]),c_0_120]) ).
cnf(c_0_130,plain,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_125 ).
cnf(c_0_131,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_126]),c_0_68]),c_0_69]) ).
cnf(c_0_132,negated_conjecture,
( app(sk1,skaf45(sk4,sk1)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_109]),c_0_56])]) ).
cnf(c_0_133,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_134,negated_conjecture,
( skaf83(sk1) = hd(sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_129]),c_0_117]),c_0_55])]) ).
cnf(c_0_135,plain,
( skaf83(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_116]),c_0_117]),c_0_118])])]),c_0_72]),c_0_82]) ).
cnf(c_0_136,negated_conjecture,
( cons(hd(sk1),tl(sk4)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_109]),c_0_133])]),c_0_120]) ).
cnf(c_0_137,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk1)) ),
inference(spm,[status(thm)],[c_0_117,c_0_134]) ).
cnf(c_0_138,negated_conjecture,
( skaf83(sk4) = hd(sk1)
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137]) ).
cnf(c_0_139,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_140,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_141,negated_conjecture,
( skaf83(sk4) = hd(sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_59]),c_0_56])]) ).
cnf(c_0_142,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
c_0_139 ).
cnf(c_0_143,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_140 ).
cnf(c_0_144,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_145,plain,
( cons(hd(cons(X1,X2)),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_81]),c_0_72]),c_0_82]) ).
cnf(c_0_146,negated_conjecture,
( cons(hd(sk1),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_141]),c_0_56])]) ).
cnf(c_0_147,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_43]),c_0_46])]) ).
cnf(c_0_148,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_149,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_143]) ).
cnf(c_0_150,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_144 ).
cnf(c_0_151,negated_conjecture,
( cons(hd(sk4),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_118])]),c_0_137]) ).
cnf(c_0_152,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_54]),c_0_55])]) ).
cnf(c_0_153,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_148 ).
cnf(c_0_154,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_55])]),c_0_68]) ).
cnf(c_0_155,negated_conjecture,
( app(sk1,skaf82(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_151]),c_0_118])]) ).
cnf(c_0_156,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_157,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_109])]) ).
cnf(c_0_158,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_118]),c_0_109])]) ).
cnf(c_0_159,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_156 ).
cnf(c_0_160,negated_conjecture,
( ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_46]),c_0_56])]) ).
cnf(c_0_161,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_120]) ).
cnf(c_0_162,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_159]),c_0_55])]) ).
cnf(c_0_163,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_164,negated_conjecture,
~ segmentP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_161]),c_0_161]),c_0_161]),c_0_162])]) ).
cnf(c_0_165,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_163 ).
cnf(c_0_166,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC079-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n009.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 03:10:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.97/0.65 # Version: 3.1.0
% 1.97/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.97/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.97/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.97/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.97/0.65 # Starting sh5l with 300s (1) cores
% 1.97/0.65 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22097 completed with status 0
% 1.97/0.65 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.97/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.97/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.97/0.65 # No SInE strategy applied
% 1.97/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.97/0.65 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.97/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.97/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.97/0.65 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.97/0.65 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.97/0.65 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.97/0.65 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 22103 completed with status 0
% 1.97/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.97/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.97/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.97/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.97/0.65 # No SInE strategy applied
% 1.97/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.97/0.65 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.97/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.97/0.65 # Preprocessing time : 0.003 s
% 1.97/0.65 # Presaturation interreduction done
% 1.97/0.65
% 1.97/0.65 # Proof found!
% 1.97/0.65 # SZS status Unsatisfiable
% 1.97/0.65 # SZS output start CNFRefutation
% See solution above
% 1.97/0.65 # Parsed axioms : 197
% 1.97/0.65 # Removed by relevancy pruning/SinE : 0
% 1.97/0.65 # Initial clauses : 197
% 1.97/0.65 # Removed in clause preprocessing : 0
% 1.97/0.65 # Initial clauses in saturation : 197
% 1.97/0.65 # Processed clauses : 2629
% 1.97/0.65 # ...of these trivial : 7
% 1.97/0.65 # ...subsumed : 1643
% 1.97/0.65 # ...remaining for further processing : 979
% 1.97/0.65 # Other redundant clauses eliminated : 169
% 1.97/0.65 # Clauses deleted for lack of memory : 0
% 1.97/0.65 # Backward-subsumed : 91
% 1.97/0.65 # Backward-rewritten : 276
% 1.97/0.65 # Generated clauses : 9477
% 1.97/0.65 # ...of the previous two non-redundant : 8821
% 1.97/0.65 # ...aggressively subsumed : 0
% 1.97/0.65 # Contextual simplify-reflections : 227
% 1.97/0.65 # Paramodulations : 9300
% 1.97/0.65 # Factorizations : 0
% 1.97/0.65 # NegExts : 0
% 1.97/0.65 # Equation resolutions : 179
% 1.97/0.65 # Disequality decompositions : 0
% 1.97/0.65 # Total rewrite steps : 8606
% 1.97/0.65 # ...of those cached : 8425
% 1.97/0.65 # Propositional unsat checks : 0
% 1.97/0.65 # Propositional check models : 0
% 1.97/0.65 # Propositional check unsatisfiable : 0
% 1.97/0.65 # Propositional clauses : 0
% 1.97/0.65 # Propositional clauses after purity: 0
% 1.97/0.65 # Propositional unsat core size : 0
% 1.97/0.65 # Propositional preprocessing time : 0.000
% 1.97/0.65 # Propositional encoding time : 0.000
% 1.97/0.65 # Propositional solver time : 0.000
% 1.97/0.65 # Success case prop preproc time : 0.000
% 1.97/0.65 # Success case prop encoding time : 0.000
% 1.97/0.65 # Success case prop solver time : 0.000
% 1.97/0.65 # Current number of processed clauses : 402
% 1.97/0.65 # Positive orientable unit clauses : 61
% 1.97/0.65 # Positive unorientable unit clauses: 0
% 1.97/0.65 # Negative unit clauses : 3
% 1.97/0.65 # Non-unit-clauses : 338
% 1.97/0.65 # Current number of unprocessed clauses: 6498
% 1.97/0.65 # ...number of literals in the above : 36705
% 1.97/0.65 # Current number of archived formulas : 0
% 1.97/0.65 # Current number of archived clauses : 553
% 1.97/0.65 # Clause-clause subsumption calls (NU) : 72390
% 1.97/0.65 # Rec. Clause-clause subsumption calls : 24268
% 1.97/0.65 # Non-unit clause-clause subsumptions : 1775
% 1.97/0.65 # Unit Clause-clause subsumption calls : 169
% 1.97/0.65 # Rewrite failures with RHS unbound : 0
% 1.97/0.65 # BW rewrite match attempts : 3
% 1.97/0.65 # BW rewrite match successes : 3
% 1.97/0.65 # Condensation attempts : 0
% 1.97/0.65 # Condensation successes : 0
% 1.97/0.65 # Termbank termtop insertions : 177551
% 1.97/0.65 # Search garbage collected termcells : 561
% 1.97/0.65
% 1.97/0.65 # -------------------------------------------------
% 1.97/0.65 # User time : 0.222 s
% 1.97/0.65 # System time : 0.010 s
% 1.97/0.65 # Total time : 0.232 s
% 1.97/0.65 # Maximum resident set size: 2152 pages
% 1.97/0.65
% 1.97/0.65 # -------------------------------------------------
% 1.97/0.65 # User time : 1.077 s
% 1.97/0.65 # System time : 0.053 s
% 1.97/0.65 # Total time : 1.130 s
% 1.97/0.65 # Maximum resident set size: 1876 pages
% 1.97/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------