%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO109^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:48:58 AM UTC 2026
% Result : Theorem 0.06s 0.25s
% Output : Refutation 0.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO109^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.17 % Computer : n002.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 16:36:52 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20 Running first-order model finding
% 0.06/0.20 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.25 % (1509726)Will run a generic schedule for satisfiability detection.
% 0.06/0.25 % (1509733)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1658604496:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.25 % (1509732)% WARNING: option uhcvi not known.
% 0.06/0.25 % (1509732)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3259323459:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.25 % (1509731)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3466580599_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.25 % (1509735)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3323477160:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.25 % (1509732)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.25 % (1509736)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4065790541:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.25 % (1509737)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1018270516:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.25 % (1509735)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.06/0.25 % (1509732)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.06/0.25 % Exception at run slice level
% 0.06/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.06/0.25 % (1509733) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1509726-1509733"...
% 0.06/0.25 % (1509733)...printing done.
% 0.06/0.25 % (1509733)Refutation found. Thanks to Tanya!
% 0.06/0.25 % SZS status Theorem for theBenchmark
% 0.06/0.25 % SZS output start Proof for theBenchmark
% 0.06/0.25 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.06/0.25 thf(func_def_0, type, cP: ($i > $o)).
% 0.06/0.25 thf(func_def_1, type, cN: ($i > $i > $o)).
% 0.06/0.25 thf(func_def_2, type, cM: ($i > $i > $o)).
% 0.06/0.25 thf(func_def_7, type, sK1: ($i > $i)).
% 0.06/0.25 thf(f1,conjecture,(
% 0.06/0.25 (! [X2 : $i,X5 : $i] : (((cN @ X2 @ X5) | (cM @ X2 @ X5)) => ((cN @ X5 @ X5) | (cM @ X5 @ X5) | (cN @ X5 @ X2) | (cM @ X5 @ X2))) & ! [X2 : $i] : ? [X3 : $i] : ((cN @ X3 @ X2) | ! [X4 : $i] : (cM @ X3 @ X4)) & ! [X0 : $i] : (? [X1 : $i] : ((cN @ X0 @ X1) | (cM @ X0 @ X1)) => (cP @ X0))) => ! [X5 : $i] : (cP @ X5)),
% 0.06/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM271)).
% 0.06/0.25 thf(f2,negated_conjecture,(
% 0.06/0.25 ~((! [X2 : $i,X5 : $i] : (((cN @ X2 @ X5) | (cM @ X2 @ X5)) => ((cN @ X5 @ X5) | (cM @ X5 @ X5) | (cN @ X5 @ X2) | (cM @ X5 @ X2))) & ! [X2 : $i] : ? [X3 : $i] : ((cN @ X3 @ X2) | ! [X4 : $i] : (cM @ X3 @ X4)) & ! [X0 : $i] : (? [X1 : $i] : ((cN @ X0 @ X1) | (cM @ X0 @ X1)) => (cP @ X0))) => ! [X5 : $i] : (cP @ X5))),
% 0.06/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.06/0.25 thf(f3,plain,(
% 0.06/0.25 ~((! [X0 : $i,X1 : $i] : (((cN @ X0 @ X1) | (cM @ X0 @ X1)) => ((cN @ X1 @ X1) | (cM @ X1 @ X1) | (cN @ X1 @ X0) | (cM @ X1 @ X0))) & ! [X2 : $i] : ? [X3 : $i] : ((cN @ X3 @ X2) | ! [X4 : $i] : (cM @ X3 @ X4)) & ! [X5 : $i] : (? [X6 : $i] : ((cN @ X5 @ X6) | (cM @ X5 @ X6)) => (cP @ X5))) => ! [X7 : $i] : (cP @ X7))),
% 0.06/0.25 inference(rectify,[],[f2])).
% 0.06/0.25 thf(f4,plain,(
% 0.06/0.25 ~((! [X0 : $i,X1 : $i] : (((((cN @ X0 @ X1)) = $true) | (((cM @ X0 @ X1)) = $true)) => ((((cN @ X1 @ X1)) = $true) | (((cM @ X1 @ X1)) = $true) | (((cN @ X1 @ X0)) = $true) | (((cM @ X1 @ X0)) = $true))) & ! [X2 : $i] : ? [X3 : $i] : ((((cN @ X3 @ X2)) = $true) | ! [X4 : $i] : (((cM @ X3 @ X4)) = $true)) & ! [X5 : $i] : (? [X6 : $i] : ((((cN @ X5 @ X6)) = $true) | (((cM @ X5 @ X6)) = $true)) => (((cP @ X5)) = $true))) => ! [X7 : $i] : (((cP @ X7)) = $true))),
% 0.06/0.25 inference(fool_elimination,[],[f3])).
% 0.06/0.25 thf(f5,plain,(
% 0.06/0.25 ? [X7 : $i] : (((cP @ X7)) != $true) & (! [X0 : $i,X1 : $i] : (((((cN @ X1 @ X1)) = $true) | (((cM @ X1 @ X1)) = $true) | (((cN @ X1 @ X0)) = $true) | (((cM @ X1 @ X0)) = $true)) | ((((cN @ X0 @ X1)) != $true) & (((cM @ X0 @ X1)) != $true))) & ! [X2 : $i] : ? [X3 : $i] : ((((cN @ X3 @ X2)) = $true) | ! [X4 : $i] : (((cM @ X3 @ X4)) = $true)) & ! [X5 : $i] : ((((cP @ X5)) = $true) | ! [X6 : $i] : ((((cN @ X5 @ X6)) != $true) & (((cM @ X5 @ X6)) != $true))))),
% 0.06/0.25 inference(ennf_transformation,[],[f4])).
% 0.06/0.25 thf(f6,plain,(
% 0.06/0.25 ? [X7 : $i] : (((cP @ X7)) != $true) & ! [X0 : $i,X1 : $i] : ((((cN @ X1 @ X1)) = $true) | (((cM @ X1 @ X1)) = $true) | (((cN @ X1 @ X0)) = $true) | (((cM @ X1 @ X0)) = $true) | ((((cN @ X0 @ X1)) != $true) & (((cM @ X0 @ X1)) != $true))) & ! [X2 : $i] : ? [X3 : $i] : ((((cN @ X3 @ X2)) = $true) | ! [X4 : $i] : (((cM @ X3 @ X4)) = $true)) & ! [X5 : $i] : ((((cP @ X5)) = $true) | ! [X6 : $i] : ((((cN @ X5 @ X6)) != $true) & (((cM @ X5 @ X6)) != $true)))),
% 0.06/0.25 inference(flattening,[],[f5])).
% 0.06/0.25 thf(f7,plain,(
% 0.06/0.25 ? [X0 : $i] : (((cP @ X0)) != $true) & ! [X1 : $i,X2 : $i] : (($true = ((cN @ X2 @ X2))) | ($true = ((cM @ X2 @ X2))) | ($true = ((cN @ X2 @ X1))) | ($true = ((cM @ X2 @ X1))) | (($true != ((cN @ X1 @ X2))) & ($true != ((cM @ X1 @ X2))))) & ! [X3 : $i] : ? [X4 : $i] : (($true = ((cN @ X4 @ X3))) | ! [X5 : $i] : ($true = ((cM @ X4 @ X5)))) & ! [X6 : $i] : (($true = ((cP @ X6))) | ! [X7 : $i] : (($true != ((cN @ X6 @ X7))) & ($true != ((cM @ X6 @ X7)))))),
% 0.06/0.25 inference(rectify,[],[f6])).
% 0.06/0.25 thf(f8,plain,(
% 0.06/0.25 ($true != ((cP @ sK0))) & ! [X1 : $i,X2 : $i] : (($true = ((cN @ X2 @ X2))) | ($true = ((cM @ X2 @ X2))) | ($true = ((cN @ X2 @ X1))) | ($true = ((cM @ X2 @ X1))) | (($true != ((cN @ X1 @ X2))) & ($true != ((cM @ X1 @ X2))))) & ! [X3 : $i] : (($true = ((cN @ (sK1 @ X3) @ X3))) | ! [X5 : $i] : ($true = ((cM @ (sK1 @ X3) @ X5)))) & ! [X6 : $i] : (($true = ((cP @ X6))) | ! [X7 : $i] : (($true != ((cN @ X6 @ X7))) & ($true != ((cM @ X6 @ X7)))))),
% 0.06/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X4,sK1 @ X3)],[f7])).
% 0.06/0.25 thf(f9,plain,(
% 0.06/0.25 ( ! [X6 : $i,X7 : $i] : (($true != ((cM @ X6 @ X7))) | ($true = ((cP @ X6)))) )),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f10,plain,(
% 0.06/0.25 ( ! [X6 : $i,X7 : $i] : (($true != ((cN @ X6 @ X7))) | ($true = ((cP @ X6)))) )),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f11,plain,(
% 0.06/0.25 ( ! [X3 : $i,X5 : $i] : (($true = ((cN @ (sK1 @ X3) @ X3))) | ($true = ((cM @ (sK1 @ X3) @ X5)))) )),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f12,plain,(
% 0.06/0.25 ( ! [X2 : $i,X1 : $i] : (($true != ((cM @ X1 @ X2))) | ($true = ((cM @ X2 @ X2))) | ($true = ((cN @ X2 @ X1))) | ($true = ((cM @ X2 @ X1))) | ($true = ((cN @ X2 @ X2)))) )),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f13,plain,(
% 0.06/0.25 ( ! [X2 : $i,X1 : $i] : (($true != ((cN @ X1 @ X2))) | ($true = ((cM @ X2 @ X2))) | ($true = ((cN @ X2 @ X1))) | ($true = ((cM @ X2 @ X1))) | ($true = ((cN @ X2 @ X2)))) )),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f14,plain,(
% 0.06/0.25 ($true != ((cP @ sK0)))),
% 0.06/0.25 inference(cnf_transformation,[],[f8])).
% 0.06/0.25 thf(f16,definition,(
% 0.06/0.25 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.06/0.25 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.06/0.25 thf(f18,definition,(
% 0.06/0.25 spl2_1 <=> ! [X6 : $i] : ($true = ((cP @ X6)))),
% 0.06/0.25 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.06/0.25 thf(f19,plain,(
% 0.06/0.25 ( ! [X6 : $i] : (($true = ((cP @ X6)))) ) | ~spl2_1),
% 0.06/0.25 inference(avatar_component_clause,[],[f18])).
% 0.06/0.25 thf(f23,plain,(
% 0.06/0.25 ($true != $true) | ~spl2_1),
% 0.06/0.25 inference(constrained_superposition,[],[f14,f19])).
% 0.06/0.25 thf(f24,plain,(
% 0.06/0.25 $false | ~spl2_1),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f23])).
% 0.06/0.25 thf(f25,plain,(
% 0.06/0.25 ~spl2_1),
% 0.06/0.25 inference(avatar_contradiction_clause,[],[f24])).
% 0.06/0.25 thf(f53,definition,(
% 0.06/0.25 spl2_6 <=> ! [X3 : $i] : ($true = ((cN @ (sK1 @ X3) @ X3)))),
% 0.06/0.25 introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition])).
% 0.06/0.25 thf(f54,plain,(
% 0.06/0.25 ( ! [X3 : $i] : (($true = ((cN @ (sK1 @ X3) @ X3)))) ) | ~spl2_6),
% 0.06/0.25 inference(avatar_component_clause,[],[f53])).
% 0.06/0.25 thf(f99,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((cM @ X1 @ X1)) = $true) | (((cN @ X1 @ X0)) = $true) | (((cM @ X1 @ X0)) = $true) | (((cN @ X1 @ X1)) = $true) | (((cM @ X0 @ X1)) = $false)) )),
% 0.06/0.25 inference(constrained_superposition,[],[f12,f16])).
% 0.06/0.25 thf(f100,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((cP @ X0)) = $true) | (((cM @ X0 @ X1)) = $false)) )),
% 0.06/0.25 inference(constrained_superposition,[],[f9,f16])).
% 0.06/0.25 thf(f104,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cM @ X0 @ X1)) = $false) | (((cP @ X0)) = $true)) )),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f100])).
% 0.06/0.25 thf(f105,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cM @ X1 @ X1)) = $true) | (((cM @ X1 @ X0)) = $true) | (((cM @ X0 @ X1)) = $false) | (((cN @ X1 @ X1)) = $true) | (((cN @ X1 @ X0)) = $true)) )),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f99])).
% 0.06/0.25 thf(f450,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((cP @ X0)) = $true) | ($true = ((cM @ X0 @ X0))) | (((cM @ X1 @ X0)) = $false) | ($true = ((cN @ X0 @ X0))) | (((cN @ X0 @ X1)) = $true)) )),
% 0.06/0.25 inference(constrained_superposition,[],[f9,f105])).
% 0.06/0.25 thf(f466,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cP @ X0)) = $true) | ($true = ((cM @ X0 @ X0))) | (((cM @ X1 @ X0)) = $false) | ($true = ((cN @ X0 @ X0))) | (((cN @ X0 @ X1)) = $true)) )),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f450])).
% 0.06/0.25 thf(f477,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cP @ X0)) = $true) | (((cM @ X1 @ X0)) = $false) | ($true = ((cN @ X0 @ X0))) | (((cN @ X0 @ X1)) = $true)) )),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f466,f9])).
% 0.06/0.25 thf(f483,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cP @ X0)) = $true) | (((cM @ X1 @ X0)) = $false) | (((cN @ X0 @ X1)) = $true)) )),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f477,f10])).
% 0.06/0.25 thf(f489,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : ((((cM @ X1 @ X0)) = $false) | (((cP @ X0)) = $true)) )),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f483,f10])).
% 0.06/0.25 thf(f502,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : (($true = $false) | ($true = ((cN @ (sK1 @ X0) @ X0))) | ($true = ((cP @ X1)))) )),
% 0.06/0.25 inference(constrained_superposition,[],[f11,f489])).
% 0.06/0.25 thf(f505,plain,(
% 0.06/0.25 ( ! [X0 : $i,X1 : $i] : (($true = ((cN @ (sK1 @ X0) @ X0))) | ($true = ((cP @ X1)))) )),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f502])).
% 0.06/0.25 thf(f511,plain,(
% 0.06/0.25 spl2_1 | spl2_6),
% 0.06/0.25 inference(avatar_split_clause,[],[f505,f53,f18])).
% 0.06/0.25 thf(f529,plain,(
% 0.06/0.25 ( ! [X0 : $i] : (($true != $true) | ($true = ((cM @ X0 @ X0))) | ($true = ((cN @ X0 @ (sK1 @ X0)))) | ($true = ((cM @ X0 @ (sK1 @ X0)))) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(constrained_superposition,[],[f13,f54])).
% 0.06/0.25 thf(f534,plain,(
% 0.06/0.25 ( ! [X0 : $i] : (($true = ((cM @ X0 @ (sK1 @ X0)))) | ($true = ((cN @ X0 @ (sK1 @ X0)))) | ($true = ((cM @ X0 @ X0))) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f529])).
% 0.06/0.25 thf(f568,plain,(
% 0.06/0.25 ( ! [X0 : $i] : (($true = $false) | (((cP @ X0)) = $true) | ($true = ((cN @ X0 @ (sK1 @ X0)))) | ($true = ((cM @ X0 @ X0))) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(constrained_superposition,[],[f104,f534])).
% 0.06/0.25 thf(f571,plain,(
% 0.06/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cN @ X0 @ (sK1 @ X0)))) | ($true = ((cM @ X0 @ X0))) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(trivial_inequality_removal,[],[f568])).
% 0.06/0.25 thf(f576,plain,(
% 0.06/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cM @ X0 @ X0))) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f571,f10])).
% 0.06/0.25 thf(f579,plain,(
% 0.06/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cN @ X0 @ X0)))) ) | ~spl2_6),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f576,f9])).
% 0.06/0.25 thf(f582,plain,(
% 0.06/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $true)) ) | ~spl2_6),
% 0.06/0.25 inference(forward_subsumption_resolution,[],[f579,f10])).
% 0.06/0.25 thf(f585,plain,(
% 0.06/0.25 spl2_1 | ~spl2_6),
% 0.06/0.25 inference(avatar_split_clause,[],[f582,f53,f18])).
% 0.06/0.25 cnf(s16, plain, ~spl2_1, inference(sat_conversion,[],[f25])).
% 0.06/0.25 cnf(s198, plain, spl2_1 | spl2_6, inference(sat_conversion,[],[f511])).
% 0.06/0.25 cnf(s226, plain, spl2_1 | ~spl2_6, inference(sat_conversion,[],[f585])).
% 0.06/0.25 cnf(s227, plain, ~spl2_6, inference(rat,[],[s226,s16])).
% 0.06/0.25 cnf(s232, plain, $false, inference(rat,[],[s198,s227,s16])).
% 0.06/0.25 thf(f586,plain,(
% 0.06/0.25 $false),
% 0.06/0.25 inference(avatar_sat_refutation,[],[s232])).
% 0.06/0.25 % SZS output end Proof for theBenchmark
% 0.06/0.25 % (1509733)------------------------------
% 0.06/0.25 % (1509733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.25 % (1509733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.25 % (1509733)CaDiCaL version: 2.1.3
% 0.06/0.25 % (1509733)Termination reason: Refutation
% 0.06/0.25 % (1509733)Time elapsed: 0.011 s
% 0.06/0.25 % (1509733)Peak memory usage: 13 MB
% 0.06/0.25 % (1509733)Instructions burned: 35 (million)
% 0.06/0.25 % (1509726)Success in time 0.039 s
% 0.06/0.25 % Vampire exiting
%------------------------------------------------------------------------------