TSTP Solution File: SEU814^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU814^2 : TPTP v8.2.0. Released v3.7.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 : n013.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 03:51:45 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU814^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.15 % 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.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 16:15:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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.38 % (8216)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (8214)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 (2999ds/4Mi)
% 0.14/0.38 % (8213)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.38 % (8215)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 (2999ds/27Mi)
% 0.14/0.38 % (8218)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 (2999ds/275Mi)
% 0.14/0.38 % (8219)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (8217)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 (2999ds/2Mi)
% 0.14/0.38 % (8220)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.38 % (8216)Instruction limit reached!
% 0.14/0.38 % (8216)------------------------------
% 0.14/0.38 % (8216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8216)Termination reason: Unknown
% 0.14/0.38 % (8216)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (8216)Memory used [KB]: 895
% 0.14/0.38 % (8216)Time elapsed: 0.003 s
% 0.14/0.38 % (8216)Instructions burned: 2 (million)
% 0.14/0.38 % (8216)------------------------------
% 0.14/0.38 % (8216)------------------------------
% 0.14/0.38 % (8217)Instruction limit reached!
% 0.14/0.38 % (8217)------------------------------
% 0.14/0.38 % (8217)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8217)Termination reason: Unknown
% 0.14/0.38 % (8217)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8217)Memory used [KB]: 895
% 0.14/0.38 % (8217)Time elapsed: 0.003 s
% 0.14/0.38 % (8217)Instructions burned: 3 (million)
% 0.14/0.38 % (8217)------------------------------
% 0.14/0.38 % (8217)------------------------------
% 0.14/0.38 % (8220)Instruction limit reached!
% 0.14/0.38 % (8220)------------------------------
% 0.14/0.38 % (8220)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8220)Termination reason: Unknown
% 0.14/0.38 % (8220)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8220)Memory used [KB]: 5500
% 0.14/0.38 % (8220)Time elapsed: 0.004 s
% 0.14/0.38 % (8220)Instructions burned: 3 (million)
% 0.14/0.38 % (8220)------------------------------
% 0.14/0.38 % (8220)------------------------------
% 0.14/0.38 % (8214)Instruction limit reached!
% 0.14/0.38 % (8214)------------------------------
% 0.14/0.38 % (8214)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8214)Termination reason: Unknown
% 0.14/0.38 % (8214)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8214)Memory used [KB]: 5500
% 0.14/0.38 % (8214)Time elapsed: 0.005 s
% 0.14/0.38 % (8214)Instructions burned: 4 (million)
% 0.14/0.38 % (8214)------------------------------
% 0.14/0.38 % (8214)------------------------------
% 0.14/0.38 % (8218)First to succeed.
% 0.14/0.39 % (8215)Also succeeded, but the first one will report.
% 0.14/0.39 % (8219)Also succeeded, but the first one will report.
% 0.14/0.39 % (8218)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.39 thf(func_def_1, type, subset: $i > $i > $o).
% 0.14/0.39 thf(func_def_4, type, transitiveset: $i > $o).
% 0.14/0.39 thf(f65,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(subsumption_resolution,[],[f64,f35])).
% 0.14/0.39 thf(f35,plain,(
% 0.14/0.39 ((in @ sK1 @ sK0) = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 thf(f22,plain,(
% 0.14/0.39 (($true = (transitiveset @ sK0)) & (($true = (in @ sK2 @ sK1)) & ((in @ sK1 @ sK0) = $true) & ($true != (in @ sK2 @ sK0)))) & (subsetE = $true) & (transitivesetOp1 = $true)),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f21,f20])).
% 0.14/0.39 thf(f20,plain,(
% 0.14/0.39 ? [X0] : (((transitiveset @ X0) = $true) & ? [X1,X2] : (((in @ X2 @ X1) = $true) & ($true = (in @ X1 @ X0)) & ((in @ X2 @ X0) != $true))) => (($true = (transitiveset @ sK0)) & ? [X2,X1] : (((in @ X2 @ X1) = $true) & ($true = (in @ X1 @ sK0)) & ((in @ X2 @ sK0) != $true)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f21,plain,(
% 0.14/0.39 ? [X2,X1] : (((in @ X2 @ X1) = $true) & ($true = (in @ X1 @ sK0)) & ((in @ X2 @ sK0) != $true)) => (($true = (in @ sK2 @ sK1)) & ((in @ sK1 @ sK0) = $true) & ($true != (in @ sK2 @ sK0)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f16,plain,(
% 0.14/0.39 ? [X0] : (((transitiveset @ X0) = $true) & ? [X1,X2] : (((in @ X2 @ X1) = $true) & ($true = (in @ X1 @ X0)) & ((in @ X2 @ X0) != $true))) & (subsetE = $true) & (transitivesetOp1 = $true)),
% 0.14/0.39 inference(flattening,[],[f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 (? [X0] : (? [X1,X2] : ((((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) & ($true = (in @ X1 @ X0))) & ((transitiveset @ X0) = $true)) & (transitivesetOp1 = $true)) & (subsetE = $true)),
% 0.14/0.39 inference(ennf_transformation,[],[f12])).
% 0.14/0.39 thf(f12,plain,(
% 0.14/0.39 ~((subsetE = $true) => ((transitivesetOp1 = $true) => ! [X0] : (((transitiveset @ X0) = $true) => ! [X1,X2] : (($true = (in @ X1 @ X0)) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true))))))),
% 0.14/0.39 inference(fool_elimination,[],[f11])).
% 0.14/0.39 thf(f11,plain,(
% 0.14/0.39 ~(subsetE => (transitivesetOp1 => ! [X0] : ((transitiveset @ X0) => ! [X1,X2] : ((in @ X1 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ X0))))))),
% 0.14/0.39 inference(rectify,[],[f5])).
% 0.14/0.39 thf(f5,negated_conjecture,(
% 0.14/0.39 ~(subsetE => (transitivesetOp1 => ! [X3] : ((transitiveset @ X3) => ! [X0,X2] : ((in @ X0 @ X3) => ((in @ X2 @ X0) => (in @ X2 @ X3))))))),
% 0.14/0.39 inference(negated_conjecture,[],[f4])).
% 0.14/0.39 thf(f4,conjecture,(
% 0.14/0.39 subsetE => (transitivesetOp1 => ! [X3] : ((transitiveset @ X3) => ! [X0,X2] : ((in @ X0 @ X3) => ((in @ X2 @ X0) => (in @ X2 @ X3)))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivesetOp2)).
% 0.14/0.39 thf(f64,plain,(
% 0.14/0.39 ((in @ sK1 @ sK0) != $true)),
% 0.14/0.39 inference(subsumption_resolution,[],[f63,f37])).
% 0.14/0.39 thf(f37,plain,(
% 0.14/0.39 ($true = (transitiveset @ sK0))),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 thf(f63,plain,(
% 0.14/0.39 ($true != (transitiveset @ sK0)) | ((in @ sK1 @ sK0) != $true)),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f62])).
% 0.14/0.39 thf(f62,plain,(
% 0.14/0.39 ((in @ sK1 @ sK0) != $true) | ($true != (transitiveset @ sK0)) | ($true != $true)),
% 0.14/0.39 inference(superposition,[],[f60,f54])).
% 0.14/0.39 thf(f54,plain,(
% 0.14/0.39 ( ! [X2 : $i,X3 : $i] : (((subset @ X3 @ X2) = $true) | ($true != (transitiveset @ X2)) | ((in @ X3 @ X2) != $true)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f53])).
% 0.14/0.39 thf(f53,plain,(
% 0.14/0.39 ( ! [X2 : $i,X3 : $i] : (($true != (transitiveset @ X2)) | ((subset @ X3 @ X2) = $true) | ((in @ X3 @ X2) != $true) | ($true != $true)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f42,f32])).
% 0.14/0.39 thf(f32,plain,(
% 0.14/0.39 (transitivesetOp1 = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 thf(f42,plain,(
% 0.14/0.39 ( ! [X2 : $i,X3 : $i] : (($true != (transitiveset @ X2)) | ((in @ X3 @ X2) != $true) | ((subset @ X3 @ X2) = $true) | (transitivesetOp1 != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f31])).
% 0.14/0.39 thf(f31,plain,(
% 0.14/0.39 ((transitivesetOp1 = $true) | (($true = (transitiveset @ sK6)) & (($true = (in @ sK7 @ sK6)) & ((subset @ sK7 @ sK6) != $true)))) & (! [X2] : (($true != (transitiveset @ X2)) | ! [X3] : (((in @ X3 @ X2) != $true) | ((subset @ X3 @ X2) = $true))) | (transitivesetOp1 != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f28,f30,f29])).
% 0.14/0.39 thf(f29,plain,(
% 0.14/0.39 ? [X0] : (((transitiveset @ X0) = $true) & ? [X1] : (($true = (in @ X1 @ X0)) & ($true != (subset @ X1 @ X0)))) => (($true = (transitiveset @ sK6)) & ? [X1] : (($true = (in @ X1 @ sK6)) & ($true != (subset @ X1 @ sK6))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f30,plain,(
% 0.14/0.39 ? [X1] : (($true = (in @ X1 @ sK6)) & ($true != (subset @ X1 @ sK6))) => (($true = (in @ sK7 @ sK6)) & ((subset @ sK7 @ sK6) != $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f28,plain,(
% 0.14/0.39 ((transitivesetOp1 = $true) | ? [X0] : (((transitiveset @ X0) = $true) & ? [X1] : (($true = (in @ X1 @ X0)) & ($true != (subset @ X1 @ X0))))) & (! [X2] : (($true != (transitiveset @ X2)) | ! [X3] : (((in @ X3 @ X2) != $true) | ((subset @ X3 @ X2) = $true))) | (transitivesetOp1 != $true))),
% 0.14/0.39 inference(rectify,[],[f27])).
% 0.14/0.39 thf(f27,plain,(
% 0.14/0.39 ((transitivesetOp1 = $true) | ? [X0] : (((transitiveset @ X0) = $true) & ? [X1] : (($true = (in @ X1 @ X0)) & ($true != (subset @ X1 @ X0))))) & (! [X0] : (((transitiveset @ X0) != $true) | ! [X1] : (($true != (in @ X1 @ X0)) | ($true = (subset @ X1 @ X0)))) | (transitivesetOp1 != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f17])).
% 0.14/0.39 thf(f17,plain,(
% 0.14/0.39 (transitivesetOp1 = $true) <=> ! [X0] : (((transitiveset @ X0) != $true) | ! [X1] : (($true != (in @ X1 @ X0)) | ($true = (subset @ X1 @ X0))))),
% 0.14/0.39 inference(ennf_transformation,[],[f10])).
% 0.14/0.39 thf(f10,plain,(
% 0.14/0.39 (transitivesetOp1 = $true) <=> ! [X0] : (((transitiveset @ X0) = $true) => ! [X1] : (($true = (in @ X1 @ X0)) => ($true = (subset @ X1 @ X0))))),
% 0.14/0.39 inference(fool_elimination,[],[f9])).
% 0.14/0.39 thf(f9,plain,(
% 0.14/0.39 (transitivesetOp1 = ! [X0] : ((transitiveset @ X0) => ! [X1] : ((in @ X1 @ X0) => (subset @ X1 @ X0))))),
% 0.14/0.39 inference(rectify,[],[f3])).
% 0.14/0.39 thf(f3,axiom,(
% 0.14/0.39 (transitivesetOp1 = ! [X3] : ((transitiveset @ X3) => ! [X0] : ((in @ X0 @ X3) => (subset @ X0 @ X3))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivesetOp1)).
% 0.14/0.39 thf(f60,plain,(
% 0.14/0.39 ($true != (subset @ sK1 @ sK0))),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.14/0.39 thf(f58,plain,(
% 0.14/0.39 ($true != $true) | ($true != (subset @ sK1 @ sK0))),
% 0.14/0.39 inference(superposition,[],[f57,f36])).
% 0.14/0.39 thf(f36,plain,(
% 0.14/0.39 ($true = (in @ sK2 @ sK1))),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 thf(f57,plain,(
% 0.14/0.39 ( ! [X0 : $i] : (($true != (in @ sK2 @ X0)) | ((subset @ X0 @ sK0) != $true)) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f56])).
% 0.14/0.39 thf(f56,plain,(
% 0.14/0.39 ( ! [X0 : $i] : (($true != (in @ sK2 @ X0)) | ((subset @ X0 @ sK0) != $true) | ($true != $true)) )),
% 0.14/0.39 inference(superposition,[],[f34,f55])).
% 0.14/0.39 thf(f55,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ X3) = $true) | ((subset @ X5 @ X3) != $true) | ($true != (in @ X4 @ X5))) )),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f49])).
% 0.14/0.39 thf(f49,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ X5)) | ($true != $true) | ((in @ X4 @ X3) = $true) | ((subset @ X5 @ X3) != $true)) )),
% 0.14/0.39 inference(definition_unfolding,[],[f38,f33])).
% 0.14/0.39 thf(f33,plain,(
% 0.14/0.39 (subsetE = $true)),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 thf(f38,plain,(
% 0.14/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ X5)) | ((subset @ X5 @ X3) != $true) | ((in @ X4 @ X3) = $true) | (subsetE != $true)) )),
% 0.14/0.39 inference(cnf_transformation,[],[f26])).
% 0.14/0.39 thf(f26,plain,(
% 0.14/0.39 ((subsetE = $true) | (($true = (in @ sK4 @ sK5)) & ($true = (subset @ sK5 @ sK3)) & ((in @ sK4 @ sK3) != $true))) & (! [X3,X4,X5] : (($true != (in @ X4 @ X5)) | ((subset @ X5 @ X3) != $true) | ((in @ X4 @ X3) = $true)) | (subsetE != $true))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f24,f25])).
% 0.14/0.39 thf(f25,plain,(
% 0.14/0.39 ? [X0,X1,X2] : (($true = (in @ X1 @ X2)) & ((subset @ X2 @ X0) = $true) & ($true != (in @ X1 @ X0))) => (($true = (in @ sK4 @ sK5)) & ($true = (subset @ sK5 @ sK3)) & ((in @ sK4 @ sK3) != $true))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f24,plain,(
% 0.14/0.39 ((subsetE = $true) | ? [X0,X1,X2] : (($true = (in @ X1 @ X2)) & ((subset @ X2 @ X0) = $true) & ($true != (in @ X1 @ X0)))) & (! [X3,X4,X5] : (($true != (in @ X4 @ X5)) | ((subset @ X5 @ X3) != $true) | ((in @ X4 @ X3) = $true)) | (subsetE != $true))),
% 0.14/0.39 inference(rectify,[],[f23])).
% 0.14/0.39 thf(f23,plain,(
% 0.14/0.39 ((subsetE = $true) | ? [X0,X1,X2] : (($true = (in @ X1 @ X2)) & ((subset @ X2 @ X0) = $true) & ($true != (in @ X1 @ X0)))) & (! [X0,X1,X2] : (($true != (in @ X1 @ X2)) | ((subset @ X2 @ X0) != $true) | ($true = (in @ X1 @ X0))) | (subsetE != $true))),
% 0.14/0.39 inference(nnf_transformation,[],[f19])).
% 0.14/0.39 thf(f19,plain,(
% 0.14/0.39 (subsetE = $true) <=> ! [X0,X1,X2] : (($true != (in @ X1 @ X2)) | ((subset @ X2 @ X0) != $true) | ($true = (in @ X1 @ X0)))),
% 0.14/0.39 inference(flattening,[],[f18])).
% 0.14/0.39 thf(f18,plain,(
% 0.14/0.39 ! [X0,X1,X2] : ((($true = (in @ X1 @ X0)) | ($true != (in @ X1 @ X2))) | ((subset @ X2 @ X0) != $true)) <=> (subsetE = $true)),
% 0.14/0.39 inference(ennf_transformation,[],[f8])).
% 0.14/0.39 thf(f8,plain,(
% 0.14/0.39 ! [X0,X1,X2] : (((subset @ X2 @ X0) = $true) => (($true = (in @ X1 @ X2)) => ($true = (in @ X1 @ X0)))) <=> (subsetE = $true)),
% 0.14/0.39 inference(fool_elimination,[],[f7])).
% 0.14/0.39 thf(f7,plain,(
% 0.14/0.39 (subsetE = ! [X0,X1,X2] : ((subset @ X2 @ X0) => ((in @ X1 @ X2) => (in @ X1 @ X0))))),
% 0.14/0.39 inference(rectify,[],[f1])).
% 0.14/0.39 thf(f1,axiom,(
% 0.14/0.39 (subsetE = ! [X1,X2,X0] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 0.14/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE)).
% 0.14/0.39 thf(f34,plain,(
% 0.14/0.39 ($true != (in @ sK2 @ sK0))),
% 0.14/0.39 inference(cnf_transformation,[],[f22])).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (8218)------------------------------
% 0.14/0.39 % (8218)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (8218)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (8218)Memory used [KB]: 5500
% 0.14/0.39 % (8218)Time elapsed: 0.007 s
% 0.14/0.39 % (8218)Instructions burned: 4 (million)
% 0.14/0.39 % (8218)------------------------------
% 0.14/0.39 % (8218)------------------------------
% 0.14/0.39 % (8212)Success in time 0.008 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------