TSTP Solution File: SWC395+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC395+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 : Fri May 3 03:12:19 EDT 2024
% Result : Theorem 76.58s 11.30s
% Output : CNFRefutation 76.58s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f597)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f29,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( ( leq(X1,X0)
& leq(X0,X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax29) ).
fof(f31,axiom,
! [X0] :
( ssItem(X0)
=> leq(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax31) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X3)
& ? [X8] :
( neq(nil,X3)
& hd(X3) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X3) = X6
& ssList(X7) )
& ssList(X6) )
& X2 != X5
& ssList(X5) ) )
| ( nil = X3
& nil != X2 )
| ! [X4] :
( memberP(X1,X4)
| ~ memberP(X0,X4)
| ~ ssItem(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X3)
& ? [X8] :
( neq(nil,X3)
& hd(X3) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X3) = X6
& ssList(X7) )
& ssList(X6) )
& X2 != X5
& ssList(X5) ) )
| ( nil = X3
& nil != X2 )
| ! [X4] :
( memberP(X1,X4)
| ~ memberP(X0,X4)
| ~ ssItem(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| ! [X8] :
( memberP(X1,X8)
| ~ memberP(X0,X8)
| ~ ssItem(X8) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1)
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1)
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f136]) ).
fof(f140,plain,
! [X0] :
( leq(X0,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(X1,X8)
& memberP(X0,X8)
& ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f232,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f324,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f148]) ).
fof(f325,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f324]) ).
fof(f330,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(X1,X8)
& memberP(X0,X8)
& ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(X1,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(X1,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK55 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = sK55 )
& ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK55 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = sK55 )
& ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK56)
| ! [X7] :
( ~ neq(nil,sK56)
| hd(sK56) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(sK56) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK55 = X4
| ~ ssList(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X8] :
( ~ memberP(sK54,X8)
& memberP(sK53,X8)
& ssItem(X8) )
=> ( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ~ neq(sK56,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK56)
| ! [X7] :
( ~ neq(nil,sK56)
| hd(sK56) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(sK56) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK55 = X4
| ~ ssList(X4) ) )
& ( nil != sK56
| nil = sK55 )
& ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f350,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f232]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f440,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f449,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f451,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f453,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f455,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f456,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f458,plain,
! [X0] :
( leq(X0,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f465,plain,
! [X2,X0,X1] :
( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f467,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f468,plain,
! [X2,X0,X1] :
( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f325]) ).
fof(f470,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f325]) ).
fof(f471,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f495,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f496,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f526,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
memberP(sK53,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
~ memberP(sK54,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
~ memberP(sK56,sK57),
inference(definition_unfolding,[],[f556,f552]) ).
fof(f560,plain,
memberP(sK55,sK57),
inference(definition_unfolding,[],[f555,f553]) ).
fof(f561,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f562,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f582,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f496]) ).
cnf(c_49,plain,
( ~ ssItem(X0)
| ~ ssItem(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_149,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_151,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f451]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_156,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X0)
| ~ ssItem(X0)
| ~ ssItem(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f456]) ).
cnf(c_158,plain,
( ~ ssItem(X0)
| leq(X0,X0) ),
inference(cnf_transformation,[],[f458]) ).
cnf(c_165,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X2,X0),X1) ),
inference(cnf_transformation,[],[f467]) ).
cnf(c_167,plain,
( ~ memberP(app(X0,X1),X2)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,X2)
| memberP(X1,X2) ),
inference(cnf_transformation,[],[f465]) ).
cnf(c_168,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| memberP(cons(X2,X0),X1) ),
inference(cnf_transformation,[],[f470]) ).
cnf(c_169,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| memberP(cons(X0,X1),X0) ),
inference(cnf_transformation,[],[f597]) ).
cnf(c_170,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssItem(X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| X0 = X2
| memberP(X1,X2) ),
inference(cnf_transformation,[],[f468]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f471]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f582]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_246,negated_conjecture,
( ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(cnf_transformation,[],[f601]) ).
cnf(c_247,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_248,negated_conjecture,
~ memberP(sK56,sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
memberP(sK55,sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_250,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f554]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f562]) ).
cnf(c_304,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_433,plain,
X0 = X0,
theory(equality) ).
cnf(c_435,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_440,plain,
( X0 != X1
| X2 != X3
| ~ memberP(X1,X3)
| memberP(X0,X2) ),
theory(equality) ).
cnf(c_488,plain,
( ~ ssItem(sK57)
| leq(sK57,sK57) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_556,plain,
( nil != X0
| sK56 != X0
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_435]) ).
cnf(c_557,plain,
( nil != nil
| sK56 != nil
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_556]) ).
cnf(c_558,plain,
( ~ memberP(sK55,sK57)
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(sK55)
| memberP(app(X0,sK55),sK57) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_559,plain,
( ~ memberP(sK55,sK57)
| ~ ssItem(sK57)
| ~ ssList(nil)
| ~ ssList(sK55)
| memberP(app(nil,sK55),sK57) ),
inference(instantiation,[status(thm)],[c_558]) ).
cnf(c_570,plain,
( X0 != sK55
| X1 != sK57
| ~ memberP(sK55,sK57)
| memberP(X0,X1) ),
inference(instantiation,[status(thm)],[c_440]) ).
cnf(c_656,plain,
( ~ leq(sK57,sK57)
| ~ ssItem(sK57)
| sK57 = sK57 ),
inference(instantiation,[status(thm)],[c_156]) ).
cnf(c_754,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_246,c_153]) ).
cnf(c_892,plain,
( X0 != app(X1,sK55)
| X2 != sK57
| ~ memberP(app(X1,sK55),sK57)
| memberP(X0,X2) ),
inference(instantiation,[status(thm)],[c_440]) ).
cnf(c_1010,plain,
( X0 != sK55
| sK57 != sK57
| ~ memberP(sK55,sK57)
| memberP(X0,sK57) ),
inference(instantiation,[status(thm)],[c_570]) ).
cnf(c_1012,plain,
( nil != sK55
| sK57 != sK57
| ~ memberP(sK55,sK57)
| memberP(nil,sK57) ),
inference(instantiation,[status(thm)],[c_1010]) ).
cnf(c_2770,plain,
( ~ ssList(X0)
| ~ ssList(sK56)
| sK56 = X0
| neq(sK56,X0) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_2771,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| neq(sK56,nil) ),
inference(instantiation,[status(thm)],[c_2770]) ).
cnf(c_2784,plain,
( ~ ssList(sK56)
| cons(hd(sK56),tl(sK56)) = sK56
| sK56 = nil ),
inference(instantiation,[status(thm)],[c_224]) ).
cnf(c_2793,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssList(tl(sK56)) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_2794,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssItem(hd(sK56)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_2802,plain,
sK56 = sK56,
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_6052,plain,
( ~ memberP(cons(X0,X1),sK57)
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssItem(sK57)
| X0 = sK57
| memberP(X1,sK57) ),
inference(instantiation,[status(thm)],[c_170]) ).
cnf(c_8215,plain,
( X0 != app(X1,sK55)
| sK57 != sK57
| ~ memberP(app(X1,sK55),sK57)
| memberP(X0,sK57) ),
inference(instantiation,[status(thm)],[c_892]) ).
cnf(c_8216,plain,
( nil != app(nil,sK55)
| sK57 != sK57
| ~ memberP(app(nil,sK55),sK57)
| memberP(nil,sK57) ),
inference(instantiation,[status(thm)],[c_8215]) ).
cnf(c_9191,plain,
( X0 != sK55
| nil != sK56
| nil = X0 ),
inference(resolution,[status(thm)],[c_435,c_247]) ).
cnf(c_9850,plain,
( X0 != sK55
| ~ ssItem(nil)
| ~ ssItem(sK56)
| nil = X0
| neq(nil,sK56) ),
inference(resolution,[status(thm)],[c_9191,c_49]) ).
cnf(c_9851,plain,
( X0 != sK55
| ~ ssList(nil)
| ~ ssList(sK56)
| nil = X0
| neq(nil,sK56) ),
inference(resolution,[status(thm)],[c_9191,c_138]) ).
cnf(c_9869,plain,
( X0 != sK55
| nil = X0
| neq(nil,sK56) ),
inference(global_subsumption_just,[status(thm)],[c_9850,c_253,c_141,c_9851]) ).
cnf(c_9908,plain,
( ~ ssList(sK55)
| nil = app(nil,sK55)
| neq(nil,sK56) ),
inference(resolution,[status(thm)],[c_9869,c_155]) ).
cnf(c_9988,plain,
( nil = app(nil,sK55)
| neq(nil,sK56) ),
inference(global_subsumption_just,[status(thm)],[c_9908,c_254,c_9908]) ).
cnf(c_11689,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ssList(cons(hd(sK56),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_11699,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ssList(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_11689]) ).
cnf(c_12384,plain,
( ~ memberP(nil,sK57)
| ~ ssItem(sK57) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_26769,plain,
( ~ memberP(cons(hd(sK56),X0),sK57)
| ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ~ ssItem(sK57)
| hd(sK56) = sK57
| memberP(X0,sK57) ),
inference(instantiation,[status(thm)],[c_6052]) ).
cnf(c_26804,plain,
( ~ memberP(cons(hd(sK56),nil),sK57)
| ~ ssItem(hd(sK56))
| ~ ssItem(sK57)
| ~ ssList(nil)
| hd(sK56) = sK57
| memberP(nil,sK57) ),
inference(instantiation,[status(thm)],[c_26769]) ).
cnf(c_41264,plain,
( X0 != cons(X1,X2)
| X3 != X1
| ~ memberP(cons(X1,X2),X1)
| memberP(X0,X3) ),
inference(instantiation,[status(thm)],[c_440]) ).
cnf(c_41266,plain,
( X0 != sK55
| X1 != sK57
| ~ memberP(sK55,sK57)
| memberP(X0,X1) ),
inference(instantiation,[status(thm)],[c_440]) ).
cnf(c_41417,plain,
( X0 != X1
| sK56 != X1
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_435]) ).
cnf(c_41570,plain,
( X0 != sK55
| sK57 != sK57
| ~ memberP(sK55,sK57)
| memberP(X0,sK57) ),
inference(instantiation,[status(thm)],[c_41266]) ).
cnf(c_42799,plain,
( sK56 != cons(X0,X1)
| sK57 != X0
| ~ memberP(cons(X0,X1),X0)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_41264]) ).
cnf(c_42907,plain,
( sK56 != X0
| sK57 != X1
| ~ memberP(X0,X1)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_440]) ).
cnf(c_43111,plain,
( ~ memberP(app(X0,X1),sK57)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK57)
| memberP(X0,sK57)
| memberP(X1,sK57) ),
inference(instantiation,[status(thm)],[c_167]) ).
cnf(c_43113,plain,
( ~ memberP(X0,sK57)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssItem(sK57)
| memberP(cons(X1,X0),sK57) ),
inference(instantiation,[status(thm)],[c_168]) ).
cnf(c_43202,plain,
( X0 != X1
| sK57 != X1
| sK57 = X0 ),
inference(instantiation,[status(thm)],[c_435]) ).
cnf(c_43761,plain,
( sK56 != X0
| sK57 != sK57
| ~ memberP(X0,sK57)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_42907]) ).
cnf(c_43959,plain,
( app(tl(sK56),cons(hd(sK56),nil)) != sK55
| sK57 != sK57
| ~ memberP(sK55,sK57)
| memberP(app(tl(sK56),cons(hd(sK56),nil)),sK57) ),
inference(instantiation,[status(thm)],[c_41570]) ).
cnf(c_48069,plain,
( X0 != sK57
| sK57 != sK57
| sK57 = X0 ),
inference(instantiation,[status(thm)],[c_43202]) ).
cnf(c_49005,plain,
( ~ memberP(app(tl(sK56),cons(hd(sK56),nil)),sK57)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| ~ ssItem(sK57)
| memberP(cons(hd(sK56),nil),sK57)
| memberP(tl(sK56),sK57) ),
inference(instantiation,[status(thm)],[c_43111]) ).
cnf(c_50734,plain,
( X0 != sK56
| sK56 != sK56
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_41417]) ).
cnf(c_53968,plain,
( ~ memberP(tl(sK56),sK57)
| ~ ssList(tl(sK56))
| ~ ssItem(X0)
| ~ ssItem(sK57)
| memberP(cons(X0,tl(sK56)),sK57) ),
inference(instantiation,[status(thm)],[c_43113]) ).
cnf(c_57962,plain,
( cons(hd(sK56),tl(sK56)) != sK56
| sK56 != sK56
| sK56 = cons(hd(sK56),tl(sK56)) ),
inference(instantiation,[status(thm)],[c_50734]) ).
cnf(c_64075,plain,
( sK56 != cons(hd(sK56),tl(sK56))
| sK57 != hd(sK56)
| ~ memberP(cons(hd(sK56),tl(sK56)),hd(sK56))
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_42799]) ).
cnf(c_64427,plain,
( sK56 != cons(X0,tl(sK56))
| sK57 != sK57
| ~ memberP(cons(X0,tl(sK56)),sK57)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_43761]) ).
cnf(c_65247,plain,
( ~ memberP(tl(sK56),sK57)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| ~ ssItem(sK57)
| memberP(cons(hd(sK56),tl(sK56)),sK57) ),
inference(instantiation,[status(thm)],[c_53968]) ).
cnf(c_65485,plain,
( hd(sK56) != sK57
| sK57 != sK57
| sK57 = hd(sK56) ),
inference(instantiation,[status(thm)],[c_48069]) ).
cnf(c_67867,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| memberP(cons(hd(sK56),tl(sK56)),hd(sK56)) ),
inference(instantiation,[status(thm)],[c_169]) ).
cnf(c_70098,plain,
( sK56 != cons(hd(sK56),tl(sK56))
| sK57 != sK57
| ~ memberP(cons(hd(sK56),tl(sK56)),sK57)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_64427]) ).
cnf(c_70099,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_70098,c_67867,c_65485,c_65247,c_64075,c_57962,c_49005,c_43959,c_26804,c_12384,c_11699,c_9988,c_8216,c_2802,c_2784,c_2793,c_2794,c_2771,c_1012,c_754,c_656,c_559,c_557,c_488,c_304,c_247,c_195,c_248,c_249,c_141,c_250,c_253,c_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWC395+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:21:14 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 76.58/11.30 % SZS status Started for theBenchmark.p
% 76.58/11.30 % SZS status Theorem for theBenchmark.p
% 76.58/11.30
% 76.58/11.30 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 76.58/11.30
% 76.58/11.30 ------ iProver source info
% 76.58/11.30
% 76.58/11.30 git: date: 2024-05-02 19:28:25 +0000
% 76.58/11.30 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 76.58/11.30 git: non_committed_changes: false
% 76.58/11.30
% 76.58/11.30 ------ Parsing...
% 76.58/11.30 ------ Clausification by vclausify_rel & Parsing by iProver...
% 76.58/11.30
% 76.58/11.30 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 1 0s sf_e
% 76.58/11.30
% 76.58/11.30 ------ Preprocessing...
% 76.58/11.30
% 76.58/11.30 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 76.58/11.30 ------ Proving...
% 76.58/11.30 ------ Problem Properties
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30 clauses 200
% 76.58/11.30 conjectures 7
% 76.58/11.30 EPR 68
% 76.58/11.30 Horn 130
% 76.58/11.30 unary 21
% 76.58/11.30 binary 49
% 76.58/11.30 lits 665
% 76.58/11.30 lits eq 83
% 76.58/11.30 fd_pure 0
% 76.58/11.30 fd_pseudo 0
% 76.58/11.30 fd_cond 21
% 76.58/11.30 fd_pseudo_cond 16
% 76.58/11.30 AC symbols 0
% 76.58/11.30
% 76.58/11.30 ------ Input Options Time Limit: Unbounded
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30 ------
% 76.58/11.30 Current options:
% 76.58/11.30 ------
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30 ------ Proving...
% 76.58/11.30
% 76.58/11.30
% 76.58/11.30 % SZS status Theorem for theBenchmark.p
% 76.58/11.30
% 76.58/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 76.58/11.30
% 76.58/11.31
%------------------------------------------------------------------------------