TSTP Solution File: SEV166^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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 : Tue May 21 04:12:13 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 81 ( 80 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 198 ( 33 ~; 32 |; 15 &; 112 @)
% ( 4 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 108 ( 108 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 90 ( 52 ^ 20 !; 16 ?; 90 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: a ).
thf(func_def_8,type,
sK1: a ).
thf(func_def_9,type,
sK2: a ).
thf(func_def_10,type,
sK3: a ).
thf(func_def_11,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK5: a > a > a ).
thf(f50,plain,
$false,
inference(subsumption_resolution,[],[f49,f44]) ).
thf(f44,plain,
sK1 = sK3,
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ( sK1 = sK3 )
| ( sK1 != sK1 ) ),
inference(beta_eta_normalization,[],[f39]) ).
thf(f39,plain,
( ( sK1
!= ( ^ [Y0: a,Y1: a] : Y0
@ sK1
@ sK0 ) )
| ( sK1 = sK3 ) ),
inference(equality_factoring,[],[f36]) ).
thf(f36,plain,
! [X1: a > a > a] :
( ( ( X1 @ sK1 @ sK0 )
= ( X1 @ sK3 @ sK0 ) )
| ( sK1 = sK3 ) ),
inference(beta_eta_normalization,[],[f35]) ).
thf(f35,plain,
! [X1: a > a > a] :
( ( sK1 = sK3 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 )
@ X1 )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 )
@ X1 ) ) ),
inference(argument_congruence,[],[f28]) ).
thf(f28,plain,
( ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) )
| ( sK1 = sK3 ) ),
inference(backward_demodulation,[],[f12,f26]) ).
thf(f26,plain,
sK0 = sK2,
inference(trivial_inequality_removal,[],[f25]) ).
thf(f25,plain,
( ( sK2 != sK2 )
| ( sK0 = sK2 ) ),
inference(beta_eta_normalization,[],[f20]) ).
thf(f20,plain,
( ( ( ^ [Y0: a,Y1: a] : Y1
@ sK1
@ sK2 )
!= sK2 )
| ( sK0 = sK2 ) ),
inference(equality_factoring,[],[f18]) ).
thf(f18,plain,
! [X1: a > a > a] :
( ( ( X1 @ sK3 @ sK0 )
= ( X1 @ sK1 @ sK2 ) )
| ( sK0 = sK2 ) ),
inference(beta_eta_normalization,[],[f16]) ).
thf(f16,plain,
! [X1: a > a > a] :
( ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 )
@ X1 )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 )
@ X1 ) )
| ( sK0 = sK2 ) ),
inference(argument_congruence,[],[f11]) ).
thf(f11,plain,
( ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) )
| ( sK0 = sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( sK1 != sK3 )
| ( sK0 != sK2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) ) )
& ( ( ( sK1 = sK3 )
& ( sK0 = sK2 ) )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a,X1: a,X2: a,X3: a] :
( ( ( X1 != X3 )
| ( X0 != X2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) )
& ( ( ( X1 = X3 )
& ( X0 = X2 ) )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) ) )
=> ( ( ( sK1 != sK3 )
| ( sK0 != sK2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) ) )
& ( ( ( sK1 = sK3 )
& ( sK0 = sK2 ) )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a,X1: a,X2: a,X3: a] :
( ( ( X1 != X3 )
| ( X0 != X2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) )
& ( ( ( X1 = X3 )
& ( X0 = X2 ) )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a,X1: a,X2: a,X3: a] :
( ( ( X1 != X3 )
| ( X0 != X2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) )
& ( ( ( X1 = X3 )
& ( X0 = X2 ) )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a,X1: a,X2: a,X3: a] :
( ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) )
<~> ( ( X1 = X3 )
& ( X0 = X2 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a,X1: a,X2: a,X3: a] :
( ( ( X1 = X3 )
& ( X0 = X2 ) )
<=> ( ( ^ [Y0: a > a > a] : ( Y0 @ X1 @ X2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ X3 @ X0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a,X1: a,X2: a,X3: a] :
( ( ( X1 = X3 )
& ( X0 = X2 ) )
<=> ( ( ^ [X4: a > a > a] : ( X4 @ X3 @ X0 ) )
= ( ^ [X5: a > a > a] : ( X5 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X3: a,X0: a,X1: a,X2: a] :
( ( ( X0 = X2 )
& ( X1 = X3 ) )
<=> ( ( ^ [X4: a > a > a] : ( X4 @ X2 @ X3 ) )
= ( ^ [X4: a > a > a] : ( X4 @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X3: a,X0: a,X1: a,X2: a] :
( ( ( X0 = X2 )
& ( X1 = X3 ) )
<=> ( ( ^ [X4: a > a > a] : ( X4 @ X2 @ X3 ) )
= ( ^ [X4: a > a > a] : ( X4 @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM182_pme) ).
thf(f12,plain,
( ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) )
| ( sK1 = sK3 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f49,plain,
sK1 != sK3,
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( sK1 != sK3 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 ) ) ) ),
inference(backward_demodulation,[],[f33,f44]) ).
thf(f33,plain,
( ( sK1 != sK3 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) ) ),
inference(subsumption_resolution,[],[f29,f26]) ).
thf(f29,plain,
( ( sK0 != sK2 )
| ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK0 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) )
| ( sK1 != sK3 ) ),
inference(backward_demodulation,[],[f13,f26]) ).
thf(f13,plain,
( ( ( ^ [Y0: a > a > a] : ( Y0 @ sK1 @ sK2 ) )
!= ( ^ [Y0: a > a > a] : ( Y0 @ sK3 @ sK0 ) ) )
| ( sK1 != sK3 )
| ( sK0 != sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV166^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 18:57:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (1188)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.14/0.37 % (1186)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.14/0.37 % (1189)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (1190)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (1191)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.14/0.37 % (1192)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (1189)Instruction limit reached!
% 0.14/0.37 % (1189)------------------------------
% 0.14/0.37 % (1189)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1189)Termination reason: Unknown
% 0.14/0.37 % (1189)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (1190)Instruction limit reached!
% 0.14/0.37 % (1190)------------------------------
% 0.14/0.37 % (1190)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1189)Memory used [KB]: 5373
% 0.14/0.37 % (1189)Time elapsed: 0.003 s
% 0.14/0.37 % (1189)Instructions burned: 2 (million)
% 0.14/0.37 % (1189)------------------------------
% 0.14/0.37 % (1189)------------------------------
% 0.14/0.37 % (1190)Termination reason: Unknown
% 0.14/0.37 % (1190)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (1190)Memory used [KB]: 5373
% 0.14/0.37 % (1190)Time elapsed: 0.003 s
% 0.14/0.37 % (1190)Instructions burned: 2 (million)
% 0.14/0.37 % (1190)------------------------------
% 0.14/0.37 % (1190)------------------------------
% 0.14/0.37 % (1188)Refutation not found, incomplete strategy
% 0.14/0.37 % (1188)------------------------------
% 0.14/0.37 % (1188)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1188)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (1188)Memory used [KB]: 5500
% 0.14/0.37 % (1188)Time elapsed: 0.004 s
% 0.14/0.37 % (1188)Instructions burned: 1 (million)
% 0.14/0.37 % (1188)------------------------------
% 0.14/0.37 % (1188)------------------------------
% 0.14/0.37 % (1191)Refutation not found, incomplete strategy
% 0.14/0.37 % (1191)------------------------------
% 0.14/0.37 % (1191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1191)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (1191)Memory used [KB]: 5500
% 0.14/0.37 % (1191)Time elapsed: 0.003 s
% 0.14/0.37 % (1191)Instructions burned: 2 (million)
% 0.14/0.37 % (1191)------------------------------
% 0.14/0.37 % (1191)------------------------------
% 0.14/0.37 % (1187)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.14/0.37 % (1187)Instruction limit reached!
% 0.14/0.37 % (1187)------------------------------
% 0.14/0.37 % (1187)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1187)Termination reason: Unknown
% 0.14/0.37 % (1187)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (1187)Memory used [KB]: 5500
% 0.14/0.37 % (1187)Time elapsed: 0.005 s
% 0.14/0.37 % (1187)Instructions burned: 5 (million)
% 0.14/0.37 % (1187)------------------------------
% 0.14/0.37 % (1187)------------------------------
% 0.14/0.38 % (1192)Instruction limit reached!
% 0.14/0.38 % (1192)------------------------------
% 0.14/0.38 % (1192)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1192)Termination reason: Unknown
% 0.14/0.38 % (1192)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1192)Memory used [KB]: 5500
% 0.14/0.38 % (1192)Time elapsed: 0.013 s
% 0.14/0.38 % (1192)Instructions burned: 18 (million)
% 0.14/0.38 % (1192)------------------------------
% 0.14/0.38 % (1192)------------------------------
% 0.14/0.38 % (1193)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.38 % (1193)Instruction limit reached!
% 0.14/0.38 % (1193)------------------------------
% 0.14/0.38 % (1193)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1193)Termination reason: Unknown
% 0.14/0.38 % (1193)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1193)Memory used [KB]: 5500
% 0.14/0.38 % (1193)Time elapsed: 0.004 s
% 0.14/0.38 % (1193)Instructions burned: 3 (million)
% 0.14/0.38 % (1193)------------------------------
% 0.14/0.38 % (1193)------------------------------
% 0.14/0.38 % (1195)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.38 % (1194)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.38 % (1195)Refutation not found, incomplete strategy
% 0.14/0.38 % (1195)------------------------------
% 0.14/0.38 % (1195)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1195)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (1195)Memory used [KB]: 5500
% 0.14/0.38 % (1195)Time elapsed: 0.003 s
% 0.14/0.38 % (1195)Instructions burned: 2 (million)
% 0.14/0.38 % (1195)------------------------------
% 0.14/0.38 % (1195)------------------------------
% 0.14/0.38 % (1196)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.38 % (1197)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.14/0.38 % (1196)Instruction limit reached!
% 0.14/0.38 % (1196)------------------------------
% 0.14/0.38 % (1196)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1196)Termination reason: Unknown
% 0.14/0.38 % (1196)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1196)Memory used [KB]: 5500
% 0.14/0.38 % (1196)Time elapsed: 0.004 s
% 0.14/0.38 % (1196)Instructions burned: 3 (million)
% 0.14/0.38 % (1196)------------------------------
% 0.14/0.38 % (1196)------------------------------
% 0.14/0.39 % (1198)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.39 % (1197)Refutation not found, incomplete strategy
% 0.14/0.39 % (1197)------------------------------
% 0.14/0.39 % (1197)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1197)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (1197)Memory used [KB]: 5500
% 0.14/0.39 % (1197)Time elapsed: 0.008 s
% 0.14/0.39 % (1197)Instructions burned: 8 (million)
% 0.14/0.39 % (1197)------------------------------
% 0.14/0.39 % (1197)------------------------------
% 0.14/0.39 % (1198)First to succeed.
% 0.14/0.39 % (1199)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.14/0.39 % (1198)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (1198)------------------------------
% 0.14/0.39 % (1198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1198)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (1198)Memory used [KB]: 1023
% 0.14/0.39 % (1198)Time elapsed: 0.006 s
% 0.14/0.39 % (1198)Instructions burned: 4 (million)
% 0.14/0.39 % (1198)------------------------------
% 0.14/0.39 % (1198)------------------------------
% 0.14/0.39 % (1185)Success in time 0.046 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------