TSTP Solution File: SWC279+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n025.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:42:52 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 7 unt; 0 def)
% Number of atoms : 483 ( 72 equ)
% Maximal formula atoms : 48 ( 10 avg)
% Number of connectives : 624 ( 187 ~; 167 |; 234 &)
% ( 4 <=>; 32 =>; 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 : 188 ( 88 !; 100 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f766,plain,
$false,
inference(avatar_sat_refutation,[],[f629,f638,f645,f646,f757,f765]) ).
fof(f765,plain,
( spl61_4
| ~ spl61_7 ),
inference(avatar_contradiction_clause,[],[f763]) ).
fof(f763,plain,
( $false
| spl61_4
| ~ spl61_7 ),
inference(unit_resulting_resolution,[],[f506,f507,f501,f508,f624,f500,f637,f570]) ).
fof(f570,plain,
! [X6,X7,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK38
| ~ ssItem(X7)
| ~ ssList(X5)
| ~ ssItem(X4)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f510,f499]) ).
fof(f499,plain,
sK40 = sK38,
inference(cnf_transformation,[],[f321]) ).
fof(f321,plain,
( ssList(sK39)
& ! [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) != sK40 ) ) )
& ssItem(sK42)
& ssList(sK43)
& ssList(sK44)
& ( ( memberP(sK43,sK45)
& ~ leq(sK45,sK42) )
| ( ~ leq(sK42,sK45)
& memberP(sK44,sK45) ) )
& ssItem(sK45)
& app(app(sK43,cons(sK42,nil)),sK44) = sK38
& sK40 = sK38
& ssList(sK41)
& sK41 = sK39
& ssList(sK40)
& ssList(sK38) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK38,sK39,sK40,sK41,sK42,sK43,sK44,sK45])],[f312,f320,f319,f318,f317,f316,f315,f314,f313]) ).
fof(f313,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = X0 ) ) )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK38 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f314,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK38 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
=> ( ssList(sK39)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK38 = X2
& ssList(X3)
& sK39 = X3 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f315,plain,
( ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK38 = X2
& ssList(X3)
& sK39 = X3 )
& ssList(X2) )
=> ( ? [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) != sK40 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK40 = sK38
& ssList(X3)
& sK39 = X3 )
& ssList(sK40) ) ),
introduced(choice_axiom,[]) ).
fof(f316,plain,
( ? [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) != sK40 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK40 = sK38
& ssList(X3)
& sK39 = 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) != sK40 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
& sK40 = sK38
& ssList(sK41)
& sK41 = sK39 ) ),
introduced(choice_axiom,[]) ).
fof(f317,plain,
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = sK38 ) ) )
=> ( ssItem(sK42)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(sK42,nil)),X10) = sK38 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f318,plain,
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(sK42,nil)),X10) = sK38 ) )
=> ( ssList(sK43)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ( ( memberP(sK43,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& sK38 = app(app(sK43,cons(sK42,nil)),X10) ) ) ),
introduced(choice_axiom,[]) ).
fof(f319,plain,
( ? [X10] :
( ssList(X10)
& ? [X11] :
( ( ( memberP(sK43,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(X10,X11) ) )
& ssItem(X11) )
& sK38 = app(app(sK43,cons(sK42,nil)),X10) )
=> ( ssList(sK44)
& ? [X11] :
( ( ( memberP(sK43,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(sK44,X11) ) )
& ssItem(X11) )
& app(app(sK43,cons(sK42,nil)),sK44) = sK38 ) ),
introduced(choice_axiom,[]) ).
fof(f320,plain,
( ? [X11] :
( ( ( memberP(sK43,X11)
& ~ leq(X11,sK42) )
| ( ~ leq(sK42,X11)
& memberP(sK44,X11) ) )
& ssItem(X11) )
=> ( ( ( memberP(sK43,sK45)
& ~ leq(sK45,sK42) )
| ( ~ leq(sK42,sK45)
& memberP(sK44,sK45) ) )
& ssItem(sK45) ) ),
introduced(choice_axiom,[]) ).
fof(f312,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(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) = X0 ) ) )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [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) != X2 ) ) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(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) = X0 ) ) )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f153]) ).
fof(f153,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [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) != X2 ) ) )
& X1 = X3
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X0
& ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) )
& ssItem(X7) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& X0 = X2
& 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)
=> ( ? [X8] :
( ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssItem(X11)
& ( ( memberP(X9,X11)
& ~ leq(X11,X8) )
| ( memberP(X10,X11)
& ~ leq(X8,X11) ) ) )
& app(app(X9,cons(X8,nil)),X10) = X2 ) )
& ssItem(X8) )
| X1 != X3
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,cons(X4,nil)),X6) != X0
| ! [X7] :
( ssItem(X7)
=> ( ( leq(X4,X7)
| ~ memberP(X6,X7) )
& ( ~ memberP(X5,X7)
| leq(X7,X4) ) ) ) ) ) ) )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( leq(X8,X11)
| ~ memberP(X10,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ? [X7] :
( ssItem(X7)
& ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) ) )
& ssList(X6) ) )
& 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)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( leq(X8,X11)
| ~ memberP(X10,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X2
& ? [X7] :
( ssItem(X7)
& ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( ~ leq(X4,X7)
& memberP(X6,X7) ) ) )
& ssList(X6) ) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f510,plain,
! [X6,X7,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| leq(X7,X4)
| ~ memberP(X5,X7)
| ~ ssItem(X7)
| app(app(X5,cons(X4,nil)),X6) != sK40 ),
inference(cnf_transformation,[],[f321]) ).
fof(f637,plain,
( memberP(sK43,sK45)
| ~ spl61_7 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f635,plain,
( spl61_7
<=> memberP(sK43,sK45) ),
introduced(avatar_definition,[new_symbols(naming,[spl61_7])]) ).
fof(f500,plain,
app(app(sK43,cons(sK42,nil)),sK44) = sK38,
inference(cnf_transformation,[],[f321]) ).
fof(f624,plain,
( ~ leq(sK45,sK42)
| spl61_4 ),
inference(avatar_component_clause,[],[f622]) ).
fof(f622,plain,
( spl61_4
<=> leq(sK45,sK42) ),
introduced(avatar_definition,[new_symbols(naming,[spl61_4])]) ).
fof(f508,plain,
ssItem(sK42),
inference(cnf_transformation,[],[f321]) ).
fof(f501,plain,
ssItem(sK45),
inference(cnf_transformation,[],[f321]) ).
fof(f507,plain,
ssList(sK43),
inference(cnf_transformation,[],[f321]) ).
fof(f506,plain,
ssList(sK44),
inference(cnf_transformation,[],[f321]) ).
fof(f757,plain,
( spl61_5
| ~ spl61_6 ),
inference(avatar_contradiction_clause,[],[f755]) ).
fof(f755,plain,
( $false
| spl61_5
| ~ spl61_6 ),
inference(unit_resulting_resolution,[],[f501,f633,f628,f506,f507,f508,f500,f571]) ).
fof(f571,plain,
! [X6,X7,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK38
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7) ),
inference(definition_unfolding,[],[f509,f499]) ).
fof(f509,plain,
! [X6,X7,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| leq(X4,X7)
| ~ memberP(X6,X7)
| ~ ssItem(X7)
| app(app(X5,cons(X4,nil)),X6) != sK40 ),
inference(cnf_transformation,[],[f321]) ).
fof(f628,plain,
( ~ leq(sK42,sK45)
| spl61_5 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f626,plain,
( spl61_5
<=> leq(sK42,sK45) ),
introduced(avatar_definition,[new_symbols(naming,[spl61_5])]) ).
fof(f633,plain,
( memberP(sK44,sK45)
| ~ spl61_6 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl61_6
<=> memberP(sK44,sK45) ),
introduced(avatar_definition,[new_symbols(naming,[spl61_6])]) ).
fof(f646,plain,
( spl61_6
| ~ spl61_4 ),
inference(avatar_split_clause,[],[f502,f622,f631]) ).
fof(f502,plain,
( ~ leq(sK45,sK42)
| memberP(sK44,sK45) ),
inference(cnf_transformation,[],[f321]) ).
fof(f645,plain,
( ~ spl61_5
| spl61_7 ),
inference(avatar_split_clause,[],[f505,f635,f626]) ).
fof(f505,plain,
( memberP(sK43,sK45)
| ~ leq(sK42,sK45) ),
inference(cnf_transformation,[],[f321]) ).
fof(f638,plain,
( spl61_6
| spl61_7 ),
inference(avatar_split_clause,[],[f504,f635,f631]) ).
fof(f504,plain,
( memberP(sK43,sK45)
| memberP(sK44,sK45) ),
inference(cnf_transformation,[],[f321]) ).
fof(f629,plain,
( ~ spl61_4
| ~ spl61_5 ),
inference(avatar_split_clause,[],[f503,f626,f622]) ).
fof(f503,plain,
( ~ leq(sK42,sK45)
| ~ leq(sK45,sK42) ),
inference(cnf_transformation,[],[f321]) ).
%------------------------------------------------------------------------------
%----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_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n025.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:51:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44 % (10225)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.49 % (10249)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.50 % (10235)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50 % (10232)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.50 % (10232)Instruction limit reached!
% 0.19/0.50 % (10232)------------------------------
% 0.19/0.50 % (10232)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (10240)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (10232)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (10232)Termination reason: Unknown
% 0.19/0.50 % (10232)Termination phase: shuffling
% 0.19/0.50
% 0.19/0.50 % (10232)Memory used [KB]: 1151
% 0.19/0.50 % (10232)Time elapsed: 0.003 s
% 0.19/0.50 % (10232)Instructions burned: 3 (million)
% 0.19/0.50 % (10232)------------------------------
% 0.19/0.50 % (10232)------------------------------
% 0.19/0.51 % (10234)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (10237)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (10225)First to succeed.
% 0.19/0.51 % (10230)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (10225)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (10225)------------------------------
% 0.19/0.52 % (10225)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (10225)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (10225)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (10225)Memory used [KB]: 6268
% 0.19/0.52 % (10225)Time elapsed: 0.123 s
% 0.19/0.52 % (10225)Instructions burned: 29 (million)
% 0.19/0.52 % (10225)------------------------------
% 0.19/0.52 % (10225)------------------------------
% 0.19/0.52 % (10220)Success in time 0.17 s
%------------------------------------------------------------------------------