TSTP Solution File: SWC311+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC311+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:57 EDT 2024
% Result : Theorem 85.15s 12.32s
% Output : CNFRefutation 85.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f604)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( ? [X9] :
( app(X9,cons(X8,nil)) = X0
& app(cons(X8,nil),X9) = X1
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( ? [X9] :
( app(X9,cons(X8,nil)) = X0
& app(cons(X8,nil),X9) = X1
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X3)
& ? [X9] :
( neq(nil,X3)
& hd(X3) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X3) = X7
& ssList(X8) )
& ssList(X7) )
& X2 != X6
& ssList(X6) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& 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] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f331,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X2 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK55 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X3)
| ! [X9] :
( ~ neq(nil,X3)
| hd(X3) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X3) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK55 = X6
| ~ ssList(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK56)
| ! [X9] :
( ~ neq(nil,sK56)
| hd(sK56) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK56) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK55 = X6
| ~ ssList(X6) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK56)
| ! [X9] :
( ~ neq(nil,sK56)
| hd(sK56) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK56) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK55 = X6
| ~ ssList(X6) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f223,f347,f346,f345,f344]) ).
fof(f439,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f440,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f449,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f451,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f453,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f495,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f496,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f526,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f529,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK53 ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK55
| app(cons(X4,nil),X5) != sK56
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK55 ),
inference(definition_unfolding,[],[f559,f553,f552,f553]) ).
fof(f561,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK55
| app(cons(X4,nil),X5) != sK56
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f558,f553,f552,f552]) ).
fof(f562,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f557,f552,f553]) ).
fof(f563,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f556,f552,f552]) ).
fof(f564,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f585,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f496]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f599]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_149,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_151,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f451]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f585]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f529]) ).
cnf(c_246,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| nil != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1)
| nil = sK56 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_248,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_250,negated_conjecture,
( ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(cnf_transformation,[],[f604]) ).
cnf(c_251,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f564]) ).
cnf(c_285,plain,
( ~ neq(nil,nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_139]) ).
cnf(c_305,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_370,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_248,c_251]) ).
cnf(c_386,plain,
( ~ ssList(X1)
| ~ ssItem(X0)
| app(X1,cons(X0,nil)) != sK55
| app(cons(X0,nil),X1) != sK56 ),
inference(global_subsumption_just,[status(thm)],[c_247,c_251,c_247,c_246]) ).
cnf(c_387,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(renaming,[status(thm)],[c_386]) ).
cnf(c_391,plain,
( ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(global_subsumption_just,[status(thm)],[c_250,c_250,c_370]) ).
cnf(c_392,negated_conjecture,
( ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(renaming,[status(thm)],[c_391]) ).
cnf(c_447,plain,
X0 = X0,
theory(equality) ).
cnf(c_449,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_450,plain,
( X0 != X1
| X2 != X3
| ~ neq(X1,X3)
| neq(X0,X2) ),
theory(equality) ).
cnf(c_539,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| nil = sK56
| neq(nil,sK56) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_546,plain,
( nil != X0
| sK56 != X0
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_449]) ).
cnf(c_547,plain,
( nil != nil
| sK56 != nil
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_546]) ).
cnf(c_554,plain,
( X0 != sK56
| X1 != nil
| ~ neq(sK56,nil)
| neq(X0,X1) ),
inference(instantiation,[status(thm)],[c_450]) ).
cnf(c_555,plain,
( nil != nil
| nil != sK56
| ~ neq(sK56,nil)
| neq(nil,nil) ),
inference(instantiation,[status(thm)],[c_554]) ).
cnf(c_677,plain,
( ~ ssList(sK56)
| cons(hd(sK56),tl(sK56)) = sK56
| sK56 = nil ),
inference(instantiation,[status(thm)],[c_224]) ).
cnf(c_686,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssList(tl(sK56)) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_687,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssItem(hd(sK56)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_695,plain,
( X0 != X1
| sK56 != X1
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_449]) ).
cnf(c_746,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(global_subsumption_just,[status(thm)],[c_392,c_254,c_141,c_195,c_285,c_305,c_250,c_370,c_539,c_547,c_555,c_687,c_686]) ).
cnf(c_747,negated_conjecture,
( ~ ssList(app(tl(sK56),cons(hd(sK56),nil)))
| ~ ssList(cons(hd(sK56),nil))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(renaming,[status(thm)],[c_746]) ).
cnf(c_827,plain,
sK56 = sK56,
inference(instantiation,[status(thm)],[c_447]) ).
cnf(c_1762,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| app(cons(hd(sK56),nil),X0) = cons(hd(sK56),X0) ),
inference(instantiation,[status(thm)],[c_227]) ).
cnf(c_1768,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ssList(cons(hd(sK56),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_1780,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ssList(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_1768]) ).
cnf(c_1958,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(superposition,[status(thm)],[c_153,c_392]) ).
cnf(c_2262,negated_conjecture,
app(tl(sK56),cons(hd(sK56),nil)) = sK55,
inference(global_subsumption_just,[status(thm)],[c_747,c_254,c_141,c_195,c_285,c_305,c_370,c_539,c_547,c_555,c_687,c_686,c_1780,c_1958]) ).
cnf(c_2268,plain,
( app(cons(hd(sK56),nil),tl(sK56)) != sK56
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56)) ),
inference(resolution,[status(thm)],[c_2262,c_387]) ).
cnf(c_2741,plain,
( X0 != sK56
| sK56 != sK56
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_695]) ).
cnf(c_7959,plain,
( cons(hd(sK56),tl(sK56)) != sK56
| sK56 != sK56
| sK56 = cons(hd(sK56),tl(sK56)) ),
inference(instantiation,[status(thm)],[c_2741]) ).
cnf(c_14977,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(cons(hd(sK56),nil),tl(sK56)) = cons(hd(sK56),tl(sK56)) ),
inference(instantiation,[status(thm)],[c_1762]) ).
cnf(c_48778,plain,
( X0 != X1
| sK56 != X1
| X0 = sK56 ),
inference(instantiation,[status(thm)],[c_449]) ).
cnf(c_54765,plain,
( X0 != cons(hd(sK56),tl(sK56))
| sK56 != cons(hd(sK56),tl(sK56))
| X0 = sK56 ),
inference(instantiation,[status(thm)],[c_48778]) ).
cnf(c_77808,plain,
( app(cons(hd(sK56),nil),tl(sK56)) != cons(hd(sK56),tl(sK56))
| sK56 != cons(hd(sK56),tl(sK56))
| app(cons(hd(sK56),nil),tl(sK56)) = sK56 ),
inference(instantiation,[status(thm)],[c_54765]) ).
cnf(c_77810,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_77808,c_14977,c_7959,c_2268,c_827,c_677,c_686,c_687,c_555,c_547,c_370,c_305,c_285,c_195,c_141,c_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC311+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.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 : Thu May 2 23:34:19 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/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
% 85.15/12.32 % SZS status Started for theBenchmark.p
% 85.15/12.32 % SZS status Theorem for theBenchmark.p
% 85.15/12.32
% 85.15/12.32 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 85.15/12.32
% 85.15/12.32 ------ iProver source info
% 85.15/12.32
% 85.15/12.32 git: date: 2024-05-02 19:28:25 +0000
% 85.15/12.32 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 85.15/12.32 git: non_committed_changes: false
% 85.15/12.32
% 85.15/12.32 ------ Parsing...
% 85.15/12.32 ------ Clausification by vclausify_rel & Parsing by iProver...
% 85.15/12.32
% 85.15/12.32 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 1 0s sf_e
% 85.15/12.32
% 85.15/12.32 ------ Preprocessing...
% 85.15/12.32
% 85.15/12.32 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 85.15/12.32 ------ Proving...
% 85.15/12.32 ------ Problem Properties
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32 clauses 199
% 85.15/12.32 conjectures 6
% 85.15/12.32 EPR 66
% 85.15/12.32 Horn 129
% 85.15/12.32 unary 19
% 85.15/12.32 binary 49
% 85.15/12.32 lits 666
% 85.15/12.32 lits eq 85
% 85.15/12.32 fd_pure 0
% 85.15/12.32 fd_pseudo 0
% 85.15/12.32 fd_cond 21
% 85.15/12.32 fd_pseudo_cond 16
% 85.15/12.32 AC symbols 0
% 85.15/12.32
% 85.15/12.32 ------ Input Options Time Limit: Unbounded
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32 ------
% 85.15/12.32 Current options:
% 85.15/12.32 ------
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32 ------ Proving...
% 85.15/12.32
% 85.15/12.32
% 85.15/12.32 % SZS status Theorem for theBenchmark.p
% 85.15/12.32
% 85.15/12.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 85.15/12.32
% 85.15/12.32
%------------------------------------------------------------------------------