TSTP Solution File: NUN025^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUN025^2 : TPTP v8.2.0. Released v6.4.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 : n022.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 02:16:58 EDT 2024

% Result   : Theorem 0.22s 0.40s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUN025^2 : TPTP v8.2.0. Released v6.4.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.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat May 18 15:05:08 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.37  % (21045)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.15/0.37  % (21041)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.15/0.37  % (21042)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.15/0.37  % (21044)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37  % (21043)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.15/0.37  % (21046)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.15/0.37  % (21047)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.37  % (21048)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.15/0.37  % (21044)Instruction limit reached!
% 0.15/0.37  % (21044)------------------------------
% 0.15/0.37  % (21044)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (21044)Termination reason: Unknown
% 0.15/0.37  % (21045)Instruction limit reached!
% 0.15/0.37  % (21045)------------------------------
% 0.15/0.37  % (21045)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (21045)Termination reason: Unknown
% 0.15/0.37  % (21045)Termination phase: Saturation
% 0.15/0.37  
% 0.15/0.37  % (21045)Memory used [KB]: 895
% 0.15/0.37  % (21045)Time elapsed: 0.003 s
% 0.15/0.37  % (21045)Instructions burned: 2 (million)
% 0.15/0.37  % (21045)------------------------------
% 0.15/0.37  % (21045)------------------------------
% 0.15/0.37  % (21044)Termination phase: Property scanning
% 0.15/0.37  
% 0.15/0.37  % (21044)Memory used [KB]: 895
% 0.15/0.37  % (21044)Time elapsed: 0.003 s
% 0.15/0.37  % (21044)Instructions burned: 2 (million)
% 0.15/0.37  % (21044)------------------------------
% 0.15/0.37  % (21044)------------------------------
% 0.15/0.38  % (21048)Instruction limit reached!
% 0.15/0.38  % (21048)------------------------------
% 0.15/0.38  % (21048)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (21048)Termination reason: Unknown
% 0.15/0.38  % (21048)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (21048)Memory used [KB]: 5500
% 0.15/0.38  % (21048)Time elapsed: 0.005 s
% 0.15/0.38  % (21048)Instructions burned: 3 (million)
% 0.15/0.38  % (21048)------------------------------
% 0.15/0.38  % (21048)------------------------------
% 0.15/0.38  % (21042)Instruction limit reached!
% 0.15/0.38  % (21042)------------------------------
% 0.15/0.38  % (21042)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (21042)Termination reason: Unknown
% 0.15/0.38  % (21042)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (21042)Memory used [KB]: 5500
% 0.15/0.38  % (21042)Time elapsed: 0.006 s
% 0.15/0.38  % (21042)Instructions burned: 5 (million)
% 0.15/0.38  % (21042)------------------------------
% 0.15/0.38  % (21042)------------------------------
% 0.15/0.38  % (21043)Refutation not found, incomplete strategy
% 0.15/0.38  % (21043)------------------------------
% 0.15/0.38  % (21043)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (21046)Refutation not found, incomplete strategy
% 0.15/0.38  % (21046)------------------------------
% 0.15/0.38  % (21046)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (21046)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38  
% 0.15/0.38  
% 0.15/0.38  % (21046)Memory used [KB]: 5500
% 0.15/0.38  % (21046)Time elapsed: 0.006 s
% 0.15/0.38  % (21046)Instructions burned: 5 (million)
% 0.15/0.38  % (21046)------------------------------
% 0.15/0.38  % (21046)------------------------------
% 0.15/0.38  % (21043)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38  
% 0.15/0.38  
% 0.15/0.38  % (21043)Memory used [KB]: 5500
% 0.15/0.38  % (21043)Time elapsed: 0.006 s
% 0.15/0.38  % (21043)Instructions burned: 4 (million)
% 0.15/0.38  % (21043)------------------------------
% 0.15/0.38  % (21043)------------------------------
% 0.15/0.39  % (21047)Instruction limit reached!
% 0.15/0.39  % (21047)------------------------------
% 0.15/0.39  % (21047)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (21047)Termination reason: Unknown
% 0.15/0.39  % (21047)Termination phase: Saturation
% 0.15/0.39  
% 0.15/0.39  % (21047)Memory used [KB]: 5628
% 0.15/0.39  % (21047)Time elapsed: 0.015 s
% 0.15/0.39  % (21047)Instructions burned: 19 (million)
% 0.15/0.39  % (21047)------------------------------
% 0.15/0.39  % (21047)------------------------------
% 0.15/0.39  % (21050)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.22/0.39  % (21049)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.22/0.39  % (21051)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.22/0.39  % (21052)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.22/0.39  % (21050)First to succeed.
% 0.22/0.39  % (21053)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.22/0.39  % (21054)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.22/0.39  % (21051)Instruction limit reached!
% 0.22/0.39  % (21051)------------------------------
% 0.22/0.39  % (21051)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (21051)Termination reason: Unknown
% 0.22/0.39  % (21051)Termination phase: Saturation
% 0.22/0.39  
% 0.22/0.39  % (21051)Memory used [KB]: 5500
% 0.22/0.39  % (21051)Time elapsed: 0.005 s
% 0.22/0.39  % (21051)Instructions burned: 4 (million)
% 0.22/0.40  % (21051)------------------------------
% 0.22/0.40  % (21051)------------------------------
% 0.22/0.40  % (21050)Refutation found. Thanks to Tanya!
% 0.22/0.40  % SZS status Theorem for theBenchmark
% 0.22/0.40  % SZS output start Proof for theBenchmark
% 0.22/0.40  thf(func_def_1, type, s: $i > $i).
% 0.22/0.40  thf(func_def_2, type, ite: $o > $i > $i > $i).
% 0.22/0.40  thf(func_def_3, type, h: $i > $i).
% 0.22/0.40  thf(func_def_10, type, ph1: !>[X0: $tType]:(X0)).
% 0.22/0.40  thf(f59,plain,(
% 0.22/0.40    $false),
% 0.22/0.40    inference(avatar_sat_refutation,[],[f43,f50,f58])).
% 0.22/0.40  thf(f58,plain,(
% 0.22/0.40    spl0_2),
% 0.22/0.40    inference(avatar_contradiction_clause,[],[f57])).
% 0.22/0.40  thf(f57,plain,(
% 0.22/0.40    $false | spl0_2),
% 0.22/0.40    inference(subsumption_resolution,[],[f55,f11])).
% 0.22/0.40  thf(f11,plain,(
% 0.22/0.40    ( ! [X7 : $i] : (((s @ X7) != X7)) )),
% 0.22/0.40    inference(cnf_transformation,[],[f9])).
% 0.22/0.40  thf(f9,plain,(
% 0.22/0.40    ! [X0,X1,X2 : $o] : (((ite @ X2 @ X0 @ X1) = X0) | ($true != X2)) & ! [X3 : $o,X4,X5] : (($true = X3) | ((ite @ X3 @ X4 @ X5) = X5)) & ! [X6 : $i > $i] : (((s @ zero) != (X6 @ zero)) | (zero != (X6 @ (s @ zero))) | ((s @ zero) != (X6 @ (s @ (s @ zero))))) & ! [X7] : ((s @ X7) != X7) & ! [X8] : ((ite @ ((s @ zero) = X8) @ zero @ (s @ zero)) = (h @ X8))),
% 0.22/0.40    inference(rectify,[],[f8])).
% 0.22/0.40  thf(f8,plain,(
% 0.22/0.40    ! [X2,X3,X4 : $o] : (((ite @ X4 @ X2 @ X3) = X2) | ($true != X4)) & ! [X5 : $o,X6,X7] : (($true = X5) | ((ite @ X5 @ X6 @ X7) = X7)) & ! [X8 : $i > $i] : (((s @ zero) != (X8 @ zero)) | (zero != (X8 @ (s @ zero))) | ((s @ zero) != (X8 @ (s @ (s @ zero))))) & ! [X0] : ((s @ X0) != X0) & ! [X1] : ((h @ X1) = (ite @ ((s @ zero) = X1) @ zero @ (s @ zero)))),
% 0.22/0.40    inference(flattening,[],[f7])).
% 0.22/0.40  thf(f7,plain,(
% 0.22/0.40    ! [X8 : $i > $i] : (((s @ zero) != (X8 @ zero)) | (zero != (X8 @ (s @ zero))) | ((s @ zero) != (X8 @ (s @ (s @ zero))))) & (! [X1] : ((h @ X1) = (ite @ ((s @ zero) = X1) @ zero @ (s @ zero))) & ! [X2,X3,X4 : $o] : (((ite @ X4 @ X2 @ X3) = X2) | ($true != X4)) & ! [X0] : ((s @ X0) != X0) & ! [X5 : $o,X6,X7] : (($true = X5) | ((ite @ X5 @ X6 @ X7) = X7)))),
% 0.22/0.40    inference(ennf_transformation,[],[f6])).
% 0.22/0.40  thf(f6,plain,(
% 0.22/0.40    ~((! [X1] : ((h @ X1) = (ite @ ((s @ zero) = X1) @ zero @ (s @ zero))) & ! [X2,X3,X4 : $o] : (($true = X4) => ((ite @ X4 @ X2 @ X3) = X2)) & ! [X0] : ((s @ X0) != X0) & ! [X5 : $o,X6,X7] : (($true != X5) => ((ite @ X5 @ X6 @ X7) = X7))) => ? [X8 : $i > $i] : (((s @ zero) = (X8 @ zero)) & (zero = (X8 @ (s @ zero))) & ((s @ zero) = (X8 @ (s @ (s @ zero))))))),
% 0.22/0.40    inference(flattening,[],[f5])).
% 0.22/0.40  thf(f5,plain,(
% 0.22/0.40    ~((! [X0] : ((s @ X0) != X0) & ! [X1] : ((h @ X1) = (ite @ ((s @ zero) = X1) @ zero @ (s @ zero))) & ! [X2,X3,X4 : $o] : (($true = X4) => ((ite @ X4 @ X2 @ X3) = X2)) & ! [X5 : $o,X6,X7] : (~($true = X5) => ((ite @ X5 @ X6 @ X7) = X7))) => ? [X8 : $i > $i] : (((s @ zero) = (X8 @ zero)) & (zero = (X8 @ (s @ zero))) & ((s @ zero) = (X8 @ (s @ (s @ zero))))))),
% 0.22/0.40    inference(fool_elimination,[],[f4])).
% 0.22/0.40  thf(f4,plain,(
% 0.22/0.40    ~((! [X0] : ((s @ X0) != X0) & ! [X1] : ((h @ X1) = (ite @ ((s @ zero) = X1) @ zero @ (s @ zero))) & ! [X2,X3,X4 : $o] : (X4 => ((ite @ X4 @ X2 @ X3) = X2)) & ! [X5 : $o,X6,X7] : (~X5 => ((ite @ X5 @ X6 @ X7) = X7))) => ? [X8 : $i > $i] : (((s @ zero) = (X8 @ (s @ (s @ zero)))) & ((s @ zero) = (X8 @ zero)) & (zero = (X8 @ (s @ zero)))))),
% 0.22/0.40    inference(rectify,[],[f2])).
% 0.22/0.40  thf(f2,negated_conjecture,(
% 0.22/0.40    ~((! [X3] : ((s @ X3) != X3) & ! [X3] : ((h @ X3) = (ite @ ((s @ zero) = X3) @ zero @ (s @ zero))) & ! [X1,X2,X0 : $o] : (X0 => ((ite @ X0 @ X1 @ X2) = X1)) & ! [X0 : $o,X1,X2] : (~X0 => ((ite @ X0 @ X1 @ X2) = X2))) => ? [X4 : $i > $i] : (((s @ zero) = (X4 @ (s @ (s @ zero)))) & ((s @ zero) = (X4 @ zero)) & (zero = (X4 @ (s @ zero)))))),
% 0.22/0.40    inference(negated_conjecture,[],[f1])).
% 0.22/0.40  thf(f1,conjecture,(
% 0.22/0.40    (! [X3] : ((s @ X3) != X3) & ! [X3] : ((h @ X3) = (ite @ ((s @ zero) = X3) @ zero @ (s @ zero))) & ! [X1,X2,X0 : $o] : (X0 => ((ite @ X0 @ X1 @ X2) = X1)) & ! [X0 : $o,X1,X2] : (~X0 => ((ite @ X0 @ X1 @ X2) = X2))) => ? [X4 : $i > $i] : (((s @ zero) = (X4 @ (s @ (s @ zero)))) & ((s @ zero) = (X4 @ zero)) & (zero = (X4 @ (s @ zero))))),
% 0.22/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n10)).
% 0.22/0.40  thf(f55,plain,(
% 0.22/0.40    (zero = (s @ zero)) | spl0_2),
% 0.22/0.40    inference(trivial_inequality_removal,[],[f53])).
% 0.22/0.40  thf(f53,plain,(
% 0.22/0.40    ((s @ zero) != (s @ zero)) | (zero = (s @ zero)) | spl0_2),
% 0.22/0.40    inference(superposition,[],[f42,f26])).
% 0.22/0.40  thf(f26,plain,(
% 0.22/0.40    ( ! [X0 : $i] : (((s @ zero) = (h @ X0)) | ((s @ zero) = X0)) )),
% 0.22/0.40    inference(equality_proxy_clausification,[],[f24])).
% 0.22/0.40  thf(f24,plain,(
% 0.22/0.40    ( ! [X0 : $i] : (((s @ zero) = (h @ X0)) | ($true = ((s @ zero) = X0))) )),
% 0.22/0.40    inference(superposition,[],[f13,f10])).
% 0.22/0.40  thf(f10,plain,(
% 0.22/0.40    ( ! [X8 : $i] : (((ite @ ((s @ zero) = X8) @ zero @ (s @ zero)) = (h @ X8))) )),
% 0.22/0.40    inference(cnf_transformation,[],[f9])).
% 0.22/0.40  thf(f13,plain,(
% 0.22/0.40    ( ! [X3 : $o,X4 : $i,X5 : $i] : (((ite @ X3 @ X4 @ X5) = X5) | ($true = X3)) )),
% 0.22/0.40    inference(cnf_transformation,[],[f9])).
% 0.22/0.40  thf(f42,plain,(
% 0.22/0.40    ((s @ zero) != (h @ zero)) | spl0_2),
% 0.22/0.40    inference(avatar_component_clause,[],[f40])).
% 0.22/0.40  thf(f40,plain,(
% 0.22/0.40    spl0_2 <=> ((s @ zero) = (h @ zero))),
% 0.22/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.22/0.40  thf(f50,plain,(
% 0.22/0.40    spl0_1),
% 0.22/0.40    inference(avatar_contradiction_clause,[],[f49])).
% 0.22/0.40  thf(f49,plain,(
% 0.22/0.40    $false | spl0_1),
% 0.22/0.40    inference(trivial_inequality_removal,[],[f48])).
% 0.22/0.40  thf(f48,plain,(
% 0.22/0.40    (zero != zero) | ((s @ zero) != (s @ zero)) | spl0_1),
% 0.22/0.40    inference(superposition,[],[f38,f28])).
% 0.22/0.40  thf(f28,plain,(
% 0.22/0.40    ( ! [X8 : $i] : ((zero = (h @ X8)) | ((s @ zero) != X8)) )),
% 0.22/0.40    inference(forward_demodulation,[],[f27,f15])).
% 0.22/0.40  thf(f15,plain,(
% 0.22/0.40    ( ! [X0 : $i,X1 : $i] : (((ite @ $true @ X0 @ X1) = X0)) )),
% 0.22/0.40    inference(equality_resolution,[],[f14])).
% 0.22/0.40  thf(f14,plain,(
% 0.22/0.40    ( ! [X2 : $o,X0 : $i,X1 : $i] : (((ite @ X2 @ X0 @ X1) = X0) | ($true != X2)) )),
% 0.22/0.40    inference(cnf_transformation,[],[f9])).
% 0.22/0.40  thf(f27,plain,(
% 0.22/0.40    ( ! [X8 : $i] : (((s @ zero) != X8) | ((h @ X8) = (ite @ $true @ zero @ (s @ zero)))) )),
% 0.22/0.40    inference(equality_proxy_clausification,[],[f22])).
% 0.22/0.40  thf(f22,plain,(
% 0.22/0.40    ( ! [X8 : $i] : ((((s @ zero) = X8) = $false) | ((h @ X8) = (ite @ $true @ zero @ (s @ zero)))) )),
% 0.22/0.40    inference(fool_paramodulation,[],[f10])).
% 0.22/0.40  thf(f38,plain,(
% 0.22/0.40    (zero != (h @ (s @ zero))) | spl0_1),
% 0.22/0.40    inference(avatar_component_clause,[],[f36])).
% 0.22/0.40  thf(f36,plain,(
% 0.22/0.40    spl0_1 <=> (zero = (h @ (s @ zero)))),
% 0.22/0.40    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.22/0.40  thf(f43,plain,(
% 0.22/0.40    ~spl0_1 | ~spl0_2),
% 0.22/0.40    inference(avatar_split_clause,[],[f34,f40,f36])).
% 0.22/0.40  thf(f34,plain,(
% 0.22/0.40    ((s @ zero) != (h @ zero)) | (zero != (h @ (s @ zero)))),
% 0.22/0.40    inference(subsumption_resolution,[],[f33,f11])).
% 0.22/0.40  thf(f33,plain,(
% 0.22/0.40    ((s @ zero) != (h @ zero)) | ((s @ zero) = (s @ (s @ zero))) | (zero != (h @ (s @ zero)))),
% 0.22/0.40    inference(trivial_inequality_removal,[],[f32])).
% 0.22/0.40  thf(f32,plain,(
% 0.22/0.40    ((s @ zero) != (h @ zero)) | ((s @ zero) != (s @ zero)) | (zero != (h @ (s @ zero))) | ((s @ zero) = (s @ (s @ zero)))),
% 0.22/0.40    inference(superposition,[],[f12,f26])).
% 0.22/0.40  thf(f12,plain,(
% 0.22/0.40    ( ! [X6 : $i > $i] : (((s @ zero) != (X6 @ (s @ (s @ zero)))) | ((s @ zero) != (X6 @ zero)) | (zero != (X6 @ (s @ zero)))) )),
% 0.22/0.40    inference(cnf_transformation,[],[f9])).
% 0.22/0.40  % SZS output end Proof for theBenchmark
% 0.22/0.40  % (21050)------------------------------
% 0.22/0.40  % (21050)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40  % (21050)Termination reason: Refutation
% 0.22/0.40  
% 0.22/0.40  % (21050)Memory used [KB]: 5500
% 0.22/0.40  % (21050)Time elapsed: 0.008 s
% 0.22/0.40  % (21050)Instructions burned: 6 (million)
% 0.22/0.40  % (21050)------------------------------
% 0.22/0.40  % (21050)------------------------------
% 0.22/0.40  % (21040)Success in time 0.022 s
% 0.22/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------