TSTP Solution File: SET711+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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 03:48:41 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 18 unt; 0 def)
% Number of atoms : 198 ( 14 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 199 ( 58 ~; 52 |; 52 &)
% ( 15 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 199 ( 183 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f200,plain,
$false,
inference(subsumption_resolution,[],[f198,f187]) ).
fof(f187,plain,
apply(sK0,sK8(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)),
inference(unit_resulting_resolution,[],[f99,f125,f103,f82]) ).
fof(f82,plain,
! [X3,X0,X1,X4,X5] :
( ~ sP12(X4,X0,X3,X1)
| ~ apply(X0,X5,X4)
| apply(X1,X4,X5)
| ~ member(X5,X3) ),
inference(general_splitting,[],[f72,f81_D]) ).
fof(f81,plain,
! [X2,X3,X0,X1,X4] :
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ member(X4,X2)
| sP12(X4,X0,X3,X1) ),
inference(cnf_transformation,[],[f81_D]) ).
fof(f81_D,plain,
! [X1,X3,X0,X4] :
( ! [X2] :
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ member(X4,X2) )
<=> ~ sP12(X4,X0,X3,X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP12])]) ).
fof(f72,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X5,X3)
| ~ apply(X0,X5,X4)
| apply(X1,X4,X5) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
=> ! [X4,X5] :
( ( member(X5,X3)
& member(X4,X2) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
inference(unused_predicate_definition_removal,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
<=> ! [X4,X5] :
( ( member(X5,X3)
& member(X4,X2) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X9,X5,X0,X1] :
( inverse_predicate(X9,X5,X0,X1)
<=> ! [X2,X4] :
( ( member(X4,X1)
& member(X2,X0) )
=> ( apply(X5,X2,X4)
<=> apply(X9,X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738',inverse_predicate) ).
fof(f103,plain,
apply(sK2,sK6(sK1,sK2,sK4,sK3),sK8(sK1,sK2,sK4,sK3)),
inference(unit_resulting_resolution,[],[f60,f68]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( apply(X1,sK6(X0,X1,X2,X3),sK8(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5,X6] :
( ( member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( ( apply(X1,X4,X6)
& apply(X0,X4,X5) )
=> X5 = X6 ) )
=> equal_maps(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( ( member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( ( apply(X1,X4,X6)
& apply(X0,X4,X5) )
=> X5 = X6 ) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X5,X9,X0,X1] :
( equal_maps(X5,X9,X0,X1)
<=> ! [X2,X6,X7] :
( ( member(X7,X1)
& member(X6,X1)
& member(X2,X0) )
=> ( ( apply(X9,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738',equal_maps) ).
fof(f60,plain,
~ equal_maps(sK1,sK2,sK4,sK3),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) )
=> equal_maps(X1,X2,X4,X3) ),
inference(rectify,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X5,X9,X8,X0,X1] :
( ( inverse_predicate(X8,X5,X0,X1)
& inverse_predicate(X9,X5,X0,X1)
& one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(X9,X8,X1,X0) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X5,X9,X8,X0,X1] :
( ( inverse_predicate(X8,X5,X0,X1)
& inverse_predicate(X9,X5,X0,X1)
& one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(X9,X8,X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738',thII03a) ).
fof(f125,plain,
sP12(sK8(sK1,sK2,sK4,sK3),sK2,sK4,sK0),
inference(unit_resulting_resolution,[],[f59,f101,f81]) ).
fof(f101,plain,
member(sK8(sK1,sK2,sK4,sK3),sK3),
inference(unit_resulting_resolution,[],[f60,f66]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( member(sK8(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
fof(f59,plain,
inverse_predicate(sK2,sK0,sK3,sK4),
inference(cnf_transformation,[],[f45]) ).
fof(f99,plain,
member(sK6(sK1,sK2,sK4,sK3),sK4),
inference(unit_resulting_resolution,[],[f60,f64]) ).
fof(f64,plain,
! [X2,X3,X0,X1] :
( member(sK6(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
fof(f198,plain,
~ apply(sK0,sK8(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)),
inference(unit_resulting_resolution,[],[f101,f104,f100,f109,f186,f84]) ).
fof(f84,plain,
! [X3,X0,X1,X4,X5] :
( ~ sP13(X5,X0,X1)
| ~ member(X4,X1)
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| X3 = X4
| ~ member(X3,X1) ),
inference(general_splitting,[],[f74,f83_D]) ).
fof(f83,plain,
! [X2,X0,X1,X5] :
( ~ injective(X0,X1,X2)
| ~ member(X5,X2)
| sP13(X5,X0,X1) ),
inference(cnf_transformation,[],[f83_D]) ).
fof(f83_D,plain,
! [X1,X0,X5] :
( ! [X2] :
( ~ injective(X0,X1,X2)
| ~ member(X5,X2) )
<=> ~ sP13(X5,X0,X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP13])]) ).
fof(f74,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ injective(X0,X1,X2)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2)
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| X3 = X4 ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(ennf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(unused_predicate_definition_removal,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
<=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X5,X0,X1] :
( injective(X5,X0,X1)
<=> ! [X12,X13,X4] :
( ( member(X4,X1)
& member(X13,X0)
& member(X12,X0) )
=> ( ( apply(X5,X13,X4)
& apply(X5,X12,X4) )
=> X12 = X13 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738',injective) ).
fof(f186,plain,
apply(sK0,sK7(sK1,sK2,sK4,sK3),sK6(sK1,sK2,sK4,sK3)),
inference(unit_resulting_resolution,[],[f99,f116,f102,f82]) ).
fof(f102,plain,
apply(sK1,sK6(sK1,sK2,sK4,sK3),sK7(sK1,sK2,sK4,sK3)),
inference(unit_resulting_resolution,[],[f60,f67]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( apply(X0,sK6(X0,X1,X2,X3),sK7(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
fof(f116,plain,
sP12(sK7(sK1,sK2,sK4,sK3),sK1,sK4,sK0),
inference(unit_resulting_resolution,[],[f58,f100,f81]) ).
fof(f58,plain,
inverse_predicate(sK1,sK0,sK3,sK4),
inference(cnf_transformation,[],[f45]) ).
fof(f109,plain,
sP13(sK6(sK1,sK2,sK4,sK3),sK0,sK3),
inference(unit_resulting_resolution,[],[f88,f99,f83]) ).
fof(f88,plain,
injective(sK0,sK3,sK4),
inference(unit_resulting_resolution,[],[f57,f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ one_to_one(X0,X1,X2)
| injective(X0,X1,X2) ),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( surjective(X0,X1,X2)
& injective(X0,X1,X2) )
| ~ one_to_one(X0,X1,X2) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
=> ( surjective(X0,X1,X2)
& injective(X0,X1,X2) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
<=> ( surjective(X0,X1,X2)
& injective(X0,X1,X2) ) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X5,X0,X1] :
( one_to_one(X5,X0,X1)
<=> ( surjective(X5,X0,X1)
& injective(X5,X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738',one_to_one) ).
fof(f57,plain,
one_to_one(sK0,sK3,sK4),
inference(cnf_transformation,[],[f45]) ).
fof(f100,plain,
member(sK7(sK1,sK2,sK4,sK3),sK3),
inference(unit_resulting_resolution,[],[f60,f65]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( member(sK7(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
fof(f104,plain,
sK7(sK1,sK2,sK4,sK3) != sK8(sK1,sK2,sK4,sK3),
inference(unit_resulting_resolution,[],[f60,f69]) ).
fof(f69,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| sK7(X0,X1,X2,X3) != sK8(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 17:36:45 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.zCJFQDv6rs/Vampire---4.8_28738
% 0.60/0.81 % (28849)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.60/0.81 % (28848)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.60/0.81 % (28850)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.60/0.81 % (28847)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.60/0.81 % (28851)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.60/0.81 % (28846)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.60/0.81 % (28852)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.60/0.81 % (28853)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.60/0.81 % (28853)Refutation not found, incomplete strategy% (28853)------------------------------
% 0.60/0.81 % (28853)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (28853)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.81
% 0.60/0.81 % (28853)Memory used [KB]: 1053
% 0.60/0.81 % (28853)Time elapsed: 0.003 s
% 0.60/0.81 % (28853)Instructions burned: 3 (million)
% 0.60/0.81 % (28853)------------------------------
% 0.60/0.81 % (28853)------------------------------
% 0.60/0.81 % (28846)Refutation not found, incomplete strategy% (28846)------------------------------
% 0.60/0.81 % (28846)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (28846)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.81
% 0.60/0.81 % (28846)Memory used [KB]: 1083
% 0.60/0.81 % (28846)Time elapsed: 0.005 s
% 0.60/0.81 % (28846)Instructions burned: 6 (million)
% 0.60/0.81 % (28846)------------------------------
% 0.60/0.81 % (28846)------------------------------
% 0.60/0.82 % (28852)First to succeed.
% 0.60/0.82 % (28849)Refutation not found, incomplete strategy% (28849)------------------------------
% 0.60/0.82 % (28849)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (28849)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (28849)Memory used [KB]: 1099
% 0.60/0.82 % (28849)Time elapsed: 0.006 s
% 0.60/0.82 % (28849)Instructions burned: 7 (million)
% 0.60/0.82 % (28849)------------------------------
% 0.60/0.82 % (28849)------------------------------
% 0.60/0.82 % (28854)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.60/0.82 % (28855)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.60/0.82 % (28852)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for Vampire---4
% 0.60/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.82 % (28852)------------------------------
% 0.60/0.82 % (28852)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (28852)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (28852)Memory used [KB]: 1168
% 0.60/0.82 % (28852)Time elapsed: 0.009 s
% 0.60/0.82 % (28852)Instructions burned: 13 (million)
% 0.60/0.82 % (28852)------------------------------
% 0.60/0.82 % (28852)------------------------------
% 0.60/0.82 % (28845)Success in time 0.487 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------