TSTP Solution File: SWC272+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC272+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:49 EDT 2024
% Result : Theorem 28.51s 4.73s
% Output : CNFRefutation 28.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 78 ( 11 unt; 0 def)
% Number of atoms : 648 ( 144 equ)
% Maximal formula atoms : 38 ( 8 avg)
% Number of connectives : 876 ( 306 ~; 279 |; 246 &)
% ( 8 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 298 ( 0 sgn 168 !; 108 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| totalorderedP(X0)
| ! [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3
| ~ ssList(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] :
( ( nil = X2
& nil != X3 )
| totalorderedP(X0)
| ! [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3
| ~ ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f110,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f111,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f113,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f216,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(X0)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f284,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f285,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f284]) ).
fof(f286,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),X2)
& app(app(X3,cons(sK30(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(sK30(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
! [X0] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),X2)
& app(app(X3,cons(sK30(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(X3,cons(sK30(X0),X4)),cons(sK31(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(sK31(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
! [X0] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(X3,cons(sK30(X0),X4)),cons(sK31(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),X4)),cons(sK31(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(sK32(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f289,plain,
! [X0] :
( ? [X4] :
( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),X4)),cons(sK31(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),X5)) = X0
& ssList(X5) )
& ssList(sK33(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f290,plain,
! [X0] :
( ? [X5] :
( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),X5)) = X0
& ssList(X5) )
=> ( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
& ssList(sK34(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f291,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK30(X0),sK31(X0))
& app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
& ssList(sK34(X0))
& ssList(sK33(X0))
& ssList(sK32(X0))
& ssItem(sK31(X0))
& ssItem(sK30(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK30,sK31,sK32,sK33,sK34])],[f285,f290,f289,f288,f287,f286]) ).
fof(f292,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f113]) ).
fof(f293,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f292]) ).
fof(f294,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),X2)
& app(app(X3,cons(sK35(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(sK35(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f295,plain,
! [X0] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),X2)
& app(app(X3,cons(sK35(X0),X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(X3,cons(sK35(X0),X4)),cons(sK36(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(sK36(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f296,plain,
! [X0] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(X3,cons(sK35(X0),X4)),cons(sK36(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),X4)),cons(sK36(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(sK37(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f297,plain,
! [X0] :
( ? [X4] :
( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),X4)),cons(sK36(X0),X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),sK38(X0))),cons(sK36(X0),X5)) = X0
& ssList(X5) )
& ssList(sK38(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f298,plain,
! [X0] :
( ? [X5] :
( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),sK38(X0))),cons(sK36(X0),X5)) = X0
& ssList(X5) )
=> ( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),sK38(X0))),cons(sK36(X0),sK39(X0))) = X0
& ssList(sK39(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f299,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK35(X0),sK36(X0))
& app(app(sK37(X0),cons(sK35(X0),sK38(X0))),cons(sK36(X0),sK39(X0))) = X0
& ssList(sK39(X0))
& ssList(sK38(X0))
& ssList(sK37(X0))
& ssItem(sK36(X0))
& ssItem(sK35(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38,sK39])],[f293,f298,f297,f296,f295,f294]) ).
fof(f340,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,[],[f216]) ).
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(flattening,[],[f340]) ).
fof(f342,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(X0)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ~ totalorderedP(sK53)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( nil != sK55
| nil = sK56 )
& ~ totalorderedP(sK53)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& ssList(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])],[f221,f346,f345,f344,f343,f342]) ).
fof(f407,plain,
! [X0] :
( totalorderedP(X0)
| ssItem(sK30(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f408,plain,
! [X0] :
( totalorderedP(X0)
| ssItem(sK31(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f409,plain,
! [X0] :
( totalorderedP(X0)
| ssList(sK32(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f410,plain,
! [X0] :
( totalorderedP(X0)
| ssList(sK33(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f411,plain,
! [X0] :
( totalorderedP(X0)
| ssList(sK34(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f412,plain,
! [X0] :
( totalorderedP(X0)
| app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f413,plain,
! [X0] :
( totalorderedP(X0)
| ~ leq(sK30(X0),sK31(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f291]) ).
fof(f414,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f299]) ).
fof(f543,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f341]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
strictorderedP(sK55),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
~ totalorderedP(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
~ totalorderedP(sK55),
inference(definition_unfolding,[],[f557,f552]) ).
fof(f561,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f572,plain,
! [X10,X8,X6,X9,X7] :
( lt(X6,X7)
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f414]) ).
cnf(c_107,plain,
( ~ leq(sK30(X0),sK31(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f413]) ).
cnf(c_108,plain,
( ~ ssList(X0)
| app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f412]) ).
cnf(c_109,plain,
( ~ ssList(X0)
| ssList(sK34(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f411]) ).
cnf(c_110,plain,
( ~ ssList(X0)
| ssList(sK33(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f410]) ).
cnf(c_111,plain,
( ~ ssList(X0)
| ssList(sK32(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f409]) ).
cnf(c_112,plain,
( ~ ssList(X0)
| ssItem(sK31(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f408]) ).
cnf(c_113,plain,
( ~ ssList(X0)
| ssItem(sK30(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f407]) ).
cnf(c_122,plain,
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| lt(X1,X3) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_242,plain,
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f543]) ).
cnf(c_247,negated_conjecture,
~ totalorderedP(sK55),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
strictorderedP(sK55),
inference(cnf_transformation,[],[f555]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f561]) ).
cnf(c_586,plain,
( X0 != X1
| ~ strictorderedP(X1)
| strictorderedP(X0) ),
theory(equality) ).
cnf(c_710,plain,
( ~ ssList(sK55)
| ssList(sK34(sK55))
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_711,plain,
( ~ ssList(sK55)
| ssList(sK33(sK55))
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_110]) ).
cnf(c_712,plain,
( ~ ssList(sK55)
| ssList(sK32(sK55))
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_111]) ).
cnf(c_713,plain,
( ~ ssList(sK55)
| ssItem(sK31(sK55))
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_714,plain,
( ~ ssList(sK55)
| ssItem(sK30(sK55))
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_113]) ).
cnf(c_765,plain,
( ~ ssList(sK55)
| app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))) = sK55
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_108]) ).
cnf(c_15123,plain,
( app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))) = sK55
| totalorderedP(sK55) ),
inference(superposition,[status(thm)],[c_255,c_108]) ).
cnf(c_15574,plain,
( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
| ~ strictorderedP(X5)
| strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(instantiation,[status(thm)],[c_586]) ).
cnf(c_24798,plain,
app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))) = sK55,
inference(global_subsumption_just,[status(thm)],[c_15123,c_255,c_247,c_765]) ).
cnf(c_24825,plain,
( ~ strictorderedP(app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))))
| ~ ssItem(sK30(sK55))
| ~ ssItem(sK31(sK55))
| ~ ssList(sK32(sK55))
| ~ ssList(sK33(sK55))
| ~ ssList(sK34(sK55))
| ~ ssList(sK55)
| lt(sK30(sK55),sK31(sK55)) ),
inference(superposition,[status(thm)],[c_24798,c_122]) ).
cnf(c_33920,plain,
( ~ leq(sK30(sK55),sK31(sK55))
| ~ ssList(sK55)
| totalorderedP(sK55) ),
inference(instantiation,[status(thm)],[c_107]) ).
cnf(c_34368,plain,
( app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))) != sK55
| ~ strictorderedP(sK55)
| strictorderedP(app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55)))) ),
inference(instantiation,[status(thm)],[c_15574]) ).
cnf(c_35242,plain,
( ~ lt(sK30(sK55),sK31(sK55))
| ~ ssItem(sK30(sK55))
| ~ ssItem(sK31(sK55))
| leq(sK30(sK55),sK31(sK55)) ),
inference(instantiation,[status(thm)],[c_242]) ).
cnf(c_35244,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_35242,c_34368,c_33920,c_24825,c_765,c_714,c_713,c_712,c_711,c_710,c_247,c_249,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC272+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:26:49 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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
% 28.51/4.73 % SZS status Started for theBenchmark.p
% 28.51/4.73 % SZS status Theorem for theBenchmark.p
% 28.51/4.73
% 28.51/4.73 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 28.51/4.73
% 28.51/4.73 ------ iProver source info
% 28.51/4.73
% 28.51/4.73 git: date: 2024-05-02 19:28:25 +0000
% 28.51/4.73 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 28.51/4.73 git: non_committed_changes: false
% 28.51/4.73
% 28.51/4.73 ------ Parsing...
% 28.51/4.73 ------ Clausification by vclausify_rel & Parsing by iProver...
% 28.51/4.73
% 28.51/4.73 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e sup_sim: 0 sf_s rm: 1 0s sf_e
% 28.51/4.73
% 28.51/4.73 ------ Preprocessing...
% 28.51/4.73
% 28.51/4.73 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 28.51/4.73 ------ Proving...
% 28.51/4.73 ------ Problem Properties
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73 clauses 201
% 28.51/4.73 conjectures 20
% 28.51/4.73 EPR 68
% 28.51/4.73 Horn 131
% 28.51/4.73 unary 22
% 28.51/4.73 binary 49
% 28.51/4.73 lits 666
% 28.51/4.73 lits eq 85
% 28.51/4.73 fd_pure 0
% 28.51/4.73 fd_pseudo 0
% 28.51/4.73 fd_cond 21
% 28.51/4.73 fd_pseudo_cond 16
% 28.51/4.73 AC symbols 0
% 28.51/4.73
% 28.51/4.73 ------ Input Options Time Limit: Unbounded
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73 ------
% 28.51/4.73 Current options:
% 28.51/4.73 ------
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73 ------ Proving...
% 28.51/4.73
% 28.51/4.73
% 28.51/4.73 % SZS status Theorem for theBenchmark.p
% 28.51/4.73
% 28.51/4.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 28.51/4.73
% 28.51/4.73
%------------------------------------------------------------------------------