%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC024+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:05 PM UTC 2026
% Result : Theorem 1.71s 1.12s
% Output : Refutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 82 ( 23 unt; 6 def)
% Number of atoms : 291 ( 63 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 347 ( 138 ~; 124 |; 61 &)
% ( 9 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 57 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( app(X2,X5) != X3
| ~ equalelemsP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X2 ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( app(X2,X5) != X3
| ~ equalelemsP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X2 ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ? [X5] :
( app(X2,X5) = X3
& equalelemsP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ssList(X5) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ? [X5] :
( app(X2,X5) = X3
& equalelemsP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ssList(X5) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f125,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f134,plain,
( sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK1,X4)
| ~ frontsegP(sK0,X4) )
& sK3 = app(sK2,sK4)
& equalelemsP(sK2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK4
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != sK2 ) ) )
& ssList(sK4)
& ( nil = sK3
| nil != sK2 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f144]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK9(X0,X1))
& app(X1,sK9(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f145]) ).
fof(f150,plain,
ssList(sK0),
inference(cnf_transformation,[],[f134]) ).
fof(f151,plain,
ssList(sK1),
inference(cnf_transformation,[],[f134]) ).
fof(f154,plain,
( nil = sK3
| nil != sK2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f155,plain,
ssList(sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f158,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f159,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK1,X4)
| ~ frontsegP(sK0,X4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f160,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f161,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f162,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f185,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f186,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f189,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f197,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f202,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f212,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f160,f162]) ).
fof(f213,plain,
! [X4] :
( ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK2,X4) ),
inference(definition_unfolding,[],[f159,f162,f161]) ).
fof(f214,plain,
ssList(sK3),
inference(definition_unfolding,[],[f151,f162]) ).
fof(f215,plain,
ssList(sK2),
inference(definition_unfolding,[],[f150,f161]) ).
fof(f219,definition,
~ sP16(nil),
introduced(definition,[new_symbols(definition,[sP16])],[inequality_splitting_name_introduction]) ).
fof(f220,plain,
( nil = sK3
| sP16(sK2) ),
inference(inequality_splitting,[],[f154,f219]) ).
fof(f234,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f185]) ).
fof(f237,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f202]) ).
fof(f241,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f234]) ).
fof(f245,definition,
( spl25_1
<=> sP16(sK2) ),
introduced(definition,[new_symbols(definition,[spl25_1])],[avatar_definition]) ).
fof(f247,plain,
( sP16(sK2)
| ~ spl25_1 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f249,definition,
( spl25_2
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl25_2])],[avatar_definition]) ).
fof(f251,plain,
( nil = sK3
| ~ spl25_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f252,plain,
( spl25_1
| spl25_2 ),
inference(avatar_split_clause,[],[f220,f249,f245]) ).
fof(f253,plain,
( neq(nil,nil)
| ~ spl25_2 ),
inference(superposition,[],[f212,f251]) ).
fof(f266,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f237,f158]) ).
fof(f267,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f266,f155]) ).
fof(f276,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f267,f215]) ).
fof(f285,plain,
frontsegP(sK3,sK2),
inference(forward_subsumption_resolution,[],[f276,f214]) ).
fof(f298,plain,
( ~ ssList(nil)
| ~ spl25_2 ),
inference(resolution,[],[f253,f241]) ).
fof(f299,plain,
( $false
| ~ spl25_2 ),
inference(forward_subsumption_resolution,[],[f298,f189]) ).
fof(f300,plain,
~ spl25_2,
inference(avatar_contradiction_clause,[],[f299]) ).
fof(f304,definition,
( spl25_3
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl25_3])],[avatar_definition]) ).
fof(f306,plain,
( nil = sK2
| ~ spl25_3 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f370,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ frontsegP(sK2,sK2) ),
inference(resolution,[],[f213,f285]) ).
fof(f374,plain,
( ~ neq(sK2,nil)
| ~ frontsegP(sK2,sK2) ),
inference(forward_subsumption_resolution,[],[f370,f215]) ).
fof(f376,definition,
( spl25_14
<=> frontsegP(sK2,sK2) ),
introduced(definition,[new_symbols(definition,[spl25_14])],[avatar_definition]) ).
fof(f378,plain,
( ~ frontsegP(sK2,sK2)
| spl25_14 ),
inference(avatar_component_clause,[],[f376]) ).
fof(f380,definition,
( spl25_15
<=> neq(sK2,nil) ),
introduced(definition,[new_symbols(definition,[spl25_15])],[avatar_definition]) ).
fof(f382,plain,
( ~ neq(sK2,nil)
| spl25_15 ),
inference(avatar_component_clause,[],[f380]) ).
fof(f383,plain,
( ~ spl25_14
| ~ spl25_15 ),
inference(avatar_split_clause,[],[f374,f380,f376]) ).
fof(f416,plain,
( ~ ssList(sK2)
| spl25_14 ),
inference(resolution,[],[f378,f197]) ).
fof(f417,plain,
( $false
| spl25_14 ),
inference(forward_subsumption_resolution,[],[f416,f215]) ).
fof(f418,plain,
spl25_14,
inference(avatar_contradiction_clause,[],[f417]) ).
fof(f447,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| spl25_15 ),
inference(resolution,[],[f382,f186]) ).
fof(f448,plain,
( nil = sK2
| ~ ssList(sK2)
| spl25_15 ),
inference(forward_subsumption_resolution,[],[f447,f189]) ).
fof(f458,plain,
( nil = sK2
| spl25_15 ),
inference(forward_subsumption_resolution,[],[f448,f215]) ).
fof(f459,plain,
( spl25_3
| spl25_15 ),
inference(avatar_split_clause,[],[f458,f380,f304]) ).
fof(f464,plain,
( sP16(nil)
| ~ spl25_1
| ~ spl25_3 ),
inference(superposition,[],[f247,f306]) ).
fof(f474,plain,
( $false
| ~ spl25_1
| ~ spl25_3 ),
inference(forward_subsumption_resolution,[],[f464,f219]) ).
fof(f475,plain,
( ~ spl25_1
| ~ spl25_3 ),
inference(avatar_contradiction_clause,[],[f474]) ).
cnf(s1,plain,
( spl25_1
| spl25_2 ),
inference(sat_conversion,[],[f252]) ).
cnf(s2,plain,
~ spl25_2,
inference(sat_conversion,[],[f300]) ).
cnf(s9,plain,
( ~ spl25_14
| ~ spl25_15 ),
inference(sat_conversion,[],[f383]) ).
cnf(s12,plain,
spl25_14,
inference(sat_conversion,[],[f418]) ).
cnf(s15,plain,
( spl25_3
| spl25_15 ),
inference(sat_conversion,[],[f459]) ).
cnf(s17,plain,
( ~ spl25_1
| ~ spl25_3 ),
inference(sat_conversion,[],[f475]) ).
cnf(s19,plain,
~ spl25_15,
inference(rat,[],[s9,s12]) ).
cnf(s20,plain,
spl25_3,
inference(rat,[],[s15,s19]) ).
cnf(s22,plain,
~ spl25_1,
inference(rat,[],[s17,s20]) ).
cnf(s28,plain,
$false,
inference(rat,[],[s1,s2,s22]) ).
fof(f477,plain,
$false,
inference(avatar_sat_refutation,[],[s28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC024+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 07:29:45 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.71/1.12 % (2860650)Detected formulas, will run a generic FOF schedule.
% 1.71/1.12 % (2860658)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=131670487:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.71/1.12 % (2860658)First to succeed.
% 1.71/1.12 % (2860658)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2860650"
% 1.71/1.12 % (2860660)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1899777392:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.71/1.12 % (2860659)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1789450898:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.71/1.12 % (2860655)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=850863732:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.71/1.12 % (2860661)dis-21_1_sil=8000:lcm=predicate:random_seed=4260092985:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.71/1.12 % (2860656)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2262511444:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.71/1.12 % (2860657)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1636563858:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.71/1.12 % (2860659)Also succeeded, but the first one will report.
% 1.71/1.12 % (2860660)Also succeeded, but the first one will report.
% 1.71/1.12 % (2860661)Instruction limit reached!
% 1.71/1.12 % (2860661)------------------------------
% 1.71/1.12 % (2860661)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.71/1.12 % (2860661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.71/1.12 % (2860661)CaDiCaL version: 2.1.3
% 1.71/1.12 % (2860661)Termination reason: Instruction limit
% 1.71/1.12 % (2860661)Termination phase: Saturation
% 1.71/1.12 % (2860661)Time elapsed: 0.075 s
% 1.71/1.12 % (2860661)Peak memory usage: 90 MB
% 1.71/1.12 % (2860661)Instructions burned: 129 (million)
% 1.71/1.12 % (2860658)Refutation found. Thanks to Tanya!
% 1.71/1.12 % SZS status Theorem for theBenchmark
% 1.71/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 2.56/1.31 % (2860658)------------------------------
% 2.56/1.31 % (2860658)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.31 % (2860658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.31 % (2860658)CaDiCaL version: 2.1.3
% 2.56/1.31 % (2860658)Termination reason: Refutation
% 2.56/1.31 % (2860658)Time elapsed: 0.005 s
% 2.56/1.31 % (2860658)Peak memory usage: 89 MB
% 2.56/1.31 % (2860658)Instructions burned: 11 (million)
% 2.56/1.31 % (2860658)------------------------------
% 2.56/1.31 % (2860658)------------------------------
% 2.56/1.31 % (2860650)Success in time 0.273 s
% 2.56/1.31 % Vampire exiting
%------------------------------------------------------------------------------