%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU612^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 : Wed Sep 30 08:30:19 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 390 ( 86 equ; 0 cnn)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 576 ( 41 ~; 20 |; 16 &; 415 @)
% ( 0 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 8 con; 0-4 aty)
% ( 30 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 129 ( 60 ^; 60 !; 9 ?; 129 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrI: $o ).
thf(func_def_4,type,
binunion: $i > $i > $i ).
thf(func_def_5,type,
binunionIL: $o ).
thf(func_def_6,type,
symdiff: $i > $i > $i ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vOR: $o > $o > $o ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X1: $i > $o,X0: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,axiom,
! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) )
= binunionIL ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(f3,axiom,
( ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( binunion @ X0 @ X1 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X0 ) ) ) )
= symdiff ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiff) ).
thf(f4,conjecture,
( dsetconstrI
=> ( binunionIL
=> ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X1 )
=> ( in @ X2 @ ( symdiff @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffI1) ).
thf(f5,negated_conjecture,
~ ( dsetconstrI
=> ( binunionIL
=> ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X1 )
=> ( in @ X2 @ ( symdiff @ X0 @ X1 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( dsetconstrI
= ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( in @ X2 @ X1 )
=> ( ( X0 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X0 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( dsetconstrI
=> ( binunionIL
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ X1 )
=> ( ~ ( in @ X0 @ X2 )
=> ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f9,plain,
~ ( ( dsetconstrI = $true )
=> ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X0 @ X1 ) )
=> ( ( $true
!= ( in @ X0 @ X2 ) )
=> ( $true
= ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( binunion @ X0 @ X1 )
@ ^ [X2: $i] :
( ~ ( in @ X2 @ X1 )
| ~ ( in @ X2 @ X0 ) ) ) )
= symdiff ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binunion @ X1 @ X0 ) ) )
= binunionIL ),
inference(rectify,[],[f2]) ).
thf(f13,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ Y2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
~ ( ( dsetconstrI = $true )
=> ( ( binunionIL = $true )
=> ! [X2: $i,X1: $i,X0: $i] :
( ( $true
= ( in @ X0 @ X1 ) )
=> ( ( $true
!= ( in @ X0 @ X2 ) )
=> ( $true
= ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) ) ) ) ) ),
inference(flattening,[],[f9]) ).
thf(f15,plain,
( ? [X2: $i,X1: $i,X0: $i] :
( ( $true
!= ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) )
& ( $true
!= ( in @ X0 @ X2 ) )
& ( $true
= ( in @ X0 @ X1 ) ) )
& ( binunionIL = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f16,plain,
( ( dsetconstrI = $true )
& ( binunionIL = $true )
& ? [X2: $i,X1: $i,X0: $i] :
( ( $true
!= ( in @ X0 @ X2 ) )
& ( $true
!= ( in @ X0 @ ( symdiff @ X1 @ X2 ) ) )
& ( $true
= ( in @ X0 @ X1 ) ) ) ),
inference(flattening,[],[f15]) ).
thf(f17,plain,
( ( dsetconstrI = $true )
& ( binunionIL = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
& ( $true
!= ( in @ X2 @ ( symdiff @ X1 @ X0 ) ) )
& ( ( in @ X2 @ X1 )
= $true ) ) ),
inference(rectify,[],[f16]) ).
thf(f18,plain,
( ( dsetconstrI = $true )
& ( binunionIL = $true )
& ( $true
!= ( in @ sK2 @ sK0 ) )
& ( $true
!= ( in @ sK2 @ ( symdiff @ sK1 @ sK0 ) ) )
& ( $true
= ( in @ sK2 @ sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).
thf(f19,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ Y2 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f20,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f21,plain,
( symdiff
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f22,plain,
( $true
= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f23,plain,
( $true
!= ( in @ sK2 @ ( symdiff @ sK1 @ sK0 ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f24,plain,
( $true
!= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f25,plain,
binunionIL = $true,
inference(cnf_transformation,[],[f18]) ).
thf(f26,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f18]) ).
thf(f29,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ Y2 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f19,f25]) ).
thf(f30,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f20,f26]) ).
thf(f31,plain,
( $true
!= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( binunion @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ~ ( in @ Y2 @ Y0 )
| ~ ( in @ Y2 @ Y1 ) ) )
@ sK1
@ sK0 ) ) ),
inference(definition_unfolding,[],[f23,f21]) ).
thf(f32,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( in @ Y0 @ Y1 )
=> ( ( Y2 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y1
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f33,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( in @ X1 @ Y0 )
=> ( ( Y1 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( in @ X1 @ Y0 )
=> ( ( Y1 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ Y1 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( in @ X1 @ X2 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( ( in @ X1 @ X2 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ Y0 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( $true
= ( ( in @ X1 @ X2 )
=> ( ( X3 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( ( $false
= ( in @ X1 @ X2 ) )
| ( ( ( X3 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) ) )
= $true ) ),
inference(imp_proxy_clausification,[],[f37]) ).
thf(f39,plain,
! [X2: $i,X3: $i > $o,X1: $i] :
( ( $true
= ( in @ X1 @ ( dsetconstr @ X2 @ X3 ) ) )
| ( $false
= ( in @ X1 @ X2 ) )
| ( ( X3 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f38]) ).
thf(f40,plain,
( $true
!= ( in @ sK2
@ ( dsetconstr @ ( binunion @ sK1 @ sK0 )
@ ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK1 )
| ~ ( in @ Y0 @ sK0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f41,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binunion @ Y1 @ Y2 ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f29]) ).
thf(f42,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f41]) ).
thf(f43,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ Y1 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ X2 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f45,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ X2 @ Y0 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f44]) ).
thf(f46,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binunion @ X2 @ X3 ) ) ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( binunion @ X2 @ X3 ) ) )
| ( $false
= ( in @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f52,plain,
( ( $true != $true )
| ( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false )
| ( ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK1 )
| ~ ( in @ Y0 @ sK0 ) )
@ sK2 )
= $false ) ),
inference(constrained_superposition,[],[f40,f39]) ).
thf(f53,plain,
( ( ( ^ [Y0: $i] :
( ~ ( in @ Y0 @ sK1 )
| ~ ( in @ Y0 @ sK0 ) )
@ sK2 )
= $false )
| ( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f54,plain,
( ( ( ~ ( in @ sK2 @ sK1 )
| ~ ( in @ sK2 @ sK0 ) )
= $false )
| ( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
( ( ( ~ ( in @ sK2 @ sK0 ) )
= $false )
| ( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false ) ),
inference(or_proxy_clausification,[],[f54]) ).
thf(f58,plain,
( ( $true
= ( in @ sK2 @ sK0 ) )
| ( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false ) ),
inference(not_proxy_clausification,[],[f55]) ).
thf(f59,plain,
( ( in @ sK2 @ ( binunion @ sK1 @ sK0 ) )
= $false ),
inference(forward_subsumption_resolution,[],[f58,f24]) ).
thf(f61,plain,
( ( ( in @ sK2 @ sK1 )
= $false )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f47,f59]) ).
thf(f62,plain,
( ( in @ sK2 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f64,plain,
$true = $false,
inference(constrained_superposition,[],[f62,f22]) ).
thf(f66,plain,
$false,
inference(trivial_inequality_removal,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU612^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 14:04:00 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.27 % (1286515)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (1286521)lrs+10_16_si=on:nwc=1.5:random_seed=1079671893:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.27 % (1286521) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1286515-1286521"...
% 0.20/0.27 % (1286521)...printing done.
% 0.20/0.27 % (1286521)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1286521)------------------------------
% 0.20/0.27 % (1286521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1286521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1286521)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1286521)Termination reason: Refutation
% 0.20/0.27 % (1286521)Time elapsed: 0.003 s
% 0.20/0.27 % (1286521)Peak memory usage: 12 MB
% 0.20/0.27 % (1286521)Instructions burned: 7 (million)
% 0.20/0.27 % (1286515)Success in time 0.032 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------