TSTP Solution File: SWC354+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC354+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:12:08 EDT 2024
% Result : Theorem 17.58s 3.19s
% Output : CNFRefutation 17.58s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f599)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
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(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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f186,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f187,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f189,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f188]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f253,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f254,f256,f255]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f335,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
! [X0] :
( ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51])],[f187,f335]) ).
fof(f337,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
=> ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X0] :
( ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52])],[f189,f337]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK55 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f369,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f439,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f448,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f452,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f454,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f520,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f336]) ).
fof(f521,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f336]) ).
fof(f522,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f523,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f525,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f528,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X4,X5] :
( neq(sK54,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
! [X4,X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f558,f551,f552]) ).
fof(f562,plain,
! [X4,X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK55 = X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f551]) ).
fof(f564,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f565,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f571,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f369]) ).
fof(f593,plain,
! [X4] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| cons(hd(sK56),nil) != X4
| ~ ssItem(hd(sK56))
| sK55 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f557]) ).
fof(f594,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| sK55 = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil)) ),
inference(equality_resolution,[],[f593]) ).
fof(f595,plain,
! [X4] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| cons(hd(sK56),nil) != X4
| ~ ssItem(hd(sK56))
| sK55 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f562]) ).
fof(f596,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| sK55 = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil)) ),
inference(equality_resolution,[],[f595]) ).
cnf(c_67,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
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,[],[f439]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_149,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f452]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f454]) ).
cnf(c_219,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f521]) ).
cnf(c_220,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f520]) ).
cnf(c_221,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f523]) ).
cnf(c_222,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f522]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f525]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f528]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(cnf_transformation,[],[f594]) ).
cnf(c_249,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f604]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f564]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f565]) ).
cnf(c_369,negated_conjecture,
~ segmentP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_246,c_250,c_246]) ).
cnf(c_383,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_250]) ).
cnf(c_385,plain,
( ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_386,negated_conjecture,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(renaming,[status(thm)],[c_385]) ).
cnf(c_3222,plain,
( X0 != nil
| X1 != sK56
| ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ~ ssList(X1)
| cons(hd(sK56),nil) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_386]) ).
cnf(c_3223,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ~ ssList(sK56)
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3222]) ).
cnf(c_3224,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_3223,c_253,c_141,c_3223]) ).
cnf(c_3242,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_383]) ).
cnf(c_3243,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3242]) ).
cnf(c_3244,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3243,c_141,c_3243]) ).
cnf(c_3249,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(backward_subsumption_resolution,[status(thm)],[c_3224,c_3244]) ).
cnf(c_8848,negated_conjecture,
~ segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_369]) ).
cnf(c_8849,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8850,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_11983,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_8849,c_155]) ).
cnf(c_12130,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| cons(hd(sK56),nil) = sK55 ),
inference(superposition,[status(thm)],[c_140,c_3249]) ).
cnf(c_12131,plain,
( ~ ssItem(hd(sK56))
| cons(hd(sK56),nil) = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12130,c_141]) ).
cnf(c_12171,plain,
( ~ ssList(sK56)
| cons(hd(sK56),nil) = sK55
| nil = sK56 ),
inference(superposition,[status(thm)],[c_149,c_12131]) ).
cnf(c_12172,plain,
cons(hd(sK56),nil) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_12171,c_3244,c_8850]) ).
cnf(c_15308,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8850,c_219]) ).
cnf(c_15311,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_15308,c_3244]) ).
cnf(c_15512,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8850,c_221]) ).
cnf(c_15515,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_15512,c_3244]) ).
cnf(c_15933,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_15311,c_220]) ).
cnf(c_15934,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_15933,c_3244,c_8850]) ).
cnf(c_16048,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_15515,c_222]) ).
cnf(c_16049,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_16048,c_3244,c_8850]) ).
cnf(c_17244,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8850,c_224]) ).
cnf(c_17249,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_17244,c_3244]) ).
cnf(c_17729,plain,
( ~ ssList(X0)
| app(cons(hd(sK56),nil),X0) = cons(hd(sK56),X0) ),
inference(superposition,[status(thm)],[c_15934,c_227]) ).
cnf(c_17737,plain,
( ~ ssList(X0)
| cons(hd(sK56),X0) = app(sK55,X0) ),
inference(light_normalisation,[status(thm)],[c_17729,c_12172]) ).
cnf(c_24714,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ssList(app(app(X0,X1),X2)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_28383,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(global_subsumption_just,[status(thm)],[c_67,c_153,c_67,c_24714]) ).
cnf(c_28400,plain,
( ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_11983,c_28383]) ).
cnf(c_28452,plain,
( ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_28400,c_8849,c_141]) ).
cnf(c_45092,plain,
cons(hd(sK56),tl(sK56)) = app(sK55,tl(sK56)),
inference(superposition,[status(thm)],[c_16049,c_17737]) ).
cnf(c_45103,plain,
app(sK55,tl(sK56)) = sK56,
inference(light_normalisation,[status(thm)],[c_45092,c_17249]) ).
cnf(c_45271,plain,
( ~ ssList(tl(sK56))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_45103,c_28452]) ).
cnf(c_45275,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_45271,c_8848,c_16049]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC354+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 00:05:35 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 17.58/3.19 % SZS status Started for theBenchmark.p
% 17.58/3.19 % SZS status Theorem for theBenchmark.p
% 17.58/3.19
% 17.58/3.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.58/3.19
% 17.58/3.19 ------ iProver source info
% 17.58/3.19
% 17.58/3.19 git: date: 2024-05-02 19:28:25 +0000
% 17.58/3.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.58/3.19 git: non_committed_changes: false
% 17.58/3.19
% 17.58/3.19 ------ Parsing...
% 17.58/3.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.58/3.19
% 17.58/3.19 ------ 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: 5 0s sf_e pe_s pe_e
% 17.58/3.19
% 17.58/3.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.58/3.19
% 17.58/3.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.58/3.19 ------ Proving...
% 17.58/3.19 ------ Problem Properties
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19 clauses 185
% 17.58/3.19 conjectures 3
% 17.58/3.19 EPR 53
% 17.58/3.19 Horn 117
% 17.58/3.19 unary 20
% 17.58/3.19 binary 40
% 17.58/3.19 lits 625
% 17.58/3.19 lits eq 80
% 17.58/3.19 fd_pure 0
% 17.58/3.19 fd_pseudo 0
% 17.58/3.19 fd_cond 21
% 17.58/3.19 fd_pseudo_cond 14
% 17.58/3.19 AC symbols 0
% 17.58/3.19
% 17.58/3.19 ------ Schedule dynamic 5 is on
% 17.58/3.19
% 17.58/3.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19 ------
% 17.58/3.19 Current options:
% 17.58/3.19 ------
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19 ------ Proving...
% 17.58/3.19
% 17.58/3.19
% 17.58/3.19 % SZS status Theorem for theBenchmark.p
% 17.58/3.19
% 17.58/3.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.58/3.19
% 17.58/3.19
%------------------------------------------------------------------------------