TSTP Solution File: SWC407+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC407+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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 : Sun May 5 09:50:54 EDT 2024
% Result : Theorem 0.50s 0.72s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 67 ( 10 unt; 0 def)
% Number of atoms : 351 ( 99 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 400 ( 116 ~; 114 |; 135 &)
% ( 7 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 86 ( 40 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f297,plain,
$false,
inference(avatar_sat_refutation,[],[f214,f224,f229,f230,f231,f237,f241,f296]) ).
fof(f296,plain,
( ~ spl12_1
| ~ spl12_3
| ~ spl12_4 ),
inference(avatar_contradiction_clause,[],[f295]) ).
fof(f295,plain,
( $false
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f293,f209]) ).
fof(f209,plain,
( memberP(sK3,sK4)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f207,plain,
( spl12_1
<=> memberP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f293,plain,
( ~ memberP(sK3,sK4)
| ~ spl12_3
| ~ spl12_4 ),
inference(superposition,[],[f196,f291]) ).
fof(f291,plain,
( sK4 = sK5
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f289,f153]) ).
fof(f153,plain,
ssItem(sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ~ memberP(sK1,sK5)
& memberP(sK0,sK5)
& ssItem(sK5)
& 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,f128,f127,f126,f125,f124,f123]) ).
fof(f123,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(X0,X5)
& ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X5] :
( ~ memberP(sK1,X5)
& memberP(sK0,X5)
& ssItem(X5) )
=> ( ~ memberP(sK1,sK5)
& memberP(sK0,sK5)
& ssItem(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(X0,X5)
& ssItem(X5) )
& 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] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ? [X5] :
( ~ memberP(X1,X5)
& memberP(X0,X5)
& ssItem(X5) )
& 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)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| 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 )
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,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 )
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nOnpfyuJ9A/Vampire---4.8_7416',co1) ).
fof(f289,plain,
( sK4 = sK5
| ~ ssItem(sK5)
| ~ spl12_3
| ~ spl12_4 ),
inference(resolution,[],[f262,f197]) ).
fof(f197,plain,
memberP(sK2,sK5),
inference(definition_unfolding,[],[f154,f152]) ).
fof(f152,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f154,plain,
memberP(sK0,sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f262,plain,
( ! [X0] :
( ~ memberP(sK2,X0)
| sK4 = X0
| ~ ssItem(X0) )
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f261,f174]) ).
fof(f174,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/sandbox/tmp/tmp.nOnpfyuJ9A/Vampire---4.8_7416',ax38) ).
fof(f261,plain,
( ! [X0] :
( ~ memberP(sK2,X0)
| sK4 = X0
| memberP(nil,X0)
| ~ ssItem(X0) )
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f260,f223]) ).
fof(f223,plain,
( ssItem(sK4)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f221,plain,
( spl12_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f260,plain,
( ! [X0] :
( ~ memberP(sK2,X0)
| sK4 = X0
| memberP(nil,X0)
| ~ ssItem(sK4)
| ~ ssItem(X0) )
| ~ spl12_3 ),
inference(subsumption_resolution,[],[f250,f173]) ).
fof(f173,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.nOnpfyuJ9A/Vampire---4.8_7416',ax17) ).
fof(f250,plain,
( ! [X0] :
( ~ memberP(sK2,X0)
| sK4 = X0
| memberP(nil,X0)
| ~ ssList(nil)
| ~ ssItem(sK4)
| ~ ssItem(X0) )
| ~ spl12_3 ),
inference(superposition,[],[f175,f218]) ).
fof(f218,plain,
( sK2 = cons(sK4,nil)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f216,plain,
( spl12_3
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| X0 = X1
| memberP(X2,X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nOnpfyuJ9A/Vampire---4.8_7416',ax37) ).
fof(f196,plain,
~ memberP(sK3,sK5),
inference(definition_unfolding,[],[f155,f151]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f155,plain,
~ memberP(sK1,sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f241,plain,
( ~ spl12_1
| ~ spl12_4
| ~ spl12_5 ),
inference(avatar_contradiction_clause,[],[f240]) ).
fof(f240,plain,
( $false
| ~ spl12_1
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f239,f223]) ).
fof(f239,plain,
( ~ ssItem(sK4)
| ~ spl12_1
| ~ spl12_5 ),
inference(resolution,[],[f238,f174]) ).
fof(f238,plain,
( memberP(nil,sK4)
| ~ spl12_1
| ~ spl12_5 ),
inference(forward_demodulation,[],[f209,f228]) ).
fof(f228,plain,
( nil = sK3
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl12_5
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f237,plain,
( ~ spl12_2
| ~ spl12_5 ),
inference(avatar_contradiction_clause,[],[f236]) ).
fof(f236,plain,
( $false
| ~ spl12_2
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f234,f232]) ).
fof(f232,plain,
( memberP(nil,sK5)
| ~ spl12_2 ),
inference(superposition,[],[f197,f213]) ).
fof(f213,plain,
( nil = sK2
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f211,plain,
( spl12_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f234,plain,
( ~ memberP(nil,sK5)
| ~ spl12_5 ),
inference(superposition,[],[f196,f228]) ).
fof(f231,plain,
( spl12_4
| spl12_5 ),
inference(avatar_split_clause,[],[f156,f226,f221]) ).
fof(f156,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f230,plain,
( spl12_3
| spl12_5 ),
inference(avatar_split_clause,[],[f157,f226,f216]) ).
fof(f157,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f129]) ).
fof(f229,plain,
( spl12_1
| spl12_5 ),
inference(avatar_split_clause,[],[f158,f226,f207]) ).
fof(f158,plain,
( nil = sK3
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f224,plain,
( spl12_4
| spl12_2 ),
inference(avatar_split_clause,[],[f159,f211,f221]) ).
fof(f159,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f214,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f161,f211,f207]) ).
fof(f161,plain,
( nil = sK2
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC407+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.33 % Computer : n016.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri May 3 20:25:37 EDT 2024
% 0.14/0.33 % CPUTime :
% 0.14/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.nOnpfyuJ9A/Vampire---4.8_7416
% 0.50/0.72 % (7524)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 (2996ds/34Mi)
% 0.50/0.72 % (7527)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.50/0.72 % (7525)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 (2996ds/51Mi)
% 0.50/0.72 % (7526)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.50/0.72 % (7528)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 (2996ds/34Mi)
% 0.50/0.72 % (7529)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.50/0.72 % (7530)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 (2996ds/83Mi)
% 0.50/0.72 % (7531)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 (2996ds/56Mi)
% 0.50/0.72 % (7531)Refutation not found, incomplete strategy% (7531)------------------------------
% 0.50/0.72 % (7531)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (7531)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.72
% 0.50/0.72 % (7531)Memory used [KB]: 1136
% 0.50/0.72 % (7531)Time elapsed: 0.004 s
% 0.50/0.72 % (7531)Instructions burned: 5 (million)
% 0.50/0.72 % (7531)------------------------------
% 0.50/0.72 % (7531)------------------------------
% 0.50/0.72 % (7529)First to succeed.
% 0.50/0.72 % (7529)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7523"
% 0.50/0.72 % (7529)Refutation found. Thanks to Tanya!
% 0.50/0.72 % SZS status Theorem for Vampire---4
% 0.50/0.72 % SZS output start Proof for Vampire---4
% See solution above
% 0.50/0.72 % (7529)------------------------------
% 0.50/0.72 % (7529)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (7529)Termination reason: Refutation
% 0.50/0.72
% 0.50/0.72 % (7529)Memory used [KB]: 1176
% 0.50/0.72 % (7529)Time elapsed: 0.006 s
% 0.50/0.72 % (7529)Instructions burned: 9 (million)
% 0.50/0.72 % (7523)Success in time 0.388 s
% 0.50/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------