TSTP Solution File: SWC220+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC220+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 : 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 : Wed Aug 31 18:39:41 EDT 2022
% Result : Theorem 1.40s 0.56s
% Output : Refutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 80 ( 4 unt; 0 def)
% Number of atoms : 679 ( 117 equ)
% Maximal formula atoms : 52 ( 8 avg)
% Number of connectives : 953 ( 354 ~; 345 |; 224 &)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 182 ( 92 !; 90 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f291,plain,
$false,
inference(avatar_sat_refutation,[],[f229,f234,f238,f239,f244,f258,f290]) ).
fof(f290,plain,
( ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f289,plain,
( $false
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f288,f257]) ).
fof(f257,plain,
( ssItem(sK4)
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f255,plain,
( spl14_8
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_8])]) ).
fof(f288,plain,
( ~ ssItem(sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f287,f283]) ).
fof(f283,plain,
( leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f282,f274]) ).
fof(f274,plain,
( memberP(sK5,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f273,f228]) ).
fof(f228,plain,
( ssList(sK5)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl14_2
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f273,plain,
( memberP(sK5,sK7(sK4,sK5,sK6))
| ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f272,f243]) ).
fof(f243,plain,
( ssList(sK6)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl14_5
<=> ssList(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_5])]) ).
fof(f272,plain,
( memberP(sK5,sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f271,f257]) ).
fof(f271,plain,
( ~ ssItem(sK4)
| memberP(sK5,sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f270]) ).
fof(f270,plain,
( memberP(sK5,sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4)
| sK0 != sK0
| ~ spl14_3 ),
inference(superposition,[],[f157,f233]) ).
fof(f233,plain,
( sK0 = app(app(sK5,cons(sK4,nil)),sK6)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl14_3
<=> sK0 = app(app(sK5,cons(sK4,nil)),sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f157,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X9)
| ~ ssItem(X8)
| memberP(X9,sK7(X8,X9,X10))
| ~ ssList(X10) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
( ssList(sK0)
& ssList(sK2)
& nil != sK0
& sK3 = sK1
& sK2 = sK0
& ( nil = sK2
| ( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7) )
& ssList(sK6)
& sK2 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK5)
& ssItem(sK4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( ~ leq(sK7(X8,X9,X10),X8)
& leq(X8,sK7(X8,X9,X10))
& ssItem(sK7(X8,X9,X10))
& memberP(X9,sK7(X8,X9,X10))
& memberP(X10,sK7(X8,X9,X10)) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(sK3)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f127,f135,f134,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& X1 = X3
& X0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK0
& X1 = X3
& sK0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK0
& X1 = X3
& sK0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK0
& sK1 = X3
& sK0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK0
& sK1 = X3
& sK0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
=> ( ssList(sK2)
& ? [X3] :
( nil != sK0
& sK1 = X3
& sK2 = sK0
& ( nil = sK2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = sK2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( nil != sK0
& sK1 = X3
& sK2 = sK0
& ( nil = sK2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = sK2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) )
=> ( nil != sK0
& sK3 = sK1
& sK2 = sK0
& ( nil = sK2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = sK2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = sK2 )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& sK2 = app(app(X5,cons(sK4,nil)),X6) )
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& sK2 = app(app(X5,cons(sK4,nil)),X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(sK5,X7) )
& ssList(X6)
& sK2 = app(app(sK5,cons(sK4,nil)),X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X6] :
( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(sK5,X7) )
& ssList(X6)
& sK2 = app(app(sK5,cons(sK4,nil)),X6) )
=> ( ! [X7] :
( leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7) )
& ssList(sK6)
& sK2 = app(app(sK5,cons(sK4,nil)),sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
=> ( ~ leq(sK7(X8,X9,X10),X8)
& leq(X8,sK7(X8,X9,X10))
& ssItem(sK7(X8,X9,X10))
& memberP(X9,sK7(X8,X9,X10))
& memberP(X10,sK7(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& X1 = X3
& X0 = X2
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X7,X4)
| ~ leq(X4,X7)
| ~ ssItem(X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& memberP(X10,X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ssList(X3) ) )
& ssList(X1) ) ),
inference(rectify,[],[f102]) ).
fof(f102,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& X1 = X3
& X0 = X2
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( leq(X11,X8)
| ~ leq(X8,X11)
| ~ ssItem(X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11) )
& ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X7,X4)
& leq(X4,X7)
& ssItem(X7)
& memberP(X5,X7)
& memberP(X6,X7) )
| app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ssList(X3) ) )
& ssList(X1) ) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& nil != X0
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( leq(X11,X8)
| ~ leq(X8,X11)
| ~ ssItem(X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) ) )
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X7,X4)
& memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ssItem(X7) )
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0 )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| nil = X0
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X11] :
( ~ leq(X11,X8)
& memberP(X10,X11)
& ssItem(X11)
& memberP(X9,X11)
& leq(X8,X11) )
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X7,X4)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7) ) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X5) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| nil = X0
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X11] :
( ~ leq(X11,X8)
& memberP(X10,X11)
& ssItem(X11)
& memberP(X9,X11)
& leq(X8,X11) )
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X7,X4)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7) ) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X5) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f282,plain,
( ~ memberP(sK5,sK7(sK4,sK5,sK6))
| leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f281,f269]) ).
fof(f269,plain,
( memberP(sK6,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f268,f257]) ).
fof(f268,plain,
( ~ ssItem(sK4)
| memberP(sK6,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5 ),
inference(subsumption_resolution,[],[f267,f243]) ).
fof(f267,plain,
( ~ ssList(sK6)
| ~ ssItem(sK4)
| memberP(sK6,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f266,f228]) ).
fof(f266,plain,
( ~ ssList(sK5)
| ~ ssList(sK6)
| ~ ssItem(sK4)
| memberP(sK6,sK7(sK4,sK5,sK6))
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f265]) ).
fof(f265,plain,
( ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ ssList(sK5)
| sK0 != sK0
| memberP(sK6,sK7(sK4,sK5,sK6))
| ~ spl14_3 ),
inference(superposition,[],[f156,f233]) ).
fof(f156,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK0
| memberP(X10,sK7(X8,X9,X10))
| ~ ssItem(X8)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f136]) ).
fof(f281,plain,
( ~ memberP(sK6,sK7(sK4,sK5,sK6))
| ~ memberP(sK5,sK7(sK4,sK5,sK6))
| leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f280,f263]) ).
fof(f263,plain,
( ssItem(sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f262,f228]) ).
fof(f262,plain,
( ssItem(sK7(sK4,sK5,sK6))
| ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f261,f243]) ).
fof(f261,plain,
( ssItem(sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f260,f257]) ).
fof(f260,plain,
( ~ ssItem(sK4)
| ssItem(sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f259]) ).
fof(f259,plain,
( ~ ssItem(sK4)
| sK0 != sK0
| ~ ssList(sK5)
| ssItem(sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ spl14_3 ),
inference(superposition,[],[f158,f233]) ).
fof(f158,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X10)
| ~ ssItem(X8)
| ~ ssList(X9)
| ssItem(sK7(X8,X9,X10)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f280,plain,
( ~ ssItem(sK7(sK4,sK5,sK6))
| ~ memberP(sK5,sK7(sK4,sK5,sK6))
| ~ memberP(sK6,sK7(sK4,sK5,sK6))
| leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(resolution,[],[f279,f237]) ).
fof(f237,plain,
( ! [X7] :
( ~ leq(sK4,X7)
| leq(X7,sK4)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7)
| ~ ssItem(X7) )
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f236,plain,
( spl14_4
<=> ! [X7] :
( ~ memberP(sK5,X7)
| ~ ssItem(X7)
| ~ leq(sK4,X7)
| leq(X7,sK4)
| ~ memberP(sK6,X7) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f279,plain,
( leq(sK4,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f278,f243]) ).
fof(f278,plain,
( leq(sK4,sK7(sK4,sK5,sK6))
| ~ ssList(sK6)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f277,f257]) ).
fof(f277,plain,
( ~ ssItem(sK4)
| ~ ssList(sK6)
| leq(sK4,sK7(sK4,sK5,sK6))
| ~ spl14_2
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f276,f228]) ).
fof(f276,plain,
( leq(sK4,sK7(sK4,sK5,sK6))
| ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ ssList(sK6)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f275]) ).
fof(f275,plain,
( sK0 != sK0
| ~ ssList(sK5)
| leq(sK4,sK7(sK4,sK5,sK6))
| ~ ssItem(sK4)
| ~ ssList(sK6)
| ~ spl14_3 ),
inference(superposition,[],[f159,f233]) ).
fof(f159,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssItem(X8)
| ~ ssList(X10)
| ~ ssList(X9)
| leq(X8,sK7(X8,X9,X10)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f287,plain,
( ~ leq(sK7(sK4,sK5,sK6),sK4)
| ~ ssItem(sK4)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5 ),
inference(subsumption_resolution,[],[f286,f228]) ).
fof(f286,plain,
( ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_3
| ~ spl14_5 ),
inference(subsumption_resolution,[],[f285,f243]) ).
fof(f285,plain,
( ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f284]) ).
fof(f284,plain,
( ~ ssList(sK6)
| sK0 != sK0
| ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ leq(sK7(sK4,sK5,sK6),sK4)
| ~ spl14_3 ),
inference(superposition,[],[f160,f233]) ).
fof(f160,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK0
| ~ ssList(X9)
| ~ ssList(X10)
| ~ leq(sK7(X8,X9,X10),X8)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f136]) ).
fof(f258,plain,
( spl14_8
| spl14_1 ),
inference(avatar_split_clause,[],[f213,f222,f255]) ).
fof(f222,plain,
( spl14_1
<=> nil = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f213,plain,
( nil = sK0
| ssItem(sK4) ),
inference(definition_unfolding,[],[f161,f166]) ).
fof(f166,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f136]) ).
fof(f161,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f244,plain,
( spl14_1
| spl14_5 ),
inference(avatar_split_clause,[],[f210,f241,f222]) ).
fof(f210,plain,
( ssList(sK6)
| nil = sK0 ),
inference(definition_unfolding,[],[f164,f166]) ).
fof(f164,plain,
( nil = sK2
| ssList(sK6) ),
inference(cnf_transformation,[],[f136]) ).
fof(f239,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f168,f222]) ).
fof(f168,plain,
nil != sK0,
inference(cnf_transformation,[],[f136]) ).
fof(f238,plain,
( spl14_1
| spl14_4 ),
inference(avatar_split_clause,[],[f209,f236,f222]) ).
fof(f209,plain,
! [X7] :
( ~ memberP(sK5,X7)
| ~ memberP(sK6,X7)
| leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| nil = sK0 ),
inference(definition_unfolding,[],[f165,f166]) ).
fof(f165,plain,
! [X7] :
( nil = sK2
| leq(X7,sK4)
| ~ leq(sK4,X7)
| ~ ssItem(X7)
| ~ memberP(sK6,X7)
| ~ memberP(sK5,X7) ),
inference(cnf_transformation,[],[f136]) ).
fof(f234,plain,
( spl14_1
| spl14_3 ),
inference(avatar_split_clause,[],[f211,f231,f222]) ).
fof(f211,plain,
( sK0 = app(app(sK5,cons(sK4,nil)),sK6)
| nil = sK0 ),
inference(definition_unfolding,[],[f163,f166,f166]) ).
fof(f163,plain,
( nil = sK2
| sK2 = app(app(sK5,cons(sK4,nil)),sK6) ),
inference(cnf_transformation,[],[f136]) ).
fof(f229,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f212,f226,f222]) ).
fof(f212,plain,
( ssList(sK5)
| nil = sK0 ),
inference(definition_unfolding,[],[f162,f166]) ).
fof(f162,plain,
( nil = sK2
| ssList(sK5) ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC220+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:34:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % (16420)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)
% 1.24/0.52 % (16429)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.24/0.52 % (16422)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)
% 1.24/0.53 % (16412)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.24/0.53 % (16439)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.40/0.53 % (16415)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.40/0.53 % (16431)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.40/0.53 % (16431)Instruction limit reached!
% 1.40/0.53 % (16431)------------------------------
% 1.40/0.53 % (16431)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.53 % (16431)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.53 % (16431)Termination reason: Unknown
% 1.40/0.53 % (16431)Termination phase: Preprocessing 2
% 1.40/0.53
% 1.40/0.53 % (16431)Memory used [KB]: 1535
% 1.40/0.53 % (16431)Time elapsed: 0.003 s
% 1.40/0.53 % (16431)Instructions burned: 2 (million)
% 1.40/0.53 % (16431)------------------------------
% 1.40/0.53 % (16431)------------------------------
% 1.40/0.53 % (16418)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)
% 1.40/0.54 % (16417)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)
% 1.40/0.54 % (16416)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.40/0.54 % (16414)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)
% 1.40/0.54 % (16438)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.40/0.54 % (16418)First to succeed.
% 1.40/0.54 % (16419)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.40/0.54 % (16421)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.40/0.54 % (16422)Instruction limit reached!
% 1.40/0.54 % (16422)------------------------------
% 1.40/0.54 % (16422)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.54 % (16422)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.54 % (16422)Termination reason: Unknown
% 1.40/0.54 % (16422)Termination phase: Saturation
% 1.40/0.54
% 1.40/0.54 % (16422)Memory used [KB]: 6268
% 1.40/0.54 % (16428)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)
% 1.40/0.54 % (16422)Time elapsed: 0.127 s
% 1.40/0.54 % (16422)Instructions burned: 14 (million)
% 1.40/0.54 % (16422)------------------------------
% 1.40/0.54 % (16422)------------------------------
% 1.40/0.54 % (16434)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.40/0.54 % (16433)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.40/0.55 % (16423)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.40/0.55 % (16428)Instruction limit reached!
% 1.40/0.55 % (16428)------------------------------
% 1.40/0.55 % (16428)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.55 % (16428)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.55 % (16428)Termination reason: Unknown
% 1.40/0.55 % (16428)Termination phase: Function definition elimination
% 1.40/0.55
% 1.40/0.55 % (16428)Memory used [KB]: 1791
% 1.40/0.55 % (16428)Time elapsed: 0.004 s
% 1.40/0.55 % (16428)Instructions burned: 8 (million)
% 1.40/0.55 % (16428)------------------------------
% 1.40/0.55 % (16428)------------------------------
% 1.40/0.55 % (16440)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)
% 1.40/0.55 % (16435)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)
% 1.40/0.55 % (16425)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.40/0.55 % (16424)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)
% 1.40/0.55 % (16437)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)
% 1.40/0.55 % (16436)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.40/0.55 % (16442)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.40/0.55 % (16441)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.40/0.56 % (16426)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)
% 1.40/0.56 % (16413)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.40/0.56 % (16426)Instruction limit reached!
% 1.40/0.56 % (16426)------------------------------
% 1.40/0.56 % (16426)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (16426)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (16426)Termination reason: Unknown
% 1.40/0.56 % (16426)Termination phase: Preprocessing 3
% 1.40/0.56
% 1.40/0.56 % (16426)Memory used [KB]: 1535
% 1.40/0.56 % (16426)Time elapsed: 0.003 s
% 1.40/0.56 % (16426)Instructions burned: 3 (million)
% 1.40/0.56 % (16426)------------------------------
% 1.40/0.56 % (16426)------------------------------
% 1.40/0.56 % (16441)Instruction limit reached!
% 1.40/0.56 % (16441)------------------------------
% 1.40/0.56 % (16441)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (16441)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (16441)Termination reason: Unknown
% 1.40/0.56 % (16441)Termination phase: Property scanning
% 1.40/0.56
% 1.40/0.56 % (16441)Memory used [KB]: 1791
% 1.40/0.56 % (16441)Time elapsed: 0.006 s
% 1.40/0.56 % (16441)Instructions burned: 10 (million)
% 1.40/0.56 % (16441)------------------------------
% 1.40/0.56 % (16441)------------------------------
% 1.40/0.56 % (16414)Instruction limit reached!
% 1.40/0.56 % (16414)------------------------------
% 1.40/0.56 % (16414)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (16414)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (16414)Termination reason: Unknown
% 1.40/0.56 % (16414)Termination phase: Preprocessing 3
% 1.40/0.56
% 1.40/0.56 % (16414)Memory used [KB]: 1535
% 1.40/0.56 % (16414)Time elapsed: 0.003 s
% 1.40/0.56 % (16414)Instructions burned: 3 (million)
% 1.40/0.56 % (16414)------------------------------
% 1.40/0.56 % (16414)------------------------------
% 1.40/0.56 % (16416)Also succeeded, but the first one will report.
% 1.40/0.56 % (16418)Refutation found. Thanks to Tanya!
% 1.40/0.56 % SZS status Theorem for theBenchmark
% 1.40/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.40/0.56 % (16418)------------------------------
% 1.40/0.56 % (16418)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.40/0.56 % (16418)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.40/0.56 % (16418)Termination reason: Refutation
% 1.40/0.56
% 1.40/0.56 % (16418)Memory used [KB]: 6140
% 1.40/0.56 % (16418)Time elapsed: 0.130 s
% 1.40/0.56 % (16418)Instructions burned: 6 (million)
% 1.40/0.56 % (16418)------------------------------
% 1.40/0.56 % (16418)------------------------------
% 1.40/0.56 % (16407)Success in time 0.204 s
%------------------------------------------------------------------------------