TSTP Solution File: SWC245+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC245+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 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 : Wed Aug 31 18:39:51 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 81 ( 7 unt; 0 def)
% Number of atoms : 618 ( 177 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 851 ( 314 ~; 302 |; 210 &)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 210 ( 142 !; 68 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f440,plain,
$false,
inference(avatar_sat_refutation,[],[f268,f278,f426,f432,f439]) ).
fof(f439,plain,
( spl16_1
| ~ spl16_4
| ~ spl16_5
| ~ spl16_6 ),
inference(avatar_contradiction_clause,[],[f438]) ).
fof(f438,plain,
( $false
| spl16_1
| ~ spl16_4
| ~ spl16_5
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f437,f421]) ).
fof(f421,plain,
( ssItem(sK13(sK7(sK8),nil,sK6(sK8)))
| ~ spl16_5 ),
inference(avatar_component_clause,[],[f419]) ).
fof(f419,plain,
( spl16_5
<=> ssItem(sK13(sK7(sK8),nil,sK6(sK8))) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_5])]) ).
fof(f437,plain,
( ~ ssItem(sK13(sK7(sK8),nil,sK6(sK8)))
| spl16_1
| ~ spl16_4
| ~ spl16_6 ),
inference(resolution,[],[f436,f232]) ).
fof(f232,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f436,plain,
( memberP(nil,sK13(sK7(sK8),nil,sK6(sK8)))
| spl16_1
| ~ spl16_4
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f435,f262]) ).
fof(f262,plain,
( nil != sK8
| spl16_1 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f260,plain,
( spl16_1
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).
fof(f435,plain,
( memberP(nil,sK13(sK7(sK8),nil,sK6(sK8)))
| nil = sK8
| ~ spl16_4
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f434,f226]) ).
fof(f226,plain,
ssList(sK8),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
( ssList(sK8)
& ssList(sK10)
& ssList(sK11)
& sK9 = sK11
& ( nil = sK11
| nil != sK10 )
& equalelemsP(sK10)
& ssList(sK12)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| sK12 != app(cons(X5,nil),X6) ) )
& app(sK10,sK12) = sK11
& sK10 = sK8
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ( ~ leq(X8,sK13(X8,X9,X10))
& lt(X8,sK13(X8,X9,X10))
& memberP(X9,sK13(X8,X9,X10))
& ssItem(sK13(X8,X9,X10))
& memberP(X10,sK13(X8,X9,X10)) ) ) )
| ~ ssItem(X8) )
& ssList(sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13])],[f160,f166,f165,f164,f163,f162,f161]) ).
fof(f161,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& X0 = X2
& nil != X0
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
& ssList(X1) ) )
=> ( ssList(sK8)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& sK8 = X2
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& sK8 = X2
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK9 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& sK8 = X2
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK9 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& sK8 = X2
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
=> ( ssList(sK10)
& ? [X3] :
( ssList(X3)
& sK9 = X3
& ( nil = X3
| nil != sK10 )
& ? [X4] :
( equalelemsP(sK10)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(sK10,X4) = X3 )
& sK10 = sK8
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
( ? [X3] :
( ssList(X3)
& sK9 = X3
& ( nil = X3
| nil != sK10 )
& ? [X4] :
( equalelemsP(sK10)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(sK10,X4) = X3 )
& sK10 = sK8
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) )
=> ( ssList(sK11)
& sK9 = sK11
& ( nil = sK11
| nil != sK10 )
& ? [X4] :
( equalelemsP(sK10)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(sK10,X4) = sK11 )
& sK10 = sK8
& nil != sK8
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
( ? [X4] :
( equalelemsP(sK10)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(sK10,X4) = sK11 )
=> ( equalelemsP(sK10)
& ssList(sK12)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| sK10 != app(X7,cons(X5,nil)) )
| ~ ssList(X6)
| sK12 != app(cons(X5,nil),X6) ) )
& app(sK10,sK12) = sK11 ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) )
=> ( ~ leq(X8,sK13(X8,X9,X10))
& lt(X8,sK13(X8,X9,X10))
& memberP(X9,sK13(X8,X9,X10))
& ssItem(sK13(X8,X9,X10))
& memberP(X10,sK13(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& app(X2,X4) = X3 )
& X0 = X2
& nil != X0
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10)
| ? [X11] :
( ~ leq(X8,X11)
& lt(X8,X11)
& memberP(X9,X11)
& ssItem(X11)
& memberP(X10,X11) ) ) )
| ~ ssItem(X8) ) ) )
& ssList(X1) ) ),
inference(rectify,[],[f127]) ).
fof(f127,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X8] :
( equalelemsP(X2)
& ssList(X8)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X9,nil)) != X2 )
| ~ ssList(X10)
| app(cons(X9,nil),X10) != X8 ) )
& app(X2,X8) = X3 )
& X0 = X2
& nil != X0
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6)
| ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7)
& memberP(X6,X7) ) ) )
| ~ ssItem(X4) ) ) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil != X3
& nil = X2 )
| X0 != X2
| nil = X0
| ! [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 )
& app(cons(X9,nil),X10) = X8 )
& ssItem(X9) )
| app(X2,X8) != X3
| ~ equalelemsP(X2)
| ~ ssList(X8) )
| ~ ssList(X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7)
| leq(X4,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| X1 != X3 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil != X3
& nil = X2 )
| X0 != X2
| nil = X0
| ! [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 )
& app(cons(X9,nil),X10) = X8 )
& ssItem(X9) )
| app(X2,X8) != X3
| ~ equalelemsP(X2)
| ~ ssList(X8) )
| ~ ssList(X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7)
| leq(X4,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| X1 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f434,plain,
( ~ ssList(sK8)
| nil = sK8
| memberP(nil,sK13(sK7(sK8),nil,sK6(sK8)))
| ~ spl16_4
| ~ spl16_6 ),
inference(subsumption_resolution,[],[f433,f424]) ).
fof(f424,plain,
( ssList(cons(sK7(sK8),nil))
| ~ spl16_6 ),
inference(avatar_component_clause,[],[f423]) ).
fof(f423,plain,
( spl16_6
<=> ssList(cons(sK7(sK8),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_6])]) ).
fof(f433,plain,
( ~ ssList(cons(sK7(sK8),nil))
| ~ ssList(sK8)
| nil = sK8
| memberP(nil,sK13(sK7(sK8),nil,sK6(sK8)))
| ~ spl16_4 ),
inference(equality_resolution,[],[f405]) ).
fof(f405,plain,
( ! [X0] :
( sK8 != X0
| memberP(nil,sK13(sK7(X0),nil,sK6(X0)))
| nil = X0
| ~ ssList(X0)
| ~ ssList(cons(sK7(X0),nil)) )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f404,f192]) ).
fof(f192,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
! [X0] :
( ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f109,f154,f153]) ).
fof(f153,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
=> ( ssList(sK6(X0))
& ? [X2] :
( ssItem(X2)
& cons(X2,sK6(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,sK6(X0)) = X0 )
=> ( ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f108]) ).
fof(f108,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f404,plain,
( ! [X0] :
( memberP(nil,sK13(sK7(X0),nil,sK6(X0)))
| ~ ssList(X0)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssItem(sK7(X0))
| sK8 != X0 )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f403,f193]) ).
fof(f193,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f403,plain,
( ! [X0] :
( sK8 != X0
| memberP(nil,sK13(sK7(X0),nil,sK6(X0)))
| ~ ssList(sK6(X0))
| ~ ssList(X0)
| nil = X0
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0)) )
| ~ spl16_4 ),
inference(superposition,[],[f382,f191]) ).
fof(f191,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f155]) ).
fof(f382,plain,
( ! [X6,X5] :
( cons(X5,X6) != sK8
| memberP(nil,sK13(X5,nil,X6))
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(cons(X5,nil)) )
| ~ spl16_4 ),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f364,plain,
( ! [X6,X5] :
( ~ ssItem(X5)
| ~ ssItem(X5)
| cons(X5,X6) != sK8
| memberP(nil,sK13(X5,nil,X6))
| ~ ssList(X6)
| ~ ssList(cons(X5,nil))
| ~ ssList(X6) )
| ~ spl16_4 ),
inference(superposition,[],[f297,f242]) ).
fof(f242,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
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(f297,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK8
| memberP(nil,sK13(X4,nil,X5))
| ~ ssList(X5)
| ~ ssList(cons(X4,nil))
| ~ ssItem(X4) )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f293,f275]) ).
fof(f275,plain,
( ssList(nil)
| ~ spl16_4 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl16_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_4])]) ).
fof(f293,plain,
! [X4,X5] :
( ~ ssList(cons(X4,nil))
| memberP(nil,sK13(X4,nil,X5))
| app(cons(X4,nil),X5) != sK8
| ~ ssItem(X4)
| ~ ssList(nil)
| ~ ssList(X5) ),
inference(superposition,[],[f213,f204]) ).
fof(f204,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f213,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X9)
| ~ ssItem(X8)
| memberP(X9,sK13(X8,X9,X10))
| ~ ssList(X10) ),
inference(cnf_transformation,[],[f167]) ).
fof(f432,plain,
( spl16_1
| ~ spl16_4
| spl16_6 ),
inference(avatar_contradiction_clause,[],[f431]) ).
fof(f431,plain,
( $false
| spl16_1
| ~ spl16_4
| spl16_6 ),
inference(subsumption_resolution,[],[f430,f262]) ).
fof(f430,plain,
( nil = sK8
| ~ spl16_4
| spl16_6 ),
inference(subsumption_resolution,[],[f429,f226]) ).
fof(f429,plain,
( ~ ssList(sK8)
| nil = sK8
| ~ spl16_4
| spl16_6 ),
inference(resolution,[],[f428,f192]) ).
fof(f428,plain,
( ~ ssItem(sK7(sK8))
| ~ spl16_4
| spl16_6 ),
inference(subsumption_resolution,[],[f427,f275]) ).
fof(f427,plain,
( ~ ssList(nil)
| ~ ssItem(sK7(sK8))
| spl16_6 ),
inference(resolution,[],[f425,f173]) ).
fof(f173,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f425,plain,
( ~ ssList(cons(sK7(sK8),nil))
| spl16_6 ),
inference(avatar_component_clause,[],[f423]) ).
fof(f426,plain,
( spl16_5
| ~ spl16_6
| spl16_1
| ~ spl16_4 ),
inference(avatar_split_clause,[],[f417,f274,f260,f423,f419]) ).
fof(f417,plain,
( ~ ssList(cons(sK7(sK8),nil))
| ssItem(sK13(sK7(sK8),nil,sK6(sK8)))
| spl16_1
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f416,f262]) ).
fof(f416,plain,
( ssItem(sK13(sK7(sK8),nil,sK6(sK8)))
| nil = sK8
| ~ ssList(cons(sK7(sK8),nil))
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f415,f226]) ).
fof(f415,plain,
( ~ ssList(sK8)
| ~ ssList(cons(sK7(sK8),nil))
| nil = sK8
| ssItem(sK13(sK7(sK8),nil,sK6(sK8)))
| ~ spl16_4 ),
inference(equality_resolution,[],[f402]) ).
fof(f402,plain,
( ! [X0] :
( sK8 != X0
| ssItem(sK13(sK7(X0),nil,sK6(X0)))
| ~ ssList(cons(sK7(X0),nil))
| ~ ssList(X0)
| nil = X0 )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f401,f192]) ).
fof(f401,plain,
( ! [X0] :
( ~ ssList(X0)
| sK8 != X0
| ssItem(sK13(sK7(X0),nil,sK6(X0)))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(cons(sK7(X0),nil)) )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f400,f193]) ).
fof(f400,plain,
( ! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| ssItem(sK13(sK7(X0),nil,sK6(X0)))
| ~ ssList(sK6(X0))
| ~ ssList(X0)
| nil = X0
| sK8 != X0
| ~ ssItem(sK7(X0)) )
| ~ spl16_4 ),
inference(superposition,[],[f389,f191]) ).
fof(f389,plain,
( ! [X10,X9] :
( cons(X9,X10) != sK8
| ~ ssItem(X9)
| ~ ssList(cons(X9,nil))
| ~ ssList(X10)
| ssItem(sK13(X9,nil,X10)) )
| ~ spl16_4 ),
inference(duplicate_literal_removal,[],[f366]) ).
fof(f366,plain,
( ! [X10,X9] :
( ~ ssList(X10)
| ~ ssList(X10)
| cons(X9,X10) != sK8
| ~ ssItem(X9)
| ~ ssItem(X9)
| ~ ssList(cons(X9,nil))
| ssItem(sK13(X9,nil,X10)) )
| ~ spl16_4 ),
inference(superposition,[],[f299,f242]) ).
fof(f299,plain,
( ! [X8,X9] :
( app(cons(X8,nil),X9) != sK8
| ~ ssList(X9)
| ~ ssItem(X8)
| ssItem(sK13(X8,nil,X9))
| ~ ssList(cons(X8,nil)) )
| ~ spl16_4 ),
inference(subsumption_resolution,[],[f295,f275]) ).
fof(f295,plain,
! [X8,X9] :
( ~ ssList(cons(X8,nil))
| ~ ssItem(X8)
| app(cons(X8,nil),X9) != sK8
| ~ ssList(X9)
| ~ ssList(nil)
| ssItem(sK13(X8,nil,X9)) ),
inference(superposition,[],[f212,f204]) ).
fof(f212,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK8
| ~ ssList(X10)
| ~ ssList(X9)
| ssItem(sK13(X8,X9,X10))
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f167]) ).
fof(f278,plain,
spl16_4,
inference(avatar_split_clause,[],[f229,f274]) ).
fof(f229,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f268,plain,
~ spl16_1,
inference(avatar_split_clause,[],[f216,f260]) ).
fof(f216,plain,
nil != sK8,
inference(cnf_transformation,[],[f167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC245+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 18:53:01 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.52 % (5696)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52 % (5683)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (5689)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.53 % (5703)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.53 % (5695)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.54 % (5705)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.54 % (5695)Instruction limit reached!
% 0.21/0.54 % (5695)------------------------------
% 0.21/0.54 % (5695)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (5695)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (5695)Termination reason: Unknown
% 0.21/0.54 % (5695)Termination phase: Preprocessing 3
% 0.21/0.54
% 0.21/0.54 % (5695)Memory used [KB]: 1535
% 0.21/0.54 % (5695)Time elapsed: 0.006 s
% 0.21/0.54 % (5695)Instructions burned: 3 (million)
% 0.21/0.54 % (5695)------------------------------
% 0.21/0.54 % (5695)------------------------------
% 0.21/0.54 % (5687)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.54 % (5696)Instruction limit reached!
% 0.21/0.54 % (5696)------------------------------
% 0.21/0.54 % (5696)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (5683)Instruction limit reached!
% 0.21/0.54 % (5683)------------------------------
% 0.21/0.54 % (5683)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (5683)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (5683)Termination reason: Unknown
% 0.21/0.54 % (5683)Termination phase: Preprocessing 3
% 0.21/0.54
% 0.21/0.54 % (5683)Memory used [KB]: 1663
% 0.21/0.54 % (5683)Time elapsed: 0.004 s
% 0.21/0.54 % (5683)Instructions burned: 4 (million)
% 0.21/0.54 % (5683)------------------------------
% 0.21/0.54 % (5683)------------------------------
% 0.21/0.54 % (5696)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (5696)Termination reason: Unknown
% 0.21/0.54 % (5696)Termination phase: Function definition elimination
% 0.21/0.54
% 0.21/0.54 % (5696)Memory used [KB]: 1791
% 0.21/0.54 % (5696)Time elapsed: 0.005 s
% 0.21/0.54 % (5696)Instructions burned: 8 (million)
% 0.21/0.54 % (5696)------------------------------
% 0.21/0.54 % (5696)------------------------------
% 0.21/0.55 % (5681)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.55 % (5708)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.21/0.55 % (5686)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.56 % (5700)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.56 % (5687)First to succeed.
% 0.21/0.56 % (5693)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.56 % (5691)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.56 % (5698)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.57 % (5687)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (5687)------------------------------
% 0.21/0.57 % (5687)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (5687)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (5687)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (5687)Memory used [KB]: 6268
% 0.21/0.57 % (5687)Time elapsed: 0.081 s
% 0.21/0.57 % (5687)Instructions burned: 14 (million)
% 0.21/0.57 % (5687)------------------------------
% 0.21/0.57 % (5687)------------------------------
% 0.21/0.57 % (5680)Success in time 0.195 s
%------------------------------------------------------------------------------