TSTP Solution File: SWC240+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC240+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:41:56 EDT 2023
% Result : Theorem 4.24s 1.18s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f602)
% 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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
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(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] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ? [X9] :
( memberP(X2,X9)
& X8 != X9
& ssItem(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ? [X9] :
( memberP(X2,X9)
& X8 != X9
& ssItem(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ? [X5] :
( memberP(X2,X5)
& X4 != X5
& ssItem(X5) ) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ! [X9] :
( ssItem(X9)
=> ( leq(X6,X9)
| ~ lt(X6,X9)
| ~ memberP(X8,X9)
| ~ memberP(X7,X9) ) )
& app(app(X7,cons(X6,nil)),X8) = X0
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f187,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f188,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f187]) ).
fof(f189,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f190,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f189]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
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] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f336,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
! [X0] :
( ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51])],[f188,f336]) ).
fof(f338,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
=> ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f339,plain,
! [X0] :
( ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52])],[f190,f338]) ).
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(nnf_transformation,[],[f217]) ).
fof(f343,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,[],[f342]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != X0
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(X2,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(sK55,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ memberP(sK55,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ memberP(sK55,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ! [X5] :
( ~ memberP(sK55,X5)
| X4 = X5
| ~ ssItem(X5) )
& ssItem(X4) )
=> ( ! [X5] :
( ~ memberP(sK55,X5)
| sK57 = X5
| ~ ssItem(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X6,X7,X8] :
( ? [X9] :
( ~ leq(X6,X9)
& lt(X6,X9)
& memberP(X8,X9)
& memberP(X7,X9)
& ssItem(X9) )
=> ( ~ leq(X6,sK58(X6,X7,X8))
& lt(X6,sK58(X6,X7,X8))
& memberP(X8,sK58(X6,X7,X8))
& memberP(X7,sK58(X6,X7,X8))
& ssItem(sK58(X6,X7,X8)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ! [X5] :
( ~ memberP(sK55,X5)
| sK57 = X5
| ~ ssItem(X5) )
& ssItem(sK57)
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ( ~ leq(X6,sK58(X6,X7,X8))
& lt(X6,sK58(X6,X7,X8))
& memberP(X8,sK58(X6,X7,X8))
& memberP(X7,sK58(X6,X7,X8))
& ssItem(sK58(X6,X7,X8)) )
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& 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])],[f223,f349,f348,f347,f346,f345,f344]) ).
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(f457,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f523,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f524,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f525,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f526,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f528,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f531,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f546,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f343]) ).
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,
! [X8,X6,X7] :
( ssItem(sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
! [X8,X6,X7] :
( lt(X6,sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
! [X8,X6,X7] :
( ~ leq(X6,sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK53
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f563,plain,
! [X5] :
( ~ memberP(sK55,X5)
| sK57 = X5
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f350]) ).
fof(f564,plain,
! [X8,X6,X7] :
( ~ leq(X6,sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK55
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f561,f555]) ).
fof(f565,plain,
! [X8,X6,X7] :
( lt(X6,sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK55
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f560,f555]) ).
fof(f568,plain,
! [X8,X6,X7] :
( ssItem(sK58(X6,X7,X8))
| app(app(X7,cons(X6,nil)),X8) != sK55
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f557,f555]) ).
fof(f569,plain,
nil != sK55,
inference(definition_unfolding,[],[f556,f555]) ).
fof(f571,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_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f457]) ).
cnf(c_169,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| memberP(cons(X0,X1),X0) ),
inference(cnf_transformation,[],[f602]) ).
cnf(c_219,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_220,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_221,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_222,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f525]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f528]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f531]) ).
cnf(c_242,plain,
( ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f546]) ).
cnf(c_246,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| X0 = sK57 ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_247,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f562]) ).
cnf(c_248,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ leq(X1,sK58(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_249,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| lt(X1,sK58(X1,X0,X2)) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_252,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ssItem(sK58(X1,X0,X2)) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_253,negated_conjecture,
nil != sK55,
inference(cnf_transformation,[],[f569]) ).
cnf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f571]) ).
cnf(c_12422,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(nil,cons(X0,X1)) = cons(X0,X1) ),
inference(superposition,[status(thm)],[c_140,c_155]) ).
cnf(c_12777,plain,
( ~ ssList(X0)
| app(nil,cons(sK57,X0)) = cons(sK57,X0) ),
inference(superposition,[status(thm)],[c_247,c_12422]) ).
cnf(c_13049,plain,
app(nil,cons(sK57,nil)) = cons(sK57,nil),
inference(superposition,[status(thm)],[c_141,c_12777]) ).
cnf(c_13201,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ leq(sK57,sK58(sK57,nil,X0))
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_13049,c_248]) ).
cnf(c_13204,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(nil)
| lt(sK57,sK58(sK57,nil,X0)) ),
inference(superposition,[status(thm)],[c_13049,c_249]) ).
cnf(c_13205,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(nil)
| ssItem(sK58(sK57,nil,X0)) ),
inference(superposition,[status(thm)],[c_13049,c_252]) ).
cnf(c_13210,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ ssList(X0)
| ssItem(sK58(sK57,nil,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13205,c_141,c_247]) ).
cnf(c_13214,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ ssList(X0)
| lt(sK57,sK58(sK57,nil,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13204,c_141,c_247]) ).
cnf(c_13226,plain,
( app(cons(sK57,nil),X0) != sK55
| ~ leq(sK57,sK58(sK57,nil,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13201,c_141,c_247]) ).
cnf(c_14363,plain,
( hd(sK55) = sK51(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_257,c_219]) ).
cnf(c_14364,plain,
hd(sK55) = sK51(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_14363,c_253]) ).
cnf(c_14512,plain,
( tl(sK55) = sK52(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_257,c_221]) ).
cnf(c_14513,plain,
tl(sK55) = sK52(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_14512,c_253]) ).
cnf(c_14720,plain,
( ~ ssList(sK55)
| nil = sK55
| ssItem(hd(sK55)) ),
inference(superposition,[status(thm)],[c_14364,c_220]) ).
cnf(c_14721,plain,
ssItem(hd(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_14720,c_253,c_257]) ).
cnf(c_14744,plain,
( ~ ssList(sK55)
| nil = sK55
| ssList(tl(sK55)) ),
inference(superposition,[status(thm)],[c_14513,c_222]) ).
cnf(c_14745,plain,
ssList(tl(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_14744,c_253,c_257]) ).
cnf(c_16459,plain,
( cons(hd(sK55),tl(sK55)) = sK55
| nil = sK55 ),
inference(superposition,[status(thm)],[c_257,c_224]) ).
cnf(c_16463,plain,
cons(hd(sK55),tl(sK55)) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_16459,c_253]) ).
cnf(c_16668,plain,
( ~ ssList(X0)
| app(cons(sK57,nil),X0) = cons(sK57,X0) ),
inference(superposition,[status(thm)],[c_247,c_227]) ).
cnf(c_16901,plain,
( ~ ssItem(hd(sK55))
| ~ ssList(tl(sK55))
| memberP(sK55,hd(sK55)) ),
inference(superposition,[status(thm)],[c_16463,c_169]) ).
cnf(c_16903,plain,
memberP(sK55,hd(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_16901,c_14745,c_14721]) ).
cnf(c_16929,plain,
( ~ ssItem(hd(sK55))
| hd(sK55) = sK57 ),
inference(superposition,[status(thm)],[c_16903,c_246]) ).
cnf(c_16930,plain,
hd(sK55) = sK57,
inference(forward_subsumption_resolution,[status(thm)],[c_16929,c_14721]) ).
cnf(c_16933,plain,
cons(sK57,tl(sK55)) = sK55,
inference(demodulation,[status(thm)],[c_16463,c_16930]) ).
cnf(c_17029,plain,
app(cons(sK57,nil),tl(sK55)) = cons(sK57,tl(sK55)),
inference(superposition,[status(thm)],[c_14745,c_16668]) ).
cnf(c_17032,plain,
app(cons(sK57,nil),tl(sK55)) = sK55,
inference(light_normalisation,[status(thm)],[c_17029,c_16933]) ).
cnf(c_19645,plain,
( ~ leq(sK57,sK58(sK57,nil,tl(sK55)))
| ~ ssList(tl(sK55)) ),
inference(superposition,[status(thm)],[c_17032,c_13226]) ).
cnf(c_19648,plain,
( ~ ssList(tl(sK55))
| lt(sK57,sK58(sK57,nil,tl(sK55))) ),
inference(superposition,[status(thm)],[c_17032,c_13214]) ).
cnf(c_19649,plain,
( ~ ssList(tl(sK55))
| ssItem(sK58(sK57,nil,tl(sK55))) ),
inference(superposition,[status(thm)],[c_17032,c_13210]) ).
cnf(c_19650,plain,
ssItem(sK58(sK57,nil,tl(sK55))),
inference(forward_subsumption_resolution,[status(thm)],[c_19649,c_14745]) ).
cnf(c_19651,plain,
lt(sK57,sK58(sK57,nil,tl(sK55))),
inference(forward_subsumption_resolution,[status(thm)],[c_19648,c_14745]) ).
cnf(c_19654,plain,
~ leq(sK57,sK58(sK57,nil,tl(sK55))),
inference(forward_subsumption_resolution,[status(thm)],[c_19645,c_14745]) ).
cnf(c_19703,plain,
( ~ ssItem(sK58(sK57,nil,tl(sK55)))
| ~ ssItem(sK57)
| leq(sK57,sK58(sK57,nil,tl(sK55))) ),
inference(superposition,[status(thm)],[c_19651,c_242]) ).
cnf(c_19706,plain,
leq(sK57,sK58(sK57,nil,tl(sK55))),
inference(forward_subsumption_resolution,[status(thm)],[c_19703,c_247,c_19650]) ).
cnf(c_19708,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_19706,c_19654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC240+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n013.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 : Mon Aug 28 15:06:02 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.24/1.18 % SZS status Started for theBenchmark.p
% 4.24/1.18 % SZS status Theorem for theBenchmark.p
% 4.24/1.18
% 4.24/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.24/1.18
% 4.24/1.18 ------ iProver source info
% 4.24/1.18
% 4.24/1.18 git: date: 2023-05-31 18:12:56 +0000
% 4.24/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.24/1.18 git: non_committed_changes: false
% 4.24/1.18 git: last_make_outside_of_git: false
% 4.24/1.18
% 4.24/1.18 ------ Parsing...
% 4.24/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.24/1.18
% 4.24/1.18 ------ 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
% 4.24/1.18
% 4.24/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.24/1.18
% 4.24/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.24/1.18 ------ Proving...
% 4.24/1.18 ------ Problem Properties
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18 clauses 190
% 4.24/1.18 conjectures 10
% 4.24/1.18 EPR 54
% 4.24/1.18 Horn 122
% 4.24/1.18 unary 20
% 4.24/1.18 binary 40
% 4.24/1.18 lits 650
% 4.24/1.18 lits eq 85
% 4.24/1.18 fd_pure 0
% 4.24/1.18 fd_pseudo 0
% 4.24/1.18 fd_cond 22
% 4.24/1.18 fd_pseudo_cond 14
% 4.24/1.18 AC symbols 0
% 4.24/1.18
% 4.24/1.18 ------ Schedule dynamic 5 is on
% 4.24/1.18
% 4.24/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18 ------
% 4.24/1.18 Current options:
% 4.24/1.18 ------
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18 ------ Proving...
% 4.24/1.18
% 4.24/1.18
% 4.24/1.18 % SZS status Theorem for theBenchmark.p
% 4.24/1.18
% 4.24/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.24/1.18
% 4.24/1.18
%------------------------------------------------------------------------------