TSTP Solution File: SWC098+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC098+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:38:47 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 77 ( 3 unt; 0 def)
% Number of atoms : 535 ( 189 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 714 ( 256 ~; 253 |; 181 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 100 ( 50 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f318,plain,
$false,
inference(avatar_sat_refutation,[],[f233,f238,f239,f253,f258,f259,f264,f265,f266,f317]) ).
fof(f317,plain,
( ~ spl12_1
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(avatar_contradiction_clause,[],[f316]) ).
fof(f316,plain,
( $false
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f315,f304]) ).
fof(f304,plain,
( sK10(sK11) != sK11
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f303,f257]) ).
fof(f257,plain,
( memberP(sK9,sK11)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f255,plain,
( spl12_7
<=> memberP(sK9,sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f303,plain,
( sK10(sK11) != sK11
| ~ memberP(sK9,sK11)
| ~ spl12_1
| ~ spl12_6 ),
inference(subsumption_resolution,[],[f302,f252]) ).
fof(f252,plain,
( ssItem(sK11)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f250,plain,
( spl12_6
<=> ssItem(sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f302,plain,
( ~ ssItem(sK11)
| sK10(sK11) != sK11
| ~ memberP(sK9,sK11)
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f301]) ).
fof(f301,plain,
( ~ memberP(sK9,sK11)
| sK10(sK11) != sK11
| ~ ssItem(sK11)
| sK6 != sK6
| ~ spl12_1 ),
inference(superposition,[],[f209,f228]) ).
fof(f228,plain,
( sK6 = cons(sK11,nil)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl12_1
<=> sK6 = cons(sK11,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f209,plain,
! [X4] :
( cons(X4,nil) != sK6
| ~ memberP(sK9,X4)
| ~ ssItem(X4)
| sK10(X4) != X4 ),
inference(definition_unfolding,[],[f199,f184]) ).
fof(f184,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
( ssList(sK7)
& ssList(sK8)
& ! [X4] :
( cons(X4,nil) != sK6
| ( sK10(X4) != X4
& ssItem(sK10(X4))
& memberP(sK7,sK10(X4))
& leq(X4,sK10(X4)) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK8 = sK6
& ( ( memberP(sK9,sK11)
& ssItem(sK11)
& ! [X7] :
( ~ leq(sK11,X7)
| ~ memberP(sK9,X7)
| ~ ssItem(X7)
| sK11 = X7 )
& sK8 = cons(sK11,nil) )
| ( nil = sK9
& nil = sK8 ) )
& ssList(sK9)
& ( nil != sK7
| nil != sK6 )
& sK7 = sK9
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f121,f147,f146,f145,f144,f143,f142]) ).
fof(f142,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != X0
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(X1,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& X0 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != X1
| nil != X0 )
& X1 = X3 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(X1,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& sK6 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != X1
| nil != sK6 )
& X1 = X3 ) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(X1,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& sK6 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != X1
| nil != sK6 )
& X1 = X3 ) ) )
=> ( ssList(sK7)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK6 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != sK7
| nil != sK6 )
& sK7 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK6 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != sK7
| nil != sK6 )
& sK7 = X3 ) )
=> ( ssList(sK8)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK8 = sK6
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = sK8 )
| ( nil = X3
& nil = sK8 ) )
& ssList(X3)
& ( nil != sK7
| nil != sK6 )
& sK7 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X3] :
( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK8 = sK6
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = sK8 )
| ( nil = X3
& nil = sK8 ) )
& ssList(X3)
& ( nil != sK7
| nil != sK6 )
& sK7 = X3 )
=> ( ! [X4] :
( cons(X4,nil) != sK6
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(sK7,X4) )
& sK8 = sK6
& ( ? [X6] :
( memberP(sK9,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(sK9,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = sK8 )
| ( nil = sK9
& nil = sK8 ) )
& ssList(sK9)
& ( nil != sK7
| nil != sK6 )
& sK7 = sK9 ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
! [X4] :
( ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(sK7,X5)
& leq(X4,X5) )
=> ( sK10(X4) != X4
& ssItem(sK10(X4))
& memberP(sK7,sK10(X4))
& leq(X4,sK10(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X6] :
( memberP(sK9,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(sK9,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = sK8 )
=> ( memberP(sK9,sK11)
& ssItem(sK11)
& ! [X7] :
( ~ leq(sK11,X7)
| ~ memberP(sK9,X7)
| ~ ssItem(X7)
| sK11 = X7 )
& sK8 = cons(sK11,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( cons(X4,nil) != X0
| ? [X5] :
( X4 != X5
& ssItem(X5)
& memberP(X1,X5)
& leq(X4,X5) )
| ~ ssItem(X4)
| ~ memberP(X1,X4) )
& X0 = X2
& ( ? [X6] :
( memberP(X3,X6)
& ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& ssList(X3)
& ( nil != X1
| nil != X0 )
& X1 = X3 ) ) )
& ssList(X0) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(X1,X4)
| ~ ssItem(X4)
| cons(X4,nil) != X0
| ? [X5] :
( X4 != X5
& leq(X4,X5)
& memberP(X1,X5)
& ssItem(X5) ) )
& ( ( nil = X3
& nil = X2 )
| ? [X6] :
( ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| ~ ssItem(X7)
| X6 = X7 )
& cons(X6,nil) = X2
& memberP(X3,X6)
& ssItem(X6) ) )
& X1 = X3
& X0 = X2
& ( nil != X1
| nil != X0 )
& 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)
=> ( ? [X4] :
( memberP(X1,X4)
& ssItem(X4)
& cons(X4,nil) = X0
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) ) )
| ( ( nil != X3
| nil != X2 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( memberP(X3,X7)
& ssItem(X7)
& leq(X6,X7)
& X6 != X7 )
| cons(X6,nil) != X2
| ~ memberP(X3,X6) ) ) )
| X1 != X3
| X0 != X2
| ( nil = X0
& nil = X1 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( memberP(X1,X4)
& ssItem(X4)
& cons(X4,nil) = X0
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) ) )
| ( ( nil != X3
| nil != X2 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( memberP(X3,X7)
& ssItem(X7)
& leq(X6,X7)
& X6 != X7 )
| cons(X6,nil) != X2
| ~ memberP(X3,X6) ) ) )
| X1 != X3
| X0 != X2
| ( nil = X0
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f199,plain,
! [X4] :
( cons(X4,nil) != sK6
| sK10(X4) != X4
| ~ ssItem(X4)
| ~ memberP(sK7,X4) ),
inference(cnf_transformation,[],[f148]) ).
fof(f315,plain,
( sK10(sK11) = sK11
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f314,f308]) ).
fof(f308,plain,
( memberP(sK9,sK10(sK11))
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f307,f252]) ).
fof(f307,plain,
( ~ ssItem(sK11)
| memberP(sK9,sK10(sK11))
| ~ spl12_1
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f306,f257]) ).
fof(f306,plain,
( ~ memberP(sK9,sK11)
| ~ ssItem(sK11)
| memberP(sK9,sK10(sK11))
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f305]) ).
fof(f305,plain,
( memberP(sK9,sK10(sK11))
| sK6 != sK6
| ~ memberP(sK9,sK11)
| ~ ssItem(sK11)
| ~ spl12_1 ),
inference(superposition,[],[f211,f228]) ).
fof(f211,plain,
! [X4] :
( cons(X4,nil) != sK6
| memberP(sK9,sK10(X4))
| ~ ssItem(X4)
| ~ memberP(sK9,X4) ),
inference(definition_unfolding,[],[f197,f184,f184]) ).
fof(f197,plain,
! [X4] :
( cons(X4,nil) != sK6
| memberP(sK7,sK10(X4))
| ~ ssItem(X4)
| ~ memberP(sK7,X4) ),
inference(cnf_transformation,[],[f148]) ).
fof(f314,plain,
( ~ memberP(sK9,sK10(sK11))
| sK10(sK11) = sK11
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f313,f300]) ).
fof(f300,plain,
( ssItem(sK10(sK11))
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f299,f257]) ).
fof(f299,plain,
( ssItem(sK10(sK11))
| ~ memberP(sK9,sK11)
| ~ spl12_1
| ~ spl12_6 ),
inference(subsumption_resolution,[],[f298,f252]) ).
fof(f298,plain,
( ssItem(sK10(sK11))
| ~ ssItem(sK11)
| ~ memberP(sK9,sK11)
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f297]) ).
fof(f297,plain,
( ~ ssItem(sK11)
| ~ memberP(sK9,sK11)
| ssItem(sK10(sK11))
| sK6 != sK6
| ~ spl12_1 ),
inference(superposition,[],[f210,f228]) ).
fof(f210,plain,
! [X4] :
( cons(X4,nil) != sK6
| ssItem(sK10(X4))
| ~ memberP(sK9,X4)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f198,f184]) ).
fof(f198,plain,
! [X4] :
( cons(X4,nil) != sK6
| ssItem(sK10(X4))
| ~ ssItem(X4)
| ~ memberP(sK7,X4) ),
inference(cnf_transformation,[],[f148]) ).
fof(f313,plain,
( ~ ssItem(sK10(sK11))
| sK10(sK11) = sK11
| ~ memberP(sK9,sK10(sK11))
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(resolution,[],[f312,f263]) ).
fof(f263,plain,
( ! [X7] :
( ~ leq(sK11,X7)
| ~ ssItem(X7)
| ~ memberP(sK9,X7)
| sK11 = X7 )
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl12_8
<=> ! [X7] :
( sK11 = X7
| ~ memberP(sK9,X7)
| ~ leq(sK11,X7)
| ~ ssItem(X7) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f312,plain,
( leq(sK11,sK10(sK11))
| ~ spl12_1
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f311,f252]) ).
fof(f311,plain,
( ~ ssItem(sK11)
| leq(sK11,sK10(sK11))
| ~ spl12_1
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f310,f257]) ).
fof(f310,plain,
( ~ memberP(sK9,sK11)
| leq(sK11,sK10(sK11))
| ~ ssItem(sK11)
| ~ spl12_1 ),
inference(trivial_inequality_removal,[],[f309]) ).
fof(f309,plain,
( leq(sK11,sK10(sK11))
| ~ ssItem(sK11)
| sK6 != sK6
| ~ memberP(sK9,sK11)
| ~ spl12_1 ),
inference(superposition,[],[f212,f228]) ).
fof(f212,plain,
! [X4] :
( cons(X4,nil) != sK6
| ~ memberP(sK9,X4)
| leq(X4,sK10(X4))
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f196,f184]) ).
fof(f196,plain,
! [X4] :
( cons(X4,nil) != sK6
| leq(X4,sK10(X4))
| ~ ssItem(X4)
| ~ memberP(sK7,X4) ),
inference(cnf_transformation,[],[f148]) ).
fof(f266,plain,
( spl12_8
| spl12_3 ),
inference(avatar_split_clause,[],[f190,f235,f262]) ).
fof(f235,plain,
( spl12_3
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f190,plain,
! [X7] :
( nil = sK9
| ~ ssItem(X7)
| sK11 = X7
| ~ leq(sK11,X7)
| ~ memberP(sK9,X7) ),
inference(cnf_transformation,[],[f148]) ).
fof(f265,plain,
( spl12_2
| spl12_7 ),
inference(avatar_split_clause,[],[f213,f255,f230]) ).
fof(f230,plain,
( spl12_2
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f213,plain,
( memberP(sK9,sK11)
| nil = sK6 ),
inference(definition_unfolding,[],[f193,f195]) ).
fof(f195,plain,
sK8 = sK6,
inference(cnf_transformation,[],[f148]) ).
fof(f193,plain,
( memberP(sK9,sK11)
| nil = sK8 ),
inference(cnf_transformation,[],[f148]) ).
fof(f264,plain,
( spl12_2
| spl12_8 ),
inference(avatar_split_clause,[],[f215,f262,f230]) ).
fof(f215,plain,
! [X7] :
( sK11 = X7
| nil = sK6
| ~ ssItem(X7)
| ~ leq(sK11,X7)
| ~ memberP(sK9,X7) ),
inference(definition_unfolding,[],[f189,f195]) ).
fof(f189,plain,
! [X7] :
( ~ leq(sK11,X7)
| ~ memberP(sK9,X7)
| ~ ssItem(X7)
| sK11 = X7
| nil = sK8 ),
inference(cnf_transformation,[],[f148]) ).
fof(f259,plain,
( spl12_6
| spl12_2 ),
inference(avatar_split_clause,[],[f214,f230,f250]) ).
fof(f214,plain,
( nil = sK6
| ssItem(sK11) ),
inference(definition_unfolding,[],[f191,f195]) ).
fof(f191,plain,
( ssItem(sK11)
| nil = sK8 ),
inference(cnf_transformation,[],[f148]) ).
fof(f258,plain,
( spl12_7
| spl12_3 ),
inference(avatar_split_clause,[],[f194,f235,f255]) ).
fof(f194,plain,
( nil = sK9
| memberP(sK9,sK11) ),
inference(cnf_transformation,[],[f148]) ).
fof(f253,plain,
( spl12_3
| spl12_6 ),
inference(avatar_split_clause,[],[f192,f250,f235]) ).
fof(f192,plain,
( ssItem(sK11)
| nil = sK9 ),
inference(cnf_transformation,[],[f148]) ).
fof(f239,plain,
( spl12_3
| spl12_1 ),
inference(avatar_split_clause,[],[f216,f226,f235]) ).
fof(f216,plain,
( sK6 = cons(sK11,nil)
| nil = sK9 ),
inference(definition_unfolding,[],[f188,f195]) ).
fof(f188,plain,
( sK8 = cons(sK11,nil)
| nil = sK9 ),
inference(cnf_transformation,[],[f148]) ).
fof(f238,plain,
( ~ spl12_2
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f218,f235,f230]) ).
fof(f218,plain,
( nil != sK9
| nil != sK6 ),
inference(definition_unfolding,[],[f185,f184]) ).
fof(f185,plain,
( nil != sK7
| nil != sK6 ),
inference(cnf_transformation,[],[f148]) ).
fof(f233,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f217,f230,f226]) ).
fof(f217,plain,
( nil = sK6
| sK6 = cons(sK11,nil) ),
inference(definition_unfolding,[],[f187,f195,f195]) ).
fof(f187,plain,
( sK8 = cons(sK11,nil)
| nil = sK8 ),
inference(cnf_transformation,[],[f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC098+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n027.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:31:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (12914)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)
% 0.19/0.48 % (12892)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.19/0.48 % (12892)First to succeed.
% 0.19/0.48 % (12892)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (12892)------------------------------
% 0.19/0.48 % (12892)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (12892)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (12892)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (12892)Memory used [KB]: 6140
% 0.19/0.48 % (12892)Time elapsed: 0.101 s
% 0.19/0.48 % (12892)Instructions burned: 5 (million)
% 0.19/0.48 % (12892)------------------------------
% 0.19/0.48 % (12892)------------------------------
% 0.19/0.48 % (12881)Success in time 0.134 s
%------------------------------------------------------------------------------