TSTP Solution File: SWC330+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC330+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:02 EDT 2024
% Result : Theorem 10.34s 2.14s
% Output : CNFRefutation 10.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of formulae : 112 ( 22 unt; 0 def)
% Number of atoms : 520 ( 142 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 627 ( 219 ~; 219 |; 155 &)
% ( 2 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 194 ( 0 sgn 99 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax56) ).
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(f73,axiom,
! [X0] :
( ssItem(X0)
=> equalelemsP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
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] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f173,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f175,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f174]) ).
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(f186,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f73]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f232,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f233,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f222,f232]) ).
fof(f332,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f345,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X3,X2) ),
inference(nnf_transformation,[],[f232]) ).
fof(f346,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP6(X0,X1) ),
inference(rectify,[],[f345]) ).
fof(f347,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),X4) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(sK56(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(sK56(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK54(X0,X1))
| ~ memberP(sK56(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK54(X0,X1),X6)
| ~ memberP(sK55(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
& cons(sK54(X0,X1),nil) = X1
& ssList(sK56(X0,X1))
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1)) )
| ~ sP6(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55,sK56])],[f346,f349,f348,f347]) ).
fof(f351,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(X1,sK57) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(X1,sK57) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = X2
& nil = X3 )
| sP6(X3,X2) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = sK59
& nil = X3 )
| sP6(X3,sK59) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X3] :
( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = sK59
& nil = X3 )
| sP6(X3,sK59) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
=> ( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = sK59
& nil = sK60 )
| sP6(sK60,sK59) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) )
& ( ( nil = sK59
& nil = sK60 )
| sP6(sK60,sK59) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60])],[f233,f354,f353,f352,f351]) ).
fof(f448,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f499,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f500,plain,
! [X2,X3,X0,X1] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f501,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f503,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f332]) ).
fof(f526,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f186]) ).
fof(f527,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f541,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f555,plain,
! [X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
! [X0,X1] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
! [X0,X1] :
( ssList(sK56(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
! [X0,X1] :
( cons(sK54(X0,X1),nil) = X1
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
! [X0,X1] :
( app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
ssList(sK57),
inference(cnf_transformation,[],[f355]) ).
fof(f563,plain,
ssList(sK58),
inference(cnf_transformation,[],[f355]) ).
fof(f566,plain,
sK58 = sK60,
inference(cnf_transformation,[],[f355]) ).
fof(f567,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f355]) ).
fof(f569,plain,
( nil = sK59
| sP6(sK60,sK59) ),
inference(cnf_transformation,[],[f355]) ).
fof(f570,plain,
( ~ equalelemsP(sK57)
| ~ segmentP(sK58,sK57) ),
inference(cnf_transformation,[],[f355]) ).
fof(f571,plain,
( ~ equalelemsP(sK59)
| ~ segmentP(sK60,sK59) ),
inference(definition_unfolding,[],[f570,f567,f566,f567]) ).
fof(f572,plain,
ssList(sK60),
inference(definition_unfolding,[],[f563,f566]) ).
fof(f573,plain,
ssList(sK59),
inference(definition_unfolding,[],[f562,f567]) ).
fof(f593,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f503]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f448]) ).
cnf(c_192,plain,
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f499]) ).
cnf(c_193,plain,
( ~ segmentP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f500]) ).
cnf(c_194,plain,
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[],[f501]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f593]) ).
cnf(c_217,plain,
( ~ ssItem(X0)
| equalelemsP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f526]) ).
cnf(c_218,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f527]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f541]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1)
| app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1)
| cons(sK54(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1)
| ssList(sK56(X0,X1)) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,plain,
( ~ sP6(X0,X1)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_252,plain,
( ~ sP6(X0,X1)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_253,negated_conjecture,
( ~ segmentP(sK60,sK59)
| ~ equalelemsP(sK59) ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_254,negated_conjecture,
( nil = sK59
| sP6(sK60,sK59) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_258,negated_conjecture,
ssList(sK60),
inference(cnf_transformation,[],[f572]) ).
cnf(c_259,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f573]) ).
cnf(c_1994,plain,
( X0 != sK60
| X1 != sK59
| nil = sK59
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_252,c_254]) ).
cnf(c_1995,plain,
( nil = sK59
| ssItem(sK54(sK60,sK59)) ),
inference(unflattening,[status(thm)],[c_1994]) ).
cnf(c_2010,plain,
( X0 != sK60
| X1 != sK59
| nil = sK59
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_251,c_254]) ).
cnf(c_2011,plain,
( nil = sK59
| ssList(sK55(sK60,sK59)) ),
inference(unflattening,[status(thm)],[c_2010]) ).
cnf(c_2026,plain,
( X0 != sK60
| X1 != sK59
| nil = sK59
| ssList(sK56(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_250,c_254]) ).
cnf(c_2027,plain,
( nil = sK59
| ssList(sK56(sK60,sK59)) ),
inference(unflattening,[status(thm)],[c_2026]) ).
cnf(c_2042,plain,
( X0 != sK60
| X1 != sK59
| cons(sK54(X0,X1),nil) = X1
| nil = sK59 ),
inference(resolution_lifted,[status(thm)],[c_249,c_254]) ).
cnf(c_2043,plain,
( cons(sK54(sK60,sK59),nil) = sK59
| nil = sK59 ),
inference(unflattening,[status(thm)],[c_2042]) ).
cnf(c_2058,plain,
( X0 != sK60
| X1 != sK59
| app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0
| nil = sK59 ),
inference(resolution_lifted,[status(thm)],[c_248,c_254]) ).
cnf(c_2059,plain,
( app(app(sK55(sK60,sK59),sK59),sK56(sK60,sK59)) = sK60
| nil = sK59 ),
inference(unflattening,[status(thm)],[c_2058]) ).
cnf(c_3814,plain,
( app(app(sK55(sK60,sK59),sK59),sK56(sK60,sK59)) = sK60
| nil = sK59 ),
inference(subtyping,[status(esa)],[c_2059]) ).
cnf(c_3816,plain,
( cons(sK54(sK60,sK59),nil) = sK59
| nil = sK59 ),
inference(subtyping,[status(esa)],[c_2043]) ).
cnf(c_3818,plain,
( nil = sK59
| ssList(sK56(sK60,sK59)) ),
inference(subtyping,[status(esa)],[c_2027]) ).
cnf(c_3820,plain,
( nil = sK59
| ssList(sK55(sK60,sK59)) ),
inference(subtyping,[status(esa)],[c_2011]) ).
cnf(c_3822,plain,
( nil = sK59
| ssItem(sK54(sK60,sK59)) ),
inference(subtyping,[status(esa)],[c_1995]) ).
cnf(c_3837,negated_conjecture,
ssList(sK60),
inference(subtyping,[status(esa)],[c_258]) ).
cnf(c_3850,plain,
( ~ ssList(X0_13)
| app(X0_13,nil) = X0_13 ),
inference(subtyping,[status(esa)],[c_232]) ).
cnf(c_3863,plain,
equalelemsP(nil),
inference(subtyping,[status(esa)],[c_218]) ).
cnf(c_3864,plain,
( ~ ssItem(X0_14)
| equalelemsP(cons(X0_14,nil)) ),
inference(subtyping,[status(esa)],[c_217]) ).
cnf(c_3878,plain,
( ~ ssList(X0_13)
| segmentP(X0_13,nil) ),
inference(subtyping,[status(esa)],[c_194]) ).
cnf(c_3879,plain,
( ~ segmentP(X0_13,X1_13)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ~ ssList(X2_13)
| ~ ssList(X3_13)
| segmentP(app(app(X2_13,X0_13),X3_13),X1_13) ),
inference(subtyping,[status(esa)],[c_193]) ).
cnf(c_3880,plain,
( ~ ssList(X0_13)
| segmentP(X0_13,X0_13) ),
inference(subtyping,[status(esa)],[c_192]) ).
cnf(c_5570,plain,
app(sK60,nil) = sK60,
inference(superposition,[status(thm)],[c_3837,c_3850]) ).
cnf(c_6188,plain,
( ~ ssItem(sK54(sK60,sK59))
| nil = sK59
| equalelemsP(sK59) ),
inference(superposition,[status(thm)],[c_3816,c_3864]) ).
cnf(c_6189,plain,
( nil = sK59
| equalelemsP(sK59) ),
inference(global_subsumption_just,[status(thm)],[c_6188,c_3822,c_6188]) ).
cnf(c_6209,plain,
( ~ ssList(sK56(sK60,sK59))
| ~ ssList(sK55(sK60,sK59))
| ~ segmentP(sK59,X0_13)
| ~ ssList(X0_13)
| ~ ssList(sK59)
| nil = sK59
| segmentP(sK60,X0_13) ),
inference(superposition,[status(thm)],[c_3814,c_3879]) ).
cnf(c_6213,plain,
( ~ segmentP(nil,X0_13)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ~ ssList(nil)
| ~ ssList(sK60)
| segmentP(app(sK60,X1_13),X0_13) ),
inference(superposition,[status(thm)],[c_5570,c_3879]) ).
cnf(c_6245,plain,
( ~ segmentP(nil,X0_13)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| segmentP(app(sK60,X1_13),X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_6213,c_258,c_141,c_6213]) ).
cnf(c_6253,plain,
( ~ ssList(X0_13)
| ~ segmentP(sK59,X0_13)
| nil = sK59
| segmentP(sK60,X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_6209,c_259,c_3818,c_3820,c_6209]) ).
cnf(c_6254,plain,
( ~ segmentP(sK59,X0_13)
| ~ ssList(X0_13)
| nil = sK59
| segmentP(sK60,X0_13) ),
inference(renaming,[status(thm)],[c_6253]) ).
cnf(c_6579,plain,
( ~ segmentP(nil,X0_13)
| ~ ssList(X0_13)
| ~ ssList(nil)
| segmentP(sK60,X0_13) ),
inference(superposition,[status(thm)],[c_5570,c_6245]) ).
cnf(c_6580,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| segmentP(sK60,nil) ),
inference(instantiation,[status(thm)],[c_6579]) ).
cnf(c_6589,plain,
( ~ ssList(nil)
| ~ ssList(sK59)
| nil = sK59
| segmentP(sK60,nil) ),
inference(superposition,[status(thm)],[c_3878,c_6254]) ).
cnf(c_6590,plain,
segmentP(sK60,nil),
inference(global_subsumption_just,[status(thm)],[c_6589,c_141,c_195,c_6580]) ).
cnf(c_7426,plain,
( ~ ssList(sK59)
| nil = sK59
| segmentP(sK60,sK59) ),
inference(superposition,[status(thm)],[c_3880,c_6254]) ).
cnf(c_7431,plain,
nil = sK59,
inference(global_subsumption_just,[status(thm)],[c_7426,c_259,c_253,c_6189,c_7426]) ).
cnf(c_7441,plain,
segmentP(sK60,sK59),
inference(superposition,[status(thm)],[c_7431,c_6590]) ).
cnf(c_7451,plain,
equalelemsP(sK59),
inference(superposition,[status(thm)],[c_7431,c_3863]) ).
cnf(c_7454,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7441,c_7451,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC330+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 23:21:19 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.34/2.14 % SZS status Started for theBenchmark.p
% 10.34/2.14 % SZS status Theorem for theBenchmark.p
% 10.34/2.14
% 10.34/2.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.34/2.14
% 10.34/2.14 ------ iProver source info
% 10.34/2.14
% 10.34/2.14 git: date: 2024-05-02 19:28:25 +0000
% 10.34/2.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.34/2.14 git: non_committed_changes: false
% 10.34/2.14
% 10.34/2.14 ------ Parsing...
% 10.34/2.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.34/2.14
% 10.34/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:8:0s pe_e
% 10.34/2.14
% 10.34/2.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.34/2.14
% 10.34/2.14 ------ Preprocessing... sf_s rm: 1 0s sf_e
% 10.34/2.14 ------ Proving...
% 10.34/2.14 ------ Problem Properties
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14 clauses 197
% 10.34/2.14 conjectures 3
% 10.34/2.14 EPR 52
% 10.34/2.14 Horn 119
% 10.34/2.14 unary 18
% 10.34/2.14 binary 51
% 10.34/2.14 lits 658
% 10.34/2.14 lits eq 96
% 10.34/2.14 fd_pure 0
% 10.34/2.14 fd_pseudo 0
% 10.34/2.14 fd_cond 21
% 10.34/2.14 fd_pseudo_cond 14
% 10.34/2.14 AC symbols 0
% 10.34/2.14
% 10.34/2.14 ------ Input Options Time Limit: Unbounded
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14 ------
% 10.34/2.14 Current options:
% 10.34/2.14 ------
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14 ------ Proving...
% 10.34/2.14
% 10.34/2.14
% 10.34/2.14 % SZS status Theorem for theBenchmark.p
% 10.34/2.14
% 10.34/2.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.34/2.14
% 10.34/2.14
%------------------------------------------------------------------------------