TSTP Solution File: SWC241+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC241+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 : 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 Aug 31 18:39:49 EDT 2022
% Result : Theorem 0.15s 0.48s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 66 ( 5 unt; 0 def)
% Number of atoms : 588 ( 110 equ)
% Maximal formula atoms : 52 ( 8 avg)
% Number of connectives : 822 ( 300 ~; 281 |; 214 &)
% ( 7 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 179 ( 97 !; 82 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f369,plain,
$false,
inference(avatar_sat_refutation,[],[f260,f265,f270,f275,f280,f368]) ).
fof(f368,plain,
( ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(avatar_contradiction_clause,[],[f367]) ).
fof(f367,plain,
( $false
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f366,f301]) ).
fof(f301,plain,
( ~ leq(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f300,f274]) ).
fof(f274,plain,
( ssList(sK9)
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f272,plain,
( spl14_7
<=> ssList(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_7])]) ).
fof(f300,plain,
( ~ leq(sK8,sK11(sK8,sK9,sK10))
| ~ ssList(sK9)
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f299,f259]) ).
fof(f259,plain,
( ssList(sK10)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f257,plain,
( spl14_4
<=> ssList(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f299,plain,
( ~ leq(sK8,sK11(sK8,sK9,sK10))
| ~ ssList(sK10)
| ~ ssList(sK9)
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f298,f269]) ).
fof(f269,plain,
( ssItem(sK8)
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f267,plain,
( spl14_6
<=> ssItem(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_6])]) ).
fof(f298,plain,
( ~ ssItem(sK8)
| ~ ssList(sK10)
| ~ ssList(sK9)
| ~ leq(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_5 ),
inference(trivial_inequality_removal,[],[f297]) ).
fof(f297,plain,
( sK6 != sK6
| ~ ssItem(sK8)
| ~ ssList(sK9)
| ~ ssList(sK10)
| ~ leq(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_5 ),
inference(superposition,[],[f232,f264]) ).
fof(f264,plain,
( app(app(sK9,cons(sK8,nil)),sK10) = sK6
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl14_5
<=> app(app(sK9,cons(sK8,nil)),sK10) = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_5])]) ).
fof(f232,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssItem(X8)
| ~ leq(X8,sK11(X8,X9,X10))
| ~ ssList(X9)
| ~ ssList(X10) ),
inference(definition_unfolding,[],[f196,f202]) ).
fof(f202,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f159]) ).
fof(f159,plain,
( ssList(sK5)
& ssList(sK7)
& ( nil = sK6
| ( ssList(sK10)
& ! [X7] :
( ~ memberP(sK9,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(sK10,X7)
| ~ ssItem(X7) )
& app(app(sK9,cons(sK8,nil)),sK10) = sK6
& ssList(sK9)
& ssItem(sK8) ) )
& sK4 = sK6
& sK5 = sK7
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ( ssItem(sK11(X8,X9,X10))
& memberP(X10,sK11(X8,X9,X10))
& memberP(X9,sK11(X8,X9,X10))
& ~ leq(X8,sK11(X8,X9,X10))
& lt(X8,sK11(X8,X9,X10)) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) )
& ssList(sK6)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f150,f158,f157,f156,f155,f154,f153,f152,f151]) ).
fof(f151,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& X0 = X2
& X1 = X3
& nil != X0
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X0
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = X2
& X1 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = X2
& X1 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = X2
& sK5 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = X2
& sK5 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ( nil = sK6
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK6 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = sK6
& sK5 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
( ? [X3] :
( ssList(X3)
& ( nil = sK6
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK6 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = sK6
& sK5 = X3
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
=> ( ssList(sK7)
& ( nil = sK6
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK6 )
& ssList(X5) )
& ssItem(X4) ) )
& sK4 = sK6
& sK5 = sK7
& nil != sK4
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != sK4
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK6 )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(sK8,nil)),X6) = sK6 )
& ssList(X5) )
& ssItem(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(sK8,nil)),X6) = sK6 )
& ssList(X5) )
=> ( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(sK9,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(sK9,cons(sK8,nil)),X6) = sK6 )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(sK9,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(sK9,cons(sK8,nil)),X6) = sK6 )
=> ( ssList(sK10)
& ! [X7] :
( ~ memberP(sK9,X7)
| leq(X7,sK8)
| ~ leq(sK8,X7)
| ~ memberP(sK10,X7)
| ~ ssItem(X7) )
& app(app(sK9,cons(sK8,nil)),sK10) = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
! [X8,X9,X10] :
( ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
=> ( ssItem(sK11(X8,X9,X10))
& memberP(X10,sK11(X8,X9,X10))
& memberP(X9,sK11(X8,X9,X10))
& ~ leq(X8,sK11(X8,X9,X10))
& lt(X8,sK11(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2 )
& ssList(X5) )
& ssItem(X4) ) )
& X0 = X2
& X1 = X3
& nil != X0
& ! [X8] :
( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( app(app(X9,cons(X8,nil)),X10) != X0
| ? [X11] :
( ssItem(X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& lt(X8,X11) )
| ~ ssList(X10) ) )
| ~ ssItem(X8) ) )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f120]) ).
fof(f120,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& ! [X11] :
( ~ memberP(X9,X11)
| leq(X11,X8)
| ~ leq(X8,X11)
| ~ memberP(X10,X11)
| ~ ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2 )
& ssList(X9) )
& ssItem(X8) ) )
& X0 = X2
& X1 = X3
& nil != X0
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( ssItem(X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ~ leq(X4,X7)
& lt(X4,X7) )
| ~ ssList(X6) ) )
| ~ ssItem(X4) ) )
& ssList(X2) ) )
& ssList(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] :
( ? [X11] :
( leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& memberP(X10,X11) )
| ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) )
& nil != X2 )
| nil = X0
| X1 != X3
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| leq(X4,X7)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( leq(X8,X11)
& ssItem(X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& memberP(X10,X11) )
| ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2 ) ) )
& nil != X2 )
| nil = X0
| X1 != X3
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ~ lt(X4,X7)
| leq(X4,X7)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f196,plain,
! [X10,X8,X9] :
( ~ ssList(X9)
| app(app(X9,cons(X8,nil)),X10) != sK4
| ~ leq(X8,sK11(X8,X9,X10))
| ~ ssList(X10)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f159]) ).
fof(f366,plain,
( leq(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f365,f285]) ).
fof(f285,plain,
( ssItem(sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f284,f274]) ).
fof(f284,plain,
( ~ ssList(sK9)
| ssItem(sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f283,f259]) ).
fof(f283,plain,
( ~ ssList(sK10)
| ~ ssList(sK9)
| ssItem(sK11(sK8,sK9,sK10))
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f282,f269]) ).
fof(f282,plain,
( ~ ssItem(sK8)
| ~ ssList(sK10)
| ~ ssList(sK9)
| ssItem(sK11(sK8,sK9,sK10))
| ~ spl14_5 ),
inference(trivial_inequality_removal,[],[f281]) ).
fof(f281,plain,
( ~ ssList(sK9)
| ~ ssItem(sK8)
| sK6 != sK6
| ssItem(sK11(sK8,sK9,sK10))
| ~ ssList(sK10)
| ~ spl14_5 ),
inference(superposition,[],[f229,f264]) ).
fof(f229,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X10)
| ssItem(sK11(X8,X9,X10))
| ~ ssItem(X8)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f199,f202]) ).
fof(f199,plain,
! [X10,X8,X9] :
( ~ ssList(X9)
| app(app(X9,cons(X8,nil)),X10) != sK4
| ssItem(sK11(X8,X9,X10))
| ~ ssList(X10)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f159]) ).
fof(f365,plain,
( ~ ssItem(sK11(sK8,sK9,sK10))
| leq(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f364,f269]) ).
fof(f364,plain,
( ~ ssItem(sK8)
| leq(sK8,sK11(sK8,sK9,sK10))
| ~ ssItem(sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(resolution,[],[f214,f306]) ).
fof(f306,plain,
( lt(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f305,f274]) ).
fof(f305,plain,
( ~ ssList(sK9)
| lt(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f304,f259]) ).
fof(f304,plain,
( ~ ssList(sK10)
| ~ ssList(sK9)
| lt(sK8,sK11(sK8,sK9,sK10))
| ~ spl14_5
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f303,f269]) ).
fof(f303,plain,
( lt(sK8,sK11(sK8,sK9,sK10))
| ~ ssItem(sK8)
| ~ ssList(sK9)
| ~ ssList(sK10)
| ~ spl14_5 ),
inference(trivial_inequality_removal,[],[f302]) ).
fof(f302,plain,
( ~ ssList(sK10)
| lt(sK8,sK11(sK8,sK9,sK10))
| sK6 != sK6
| ~ ssItem(sK8)
| ~ ssList(sK9)
| ~ spl14_5 ),
inference(superposition,[],[f233,f264]) ).
fof(f233,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK6
| ~ ssList(X9)
| ~ ssItem(X8)
| lt(X8,sK11(X8,X9,X10))
| ~ ssList(X10) ),
inference(definition_unfolding,[],[f195,f202]) ).
fof(f195,plain,
! [X10,X8,X9] :
( ~ ssList(X9)
| app(app(X9,cons(X8,nil)),X10) != sK4
| lt(X8,sK11(X8,X9,X10))
| ~ ssList(X10)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f159]) ).
fof(f214,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0] :
( ! [X1] :
( ( ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) )
& ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ( ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) )
& ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
& leq(X0,X1) )
<=> lt(X0,X1) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( ( X0 != X1
& leq(X0,X1) )
<=> lt(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
fof(f280,plain,
~ spl14_3,
inference(avatar_split_clause,[],[f228,f253]) ).
fof(f253,plain,
( spl14_3
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f228,plain,
nil != sK6,
inference(definition_unfolding,[],[f200,f202]) ).
fof(f200,plain,
nil != sK4,
inference(cnf_transformation,[],[f159]) ).
fof(f275,plain,
( spl14_7
| spl14_3 ),
inference(avatar_split_clause,[],[f204,f253,f272]) ).
fof(f204,plain,
( nil = sK6
| ssList(sK9) ),
inference(cnf_transformation,[],[f159]) ).
fof(f270,plain,
( spl14_6
| spl14_3 ),
inference(avatar_split_clause,[],[f203,f253,f267]) ).
fof(f203,plain,
( nil = sK6
| ssItem(sK8) ),
inference(cnf_transformation,[],[f159]) ).
fof(f265,plain,
( spl14_5
| spl14_3 ),
inference(avatar_split_clause,[],[f205,f253,f262]) ).
fof(f205,plain,
( nil = sK6
| app(app(sK9,cons(sK8,nil)),sK10) = sK6 ),
inference(cnf_transformation,[],[f159]) ).
fof(f260,plain,
( spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f207,f257,f253]) ).
fof(f207,plain,
( ssList(sK10)
| nil = sK6 ),
inference(cnf_transformation,[],[f159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC241+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Aug 30 18:58:49 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/0.45 % (23748)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.15/0.45 % (23765)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.15/0.45 % (23757)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.15/0.46 % (23748)First to succeed.
% 0.15/0.47 % (23756)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.15/0.47 % (23757)Instruction limit reached!
% 0.15/0.47 % (23757)------------------------------
% 0.15/0.47 % (23757)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47 % (23757)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47 % (23757)Termination reason: Unknown
% 0.15/0.47 % (23757)Termination phase: Function definition elimination
% 0.15/0.47
% 0.15/0.47 % (23757)Memory used [KB]: 1791
% 0.15/0.47 % (23757)Time elapsed: 0.011 s
% 0.15/0.47 % (23757)Instructions burned: 8 (million)
% 0.15/0.47 % (23757)------------------------------
% 0.15/0.47 % (23757)------------------------------
% 0.15/0.47 % (23764)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.15/0.47 % (23749)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.15/0.47 % (23754)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)
% 0.15/0.47 % (23751)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)
% 0.15/0.48 % (23748)Refutation found. Thanks to Tanya!
% 0.15/0.48 % SZS status Theorem for theBenchmark
% 0.15/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48 % (23748)------------------------------
% 0.15/0.48 % (23748)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.48 % (23748)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48 % (23748)Termination reason: Refutation
% 0.15/0.48
% 0.15/0.48 % (23748)Memory used [KB]: 6268
% 0.15/0.48 % (23748)Time elapsed: 0.106 s
% 0.15/0.48 % (23748)Instructions burned: 10 (million)
% 0.15/0.48 % (23748)------------------------------
% 0.15/0.48 % (23748)------------------------------
% 0.15/0.48 % (23741)Success in time 0.175 s
%------------------------------------------------------------------------------