%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET959+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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 12:45:05 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 10 unt; 4 def)
% Number of atoms : 199 ( 55 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 214 ( 87 ~; 84 |; 28 &)
% ( 10 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn 85 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f7,conjecture,
! [X0,X1] :
( ( ! [X2] :
~ ( in(X2,X0)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) )
& ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) )
& ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) ) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t112_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( ( ! [X2] :
~ ( in(X2,X0)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) )
& ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) )
& ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) ) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f10,plain,
~ ! [X0,X1] :
( ( ! [X2] :
~ ( in(X2,X0)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) )
& ! [X5] :
~ ( in(X5,X1)
& ! [X6,X7] : ordered_pair(X6,X7) != X5 )
& ! [X8,X9] :
( in(ordered_pair(X8,X9),X0)
<=> in(ordered_pair(X8,X9),X1) ) )
=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f12,plain,
? [X0,X1] :
( X0 != X1
& ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X5] :
( ~ in(X5,X1)
| ? [X6,X7] : ordered_pair(X6,X7) = X5 )
& ! [X8,X9] :
( in(ordered_pair(X8,X9),X0)
<=> in(ordered_pair(X8,X9),X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
? [X0,X1] :
( X0 != X1
& ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X5] :
( ~ in(X5,X1)
| ? [X6,X7] : ordered_pair(X6,X7) = X5 )
& ! [X8,X9] :
( in(ordered_pair(X8,X9),X0)
<=> in(ordered_pair(X8,X9),X1) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f17,plain,
? [X0,X1] :
( X0 != X1
& ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X5] :
( ~ in(X5,X1)
| ? [X6,X7] : ordered_pair(X6,X7) = X5 )
& ! [X8,X9] :
( ( in(ordered_pair(X8,X9),X0)
| ~ in(ordered_pair(X8,X9),X1) )
& ( in(ordered_pair(X8,X9),X1)
| ~ in(ordered_pair(X8,X9),X0) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f18,plain,
( sK2 != sK3
& ! [X2] :
( ~ in(X2,sK2)
| ordered_pair(sK4(X2),sK5(X2)) = X2 )
& ! [X5] :
( ~ in(X5,sK3)
| ordered_pair(sK6(X5),sK7(X5)) = X5 )
& ! [X8,X9] :
( ( in(ordered_pair(X8,X9),sK2)
| ~ in(ordered_pair(X8,X9),sK3) )
& ( in(ordered_pair(X8,X9),sK3)
| ~ in(ordered_pair(X8,X9),sK2) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X3,sK4(X2)),skolemize(X4,sK5(X2)),skolemize(X6,sK6(X5)),skolemize(X7,sK7(X5))],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f19]) ).
fof(f22,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f23,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f27,plain,
! [X8,X9] :
( in(ordered_pair(X8,X9),sK3)
| ~ in(ordered_pair(X8,X9),sK2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X8,X9] :
( in(ordered_pair(X8,X9),sK2)
| ~ in(ordered_pair(X8,X9),sK3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X5] :
( ~ in(X5,sK3)
| ordered_pair(sK6(X5),sK7(X5)) = X5 ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X2] :
( ~ in(X2,sK2)
| ordered_pair(sK4(X2),sK5(X2)) = X2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f33,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| X0 = X1
| ~ in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
! [X2] :
( ~ in(X2,sK2)
| unordered_pair(unordered_pair(sK4(X2),sK5(X2)),singleton(sK4(X2))) = X2 ),
inference(definition_unfolding,[],[f30,f23]) ).
fof(f36,plain,
! [X5] :
( ~ in(X5,sK3)
| unordered_pair(unordered_pair(sK6(X5),sK7(X5)),singleton(sK6(X5))) = X5 ),
inference(definition_unfolding,[],[f29,f23]) ).
fof(f37,plain,
! [X8,X9] :
( ~ in(unordered_pair(unordered_pair(X8,X9),singleton(X8)),sK3)
| in(unordered_pair(unordered_pair(X8,X9),singleton(X8)),sK2) ),
inference(definition_unfolding,[],[f28,f23,f23]) ).
fof(f38,plain,
! [X8,X9] :
( ~ in(unordered_pair(unordered_pair(X8,X9),singleton(X8)),sK2)
| in(unordered_pair(unordered_pair(X8,X9),singleton(X8)),sK3) ),
inference(definition_unfolding,[],[f27,f23,f23]) ).
fof(f41,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3) ),
inference(superposition,[],[f38,f22]) ).
fof(f42,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2) ),
inference(superposition,[],[f37,f22]) ).
fof(f62,plain,
! [X0] :
( in(sK8(X0,sK2),X0)
| sK2 = X0
| sK8(X0,sK2) = unordered_pair(unordered_pair(sK4(sK8(X0,sK2)),sK5(sK8(X0,sK2))),singleton(sK4(sK8(X0,sK2)))) ),
inference(resolution,[],[f32,f35]) ).
fof(f72,plain,
! [X0] :
( in(sK8(X0,sK2),X0)
| sK8(X0,sK2) = unordered_pair(singleton(sK4(sK8(X0,sK2))),unordered_pair(sK4(sK8(X0,sK2)),sK5(sK8(X0,sK2))))
| sK2 = X0 ),
inference(forward_demodulation,[],[f62,f22]) ).
fof(f87,definition,
( spl9_1
<=> sK8(sK3,sK2) = unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2)))) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f89,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))))
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f91,definition,
( spl9_2
<=> sK8(sK3,sK2) = unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f93,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2))))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f121,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2))))
| sK2 = sK3
| sK8(sK3,sK2) = unordered_pair(unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))),singleton(sK6(sK8(sK3,sK2)))) ),
inference(resolution,[],[f72,f36]) ).
fof(f124,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2))))
| sK8(sK3,sK2) = unordered_pair(unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))),singleton(sK6(sK8(sK3,sK2)))) ),
inference(forward_subsumption_resolution,[],[f121,f31]) ).
fof(f125,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))))
| sK8(sK3,sK2) = unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) ),
inference(forward_demodulation,[],[f124,f22]) ).
fof(f126,plain,
( spl9_2
| spl9_1 ),
inference(avatar_split_clause,[],[f125,f87,f91]) ).
fof(f131,plain,
( ~ in(sK8(sK3,sK2),sK2)
| in(sK8(sK3,sK2),sK3)
| ~ spl9_2 ),
inference(superposition,[],[f41,f93]) ).
fof(f157,definition,
( spl9_7
<=> in(sK8(sK3,sK2),sK3) ),
introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition]) ).
fof(f158,plain,
( ~ in(sK8(sK3,sK2),sK3)
| spl9_7 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f159,plain,
( in(sK8(sK3,sK2),sK3)
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f161,definition,
( spl9_8
<=> in(sK8(sK3,sK2),sK2) ),
introduced(definition,[new_symbols(definition,[spl9_8])],[avatar_definition]) ).
fof(f162,plain,
( in(sK8(sK3,sK2),sK2)
| ~ spl9_8 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f164,plain,
( spl9_7
| ~ spl9_8
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f131,f91,f161,f157]) ).
fof(f183,plain,
( in(sK8(sK3,sK2),sK2)
| sK2 = sK3
| spl9_7 ),
inference(resolution,[],[f158,f32]) ).
fof(f184,plain,
( in(sK8(sK3,sK2),sK2)
| spl9_7 ),
inference(forward_subsumption_resolution,[],[f183,f31]) ).
fof(f185,plain,
( spl9_8
| spl9_7 ),
inference(avatar_split_clause,[],[f184,f157,f161]) ).
fof(f186,plain,
( sK8(sK3,sK2) = unordered_pair(unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))),singleton(sK6(sK8(sK3,sK2))))
| ~ spl9_7 ),
inference(resolution,[],[f159,f36]) ).
fof(f188,plain,
( sK8(sK3,sK2) = unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2))))
| ~ spl9_7 ),
inference(forward_demodulation,[],[f186,f22]) ).
fof(f189,plain,
( spl9_1
| ~ spl9_7 ),
inference(avatar_split_clause,[],[f188,f157,f87]) ).
fof(f190,plain,
( ~ in(sK8(sK3,sK2),sK3)
| in(sK8(sK3,sK2),sK2)
| ~ spl9_1 ),
inference(superposition,[],[f42,f89]) ).
fof(f192,plain,
( ~ in(sK8(sK3,sK2),sK2)
| in(sK8(sK3,sK2),sK3)
| ~ spl9_1 ),
inference(superposition,[],[f41,f89]) ).
fof(f217,plain,
( in(sK8(sK3,sK2),sK2)
| ~ spl9_1
| ~ spl9_7 ),
inference(forward_subsumption_resolution,[],[f190,f159]) ).
fof(f222,plain,
( spl9_8
| ~ spl9_1
| ~ spl9_7 ),
inference(avatar_split_clause,[],[f217,f157,f87,f161]) ).
fof(f235,plain,
( sK2 = sK3
| ~ in(sK8(sK3,sK2),sK3)
| ~ spl9_8 ),
inference(resolution,[],[f162,f33]) ).
fof(f239,plain,
( ~ in(sK8(sK3,sK2),sK3)
| ~ spl9_8 ),
inference(forward_subsumption_resolution,[],[f235,f31]) ).
fof(f242,plain,
( in(sK8(sK3,sK2),sK3)
| ~ spl9_1
| ~ spl9_8 ),
inference(forward_subsumption_resolution,[],[f192,f162]) ).
fof(f243,plain,
( ~ spl9_7
| ~ spl9_8 ),
inference(avatar_split_clause,[],[f239,f161,f157]) ).
fof(f245,plain,
( spl9_7
| ~ spl9_1
| ~ spl9_8 ),
inference(avatar_split_clause,[],[f242,f161,f87,f157]) ).
cnf(s4,plain,
( spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f126]) ).
cnf(s7,plain,
( ~ spl9_2
| spl9_7
| ~ spl9_8 ),
inference(sat_conversion,[],[f164]) ).
cnf(s13,plain,
( spl9_7
| spl9_8 ),
inference(sat_conversion,[],[f185]) ).
cnf(s14,plain,
( spl9_1
| ~ spl9_7 ),
inference(sat_conversion,[],[f189]) ).
cnf(s17,plain,
( ~ spl9_1
| ~ spl9_7
| spl9_8 ),
inference(sat_conversion,[],[f222]) ).
cnf(s23,plain,
( ~ spl9_7
| ~ spl9_8 ),
inference(sat_conversion,[],[f243]) ).
cnf(s25,plain,
( ~ spl9_1
| spl9_7
| ~ spl9_8 ),
inference(sat_conversion,[],[f245]) ).
cnf(s26,plain,
spl9_1,
inference(rat,[],[s7,s13,s4,s14]) ).
cnf(s27,plain,
spl9_7,
inference(rat,[],[s13,s25,s26]) ).
cnf(s28,plain,
~ spl9_8,
inference(rat,[],[s23,s27]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s17,s26,s28,s27]) ).
fof(f246,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET959+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n009.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 28 03:16:15 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 Running first-order model finding
% 0.12/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 % (2631011)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2631016)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4221427390_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.45 % TRYING [1]
% 0.12/0.45 % TRYING [2]
% 0.12/0.45 % TRYING [3]
% 0.12/0.45 % (2631017)% WARNING: option uhcvi not known.
% 0.12/0.45 % (2631018)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2146683207:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.45 % (2631019)dis+10_1_sil=32000:sp=arity:random_seed=3092642923:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45 % (2631022)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3026737744:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.45 % (2631020)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1169172740:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.45 % (2631021)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3897202094:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.45 % (2631017)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1087233974:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.45 % (2631019) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2631011-2631019"...
% 0.12/0.45 % (2631021) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2631011-2631021"...
% 0.12/0.45 % (2631020) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2631011-2631020"...
% 0.12/0.45 % (2631019)...printing done.
% 0.12/0.45 % (2631021)...printing done.
% 0.12/0.45 % (2631019)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (2631019)------------------------------
% 0.12/0.45 % (2631019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (2631019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (2631019)CaDiCaL version: 2.1.3
% 0.12/0.45 % (2631019)Termination reason: Refutation
% 0.12/0.45 % (2631019)Time elapsed: 0.007 s
% 0.12/0.45 % (2631019)Peak memory usage: 12 MB
% 0.12/0.45 % (2631019)Instructions burned: 9 (million)
% 0.12/0.45 % (2631011)Success in time 0.048 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------