TSTP Solution File: SWC364+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC364+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 : n017.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 May 1 04:01:43 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 67 ( 9 unt; 0 def)
% Number of atoms : 325 ( 62 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 376 ( 118 ~; 107 |; 121 &)
% ( 8 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 97 ( 50 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f346,plain,
$false,
inference(avatar_sat_refutation,[],[f230,f235,f240,f244,f312,f316,f345]) ).
fof(f345,plain,
( spl11_1
| ~ spl11_14 ),
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f344,plain,
( $false
| spl11_1
| ~ spl11_14 ),
inference(subsumption_resolution,[],[f343,f192]) ).
fof(f192,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.OuMMJRuCgf/Vampire---4.8_10623',ax17) ).
fof(f343,plain,
( ~ ssList(nil)
| spl11_1
| ~ spl11_14 ),
inference(subsumption_resolution,[],[f342,f155]) ).
fof(f155,plain,
ssList(sK3),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& sK3 = app(cons(sK4,nil),sK2)
& ssItem(sK4)
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ? [X4] :
( app(cons(X4,nil),sK2) = X3
& ssItem(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ? [X4] :
( app(cons(X4,nil),sK2) = X3
& ssItem(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ? [X4] :
( app(cons(X4,nil),sK2) = sK3
& ssItem(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X4] :
( app(cons(X4,nil),sK2) = sK3
& ssItem(X4) )
=> ( sK3 = app(cons(sK4,nil),sK2)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OuMMJRuCgf/Vampire---4.8_10623',co1) ).
fof(f342,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| spl11_1
| ~ spl11_14 ),
inference(subsumption_resolution,[],[f339,f225]) ).
fof(f225,plain,
( ~ segmentP(sK3,sK2)
| spl11_1 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f223,plain,
( spl11_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f339,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ ssList(nil)
| ~ spl11_14 ),
inference(duplicate_literal_removal,[],[f338]) ).
fof(f338,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ spl11_14 ),
inference(superposition,[],[f311,f177]) ).
fof(f177,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.OuMMJRuCgf/Vampire---4.8_10623',ax84) ).
fof(f311,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(app(sK3,X0))
| ~ ssList(X0) )
| ~ spl11_14 ),
inference(avatar_component_clause,[],[f310]) ).
fof(f310,plain,
( spl11_14
<=> ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(app(sK3,X0))
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_14])]) ).
fof(f316,plain,
( ~ spl11_4
| spl11_5 ),
inference(avatar_contradiction_clause,[],[f315]) ).
fof(f315,plain,
( $false
| ~ spl11_4
| spl11_5 ),
inference(subsumption_resolution,[],[f314,f192]) ).
fof(f314,plain,
( ~ ssList(nil)
| ~ spl11_4
| spl11_5 ),
inference(subsumption_resolution,[],[f313,f239]) ).
fof(f239,plain,
( ssItem(sK4)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl11_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f313,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| spl11_5 ),
inference(resolution,[],[f263,f176]) ).
fof(f176,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/tmp/tmp.OuMMJRuCgf/Vampire---4.8_10623',ax16) ).
fof(f263,plain,
( ~ ssList(cons(sK4,nil))
| spl11_5 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl11_5
<=> ssList(cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f312,plain,
( ~ spl11_5
| spl11_14
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f308,f232,f310,f261]) ).
fof(f232,plain,
( spl11_3
<=> sK3 = app(cons(sK4,nil),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f308,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(app(sK3,X0)) )
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f258,f154]) ).
fof(f154,plain,
ssList(sK2),
inference(cnf_transformation,[],[f135]) ).
fof(f258,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK2)
| ~ ssList(app(sK3,X0)) )
| ~ spl11_3 ),
inference(superposition,[],[f217,f234]) ).
fof(f234,plain,
( sK3 = app(cons(sK4,nil),sK2)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f217,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f203]) ).
fof(f203,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f148,f150,f149]) ).
fof(f149,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OuMMJRuCgf/Vampire---4.8_10623',ax7) ).
fof(f244,plain,
spl11_2,
inference(avatar_split_clause,[],[f221,f227]) ).
fof(f227,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f221,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f209]) ).
fof(f209,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f158,f156,f156]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f135]) ).
fof(f158,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f135]) ).
fof(f240,plain,
( spl11_4
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f163,f227,f237]) ).
fof(f163,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f135]) ).
fof(f235,plain,
( spl11_3
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f164,f227,f232]) ).
fof(f164,plain,
( ~ neq(sK3,nil)
| sK3 = app(cons(sK4,nil),sK2) ),
inference(cnf_transformation,[],[f135]) ).
fof(f230,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f204,f227,f223]) ).
fof(f204,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f165,f156,f157]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f135]) ).
fof(f165,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC364+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % 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.10/0.32 % Computer : n017.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 17:51:19 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.32 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.OuMMJRuCgf/Vampire---4.8_10623
% 0.61/0.81 % (10746)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81 % (10747)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81 % (10748)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 (2995ds/34Mi)
% 0.61/0.81 % (10749)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81 % (10745)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 (2995ds/51Mi)
% 0.61/0.81 % (10750)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 (2995ds/83Mi)
% 0.61/0.81 % (10751)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 (2995ds/56Mi)
% 0.61/0.81 % (10744)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 (2995ds/34Mi)
% 0.61/0.81 % (10749)First to succeed.
% 0.61/0.82 % (10749)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (10749)------------------------------
% 0.61/0.82 % (10749)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (10749)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (10749)Memory used [KB]: 1191
% 0.61/0.82 % (10749)Time elapsed: 0.008 s
% 0.61/0.82 % (10749)Instructions burned: 10 (million)
% 0.61/0.82 % (10749)------------------------------
% 0.61/0.82 % (10749)------------------------------
% 0.61/0.82 % (10737)Success in time 0.49 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------