TSTP Solution File: SWC098+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC098+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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 May 1 03:59:46 EDT 2024
% Result : Theorem 0.61s 0.85s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 84 ( 3 unt; 0 def)
% Number of atoms : 572 ( 189 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 769 ( 281 ~; 265 |; 189 &)
% ( 9 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 109 ( 57 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f306,plain,
$false,
inference(avatar_sat_refutation,[],[f233,f243,f248,f249,f250,f251,f252,f263,f281,f286,f293,f305]) ).
fof(f305,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| ~ spl12_8 ),
inference(avatar_contradiction_clause,[],[f304]) ).
fof(f304,plain,
( $false
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f303,f242]) ).
fof(f242,plain,
( ssItem(sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f240,plain,
( spl12_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f303,plain,
( ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_4
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f302,f237]) ).
fof(f237,plain,
( sK2 = cons(sK4,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl12_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f302,plain,
( sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f301,f232]) ).
fof(f232,plain,
( memberP(sK3,sK4)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f230,plain,
( spl12_3
<=> memberP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f301,plain,
( ~ memberP(sK3,sK4)
| sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| ~ spl12_8 ),
inference(trivial_inequality_removal,[],[f299]) ).
fof(f299,plain,
( sK4 != sK4
| ~ memberP(sK3,sK4)
| sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| ~ spl12_8 ),
inference(superposition,[],[f209,f276]) ).
fof(f276,plain,
( sK4 = sK5(sK4)
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl12_8
<=> sK4 = sK5(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f209,plain,
! [X6] :
( sK5(X6) != X6
| ~ memberP(sK3,X6)
| cons(X6,nil) != sK2
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f161,f156,f157]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ( sK5(X6) != X6
& leq(X6,sK5(X6))
& memberP(sK1,sK5(X6))
& ssItem(sK5(X6)) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ! [X6] :
( ~ memberP(sK1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
| cons(X6,nil) != sK0
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
! [X6] :
( ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(sK1,X7)
& ssItem(X7) )
=> ( sK5(X6) != X6
& leq(X6,sK5(X6))
& memberP(sK1,sK5(X6))
& ssItem(sK5(X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ! [X6] :
( ~ memberP(X1,X6)
| ? [X7] :
( X6 != X7
& leq(X6,X7)
& memberP(X1,X7)
& ssItem(X7) )
| cons(X6,nil) != X0
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X6] :
( memberP(X1,X6)
& ! [X7] :
( ssItem(X7)
=> ( X6 = X7
| ~ leq(X6,X7)
| ~ memberP(X1,X7) ) )
& cons(X6,nil) = X0
& ssItem(X6) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IHpkGMy4Oe/Vampire---4.8_25644',co1) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f161,plain,
! [X6] :
( ~ memberP(sK1,X6)
| sK5(X6) != X6
| cons(X6,nil) != sK0
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f134]) ).
fof(f293,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| spl12_9 ),
inference(avatar_contradiction_clause,[],[f292]) ).
fof(f292,plain,
( $false
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| spl12_9 ),
inference(subsumption_resolution,[],[f291,f242]) ).
fof(f291,plain,
( ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(subsumption_resolution,[],[f290,f237]) ).
fof(f290,plain,
( sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| ~ spl12_3
| spl12_9 ),
inference(subsumption_resolution,[],[f289,f232]) ).
fof(f289,plain,
( ~ memberP(sK3,sK4)
| sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| spl12_9 ),
inference(resolution,[],[f280,f212]) ).
fof(f212,plain,
! [X6] :
( ssItem(sK5(X6))
| ~ memberP(sK3,X6)
| cons(X6,nil) != sK2
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f158,f156,f157]) ).
fof(f158,plain,
! [X6] :
( ~ memberP(sK1,X6)
| ssItem(sK5(X6))
| cons(X6,nil) != sK0
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f134]) ).
fof(f280,plain,
( ~ ssItem(sK5(sK4))
| spl12_9 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f278,plain,
( spl12_9
<=> ssItem(sK5(sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_9])]) ).
fof(f286,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| spl12_7 ),
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f285,plain,
( $false
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5
| spl12_7 ),
inference(subsumption_resolution,[],[f284,f242]) ).
fof(f284,plain,
( ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_4
| spl12_7 ),
inference(subsumption_resolution,[],[f283,f237]) ).
fof(f283,plain,
( sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| ~ spl12_3
| spl12_7 ),
inference(subsumption_resolution,[],[f282,f232]) ).
fof(f282,plain,
( ~ memberP(sK3,sK4)
| sK2 != cons(sK4,nil)
| ~ ssItem(sK4)
| spl12_7 ),
inference(resolution,[],[f272,f211]) ).
fof(f211,plain,
! [X6] :
( memberP(sK3,sK5(X6))
| ~ memberP(sK3,X6)
| cons(X6,nil) != sK2
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f159,f156,f156,f157]) ).
fof(f159,plain,
! [X6] :
( ~ memberP(sK1,X6)
| memberP(sK1,sK5(X6))
| cons(X6,nil) != sK0
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f134]) ).
fof(f272,plain,
( ~ memberP(sK3,sK5(sK4))
| spl12_7 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl12_7
<=> memberP(sK3,sK5(sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f281,plain,
( ~ spl12_7
| spl12_8
| ~ spl12_9
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5 ),
inference(avatar_split_clause,[],[f268,f240,f235,f230,f222,f278,f274,f270]) ).
fof(f222,plain,
( spl12_1
<=> ! [X5] :
( ~ leq(sK4,X5)
| ~ ssItem(X5)
| sK4 = X5
| ~ memberP(sK3,X5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f268,plain,
( ~ ssItem(sK5(sK4))
| sK4 = sK5(sK4)
| ~ memberP(sK3,sK5(sK4))
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5 ),
inference(resolution,[],[f267,f223]) ).
fof(f223,plain,
( ! [X5] :
( ~ leq(sK4,X5)
| ~ ssItem(X5)
| sK4 = X5
| ~ memberP(sK3,X5) )
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f267,plain,
( leq(sK4,sK5(sK4))
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f266,f242]) ).
fof(f266,plain,
( leq(sK4,sK5(sK4))
| ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f265,f232]) ).
fof(f265,plain,
( leq(sK4,sK5(sK4))
| ~ memberP(sK3,sK4)
| ~ ssItem(sK4)
| ~ spl12_4 ),
inference(trivial_inequality_removal,[],[f264]) ).
fof(f264,plain,
( sK2 != sK2
| leq(sK4,sK5(sK4))
| ~ memberP(sK3,sK4)
| ~ ssItem(sK4)
| ~ spl12_4 ),
inference(superposition,[],[f210,f237]) ).
fof(f210,plain,
! [X6] :
( cons(X6,nil) != sK2
| leq(X6,sK5(X6))
| ~ memberP(sK3,X6)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f160,f156,f157]) ).
fof(f160,plain,
! [X6] :
( ~ memberP(sK1,X6)
| leq(X6,sK5(X6))
| cons(X6,nil) != sK0
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f134]) ).
fof(f263,plain,
( ~ spl12_3
| ~ spl12_5
| ~ spl12_6 ),
inference(avatar_contradiction_clause,[],[f262]) ).
fof(f262,plain,
( $false
| ~ spl12_3
| ~ spl12_5
| ~ spl12_6 ),
inference(subsumption_resolution,[],[f261,f242]) ).
fof(f261,plain,
( ~ ssItem(sK4)
| ~ spl12_3
| ~ spl12_6 ),
inference(resolution,[],[f183,f259]) ).
fof(f259,plain,
( memberP(nil,sK4)
| ~ spl12_3
| ~ spl12_6 ),
inference(forward_demodulation,[],[f232,f247]) ).
fof(f247,plain,
( nil = sK3
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl12_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f183,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.IHpkGMy4Oe/Vampire---4.8_25644',ax38) ).
fof(f252,plain,
( ~ spl12_6
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f208,f225,f245]) ).
fof(f225,plain,
( spl12_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f208,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f162,f157,f156]) ).
fof(f162,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f134]) ).
fof(f251,plain,
( spl12_5
| spl12_6 ),
inference(avatar_split_clause,[],[f163,f245,f240]) ).
fof(f163,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f250,plain,
( spl12_4
| spl12_6 ),
inference(avatar_split_clause,[],[f164,f245,f235]) ).
fof(f164,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f249,plain,
( spl12_3
| spl12_6 ),
inference(avatar_split_clause,[],[f165,f245,f230]) ).
fof(f165,plain,
( nil = sK3
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f248,plain,
( spl12_1
| spl12_6 ),
inference(avatar_split_clause,[],[f166,f245,f222]) ).
fof(f166,plain,
! [X5] :
( nil = sK3
| ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f134]) ).
fof(f243,plain,
( spl12_5
| spl12_2 ),
inference(avatar_split_clause,[],[f167,f225,f240]) ).
fof(f167,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f233,plain,
( spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f169,f225,f230]) ).
fof(f169,plain,
( nil = sK2
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC098+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:35:10 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.IHpkGMy4Oe/Vampire---4.8_25644
% 0.61/0.84 % (25846)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.84 % (25844)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.84 % (25850)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.84 % (25847)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.84 % (25848)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.84 % (25849)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.84 % (25851)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.84 % (25852)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.85 % (25847)First to succeed.
% 0.61/0.85 % (25844)Also succeeded, but the first one will report.
% 0.61/0.85 % (25847)Refutation found. Thanks to Tanya!
% 0.61/0.85 % SZS status Theorem for Vampire---4
% 0.61/0.85 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.85 % (25847)------------------------------
% 0.61/0.85 % (25847)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.85 % (25847)Termination reason: Refutation
% 0.61/0.85
% 0.61/0.85 % (25847)Memory used [KB]: 1184
% 0.61/0.85 % (25847)Time elapsed: 0.008 s
% 0.61/0.85 % (25847)Instructions burned: 11 (million)
% 0.61/0.85 % (25847)------------------------------
% 0.61/0.85 % (25847)------------------------------
% 0.61/0.85 % (25804)Success in time 0.481 s
% 0.61/0.85 % Vampire---4.8 exiting
%------------------------------------------------------------------------------