TSTP Solution File: SWC214+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC214+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Mon Jun 24 16:23:40 EDT 2024
% Result : Theorem 7.73s 1.66s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f593)
% 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(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(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(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(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)
=> ( neq(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
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(f125,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
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(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
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(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& 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(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f245,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,[],[f101]) ).
fof(f246,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,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,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])],[f246,f247]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f330,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
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(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& 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(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(X3,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& strictorderedP(sK55)
& frontsegP(X3,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(X3,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& strictorderedP(sK55)
& frontsegP(X3,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& strictorderedP(sK55)
& frontsegP(sK56,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ~ neq(sK53,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& strictorderedP(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])],[f222,f346,f345,f344,f343]) ).
fof(f362,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
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(f447,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
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(f493,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f494,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f495,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f509,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
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(f553,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ frontsegP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f557,f552]) ).
fof(f559,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f560,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f561,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f565,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f362]) ).
fof(f581,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f495]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
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_148,plain,
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f447]) ).
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_177,plain,
( ~ frontsegP(X0,X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(cons(X2,X0),cons(X2,X1)) ),
inference(cnf_transformation,[],[f593]) ).
cnf(c_194,plain,
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[],[f493]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f581]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f494]) ).
cnf(c_209,plain,
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f509]) ).
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(sK55,nil),
inference(cnf_transformation,[],[f558]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK55,X0)
| ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f559]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f560]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f561]) ).
cnf(c_304,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_376,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_3222,plain,
( X0 != sK55
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3223,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3222]) ).
cnf(c_3224,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_3223,c_254,c_141,c_3223]) ).
cnf(c_3231,plain,
( X0 != sK55
| X1 != X2
| ~ frontsegP(sK56,X2)
| ~ segmentP(X2,sK55)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ strictorderedP(X2)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3232,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssList(sK55)
| sK55 = X0 ),
inference(unflattening,[status(thm)],[c_3231]) ).
cnf(c_3233,plain,
( ~ strictorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(X0,sK55)
| ~ frontsegP(sK56,X0)
| sK55 = X0 ),
inference(global_subsumption_just,[status(thm)],[c_3232,c_254,c_3232]) ).
cnf(c_3234,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| sK55 = X0 ),
inference(renaming,[status(thm)],[c_3233]) ).
cnf(c_3263,plain,
( nil != nil
| sK55 != sK56 ),
inference(resolution_lifted,[status(thm)],[c_246,c_250]) ).
cnf(c_3264,plain,
sK55 != sK56,
inference(global_subsumption_just,[status(thm)],[c_3263,c_141,c_195,c_304,c_3263]) ).
cnf(c_6095,plain,
nil != sK56,
inference(light_normalisation,[status(thm)],[c_3264,c_3224]) ).
cnf(c_6704,plain,
( ~ frontsegP(sK56,X0)
| ~ segmentP(X0,nil)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| X0 = nil ),
inference(light_normalisation,[status(thm)],[c_3234,c_3224]) ).
cnf(c_6710,plain,
( ~ frontsegP(sK56,X0)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| X0 = nil ),
inference(forward_subsumption_resolution,[status(thm)],[c_6704,c_194]) ).
cnf(c_12940,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_17294,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_12940,c_219]) ).
cnf(c_17295,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_17294,c_6095]) ).
cnf(c_17464,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_12940,c_221]) ).
cnf(c_17465,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_17464,c_6095]) ).
cnf(c_17604,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_17295,c_220]) ).
cnf(c_17605,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_17604,c_6095,c_12940]) ).
cnf(c_17618,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_17465,c_222]) ).
cnf(c_17619,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_17618,c_6095,c_12940]) ).
cnf(c_17626,plain,
app(nil,tl(sK56)) = tl(sK56),
inference(superposition,[status(thm)],[c_17619,c_155]) ).
cnf(c_17658,plain,
( ~ ssList(tl(sK56))
| ~ ssList(nil)
| frontsegP(tl(sK56),nil) ),
inference(superposition,[status(thm)],[c_17626,c_376]) ).
cnf(c_17659,plain,
frontsegP(tl(sK56),nil),
inference(forward_subsumption_resolution,[status(thm)],[c_17658,c_141,c_17619]) ).
cnf(c_18751,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_12940,c_224]) ).
cnf(c_18754,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_18751,c_6095]) ).
cnf(c_18955,plain,
( ~ ssList(X0)
| app(cons(hd(sK56),nil),X0) = cons(hd(sK56),X0) ),
inference(superposition,[status(thm)],[c_17605,c_227]) ).
cnf(c_19220,plain,
app(cons(hd(sK56),nil),tl(sK56)) = cons(hd(sK56),tl(sK56)),
inference(superposition,[status(thm)],[c_17619,c_18955]) ).
cnf(c_19222,plain,
app(cons(hd(sK56),nil),tl(sK56)) = sK56,
inference(light_normalisation,[status(thm)],[c_19220,c_18754]) ).
cnf(c_20857,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(superposition,[status(thm)],[c_19222,c_376]) ).
cnf(c_20864,plain,
( ~ ssList(cons(hd(sK56),nil))
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_20857,c_17619]) ).
cnf(c_22649,plain,
( ~ frontsegP(tl(sK56),X0)
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| ~ ssList(X0)
| frontsegP(sK56,cons(hd(sK56),X0)) ),
inference(superposition,[status(thm)],[c_18754,c_177]) ).
cnf(c_22673,plain,
( ~ frontsegP(tl(sK56),X0)
| ~ ssList(X0)
| frontsegP(sK56,cons(hd(sK56),X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22649,c_17619,c_17605]) ).
cnf(c_22719,plain,
( ~ frontsegP(tl(sK56),nil)
| ~ ssList(nil)
| frontsegP(sK56,cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_22673]) ).
cnf(c_23738,plain,
frontsegP(sK56,cons(hd(sK56),nil)),
inference(global_subsumption_just,[status(thm)],[c_20864,c_141,c_17659,c_22719]) ).
cnf(c_23743,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ strictorderedP(cons(hd(sK56),nil))
| cons(hd(sK56),nil) = nil ),
inference(superposition,[status(thm)],[c_23738,c_6710]) ).
cnf(c_24975,plain,
( cons(hd(sK56),X0) != nil
| ~ ssItem(hd(sK56))
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_24976,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ssList(cons(hd(sK56),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_24983,plain,
( ~ ssItem(hd(sK56))
| strictorderedP(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_209]) ).
cnf(c_24986,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ssList(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_24976]) ).
cnf(c_24987,plain,
( cons(hd(sK56),nil) != nil
| ~ ssItem(hd(sK56))
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_24975]) ).
cnf(c_24988,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_24987,c_24986,c_24983,c_23743,c_17605,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC214+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 04:57:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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
% 7.73/1.66 % SZS status Started for theBenchmark.p
% 7.73/1.66 % SZS status Theorem for theBenchmark.p
% 7.73/1.66
% 7.73/1.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.73/1.66
% 7.73/1.66 ------ iProver source info
% 7.73/1.66
% 7.73/1.66 git: date: 2024-06-12 09:56:46 +0000
% 7.73/1.66 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 7.73/1.66 git: non_committed_changes: false
% 7.73/1.66
% 7.73/1.66 ------ Parsing...
% 7.73/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.73/1.66
% 7.73/1.66 ------ 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: 8 sf_s rm: 5 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 7.73/1.66
% 7.73/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.73/1.66
% 7.73/1.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.73/1.66 ------ Proving...
% 7.73/1.66 ------ Problem Properties
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 clauses 185
% 7.73/1.66 conjectures 1
% 7.73/1.66 EPR 54
% 7.73/1.66 Horn 117
% 7.73/1.66 unary 20
% 7.73/1.66 binary 40
% 7.73/1.66 lits 626
% 7.73/1.66 lits eq 81
% 7.73/1.66 fd_pure 0
% 7.73/1.66 fd_pseudo 0
% 7.73/1.66 fd_cond 22
% 7.73/1.66 fd_pseudo_cond 14
% 7.73/1.66 AC symbols 0
% 7.73/1.66
% 7.73/1.66 ------ Schedule dynamic 5 is on
% 7.73/1.66
% 7.73/1.66 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 ------
% 7.73/1.66 Current options:
% 7.73/1.66 ------
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 ------ Proving...
% 7.73/1.66
% 7.73/1.66
% 7.73/1.66 % SZS status Theorem for theBenchmark.p
% 7.73/1.66
% 7.73/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.66
% 7.73/1.66
%------------------------------------------------------------------------------