TSTP Solution File: SWC242+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC242+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 : n028.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:50 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 79 ( 5 unt; 0 def)
% Number of atoms : 644 ( 105 equ)
% Maximal formula atoms : 52 ( 8 avg)
% Number of connectives : 932 ( 367 ~; 349 |; 192 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 172 ( 98 !; 74 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f312,plain,
$false,
inference(avatar_sat_refutation,[],[f250,f255,f259,f264,f265,f279,f311]) ).
fof(f311,plain,
( ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f310,plain,
( $false
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f309,f249]) ).
fof(f249,plain,
( ssItem(sK9)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f247,plain,
( spl14_2
<=> ssItem(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f309,plain,
( ~ ssItem(sK9)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f308,f263]) ).
fof(f263,plain,
( ssList(sK10)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl14_5
<=> ssList(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_5])]) ).
fof(f308,plain,
( ~ ssList(sK10)
| ~ ssItem(sK9)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f307,f278]) ).
fof(f278,plain,
( ssList(sK11)
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f276,plain,
( spl14_8
<=> ssList(sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_8])]) ).
fof(f307,plain,
( ~ ssList(sK11)
| ~ ssList(sK10)
| ~ ssItem(sK9)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f306,f304]) ).
fof(f304,plain,
( ~ memberP(sK10,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f303,f295]) ).
fof(f295,plain,
( ~ leq(sK9,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f294,f263]) ).
fof(f294,plain,
( ~ leq(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f293,f278]) ).
fof(f293,plain,
( ~ ssList(sK11)
| ~ leq(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ spl14_2
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f292,f249]) ).
fof(f292,plain,
( ~ ssItem(sK9)
| ~ leq(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ ssList(sK11)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f291]) ).
fof(f291,plain,
( ~ ssItem(sK9)
| sK6 != sK6
| ~ ssList(sK10)
| ~ leq(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK11)
| ~ spl14_3 ),
inference(superposition,[],[f229,f254]) ).
fof(f254,plain,
( app(app(sK10,cons(sK9,nil)),sK11) = sK6
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl14_3
<=> app(app(sK10,cons(sK9,nil)),sK11) = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f229,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK6
| ~ ssList(X5)
| ~ ssItem(X4)
| ~ ssList(X6)
| ~ leq(X4,sK8(X4,X5,X6)) ),
inference(definition_unfolding,[],[f205,f207]) ).
fof(f207,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
( ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& ssList(sK7)
& sK5 = sK7
& sK4 = sK6
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ( memberP(X6,sK8(X4,X5,X6))
& ~ leq(X4,sK8(X4,X5,X6))
& ssItem(sK8(X4,X5,X6))
& lt(X4,sK8(X4,X5,X6))
& memberP(X5,sK8(X4,X5,X6)) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK6
| ( ssList(sK11)
& ! [X11] :
( ~ memberP(sK10,X11)
| ~ memberP(sK11,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(sK10,cons(sK9,nil)),sK11) = sK6
& ssList(sK10)
& ssItem(sK9) ) )
& nil != sK4 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f109,f155,f154,f153,f152,f151,f150,f149,f148]) ).
fof(f148,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != X0 ) ) ) )
=> ( ssList(sK4)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& sK4 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& sK4 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) ) )
=> ( ssList(sK5)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK5 = X3
& sK4 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK5 = X3
& sK4 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) )
=> ( ssList(sK6)
& ? [X3] :
( ssList(X3)
& sK5 = X3
& sK4 = sK6
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK6
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK6 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X3] :
( ssList(X3)
& sK5 = X3
& sK4 = sK6
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK6
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK6 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 )
=> ( ssList(sK7)
& sK5 = sK7
& sK4 = sK6
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK6
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK6 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X4,X5,X6] :
( ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) )
=> ( memberP(X6,sK8(X4,X5,X6))
& ~ leq(X4,sK8(X4,X5,X6))
& ssItem(sK8(X4,X5,X6))
& lt(X4,sK8(X4,X5,X6))
& memberP(X5,sK8(X4,X5,X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
( ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = sK6 )
& ssList(X9) )
& ssItem(X8) )
=> ( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(X9,cons(sK9,nil)),X10) = sK6 )
& ssList(X9) )
& ssItem(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(X9,cons(sK9,nil)),X10) = sK6 )
& ssList(X9) )
=> ( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(sK10,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(sK10,cons(sK9,nil)),X10) = sK6 )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(sK10,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(sK10,cons(sK9,nil)),X10) = sK6 )
=> ( ssList(sK11)
& ! [X11] :
( ~ memberP(sK10,X11)
| ~ memberP(sK11,X11)
| ~ ssItem(X11)
| ~ lt(sK9,X11)
| leq(sK9,X11) )
& app(app(sK10,cons(sK9,nil)),sK11) = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X6,X7)
& ~ leq(X4,X7)
& ssItem(X7)
& lt(X4,X7)
& memberP(X5,X7) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11)
| ~ lt(X8,X11)
| leq(X8,X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& nil != X0 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& lt(X8,X11)
& memberP(X10,X11) ) ) ) )
& nil != X2 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7)
| ~ ssItem(X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| X1 != X3
| nil = X0
| ~ ssList(X3)
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& lt(X8,X11)
& memberP(X10,X11) ) ) ) )
& nil != X2 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7)
| ~ ssItem(X7) )
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
| X1 != X3
| nil = X0
| ~ ssList(X3)
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f205,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ~ leq(X4,sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f156]) ).
fof(f303,plain,
( ~ memberP(sK10,sK8(sK9,sK10,sK11))
| leq(sK9,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f302,f290]) ).
fof(f290,plain,
( memberP(sK11,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f289,f263]) ).
fof(f289,plain,
( ~ ssList(sK10)
| memberP(sK11,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f288,f278]) ).
fof(f288,plain,
( ~ ssList(sK11)
| ~ ssList(sK10)
| memberP(sK11,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f287,f249]) ).
fof(f287,plain,
( memberP(sK11,sK8(sK9,sK10,sK11))
| ~ ssItem(sK9)
| ~ ssList(sK10)
| ~ ssList(sK11)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f286]) ).
fof(f286,plain,
( ~ ssItem(sK9)
| ~ ssList(sK11)
| memberP(sK11,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| sK6 != sK6
| ~ spl14_3 ),
inference(superposition,[],[f228,f254]) ).
fof(f228,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK6
| memberP(X6,sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f206,f207]) ).
fof(f206,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| memberP(X6,sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f156]) ).
fof(f302,plain,
( ~ memberP(sK11,sK8(sK9,sK10,sK11))
| leq(sK9,sK8(sK9,sK10,sK11))
| ~ memberP(sK10,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f301,f285]) ).
fof(f285,plain,
( ssItem(sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f284,f278]) ).
fof(f284,plain,
( ssItem(sK8(sK9,sK10,sK11))
| ~ ssList(sK11)
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5 ),
inference(subsumption_resolution,[],[f283,f249]) ).
fof(f283,plain,
( ~ ssItem(sK9)
| ssItem(sK8(sK9,sK10,sK11))
| ~ ssList(sK11)
| ~ spl14_3
| ~ spl14_5 ),
inference(subsumption_resolution,[],[f282,f263]) ).
fof(f282,plain,
( ~ ssList(sK10)
| ~ ssList(sK11)
| ~ ssItem(sK9)
| ssItem(sK8(sK9,sK10,sK11))
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f281]) ).
fof(f281,plain,
( ~ ssList(sK10)
| sK6 != sK6
| ~ ssList(sK11)
| ~ ssItem(sK9)
| ssItem(sK8(sK9,sK10,sK11))
| ~ spl14_3 ),
inference(superposition,[],[f230,f254]) ).
fof(f230,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK6
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK8(X4,X5,X6))
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f204,f207]) ).
fof(f204,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| ssItem(sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f156]) ).
fof(f301,plain,
( ~ ssItem(sK8(sK9,sK10,sK11))
| ~ memberP(sK11,sK8(sK9,sK10,sK11))
| ~ memberP(sK10,sK8(sK9,sK10,sK11))
| leq(sK9,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_8 ),
inference(resolution,[],[f300,f258]) ).
fof(f258,plain,
( ! [X11] :
( ~ lt(sK9,X11)
| ~ memberP(sK10,X11)
| leq(sK9,X11)
| ~ ssItem(X11)
| ~ memberP(sK11,X11) )
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f257,plain,
( spl14_4
<=> ! [X11] :
( leq(sK9,X11)
| ~ ssItem(X11)
| ~ memberP(sK11,X11)
| ~ memberP(sK10,X11)
| ~ lt(sK9,X11) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f300,plain,
( lt(sK9,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_5
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f299,f263]) ).
fof(f299,plain,
( ~ ssList(sK10)
| lt(sK9,sK8(sK9,sK10,sK11))
| ~ spl14_2
| ~ spl14_3
| ~ spl14_8 ),
inference(subsumption_resolution,[],[f298,f278]) ).
fof(f298,plain,
( lt(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK11)
| ~ ssList(sK10)
| ~ spl14_2
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f297,f249]) ).
fof(f297,plain,
( ~ ssItem(sK9)
| lt(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ ssList(sK11)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f296,plain,
( sK6 != sK6
| ~ ssList(sK11)
| ~ ssItem(sK9)
| lt(sK9,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ spl14_3 ),
inference(superposition,[],[f231,f254]) ).
fof(f231,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK6
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| lt(X4,sK8(X4,X5,X6)) ),
inference(definition_unfolding,[],[f203,f207]) ).
fof(f203,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| lt(X4,sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f156]) ).
fof(f306,plain,
( memberP(sK10,sK8(sK9,sK10,sK11))
| ~ ssList(sK10)
| ~ ssList(sK11)
| ~ ssItem(sK9)
| ~ spl14_3 ),
inference(trivial_inequality_removal,[],[f305]) ).
fof(f305,plain,
( ~ ssList(sK11)
| memberP(sK10,sK8(sK9,sK10,sK11))
| ~ ssItem(sK9)
| sK6 != sK6
| ~ ssList(sK10)
| ~ spl14_3 ),
inference(superposition,[],[f232,f254]) ).
fof(f232,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK6
| memberP(X5,sK8(X4,X5,X6))
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f202,f207]) ).
fof(f202,plain,
! [X6,X4,X5] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK4
| memberP(X5,sK8(X4,X5,X6))
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f156]) ).
fof(f279,plain,
( spl14_1
| spl14_8 ),
inference(avatar_split_clause,[],[f201,f276,f243]) ).
fof(f243,plain,
( spl14_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f201,plain,
( ssList(sK11)
| nil = sK6 ),
inference(cnf_transformation,[],[f156]) ).
fof(f265,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f233,f243]) ).
fof(f233,plain,
nil != sK6,
inference(definition_unfolding,[],[f196,f207]) ).
fof(f196,plain,
nil != sK4,
inference(cnf_transformation,[],[f156]) ).
fof(f264,plain,
( spl14_1
| spl14_5 ),
inference(avatar_split_clause,[],[f198,f261,f243]) ).
fof(f198,plain,
( ssList(sK10)
| nil = sK6 ),
inference(cnf_transformation,[],[f156]) ).
fof(f259,plain,
( spl14_1
| spl14_4 ),
inference(avatar_split_clause,[],[f200,f257,f243]) ).
fof(f200,plain,
! [X11] :
( leq(sK9,X11)
| ~ lt(sK9,X11)
| nil = sK6
| ~ memberP(sK10,X11)
| ~ memberP(sK11,X11)
| ~ ssItem(X11) ),
inference(cnf_transformation,[],[f156]) ).
fof(f255,plain,
( spl14_1
| spl14_3 ),
inference(avatar_split_clause,[],[f199,f252,f243]) ).
fof(f199,plain,
( app(app(sK10,cons(sK9,nil)),sK11) = sK6
| nil = sK6 ),
inference(cnf_transformation,[],[f156]) ).
fof(f250,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f197,f247,f243]) ).
fof(f197,plain,
( ssItem(sK9)
| nil = sK6 ),
inference(cnf_transformation,[],[f156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC242+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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 : n028.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:47:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.47 % (30967)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.18/0.47 % (30958)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.18/0.47 % (30966)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.18/0.47 % (30959)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)
% 0.18/0.47 % (30966)Instruction limit reached!
% 0.18/0.47 % (30966)------------------------------
% 0.18/0.47 % (30966)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (30975)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)
% 0.18/0.48 % (30974)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.18/0.48 % (30966)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (30966)Termination reason: Unknown
% 0.18/0.48 % (30966)Termination phase: Preprocessing 3
% 0.18/0.48
% 0.18/0.48 % (30966)Memory used [KB]: 1535
% 0.18/0.48 % (30966)Time elapsed: 0.003 s
% 0.18/0.48 % (30966)Instructions burned: 3 (million)
% 0.18/0.48 % (30966)------------------------------
% 0.18/0.48 % (30966)------------------------------
% 0.18/0.48 % (30967)Instruction limit reached!
% 0.18/0.48 % (30967)------------------------------
% 0.18/0.48 % (30967)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (30958)First to succeed.
% 0.18/0.49 % (30958)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (30958)------------------------------
% 0.18/0.49 % (30958)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (30958)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (30958)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (30958)Memory used [KB]: 6140
% 0.18/0.49 % (30958)Time elapsed: 0.092 s
% 0.18/0.49 % (30958)Instructions burned: 6 (million)
% 0.18/0.49 % (30958)------------------------------
% 0.18/0.49 % (30958)------------------------------
% 0.18/0.49 % (30951)Success in time 0.143 s
%------------------------------------------------------------------------------