TSTP Solution File: SWC120+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC120+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:11:18 EDT 2024
% Result : Theorem 10.06s 2.14s
% Output : CNFRefutation 10.06s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f604)
% 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/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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& ssList(X5) )
& X3 != X4
& ssList(X4) )
| ~ 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(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& ssList(X5) )
& X3 != 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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(X0,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(sK55,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(sK55,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| app(sK55,X5) != X4
| tl(sK56) != X5
| ~ ssList(X5) )
| sK56 = 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)
| ~ neq(sK53,nil) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK56)
| app(sK55,X5) != X4
| tl(sK56) != X5
| ~ ssList(X5) )
| sK56 = 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(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f441,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f450,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
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(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)
| app(sK55,X5) != X4
| tl(sK56) != X5
| ~ ssList(X5)
| sK56 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
! [X4,X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| app(sK55,X5) != X4
| tl(sK56) != X5
| ~ ssList(X5)
| sK56 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55)
| ~ neq(sK55,nil) ),
inference(definition_unfolding,[],[f558,f551,f552,f552]) ).
fof(f562,plain,
! [X4,X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| app(sK55,X5) != X4
| tl(sK56) != X5
| ~ ssList(X5)
| sK56 = 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,
! [X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| tl(sK56) != X5
| ~ ssList(X5)
| app(sK55,X5) = sK56
| ~ ssList(app(sK55,X5)) ),
inference(equality_resolution,[],[f557]) ).
fof(f594,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssList(tl(sK56))
| sK56 = app(sK55,tl(sK56))
| ~ ssList(app(sK55,tl(sK56))) ),
inference(equality_resolution,[],[f593]) ).
fof(f595,plain,
! [X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| tl(sK56) != X5
| ~ ssList(X5)
| app(sK55,X5) = sK56
| ~ ssList(app(sK55,X5)) ),
inference(equality_resolution,[],[f562]) ).
fof(f596,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssList(tl(sK56))
| sK56 = app(sK55,tl(sK56))
| ~ ssList(app(sK55,tl(sK56))) ),
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_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_142,plain,
( cons(X0,X1) != X1
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f441]) ).
cnf(c_151,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f450]) ).
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_246,negated_conjecture,
( ~ neq(sK56,nil)
| ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
( ~ ssList(app(sK55,tl(sK56)))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil)
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56 ),
inference(cnf_transformation,[],[f594]) ).
cnf(c_249,negated_conjecture,
( ~ ssList(app(sK55,tl(sK56)))
| ~ neq(nil,sK56)
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56
| 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_375,negated_conjecture,
( ~ neq(sK55,nil)
| ~ 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(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_247,c_250,c_247]) ).
cnf(c_386,negated_conjecture,
( ~ ssList(app(sK55,tl(sK56)))
| ~ neq(nil,sK56)
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56 ),
inference(renaming,[status(thm)],[c_385]) ).
cnf(c_3228,plain,
( X0 != sK55
| X1 != nil
| ~ segmentP(sK56,sK55)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_375]) ).
cnf(c_3229,plain,
( ~ segmentP(sK56,sK55)
| ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3228]) ).
cnf(c_3230,plain,
( ~ segmentP(sK56,sK55)
| sK55 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3229,c_254,c_141,c_3229]) ).
cnf(c_3242,plain,
( X0 != nil
| X1 != sK56
| ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK55,tl(sK56)) = sK56
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_386]) ).
cnf(c_3243,plain,
( ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| ~ ssList(nil)
| ~ ssList(sK56)
| app(sK55,tl(sK56)) = sK56
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3242]) ).
cnf(c_3244,plain,
( ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_3243,c_253,c_141,c_3243]) ).
cnf(c_3262,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_383]) ).
cnf(c_3263,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3262]) ).
cnf(c_3264,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3263,c_141,c_3263]) ).
cnf(c_3269,plain,
( ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56 ),
inference(backward_subsumption_resolution,[status(thm)],[c_3244,c_3264]) ).
cnf(c_8895,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8896,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_12046,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_8895,c_155]) ).
cnf(c_12242,plain,
( ~ ssList(X0)
| app(nil,tl(X0)) = tl(X0)
| X0 = nil ),
inference(superposition,[status(thm)],[c_151,c_155]) ).
cnf(c_12388,plain,
( ~ ssList(tl(sK56))
| ~ ssList(sK55)
| app(sK55,tl(sK56)) = sK56 ),
inference(superposition,[status(thm)],[c_153,c_3269]) ).
cnf(c_12389,plain,
( ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) = sK56 ),
inference(forward_subsumption_resolution,[status(thm)],[c_12388,c_8895]) ).
cnf(c_12452,plain,
( ~ ssList(sK56)
| app(sK55,tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_151,c_12389]) ).
cnf(c_12453,plain,
app(sK55,tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_12452,c_3264,c_8896]) ).
cnf(c_13162,plain,
( app(nil,tl(sK56)) = tl(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8896,c_12242]) ).
cnf(c_13166,plain,
app(nil,tl(sK56)) = tl(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_13162,c_3264]) ).
cnf(c_13971,plain,
( hd(sK56) = sK51(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8896,c_219]) ).
cnf(c_13975,plain,
hd(sK56) = sK51(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_13971,c_3264]) ).
cnf(c_14140,plain,
( tl(sK56) = sK52(sK56)
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8896,c_221]) ).
cnf(c_14144,plain,
tl(sK56) = sK52(sK56),
inference(forward_subsumption_resolution,[status(thm)],[c_14140,c_3264]) ).
cnf(c_14269,plain,
( ~ ssList(sK56)
| nil = sK56
| ssItem(hd(sK56)) ),
inference(superposition,[status(thm)],[c_13975,c_220]) ).
cnf(c_14270,plain,
ssItem(hd(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_14269,c_3264,c_8896]) ).
cnf(c_14282,plain,
( ~ ssList(sK56)
| nil = sK56
| ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_14144,c_222]) ).
cnf(c_14283,plain,
ssList(tl(sK56)),
inference(forward_subsumption_resolution,[status(thm)],[c_14282,c_3264,c_8896]) ).
cnf(c_16514,plain,
( cons(hd(sK56),tl(sK56)) = sK56
| nil = sK56 ),
inference(superposition,[status(thm)],[c_8896,c_224]) ).
cnf(c_16520,plain,
cons(hd(sK56),tl(sK56)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_16514,c_3264]) ).
cnf(c_16995,plain,
( tl(sK56) != sK56
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56)) ),
inference(superposition,[status(thm)],[c_16520,c_142]) ).
cnf(c_16999,plain,
tl(sK56) != sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_16995,c_14283,c_14270]) ).
cnf(c_26126,plain,
( ~ ssList(app(app(nil,sK55),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_12046,c_67]) ).
cnf(c_26189,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_26126,c_12046]) ).
cnf(c_26190,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26189,c_8895,c_141]) ).
cnf(c_27248,plain,
( ~ ssList(app(sK55,tl(sK56)))
| ~ ssList(tl(sK56))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_12453,c_26190]) ).
cnf(c_27257,plain,
( ~ ssList(tl(sK56))
| ~ ssList(sK56)
| segmentP(sK56,sK55) ),
inference(light_normalisation,[status(thm)],[c_27248,c_12453]) ).
cnf(c_27258,plain,
segmentP(sK56,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_27257,c_8896,c_14283]) ).
cnf(c_27275,plain,
nil = sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_3230,c_27258]) ).
cnf(c_27334,plain,
app(nil,tl(sK56)) = sK56,
inference(demodulation,[status(thm)],[c_12453,c_27275]) ).
cnf(c_27340,plain,
tl(sK56) = sK56,
inference(light_normalisation,[status(thm)],[c_27334,c_13166]) ).
cnf(c_27341,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_27340,c_16999]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC120+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:04:35 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 10.06/2.14 % SZS status Started for theBenchmark.p
% 10.06/2.14 % SZS status Theorem for theBenchmark.p
% 10.06/2.14
% 10.06/2.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.06/2.14
% 10.06/2.14 ------ iProver source info
% 10.06/2.14
% 10.06/2.14 git: date: 2024-05-02 19:28:25 +0000
% 10.06/2.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.06/2.14 git: non_committed_changes: false
% 10.06/2.14
% 10.06/2.14 ------ Parsing...
% 10.06/2.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.06/2.14
% 10.06/2.14 ------ 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
% 10.06/2.14
% 10.06/2.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.06/2.14
% 10.06/2.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.06/2.14 ------ Proving...
% 10.06/2.14 ------ Problem Properties
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14 clauses 186
% 10.06/2.14 conjectures 2
% 10.06/2.14 EPR 54
% 10.06/2.14 Horn 118
% 10.06/2.14 unary 19
% 10.06/2.14 binary 42
% 10.06/2.14 lits 628
% 10.06/2.14 lits eq 82
% 10.06/2.14 fd_pure 0
% 10.06/2.14 fd_pseudo 0
% 10.06/2.14 fd_cond 21
% 10.06/2.14 fd_pseudo_cond 14
% 10.06/2.14 AC symbols 0
% 10.06/2.14
% 10.06/2.14 ------ Schedule dynamic 5 is on
% 10.06/2.14
% 10.06/2.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14 ------
% 10.06/2.14 Current options:
% 10.06/2.14 ------
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14 ------ Proving...
% 10.06/2.14
% 10.06/2.14
% 10.06/2.14 % SZS status Theorem for theBenchmark.p
% 10.06/2.14
% 10.06/2.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.06/2.14
% 10.06/2.15
%------------------------------------------------------------------------------