TSTP Solution File: SWC248+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:11:44 EDT 2024
% Result : Theorem 228.07s 30.77s
% Output : CNFRefutation 228.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 121 ( 17 unt; 0 def)
% Number of atoms : 875 ( 298 equ)
% Maximal formula atoms : 72 ( 7 avg)
% Number of connectives : 1245 ( 491 ~; 455 |; 265 &)
% ( 2 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 404 ( 0 sgn 227 !; 95 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
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/sandbox/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(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(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f217,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
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(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(f341,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f217]) ).
fof(f342,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| ~ leq(X0,X1)
| X0 = X1 )
& ( ( leq(X0,X1)
& X0 != X1 )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f341]) ).
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(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(f531,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f536,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f546,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f342]) ).
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(f560,plain,
! [X16,X14,X15] :
( lt(X14,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
! [X16,X14,X15] :
( ~ leq(X14,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK53
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f350]) ).
fof(f569,plain,
! [X16,X14,X15] :
( ~ leq(X14,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK55
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f561,f555]) ).
fof(f570,plain,
! [X16,X14,X15] :
( lt(X14,sK59(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK55
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f560,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]) ).
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_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f531]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f536]) ).
cnf(c_242,plain,
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f546]) ).
cnf(c_253,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ leq(X1,sK59(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_254,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| lt(X1,sK59(X1,X0,X2)) ),
inference(cnf_transformation,[],[f570]) ).
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_9128,negated_conjecture,
ssList(sK55),
inference(subtyping,[status(esa)],[c_262]) ).
cnf(c_9130,negated_conjecture,
nil != sK55,
inference(subtyping,[status(esa)],[c_258]) ).
cnf(c_9131,negated_conjecture,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK55
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssItem(sK59(X0_14,X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_257]) ).
cnf(c_9134,negated_conjecture,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK55
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| lt(X0_14,sK59(X0_14,X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_254]) ).
cnf(c_9135,negated_conjecture,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK55
| ~ leq(X0_14,sK59(X0_14,X0_13,X1_13))
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13) ),
inference(subtyping,[status(esa)],[c_253]) ).
cnf(c_9144,plain,
( ~ lt(X0_14,X1_14)
| ~ ssItem(X0_14)
| ~ ssItem(X1_14)
| leq(X0_14,X1_14) ),
inference(subtyping,[status(esa)],[c_242]) ).
cnf(c_9153,plain,
( ~ ssList(X0_13)
| app(X0_13,nil) = X0_13 ),
inference(subtyping,[status(esa)],[c_232]) ).
cnf(c_9157,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| app(cons(X0_14,nil),X0_13) = cons(X0_14,X0_13) ),
inference(subtyping,[status(esa)],[c_227]) ).
cnf(c_9218,plain,
( ~ ssList(X0_13)
| app(nil,X0_13) = X0_13 ),
inference(subtyping,[status(esa)],[c_155]) ).
cnf(c_9220,plain,
( ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssList(app(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_153]) ).
cnf(c_9226,plain,
( ~ ssList(X0_13)
| X0_13 = nil
| ssList(sK49(X0_13)) ),
inference(subtyping,[status(esa)],[c_147]) ).
cnf(c_9227,plain,
( ~ ssList(X0_13)
| X0_13 = nil
| ssItem(sK50(X0_13)) ),
inference(subtyping,[status(esa)],[c_146]) ).
cnf(c_9228,plain,
( ~ ssList(X0_13)
| cons(sK50(X0_13),sK49(X0_13)) = X0_13
| X0_13 = nil ),
inference(subtyping,[status(esa)],[c_145]) ).
cnf(c_9233,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ssList(cons(X0_14,X0_13)) ),
inference(subtyping,[status(esa)],[c_140]) ).
cnf(c_9311,plain,
X0_13 = X0_13,
theory(equality) ).
cnf(c_9313,plain,
( X0_13 != X1_13
| X2_13 != X1_13
| X2_13 = X0_13 ),
theory(equality) ).
cnf(c_9317,plain,
( X0_13 != X1_13
| X2_13 != X3_13
| app(X0_13,X2_13) = app(X1_13,X3_13) ),
theory(equality) ).
cnf(c_9340,plain,
nil = nil,
inference(instantiation,[status(thm)],[c_9311]) ).
cnf(c_12372,plain,
( nil != X0_13
| sK55 != X0_13
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_9313]) ).
cnf(c_12373,plain,
( nil != nil
| sK55 != nil
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_12372]) ).
cnf(c_12784,plain,
( ~ ssList(sK55)
| cons(sK50(sK55),sK49(sK55)) = sK55
| sK55 = nil ),
inference(instantiation,[status(thm)],[c_9228]) ).
cnf(c_12789,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssItem(sK50(sK55)) ),
inference(instantiation,[status(thm)],[c_9227]) ).
cnf(c_12790,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssList(sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_9226]) ).
cnf(c_14582,plain,
( cons(X0_14,X0_13) != X1_13
| X2_13 != X1_13
| X2_13 = cons(X0_14,X0_13) ),
inference(instantiation,[status(thm)],[c_9313]) ).
cnf(c_16276,plain,
sK55 = sK55,
inference(instantiation,[status(thm)],[c_9311]) ).
cnf(c_21766,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| X0_13 != sK55
| X0_13 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_14582]) ).
cnf(c_25989,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| sK55 != sK55
| sK55 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_21766]) ).
cnf(c_48522,plain,
( ~ ssList(X0_13)
| app(sK49(X0_13),nil) = sK49(X0_13)
| X0_13 = nil ),
inference(superposition,[status(thm)],[c_9226,c_9153]) ).
cnf(c_49731,plain,
( app(sK49(sK55),nil) = sK49(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_9128,c_48522]) ).
cnf(c_49764,plain,
app(sK49(sK55),nil) = sK49(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_49731,c_9130]) ).
cnf(c_93909,plain,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != X2_13
| sK55 != X2_13
| app(app(X0_13,cons(X0_14,nil)),X1_13) = sK55 ),
inference(instantiation,[status(thm)],[c_9313]) ).
cnf(c_94137,plain,
( X0_13 != X1_13
| sK55 != X1_13
| sK55 = X0_13 ),
inference(instantiation,[status(thm)],[c_9313]) ).
cnf(c_94604,plain,
( ~ ssList(cons(X0_14,X0_13))
| app(nil,cons(X0_14,X0_13)) = cons(X0_14,X0_13) ),
inference(instantiation,[status(thm)],[c_9218]) ).
cnf(c_96569,plain,
( app(X0_13,cons(X0_14,nil)) != X1_13
| X2_13 != X3_13
| app(app(X0_13,cons(X0_14,nil)),X2_13) = app(X1_13,X3_13) ),
inference(instantiation,[status(thm)],[c_9317]) ).
cnf(c_105115,plain,
( app(nil,cons(X0_14,nil)) != cons(X0_14,nil)
| X0_13 != X1_13
| app(app(nil,cons(X0_14,nil)),X0_13) = app(cons(X0_14,nil),X1_13) ),
inference(instantiation,[status(thm)],[c_96569]) ).
cnf(c_124006,plain,
( ~ ssList(cons(sK50(sK55),X0_13))
| app(nil,cons(sK50(sK55),X0_13)) = cons(sK50(sK55),X0_13) ),
inference(instantiation,[status(thm)],[c_94604]) ).
cnf(c_124008,plain,
( ~ ssList(cons(sK50(sK55),nil))
| app(nil,cons(sK50(sK55),nil)) = cons(sK50(sK55),nil) ),
inference(instantiation,[status(thm)],[c_124006]) ).
cnf(c_127631,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssList(cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_9233]) ).
cnf(c_160696,plain,
( X0_13 != cons(sK50(sK55),sK49(sK55))
| sK55 != cons(sK50(sK55),sK49(sK55))
| sK55 = X0_13 ),
inference(instantiation,[status(thm)],[c_94137]) ).
cnf(c_165073,plain,
( app(cons(sK50(sK55),nil),sK49(sK55)) != cons(sK50(sK55),sK49(sK55))
| sK55 != cons(sK50(sK55),sK49(sK55))
| sK55 = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_160696]) ).
cnf(c_165074,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| app(cons(sK50(sK55),nil),sK49(sK55)) = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_9157]) ).
cnf(c_189140,plain,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(X0_13,cons(X0_14,nil)),X1_13) = sK55 ),
inference(instantiation,[status(thm)],[c_93909]) ).
cnf(c_190355,plain,
( app(app(nil,cons(sK50(sK55),nil)),X0_13) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(nil,cons(sK50(sK55),nil)),X0_13) = sK55 ),
inference(instantiation,[status(thm)],[c_189140]) ).
cnf(c_190356,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| X0_13 != sK49(sK55)
| app(app(nil,cons(sK50(sK55),nil)),X0_13) = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_105115]) ).
cnf(c_197246,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| app(sK49(sK55),nil) != sK49(sK55)
| app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_190356]) ).
cnf(c_272565,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) = sK55 ),
inference(instantiation,[status(thm)],[c_190355]) ).
cnf(c_302016,plain,
( ~ ssList(sK49(sK55))
| ~ ssList(nil)
| ssList(app(sK49(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_9220]) ).
cnf(c_435357,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != sK55
| ~ leq(sK50(sK55),sK59(sK50(sK55),nil,app(sK49(sK55),nil)))
| ~ ssList(app(sK49(sK55),nil))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_9135]) ).
cnf(c_435358,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != sK55
| ~ ssList(app(sK49(sK55),nil))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| lt(sK50(sK55),sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9134]) ).
cnf(c_435361,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != sK55
| ~ ssList(app(sK49(sK55),nil))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssItem(sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9131]) ).
cnf(c_435549,plain,
( ~ lt(sK50(sK55),sK59(sK50(sK55),nil,app(sK49(sK55),nil)))
| ~ ssItem(sK59(sK50(sK55),nil,app(sK49(sK55),nil)))
| ~ ssItem(sK50(sK55))
| leq(sK50(sK55),sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9144]) ).
cnf(c_435550,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_435549,c_435357,c_435358,c_435361,c_302016,c_272565,c_197246,c_165074,c_165073,c_127631,c_124008,c_49764,c_25989,c_16276,c_12784,c_12789,c_12790,c_12373,c_9130,c_9340,c_141,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 23:22:35 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 228.07/30.77 % SZS status Started for theBenchmark.p
% 228.07/30.77 % SZS status Theorem for theBenchmark.p
% 228.07/30.77
% 228.07/30.77 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 228.07/30.77
% 228.07/30.77 ------ iProver source info
% 228.07/30.77
% 228.07/30.77 git: date: 2024-05-02 19:28:25 +0000
% 228.07/30.77 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 228.07/30.77 git: non_committed_changes: false
% 228.07/30.77
% 228.07/30.77 ------ Parsing...
% 228.07/30.77 ------ Clausification by vclausify_rel & Parsing by iProver...
% 228.07/30.77
% 228.07/30.77 ------ 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
% 228.07/30.77
% 228.07/30.77 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 228.07/30.77
% 228.07/30.77 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 228.07/30.77 ------ Proving...
% 228.07/30.77 ------ Problem Properties
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77 clauses 194
% 228.07/30.77 conjectures 14
% 228.07/30.77 EPR 55
% 228.07/30.77 Horn 126
% 228.07/30.77 unary 23
% 228.07/30.77 binary 40
% 228.07/30.77 lits 664
% 228.07/30.77 lits eq 89
% 228.07/30.77 fd_pure 0
% 228.07/30.77 fd_pseudo 0
% 228.07/30.77 fd_cond 21
% 228.07/30.77 fd_pseudo_cond 14
% 228.07/30.77 AC symbols 0
% 228.07/30.77
% 228.07/30.77 ------ Input Options Time Limit: Unbounded
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77 ------
% 228.07/30.77 Current options:
% 228.07/30.77 ------
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77 ------ Proving...
% 228.07/30.77
% 228.07/30.77
% 228.07/30.77 % SZS status Theorem for theBenchmark.p
% 228.07/30.77
% 228.07/30.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 228.07/30.78
% 228.07/30.79
%------------------------------------------------------------------------------