TSTP Solution File: SWC091+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC091+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:40:54 EDT 2023
% Result : Theorem 34.64s 5.82s
% Output : CNFRefutation 34.64s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f592)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
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/sandbox2/benchmark/theBenchmark.p',ax7) ).
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(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f54,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( segmentP(X1,X0)
& segmentP(X0,X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax54) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
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(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X2)
& frontsegP(X3,X5)
& neq(X2,X5)
& ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| 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)
=> ( ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X2)
& frontsegP(X3,X5)
& neq(X2,X5)
& ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f104,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(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(f126,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f171,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f171]) ).
fof(f173,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f176,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f181,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
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(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f247,f248]) ).
fof(f254,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,[],[f104]) ).
fof(f255,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,[],[f254]) ).
fof(f256,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(f257,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(f258,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])],[f255,f257,f256]) ).
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(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(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(X3,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(sK55)
& frontsegP(X3,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(X3,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(sK55)
& frontsegP(X3,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(sK55)
& frontsegP(sK56,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& totalorderedP(sK55)
& frontsegP(sK56,sK55)
& 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])],[f223,f347,f346,f345,f344]) ).
fof(f361,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f362,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f363,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f370,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,[],[f258]) ).
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(f448,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f453,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f455,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f491,plain,
! [X0,X1] :
( X0 = X1
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f492,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f494,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
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(f503,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f521,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f522,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f523,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f524,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
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(f534,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
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,
neq(sK54,nil),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
frontsegP(sK56,sK55),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
! [X5] :
( ~ segmentP(sK55,X5)
| ~ segmentP(sK56,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f557,f553,f552]) ).
fof(f560,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f554,f552]) ).
fof(f561,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f562,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
fof(f566,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f363]) ).
fof(f568,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,[],[f370]) ).
fof(f582,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f496]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f362]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f361]) ).
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,[],[f568]) ).
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,[],[f592]) ).
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_148,plain,
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_177,plain,
( ~ frontsegP(X0,X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(cons(X2,X0),cons(X2,X1)) ),
inference(cnf_transformation,[],[f594]) ).
cnf(c_191,plain,
( ~ segmentP(X0,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f491]) ).
cnf(c_192,plain,
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f492]) ).
cnf(c_194,plain,
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[],[f494]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f582]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_203,plain,
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f503]) ).
cnf(c_219,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f522]) ).
cnf(c_220,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f521]) ).
cnf(c_221,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_222,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f523]) ).
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_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f595]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK55,X0)
| ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ totalorderedP(X0) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_247,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
frontsegP(sK56,sK55),
inference(cnf_transformation,[],[f555]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f560]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f562]) ).
cnf(c_295,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_304,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_368,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_295]) ).
cnf(c_377,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_3237,plain,
( X0 != sK55
| X1 != X2
| ~ frontsegP(sK56,X2)
| ~ segmentP(X2,sK55)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ totalorderedP(X2)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3238,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ totalorderedP(X0)
| ~ ssList(sK55)
| sK55 = X0 ),
inference(unflattening,[status(thm)],[c_3237]) ).
cnf(c_3240,plain,
( ~ totalorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,sK55)
| ~ frontsegP(sK56,X0)
| sK55 = X0 ),
inference(global_subsumption_just,[status(thm)],[c_3238,c_254,c_3238]) ).
cnf(c_3241,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ totalorderedP(X0)
| sK55 = X0 ),
inference(renaming,[status(thm)],[c_3240]) ).
cnf(c_3263,plain,
( X0 != X1
| X2 != nil
| ~ segmentP(sK55,X1)
| ~ segmentP(sK56,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3264,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| X0 = nil ),
inference(unflattening,[status(thm)],[c_3263]) ).
cnf(c_3266,plain,
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3264,c_141,c_3264]) ).
cnf(c_3267,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(renaming,[status(thm)],[c_3266]) ).
cnf(c_3285,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_250]) ).
cnf(c_3286,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3285]) ).
cnf(c_3287,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3286,c_141,c_3286]) ).
cnf(c_8980,plain,
( X0 != X1
| X2 != X3
| ~ segmentP(X1,X3)
| segmentP(X0,X2) ),
theory(equality) ).
cnf(c_12170,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_254,c_155]) ).
cnf(c_12259,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_254,c_232]) ).
cnf(c_13306,plain,
( ~ ssList(sK55)
| segmentP(sK55,sK55) ),
inference(instantiation,[status(thm)],[c_192]) ).
cnf(c_13452,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_219]) ).
cnf(c_13456,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_13452,c_3287]) ).
cnf(c_13623,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_221]) ).
cnf(c_13627,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_13623,c_3287]) ).
cnf(c_13742,plain,
( X0 != X1
| sK55 != X2
| ~ segmentP(X1,X2)
| segmentP(X0,sK55) ),
inference(instantiation,[status(thm)],[c_8980]) ).
cnf(c_13743,plain,
( nil != nil
| sK55 != nil
| ~ segmentP(nil,nil)
| segmentP(nil,sK55) ),
inference(instantiation,[status(thm)],[c_13742]) ).
cnf(c_13771,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_13456,c_220]) ).
cnf(c_13772,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_13771,c_3287,c_253]) ).
cnf(c_13781,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_13627,c_222]) ).
cnf(c_13782,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_13781,c_3287,c_253]) ).
cnf(c_13793,plain,
app(nil,tl(sK56)) = tl(sK56),
inference(superposition,[status(thm)],[c_13782,c_155]) ).
cnf(c_14139,plain,
( ~ ssList(tl(sK56))
| ~ ssList(nil)
| frontsegP(tl(sK56),nil) ),
inference(superposition,[status(thm)],[c_13793,c_377]) ).
cnf(c_14140,plain,
frontsegP(tl(sK56),nil),
inference(forward_subsumption_resolution,[status(thm)],[c_14139,c_141,c_13782]) ).
cnf(c_14790,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_224]) ).
cnf(c_14796,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_14790,c_3287]) ).
cnf(c_15207,plain,
( ~ segmentP(sK55,sK55)
| ~ segmentP(sK56,sK55)
| ~ ssList(sK55)
| sK55 = nil ),
inference(instantiation,[status(thm)],[c_3267]) ).
cnf(c_15732,plain,
( ~ ssList(sK55)
| ~ ssList(sK56)
| app(sK55,sK11(sK56,sK55)) = sK56 ),
inference(superposition,[status(thm)],[c_249,c_62]) ).
cnf(c_15747,plain,
app(sK55,sK11(sK56,sK55)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_15732,c_253,c_254]) ).
cnf(c_15770,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ssList(app(app(X0,X1),X2)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_19038,plain,
( ~ frontsegP(tl(sK56),X0)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| ~ ssList(X0)
| frontsegP(sK56,cons(hd(sK56),X0)) ),
inference(superposition,[status(thm)],[c_14796,c_177]) ).
cnf(c_19063,plain,
( ~ frontsegP(tl(sK56),X0)
| ~ ssList(X0)
| frontsegP(sK56,cons(hd(sK56),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_19038,c_13782,c_13772]) ).
cnf(c_19115,plain,
( ~ frontsegP(tl(sK56),nil)
| ~ ssList(nil)
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_19063]) ).
cnf(c_22847,plain,
( cons(hd(sK56),X0) != nil
| ~ ssItem(hd(sK56))
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_22848,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ssList(cons(hd(sK56),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_22856,plain,
( ~ ssItem(hd(sK56))
| totalorderedP(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_203]) ).
cnf(c_22858,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ssList(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_22848]) ).
cnf(c_22859,plain,
( cons(hd(sK56),nil) != nil
| ~ ssItem(hd(sK56))
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_22847]) ).
cnf(c_23990,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_15770]) ).
cnf(c_24001,plain,
( ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(nil,X0),nil) ),
inference(superposition,[status(thm)],[c_368,c_23990]) ).
cnf(c_24005,plain,
( ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_12170,c_23990]) ).
cnf(c_24037,plain,
( ~ ssList(X0)
| segmentP(app(nil,X0),nil) ),
inference(forward_subsumption_resolution,[status(thm)],[c_24001,c_141]) ).
cnf(c_24046,plain,
( ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_24005,c_254,c_141]) ).
cnf(c_24679,plain,
( ~ ssList(sK55)
| segmentP(sK55,nil) ),
inference(superposition,[status(thm)],[c_12170,c_24037]) ).
cnf(c_24687,plain,
segmentP(sK55,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_24679,c_254]) ).
cnf(c_24709,plain,
( ~ segmentP(nil,sK55)
| ~ ssList(nil)
| ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_24687,c_191]) ).
cnf(c_24710,plain,
( ~ segmentP(nil,sK55)
| nil = sK55 ),
inference(forward_subsumption_resolution,[status(thm)],[c_24709,c_254,c_141]) ).
cnf(c_24797,plain,
( ~ ssList(nil)
| segmentP(sK55,sK55) ),
inference(superposition,[status(thm)],[c_12259,c_24046]) ).
cnf(c_24798,plain,
( ~ ssList(sK11(sK56,sK55))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_15747,c_24046]) ).
cnf(c_24804,plain,
segmentP(sK55,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_24797,c_141]) ).
cnf(c_25689,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_219]) ).
cnf(c_25690,plain,
( hd(sK55) = sK51(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_254,c_219]) ).
cnf(c_25693,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_25689,c_3287]) ).
cnf(c_25809,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_63,c_24798]) ).
cnf(c_25810,plain,
segmentP(sK56,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_25809,c_253,c_254,c_249]) ).
cnf(c_25815,plain,
( ~ segmentP(sK55,sK55)
| ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_25810,c_3267]) ).
cnf(c_25816,plain,
nil = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_25815,c_254,c_24804]) ).
cnf(c_25896,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,nil)
| ~ ssList(X0)
| ~ totalorderedP(X0)
| X0 = nil ),
inference(demodulation,[status(thm)],[c_3241,c_25816]) ).
cnf(c_27823,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_221]) ).
cnf(c_27827,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_27823,c_3287]) ).
cnf(c_29292,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_25693,c_220]) ).
cnf(c_29293,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_29292,c_3287,c_253]) ).
cnf(c_29313,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_27827,c_222]) ).
cnf(c_29314,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_29313,c_3287,c_253]) ).
cnf(c_30105,plain,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_25690,c_254,c_141,c_195,c_304,c_13306,c_13743,c_15207,c_24710,c_25810]) ).
cnf(c_30117,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,nil)
| ~ ssList(X0)
| ~ totalorderedP(X0)
| X0 = nil ),
inference(demodulation,[status(thm)],[c_3241,c_30105]) ).
cnf(c_36031,plain,
( ~ frontsegP(sK56,X0)
| ~ ssList(X0)
| ~ totalorderedP(X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_30117,c_194,c_25896]) ).
cnf(c_36111,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_253,c_224]) ).
cnf(c_36114,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_36111,c_3287]) ).
cnf(c_37103,plain,
( ~ ssList(X0)
| app(cons(hd(sK56),nil),X0) = cons(hd(sK56),X0) ),
inference(superposition,[status(thm)],[c_29293,c_227]) ).
cnf(c_39614,plain,
app(cons(hd(sK56),nil),tl(sK56)) = cons(hd(sK56),tl(sK56)),
inference(superposition,[status(thm)],[c_29314,c_37103]) ).
cnf(c_39616,plain,
app(cons(hd(sK56),nil),tl(sK56)) = sK56,
inference(light_normalisation,[status(thm)],[c_39614,c_36114]) ).
cnf(c_55782,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(superposition,[status(thm)],[c_39616,c_377]) ).
cnf(c_55790,plain,
( ~ ssList(cons(hd(sK56),nil))
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_55782,c_29314]) ).
cnf(c_99676,plain,
frontsegP(sK56,cons(hd(sK56),nil)),
inference(global_subsumption_just,[status(thm)],[c_55790,c_141,c_14140,c_19115]) ).
cnf(c_99682,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ totalorderedP(cons(hd(sK56),nil))
| cons(hd(sK56),nil) = nil ),
inference(superposition,[status(thm)],[c_99676,c_36031]) ).
cnf(c_99700,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_99682,c_22859,c_22858,c_22856,c_13772,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.18 % Problem : SWC091+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.19 % Command : run_iprover %s %d THM
% 0.16/0.40 % Computer : n026.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8042.1875MB
% 0.16/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Mon Aug 28 16:53:20 EDT 2023
% 0.16/0.41 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 34.64/5.82 % SZS status Started for theBenchmark.p
% 34.64/5.82 % SZS status Theorem for theBenchmark.p
% 34.64/5.82
% 34.64/5.82 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 34.64/5.82
% 34.64/5.82 ------ iProver source info
% 34.64/5.82
% 34.64/5.82 git: date: 2023-05-31 18:12:56 +0000
% 34.64/5.82 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 34.64/5.82 git: non_committed_changes: false
% 34.64/5.82 git: last_make_outside_of_git: false
% 34.64/5.82
% 34.64/5.82 ------ Parsing...
% 34.64/5.82 ------ Clausification by vclausify_rel & Parsing by iProver...
% 34.64/5.82
% 34.64/5.82 ------ 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
% 34.64/5.82
% 34.64/5.82 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 34.64/5.82
% 34.64/5.82 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 34.64/5.82 ------ Proving...
% 34.64/5.82 ------ Problem Properties
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82 clauses 189
% 34.64/5.82 conjectures 4
% 34.64/5.82 EPR 58
% 34.64/5.82 Horn 121
% 34.64/5.82 unary 21
% 34.64/5.82 binary 41
% 34.64/5.82 lits 637
% 34.64/5.82 lits eq 82
% 34.64/5.82 fd_pure 0
% 34.64/5.82 fd_pseudo 0
% 34.64/5.82 fd_cond 23
% 34.64/5.82 fd_pseudo_cond 14
% 34.64/5.82 AC symbols 0
% 34.64/5.82
% 34.64/5.82 ------ Schedule dynamic 5 is on
% 34.64/5.82
% 34.64/5.82 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82 ------
% 34.64/5.82 Current options:
% 34.64/5.82 ------
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82 ------ Proving...
% 34.64/5.82
% 34.64/5.82
% 34.64/5.82 % SZS status Theorem for theBenchmark.p
% 34.64/5.82
% 34.64/5.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 34.64/5.82
% 34.64/5.83
%------------------------------------------------------------------------------