TSTP Solution File: SWC279+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC279+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 : n007.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:40:05 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 8 unt; 0 def)
% Number of atoms : 507 ( 69 equ)
% Maximal formula atoms : 48 ( 8 avg)
% Number of connectives : 663 ( 214 ~; 195 |; 226 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 178 ( 82 !; 96 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f538,plain,
$false,
inference(avatar_sat_refutation,[],[f225,f234,f235,f236,f503,f537]) ).
fof(f537,plain,
( spl14_1
| ~ spl14_3 ),
inference(avatar_contradiction_clause,[],[f536]) ).
fof(f536,plain,
( $false
| spl14_1
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f535,f220]) ).
fof(f220,plain,
( ~ leq(sK8,sK11)
| spl14_1 ),
inference(avatar_component_clause,[],[f218]) ).
fof(f218,plain,
( spl14_1
<=> leq(sK8,sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f535,plain,
( leq(sK8,sK11)
| ~ spl14_3 ),
inference(subsumption_resolution,[],[f534,f185]) ).
fof(f185,plain,
ssItem(sK11),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
( ssList(sK5)
& ssList(sK7)
& ssItem(sK8)
& ssList(sK9)
& ssList(sK10)
& ( ( ~ leq(sK11,sK8)
& memberP(sK9,sK11) )
| ( ~ leq(sK8,sK11)
& memberP(sK10,sK11) ) )
& ssItem(sK11)
& app(app(sK9,cons(sK8,nil)),sK10) = sK4
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = sK7
& sK4 = sK6
& ssList(sK6)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f139,f147,f146,f145,f144,f143,f142,f141,f140]) ).
fof(f140,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X1 = X3
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X1 = X3
& sK4 = X2 )
& ssList(X2) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X1 = X3
& sK4 = X2 )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = X3
& sK4 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = X3
& sK4 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = X3
& sK4 = sK6 )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = X3
& sK4 = sK6 )
=> ( ssList(sK7)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK5 = sK7
& sK4 = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK4 ) ) )
=> ( ssItem(sK8)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(X5,X7) )
| ( ~ leq(sK8,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& sK4 = app(app(X5,cons(sK8,nil)),X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(X5,X7) )
| ( ~ leq(sK8,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& sK4 = app(app(X5,cons(sK8,nil)),X6) ) )
=> ( ssList(sK9)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(sK9,X7) )
| ( ~ leq(sK8,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& sK4 = app(app(sK9,cons(sK8,nil)),X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(sK9,X7) )
| ( ~ leq(sK8,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& sK4 = app(app(sK9,cons(sK8,nil)),X6) )
=> ( ssList(sK10)
& ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(sK9,X7) )
| ( ~ leq(sK8,X7)
& memberP(sK10,X7) ) )
& ssItem(X7) )
& app(app(sK9,cons(sK8,nil)),sK10) = sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X7] :
( ( ( ~ leq(X7,sK8)
& memberP(sK9,X7) )
| ( ~ leq(sK8,X7)
& memberP(sK10,X7) ) )
& ssItem(X7) )
=> ( ( ( ~ leq(sK11,sK8)
& memberP(sK9,sK11) )
| ( ~ leq(sK8,sK11)
& memberP(sK10,sK11) ) )
& ssItem(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( ~ leq(X7,X4)
& memberP(X5,X7) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 ) ) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10)
| ! [X11] :
( ~ ssItem(X11)
| ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( ~ memberP(X9,X11)
| leq(X11,X8) ) ) ) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X1 = X3
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ( ( ~ leq(X11,X8)
& memberP(X9,X11) )
| ( ~ leq(X8,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X0 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ( ( leq(X4,X7)
| ~ memberP(X6,X7) )
& ( ~ memberP(X5,X7)
| leq(X7,X4) ) ) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& X1 = X3
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( ~ leq(X11,X8)
& memberP(X9,X11) )
| ( ~ leq(X8,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ( ( leq(X4,X7)
| ~ memberP(X6,X7) )
& ( ~ memberP(X5,X7)
| leq(X7,X4) ) ) ) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& 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
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X11,X8)
| ~ memberP(X9,X11) )
& ( leq(X8,X11)
| ~ memberP(X10,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( memberP(X6,X7)
& ~ leq(X4,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X11,X8)
| ~ memberP(X9,X11) )
& ( leq(X8,X11)
| ~ memberP(X10,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ( ( memberP(X6,X7)
& ~ leq(X4,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f534,plain,
( ~ ssItem(sK11)
| leq(sK8,sK11)
| ~ spl14_3 ),
inference(resolution,[],[f499,f229]) ).
fof(f229,plain,
( memberP(sK10,sK11)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f227,plain,
( spl14_3
<=> memberP(sK10,sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f499,plain,
! [X0] :
( ~ memberP(sK10,X0)
| leq(sK8,X0)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f498,f192]) ).
fof(f192,plain,
ssItem(sK8),
inference(cnf_transformation,[],[f148]) ).
fof(f498,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK10,X0)
| ~ ssItem(sK8)
| leq(sK8,X0) ),
inference(subsumption_resolution,[],[f497,f190]) ).
fof(f190,plain,
ssList(sK10),
inference(cnf_transformation,[],[f148]) ).
fof(f497,plain,
! [X0] :
( ~ ssList(sK10)
| ~ ssItem(X0)
| leq(sK8,X0)
| ~ ssItem(sK8)
| ~ memberP(sK10,X0) ),
inference(subsumption_resolution,[],[f496,f191]) ).
fof(f191,plain,
ssList(sK9),
inference(cnf_transformation,[],[f148]) ).
fof(f496,plain,
! [X0] :
( ~ ssList(sK9)
| leq(sK8,X0)
| ~ ssItem(sK8)
| ~ ssItem(X0)
| ~ memberP(sK10,X0)
| ~ ssList(sK10) ),
inference(trivial_inequality_removal,[],[f495]) ).
fof(f495,plain,
! [X0] :
( sK6 != sK6
| ~ ssList(sK10)
| ~ ssItem(X0)
| ~ ssItem(sK8)
| ~ ssList(sK9)
| leq(sK8,X0)
| ~ memberP(sK10,X0) ),
inference(superposition,[],[f183,f209]) ).
fof(f209,plain,
app(app(sK9,cons(sK8,nil)),sK10) = sK6,
inference(definition_unfolding,[],[f184,f180]) ).
fof(f180,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f148]) ).
fof(f184,plain,
app(app(sK9,cons(sK8,nil)),sK10) = sK4,
inference(cnf_transformation,[],[f148]) ).
fof(f183,plain,
! [X10,X11,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ~ ssItem(X11)
| ~ memberP(X10,X11)
| ~ ssItem(X8)
| leq(X8,X11)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f148]) ).
fof(f503,plain,
( spl14_2
| ~ spl14_4 ),
inference(avatar_contradiction_clause,[],[f502]) ).
fof(f502,plain,
( $false
| spl14_2
| ~ spl14_4 ),
inference(subsumption_resolution,[],[f501,f185]) ).
fof(f501,plain,
( ~ ssItem(sK11)
| spl14_2
| ~ spl14_4 ),
inference(subsumption_resolution,[],[f500,f224]) ).
fof(f224,plain,
( ~ leq(sK11,sK8)
| spl14_2 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl14_2
<=> leq(sK11,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f500,plain,
( leq(sK11,sK8)
| ~ ssItem(sK11)
| ~ spl14_4 ),
inference(resolution,[],[f494,f233]) ).
fof(f233,plain,
( memberP(sK9,sK11)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl14_4
<=> memberP(sK9,sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f494,plain,
! [X0] :
( ~ memberP(sK9,X0)
| leq(X0,sK8)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f493,f190]) ).
fof(f493,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK9,X0)
| ~ ssList(sK10)
| leq(X0,sK8) ),
inference(subsumption_resolution,[],[f492,f192]) ).
fof(f492,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssItem(sK8)
| ~ ssList(sK10)
| ~ memberP(sK9,X0)
| leq(X0,sK8) ),
inference(subsumption_resolution,[],[f491,f191]) ).
fof(f491,plain,
! [X0] :
( ~ ssList(sK9)
| ~ ssList(sK10)
| ~ memberP(sK9,X0)
| ~ ssItem(sK8)
| ~ ssItem(X0)
| leq(X0,sK8) ),
inference(trivial_inequality_removal,[],[f490]) ).
fof(f490,plain,
! [X0] :
( ~ ssList(sK9)
| ~ ssItem(X0)
| ~ ssList(sK10)
| sK6 != sK6
| ~ ssItem(sK8)
| ~ memberP(sK9,X0)
| leq(X0,sK8) ),
inference(superposition,[],[f182,f209]) ).
fof(f182,plain,
! [X10,X11,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ ssList(X10)
| ~ ssList(X9)
| leq(X11,X8)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f148]) ).
fof(f236,plain,
( spl14_4
| ~ spl14_1 ),
inference(avatar_split_clause,[],[f187,f218,f231]) ).
fof(f187,plain,
( ~ leq(sK8,sK11)
| memberP(sK9,sK11) ),
inference(cnf_transformation,[],[f148]) ).
fof(f235,plain,
( ~ spl14_2
| spl14_3 ),
inference(avatar_split_clause,[],[f188,f227,f222]) ).
fof(f188,plain,
( memberP(sK10,sK11)
| ~ leq(sK11,sK8) ),
inference(cnf_transformation,[],[f148]) ).
fof(f234,plain,
( spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f186,f231,f227]) ).
fof(f186,plain,
( memberP(sK9,sK11)
| memberP(sK10,sK11) ),
inference(cnf_transformation,[],[f148]) ).
fof(f225,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f189,f222,f218]) ).
fof(f189,plain,
( ~ leq(sK11,sK8)
| ~ leq(sK8,sK11) ),
inference(cnf_transformation,[],[f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC279+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:27:31 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.44 % (8134)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)
% 0.20/0.46 % (8134)First to succeed.
% 0.20/0.46 % (8134)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.46 % (8134)------------------------------
% 0.20/0.46 % (8134)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.46 % (8134)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.46 % (8134)Termination reason: Refutation
% 0.20/0.46
% 0.20/0.46 % (8134)Memory used [KB]: 6396
% 0.20/0.46 % (8134)Time elapsed: 0.041 s
% 0.20/0.46 % (8134)Instructions burned: 18 (million)
% 0.20/0.46 % (8134)------------------------------
% 0.20/0.46 % (8134)------------------------------
% 0.20/0.46 % (8108)Success in time 0.105 s
%------------------------------------------------------------------------------