TSTP Solution File: SWC008+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC008+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Sun May 5 09:47:57 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 9 unt; 0 def)
% Number of atoms : 368 ( 94 equ)
% Maximal formula atoms : 36 ( 8 avg)
% Number of connectives : 535 ( 212 ~; 178 |; 121 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 147 ( 106 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f447,plain,
$false,
inference(subsumption_resolution,[],[f446,f183]) ).
fof(f183,plain,
ssList(sK3),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f148,f147,f146,f145]) ).
fof(f145,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != X0
| app(app(X5,X6),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(sK2)
& frontsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != X0
| app(app(X5,X6),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ equalelemsP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X5,X7) != X0
| app(app(X5,X6),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssList(X5) )
& equalelemsP(X2)
& frontsegP(X3,X2)
& 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)
=> ( ? [X4] :
( equalelemsP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X0
& app(app(X5,X6),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ equalelemsP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X7] :
( equalelemsP(X7)
& segmentP(X7,X2)
& frontsegP(X3,X7)
& neq(X2,X7)
& ssList(X7) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ~ equalelemsP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X7] :
( equalelemsP(X7)
& segmentP(X7,X2)
& frontsegP(X3,X7)
& neq(X2,X7)
& ssList(X7) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ~ equalelemsP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2GMlJHiGre/Vampire---4.8_22353',co1) ).
fof(f446,plain,
~ ssList(sK3),
inference(subsumption_resolution,[],[f436,f182]) ).
fof(f182,plain,
ssList(sK2),
inference(cnf_transformation,[],[f149]) ).
fof(f436,plain,
( ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f435]) ).
fof(f435,plain,
( sK2 != sK2
| ~ ssList(sK2)
| sK3 != sK3
| ~ ssList(sK3) ),
inference(resolution,[],[f426,f186]) ).
fof(f186,plain,
frontsegP(sK3,sK2),
inference(cnf_transformation,[],[f149]) ).
fof(f426,plain,
! [X0,X1] :
( ~ frontsegP(X1,X0)
| sK2 != X0
| ~ ssList(X0)
| sK3 != X1
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f419,f215]) ).
fof(f215,plain,
! [X0,X1] :
( ssList(sK4(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK4(X0,X1)) = X0
& ssList(sK4(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f158,f159]) ).
fof(f159,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK4(X0,X1)) = X0
& ssList(sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2GMlJHiGre/Vampire---4.8_22353',ax5) ).
fof(f419,plain,
! [X0,X1] :
( sK3 != X1
| sK2 != X0
| ~ ssList(sK4(X1,X0))
| ~ ssList(X0)
| ~ frontsegP(X1,X0)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f417]) ).
fof(f417,plain,
! [X0,X1] :
( sK3 != X1
| sK2 != X0
| ~ ssList(sK4(X1,X0))
| ~ ssList(X0)
| ~ frontsegP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f409,f216]) ).
fof(f216,plain,
! [X0,X1] :
( app(X1,sK4(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f409,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| sK2 != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f406]) ).
fof(f406,plain,
! [X0,X1] :
( sK2 != X0
| app(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f354,f190]) ).
fof(f190,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,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/sandbox2/tmp/tmp.2GMlJHiGre/Vampire---4.8_22353',ax84) ).
fof(f354,plain,
! [X0,X1] :
( app(X0,nil) != sK2
| app(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f353,f200]) ).
fof(f200,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2GMlJHiGre/Vampire---4.8_22353',ax26) ).
fof(f353,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| app(X0,nil) != sK2
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(subsumption_resolution,[],[f336,f238]) ).
fof(f238,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.2GMlJHiGre/Vampire---4.8_22353',ax17) ).
fof(f336,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| app(X0,nil) != sK2
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f250,f190]) ).
fof(f250,plain,
! [X6,X7,X5] :
( app(app(X5,X6),X7) != sK3
| app(X5,X7) != sK2
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f188,f185,f184]) ).
fof(f184,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f149]) ).
fof(f185,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f149]) ).
fof(f188,plain,
! [X6,X7,X5] :
( app(X5,X7) != sK0
| app(app(X5,X6),X7) != sK1
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC008+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % 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.15/0.34 % Computer : n023.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 20:28:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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.2GMlJHiGre/Vampire---4.8_22353
% 0.58/0.73 % (22558)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.58/0.73 % (22560)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.58/0.74 % (22554)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.58/0.74 % (22555)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.58/0.74 % (22556)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.58/0.74 % (22553)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.58/0.74 % (22552)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.58/0.74 % (22559)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.58/0.74 % (22558)First to succeed.
% 0.58/0.74 % (22558)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22519"
% 0.58/0.74 % (22558)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for Vampire---4
% 0.58/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.74 % (22558)------------------------------
% 0.58/0.74 % (22558)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (22558)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (22558)Memory used [KB]: 1284
% 0.58/0.74 % (22558)Time elapsed: 0.006 s
% 0.58/0.74 % (22558)Instructions burned: 17 (million)
% 0.58/0.74 % (22519)Success in time 0.383 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------