TSTP Solution File: SWC248+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 : Thu Aug 31 20:42:00 EDT 2023
% Result : Theorem 129.00s 19.41s
% Output : CNFRefutation 129.00s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f608)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
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(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
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(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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( leq(X16,X14)
& app(X17,cons(X16,nil)) = X2
& ssList(X17) )
& ssItem(X16) )
& app(cons(X14,nil),X15) = X9
& ssList(X15) )
& ssItem(X14) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3
| ~ ssList(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| 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] :
( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( leq(X16,X14)
& app(X17,cons(X16,nil)) = X2
& ssList(X17) )
& ssItem(X16) )
& app(cons(X14,nil),X15) = X9
& ssList(X15) )
& ssItem(X14) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3
| ~ ssList(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X8,X6)
& app(X9,cons(X8,nil)) = X2
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X4
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| ? [X14] :
( ? [X15] :
( ? [X16] :
( ! [X17] :
( leq(X14,X17)
| ~ lt(X14,X17)
| ~ memberP(X16,X17)
| ~ memberP(X15,X17)
| ~ ssItem(X17) )
& app(app(X15,cons(X14,nil)),X16) = X0
& ssList(X16) )
& ssList(X15) )
& ssItem(X14) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
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(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(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f246,f247]) ).
fof(f317,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
& ssList(sK49(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f318,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
=> ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f319,plain,
! [X0] :
( ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0))
& ssList(sK49(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK49,sK50])],[f125,f318,f317]) ).
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] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK57
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK57
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK57
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X14,X15,X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
=> ( ~ leq(X14,sK59(X14,X15,X16))
& lt(X14,sK59(X14,X15,X16))
& memberP(X16,sK59(X14,X15,X16))
& memberP(X15,sK59(X14,X15,X16))
& ssItem(sK59(X14,X15,X16)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( nil != sK55
| nil = sK56 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK57
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58)
& ssList(sK57)
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ( ~ leq(X14,sK59(X14,X15,X16))
& lt(X14,sK59(X14,X15,X16))
& memberP(X16,sK59(X14,X15,X16))
& memberP(X15,sK59(X14,X15,X16))
& ssItem(sK59(X14,X15,X16)) )
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f363,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f364,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f365,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f442,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f443,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f447,plain,
! [X0] :
( ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f448,plain,
! [X0] :
( ssItem(sK50(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f449,plain,
! [X0] :
( cons(sK50(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f319]) ).
fof(f455,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f457,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f473,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f497,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f498,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f550,plain,
ssList(sK53),
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
nil != sK53,
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
! [X16,X14,X15] :
( ssItem(sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
! [X16,X14,X15] :
( memberP(X15,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f350]) ).
fof(f572,plain,
! [X16,X14,X15] :
( memberP(X15,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK55
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f558,f555]) ).
fof(f573,plain,
! [X16,X14,X15] :
( ssItem(sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK55
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f557,f555]) ).
fof(f574,plain,
nil != sK55,
inference(definition_unfolding,[],[f556,f555]) ).
fof(f576,plain,
ssList(sK55),
inference(definition_unfolding,[],[f550,f555]) ).
fof(f580,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f365]) ).
fof(f596,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f498]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f580]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f364]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f363]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f442]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f443]) ).
cnf(c_145,plain,
( ~ ssList(X0)
| cons(sK50(X0),sK49(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_146,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK50(X0)) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_147,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK49(X0)) ),
inference(cnf_transformation,[],[f447]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f457]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f473]) ).
cnf(c_177,plain,
( ~ frontsegP(X0,X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(cons(X2,X0),cons(X2,X1)) ),
inference(cnf_transformation,[],[f608]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f497]) ).
cnf(c_256,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sK59(X1,X0,X2)) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_257,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ssItem(sK59(X1,X0,X2)) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_258,negated_conjecture,
nil != sK55,
inference(cnf_transformation,[],[f574]) ).
cnf(c_262,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f576]) ).
cnf(c_312,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_599,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_6860,plain,
X0 = X0,
theory(equality) ).
cnf(c_6862,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_6869,plain,
( X0 != X1
| X2 != X3
| ~ frontsegP(X1,X3)
| frontsegP(X0,X2) ),
theory(equality) ).
cnf(c_10227,plain,
( nil != X0
| sK55 != X0
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_6862]) ).
cnf(c_10228,plain,
( nil != nil
| sK55 != nil
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_10227]) ).
cnf(c_10321,plain,
( ~ ssList(sK55)
| cons(sK50(sK55),sK49(sK55)) = sK55
| sK55 = nil ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_10331,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssList(sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_10332,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssItem(sK50(sK55)) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_10338,plain,
( X0 != X1
| sK55 != X1
| sK55 = X0 ),
inference(instantiation,[status(thm)],[c_6862]) ).
cnf(c_11534,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ssList(cons(sK50(sK55),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_11541,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssList(cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_11534]) ).
cnf(c_11722,plain,
sK55 = sK55,
inference(instantiation,[status(thm)],[c_6860]) ).
cnf(c_16228,plain,
( X0 != sK55
| sK55 != sK55
| sK55 = X0 ),
inference(instantiation,[status(thm)],[c_10338]) ).
cnf(c_16358,plain,
( ~ ssList(cons(X0,X1))
| ~ ssList(X2)
| ssList(app(X2,cons(X0,X1))) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_20269,plain,
( ~ ssList(cons(sK50(sK55),X0))
| ~ ssList(X1)
| ssList(app(X1,cons(sK50(sK55),X0))) ),
inference(instantiation,[status(thm)],[c_16358]) ).
cnf(c_20270,plain,
( ~ ssList(cons(sK50(sK55),nil))
| ~ ssList(nil)
| ssList(app(nil,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_20269]) ).
cnf(c_23386,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| sK55 != sK55
| sK55 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_16228]) ).
cnf(c_25575,plain,
( ~ ssList(cons(X0,X1))
| app(nil,cons(X0,X1)) = cons(X0,X1) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_49843,plain,
( ~ ssList(cons(sK50(sK55),X0))
| app(nil,cons(sK50(sK55),X0)) = cons(sK50(sK55),X0) ),
inference(instantiation,[status(thm)],[c_25575]) ).
cnf(c_49844,plain,
( ~ ssList(cons(sK50(sK55),nil))
| app(nil,cons(sK50(sK55),nil)) = cons(sK50(sK55),nil) ),
inference(instantiation,[status(thm)],[c_49843]) ).
cnf(c_58345,plain,
( ~ ssList(X0)
| app(nil,sK49(X0)) = sK49(X0)
| X0 = nil ),
inference(superposition,[status(thm)],[c_147,c_155]) ).
cnf(c_58793,plain,
( app(nil,sK49(sK55)) = sK49(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_262,c_58345]) ).
cnf(c_58963,plain,
app(nil,sK49(sK55)) = sK49(sK55),
inference(global_subsumption_just,[status(thm)],[c_58793,c_258,c_58793]) ).
cnf(c_58988,plain,
( ~ ssList(sK49(sK55))
| ~ ssList(nil)
| frontsegP(sK49(sK55),nil) ),
inference(superposition,[status(thm)],[c_58963,c_599]) ).
cnf(c_60287,plain,
( app(app(X0,cons(sK50(sK55),nil)),X1) != sK55
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sK59(sK50(sK55),X0,X1)) ),
inference(instantiation,[status(thm)],[c_256]) ).
cnf(c_60291,plain,
( app(app(X0,cons(sK50(sK55),nil)),X1) != sK55
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sK59(sK50(sK55),X0,X1)) ),
inference(instantiation,[status(thm)],[c_257]) ).
cnf(c_62591,plain,
( ~ frontsegP(sK55,app(X0,cons(X1,nil)))
| ~ ssList(app(X0,cons(X1,nil)))
| ~ ssList(sK55)
| app(app(X0,cons(X1,nil)),sK11(sK55,app(X0,cons(X1,nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_64591,plain,
( app(X0,cons(X1,nil)) != X2
| sK55 != X3
| ~ frontsegP(X3,X2)
| frontsegP(sK55,app(X0,cons(X1,nil))) ),
inference(instantiation,[status(thm)],[c_6869]) ).
cnf(c_66214,plain,
( ~ frontsegP(sK55,app(X0,cons(X1,nil)))
| ~ ssList(app(X0,cons(X1,nil)))
| ~ ssList(sK55)
| ssList(sK11(sK55,app(X0,cons(X1,nil)))) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_77181,plain,
( ~ frontsegP(sK55,app(X0,cons(sK50(sK55),nil)))
| ~ ssList(app(X0,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_62591]) ).
cnf(c_77183,plain,
( app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| memberP(X0,sK59(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_60287]) ).
cnf(c_77184,plain,
( app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ssItem(sK59(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_60291]) ).
cnf(c_77186,plain,
( ~ frontsegP(sK55,app(nil,cons(sK50(sK55),nil)))
| ~ ssList(app(nil,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_77181]) ).
cnf(c_77188,plain,
( app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssItem(sK59(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_77184]) ).
cnf(c_77189,plain,
( app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| memberP(nil,sK59(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_77183]) ).
cnf(c_82332,plain,
( ~ frontsegP(sK55,app(X0,cons(sK50(sK55),nil)))
| ~ ssList(app(X0,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil)))) ),
inference(instantiation,[status(thm)],[c_66214]) ).
cnf(c_82333,plain,
( ~ frontsegP(sK55,app(nil,cons(sK50(sK55),nil)))
| ~ ssList(app(nil,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil)))) ),
inference(instantiation,[status(thm)],[c_82332]) ).
cnf(c_85613,plain,
( app(X0,cons(X1,nil)) != X2
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),X2)
| frontsegP(sK55,app(X0,cons(X1,nil))) ),
inference(instantiation,[status(thm)],[c_64591]) ).
cnf(c_114816,plain,
( ~ frontsegP(sK49(sK55),X0)
| ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| ~ ssList(X0)
| frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),X0)) ),
inference(instantiation,[status(thm)],[c_177]) ).
cnf(c_114818,plain,
( ~ frontsegP(sK49(sK55),nil)
| ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| ~ ssList(nil)
| frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_114816]) ).
cnf(c_165652,plain,
( app(nil,cons(X0,nil)) != cons(X0,nil)
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),cons(X0,nil))
| frontsegP(sK55,app(nil,cons(X0,nil))) ),
inference(instantiation,[status(thm)],[c_85613]) ).
cnf(c_175244,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),nil))
| frontsegP(sK55,app(nil,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_165652]) ).
cnf(c_248346,plain,
( ~ memberP(nil,sK59(X0,X1,sK11(sK55,app(X1,cons(X0,nil)))))
| ~ ssItem(sK59(X0,X1,sK11(sK55,app(X1,cons(X0,nil))))) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_259763,plain,
( ~ memberP(nil,sK59(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil)))))
| ~ ssItem(sK59(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_248346]) ).
cnf(c_259764,plain,
( ~ memberP(nil,sK59(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil)))))
| ~ ssItem(sK59(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_259763]) ).
cnf(c_259765,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_259764,c_175244,c_114818,c_82333,c_77189,c_77188,c_77186,c_58988,c_49844,c_23386,c_20270,c_11722,c_11541,c_10321,c_10331,c_10332,c_10228,c_312,c_195,c_258,c_141,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 15:28:15 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 129.00/19.41 % SZS status Started for theBenchmark.p
% 129.00/19.41 % SZS status Theorem for theBenchmark.p
% 129.00/19.41
% 129.00/19.41 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 129.00/19.41
% 129.00/19.41 ------ iProver source info
% 129.00/19.41
% 129.00/19.41 git: date: 2023-05-31 18:12:56 +0000
% 129.00/19.41 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 129.00/19.41 git: non_committed_changes: false
% 129.00/19.41 git: last_make_outside_of_git: false
% 129.00/19.41
% 129.00/19.41 ------ Parsing...
% 129.00/19.41 ------ Clausification by vclausify_rel & Parsing by iProver...
% 129.00/19.41
% 129.00/19.41 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 129.00/19.41
% 129.00/19.41 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 129.00/19.41
% 129.00/19.41 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 129.00/19.41 ------ Proving...
% 129.00/19.41 ------ Problem Properties
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41 clauses 194
% 129.00/19.41 conjectures 14
% 129.00/19.41 EPR 55
% 129.00/19.41 Horn 126
% 129.00/19.41 unary 23
% 129.00/19.41 binary 40
% 129.00/19.41 lits 664
% 129.00/19.41 lits eq 89
% 129.00/19.41 fd_pure 0
% 129.00/19.41 fd_pseudo 0
% 129.00/19.41 fd_cond 21
% 129.00/19.41 fd_pseudo_cond 14
% 129.00/19.41 AC symbols 0
% 129.00/19.41
% 129.00/19.41 ------ Input Options Time Limit: Unbounded
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41 ------
% 129.00/19.41 Current options:
% 129.00/19.41 ------
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41 ------ Proving...
% 129.00/19.41
% 129.00/19.41
% 129.00/19.41 % SZS status Theorem for theBenchmark.p
% 129.00/19.41
% 129.00/19.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 129.00/19.41
% 129.00/19.41
%------------------------------------------------------------------------------