TSTP Solution File: SEV416^5 by Vampire---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.9
% Problem  : SEV416^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d THM

% Computer : n026.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 : Mon Jun 24 16:03:46 EDT 2024

% Result   : Theorem 0.12s 0.39s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEV416^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12  % Command    : run_vampire %s %d THM
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Fri Jun 21 19:38:24 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.36  This is a TH0_THM_NEQ_NAR problem
% 0.12/0.36  Running higher-order theorem proving
% 0.12/0.36  Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.38  % (6304)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.12/0.38  % (6305)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.38  % (6303)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.12/0.38  % (6302)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.12/0.38  % (6307)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.12/0.38  % (6306)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.12/0.38  % (6308)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.38  % (6305)Instruction limit reached!
% 0.12/0.38  % (6305)------------------------------
% 0.12/0.38  % (6305)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38  % (6305)Termination reason: Unknown
% 0.12/0.38  % (6305)Termination phase: Saturation
% 0.12/0.38  
% 0.12/0.38  % (6305)Memory used [KB]: 5373
% 0.12/0.38  % (6305)Time elapsed: 0.004 s
% 0.12/0.38  % (6305)Instructions burned: 2 (million)
% 0.12/0.38  % (6305)------------------------------
% 0.12/0.38  % (6305)------------------------------
% 0.12/0.38  % (6306)Instruction limit reached!
% 0.12/0.38  % (6306)------------------------------
% 0.12/0.38  % (6306)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38  % (6306)Termination reason: Unknown
% 0.12/0.38  % (6306)Termination phase: Saturation
% 0.12/0.38  
% 0.12/0.38  % (6306)Memory used [KB]: 5373
% 0.12/0.38  % (6306)Time elapsed: 0.004 s
% 0.12/0.38  % (6306)Instructions burned: 2 (million)
% 0.12/0.38  % (6306)------------------------------
% 0.12/0.38  % (6306)------------------------------
% 0.12/0.38  % (6307)First to succeed.
% 0.12/0.38  % (6302)Also succeeded, but the first one will report.
% 0.12/0.39  % (6307)Refutation found. Thanks to Tanya!
% 0.12/0.39  % SZS status Theorem for theBenchmark
% 0.12/0.39  % SZS output start Proof for theBenchmark
% 0.12/0.39  thf(func_def_1, type, cB: $i > $o).
% 0.12/0.39  thf(func_def_2, type, cA: $i > $o).
% 0.12/0.39  thf(f81,plain,(
% 0.12/0.39    $false),
% 0.12/0.39    inference(avatar_sat_refutation,[],[f44,f50,f56,f62,f64,f66,f68,f70,f77,f78,f80])).
% 0.12/0.39  thf(f80,plain,(
% 0.12/0.39    ~spl3_3 | spl3_6),
% 0.12/0.39    inference(avatar_contradiction_clause,[],[f79])).
% 0.12/0.39  thf(f79,plain,(
% 0.12/0.39    $false | (~spl3_3 | spl3_6)),
% 0.12/0.39    inference(subsumption_resolution,[],[f74,f43])).
% 0.12/0.39  thf(f43,plain,(
% 0.12/0.39    ($true = (cA @ sK0)) | ~spl3_3),
% 0.12/0.39    inference(avatar_component_clause,[],[f41])).
% 0.12/0.39  thf(f41,plain,(
% 0.12/0.39    spl3_3 <=> ($true = (cA @ sK0))),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.12/0.39  thf(f74,plain,(
% 0.12/0.39    ($true != (cA @ sK0)) | spl3_6),
% 0.12/0.39    inference(trivial_inequality_removal,[],[f71])).
% 0.12/0.39  thf(f71,plain,(
% 0.12/0.39    ($true != (cA @ sK0)) | ($true != $true) | spl3_6),
% 0.12/0.39    inference(superposition,[],[f61,f14])).
% 0.12/0.39  thf(f14,plain,(
% 0.12/0.39    ( ! [X3 : $i] : (((cB @ X3) = $true) | ((cA @ X3) != $true)) )),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f12,plain,(
% 0.12/0.39    ((cG = $true) | (((cB @ sK0) != $true) & ($true = (cA @ sK0))) | (((cA @ sK1) = $true) & ((cB @ sK1) != $true)) | (cG = $true) | (((cB @ sK2) != $true) & ((cA @ sK2) = $true))) & ! [X3] : (((cB @ X3) = $true) | ((cA @ X3) != $true)) & (cG != $true)),
% 0.12/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9])).
% 0.12/0.39  thf(f9,plain,(
% 0.12/0.39    ? [X0] : (((cB @ X0) != $true) & ((cA @ X0) = $true)) => (((cB @ sK0) != $true) & ($true = (cA @ sK0)))),
% 0.12/0.39    introduced(choice_axiom,[])).
% 0.12/0.39  thf(f10,plain,(
% 0.12/0.39    ? [X1] : (((cA @ X1) = $true) & ((cB @ X1) != $true)) => (((cA @ sK1) = $true) & ((cB @ sK1) != $true))),
% 0.12/0.39    introduced(choice_axiom,[])).
% 0.12/0.39  thf(f11,plain,(
% 0.12/0.39    ? [X2] : (((cB @ X2) != $true) & ((cA @ X2) = $true)) => (((cB @ sK2) != $true) & ((cA @ sK2) = $true))),
% 0.12/0.39    introduced(choice_axiom,[])).
% 0.12/0.39  thf(f8,plain,(
% 0.12/0.39    ((cG = $true) | ? [X0] : (((cB @ X0) != $true) & ((cA @ X0) = $true)) | ? [X1] : (((cA @ X1) = $true) & ((cB @ X1) != $true)) | (cG = $true) | ? [X2] : (((cB @ X2) != $true) & ((cA @ X2) = $true))) & ! [X3] : (((cB @ X3) = $true) | ((cA @ X3) != $true)) & (cG != $true)),
% 0.12/0.39    inference(rectify,[],[f7])).
% 0.12/0.39  thf(f7,plain,(
% 0.12/0.39    ((cG = $true) | ? [X2] : (((cB @ X2) != $true) & ((cA @ X2) = $true)) | ? [X0] : (((cA @ X0) = $true) & ((cB @ X0) != $true)) | (cG = $true) | ? [X1] : (((cB @ X1) != $true) & ((cA @ X1) = $true))) & ! [X3] : (((cB @ X3) = $true) | ((cA @ X3) != $true)) & (cG != $true)),
% 0.12/0.39    inference(flattening,[],[f6])).
% 0.12/0.39  thf(f6,plain,(
% 0.12/0.39    ((cG != $true) & ! [X3] : (((cB @ X3) = $true) | ((cA @ X3) != $true))) & (((cG = $true) | (? [X1] : (((cB @ X1) != $true) & ((cA @ X1) = $true)) | ? [X0] : (((cA @ X0) = $true) & ((cB @ X0) != $true)))) | ((cG = $true) | ? [X2] : (((cB @ X2) != $true) & ((cA @ X2) = $true))))),
% 0.12/0.39    inference(ennf_transformation,[],[f5])).
% 0.12/0.39  thf(f5,plain,(
% 0.12/0.39    ~((((! [X1] : (((cA @ X1) = $true) => ((cB @ X1) = $true)) & ! [X0] : (((cA @ X0) = $true) => ((cB @ X0) = $true))) => (cG = $true)) | (! [X2] : (((cA @ X2) = $true) => ((cB @ X2) = $true)) => (cG = $true))) => (! [X3] : (((cA @ X3) = $true) => ((cB @ X3) = $true)) => (cG = $true)))),
% 0.12/0.39    inference(fool_elimination,[],[f4])).
% 0.12/0.39  thf(f4,plain,(
% 0.12/0.39    ~((((! [X0] : ((cA @ X0) => (cB @ X0)) & ! [X1] : ((cA @ X1) => (cB @ X1))) => cG) | (! [X2] : ((cA @ X2) => (cB @ X2)) => cG)) => (! [X3] : ((cA @ X3) => (cB @ X3)) => cG))),
% 0.12/0.39    inference(rectify,[],[f2])).
% 0.12/0.39  thf(f2,negated_conjecture,(
% 0.12/0.39    ~((((! [X0] : ((cA @ X0) => (cB @ X0)) & ! [X0] : ((cA @ X0) => (cB @ X0))) => cG) | (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)) => (! [X0] : ((cA @ X0) => (cB @ X0)) => cG))),
% 0.12/0.39    inference(negated_conjecture,[],[f1])).
% 0.12/0.39  thf(f1,conjecture,(
% 0.12/0.39    (((! [X0] : ((cA @ X0) => (cB @ X0)) & ! [X0] : ((cA @ X0) => (cB @ X0))) => cG) | (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)) => (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)),
% 0.12/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDUAL_EG3_pme)).
% 0.12/0.39  thf(f61,plain,(
% 0.12/0.39    ((cB @ sK0) != $true) | spl3_6),
% 0.12/0.39    inference(avatar_component_clause,[],[f59])).
% 0.12/0.39  thf(f59,plain,(
% 0.12/0.39    spl3_6 <=> ((cB @ sK0) = $true)),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_6])])).
% 0.12/0.39  thf(f78,plain,(
% 0.12/0.39    ~spl3_4 | spl3_2),
% 0.12/0.39    inference(avatar_split_clause,[],[f75,f37,f47])).
% 0.12/0.39  thf(f47,plain,(
% 0.12/0.39    spl3_4 <=> ((cA @ sK2) = $true)),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.12/0.39  thf(f37,plain,(
% 0.12/0.39    spl3_2 <=> ((cB @ sK2) = $true)),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.12/0.39  thf(f75,plain,(
% 0.12/0.39    ((cA @ sK2) != $true) | spl3_2),
% 0.12/0.39    inference(trivial_inequality_removal,[],[f73])).
% 0.12/0.39  thf(f73,plain,(
% 0.12/0.39    ($true != $true) | ((cA @ sK2) != $true) | spl3_2),
% 0.12/0.39    inference(superposition,[],[f39,f14])).
% 0.12/0.39  thf(f39,plain,(
% 0.12/0.39    ((cB @ sK2) != $true) | spl3_2),
% 0.12/0.39    inference(avatar_component_clause,[],[f37])).
% 0.12/0.39  thf(f77,plain,(
% 0.12/0.39    ~spl3_5 | spl3_1),
% 0.12/0.39    inference(avatar_split_clause,[],[f76,f33,f53])).
% 0.12/0.39  thf(f53,plain,(
% 0.12/0.39    spl3_5 <=> ((cA @ sK1) = $true)),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_5])])).
% 0.12/0.39  thf(f33,plain,(
% 0.12/0.39    spl3_1 <=> ((cB @ sK1) = $true)),
% 0.12/0.39    introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.12/0.39  thf(f76,plain,(
% 0.12/0.39    ((cA @ sK1) != $true) | spl3_1),
% 0.12/0.39    inference(trivial_inequality_removal,[],[f72])).
% 0.12/0.39  thf(f72,plain,(
% 0.12/0.39    ((cA @ sK1) != $true) | ($true != $true) | spl3_1),
% 0.12/0.39    inference(superposition,[],[f35,f14])).
% 0.12/0.39  thf(f35,plain,(
% 0.12/0.39    ((cB @ sK1) != $true) | spl3_1),
% 0.12/0.39    inference(avatar_component_clause,[],[f33])).
% 0.12/0.39  thf(f70,plain,(
% 0.12/0.39    spl3_4 | ~spl3_6 | spl3_5),
% 0.12/0.39    inference(avatar_split_clause,[],[f69,f53,f59,f47])).
% 0.12/0.39  thf(f69,plain,(
% 0.12/0.39    ((cB @ sK0) != $true) | ((cA @ sK1) = $true) | ((cA @ sK2) = $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f23,f13])).
% 0.12/0.39  thf(f13,plain,(
% 0.12/0.39    (cG != $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f23,plain,(
% 0.12/0.39    ((cA @ sK1) = $true) | ((cB @ sK0) != $true) | (cG = $true) | ((cA @ sK2) = $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f21])).
% 0.12/0.39  thf(f21,plain,(
% 0.12/0.39    (cG = $true) | (cG = $true) | ((cB @ sK0) != $true) | ((cA @ sK2) = $true) | ((cA @ sK1) = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f68,plain,(
% 0.12/0.39    ~spl3_2 | ~spl3_1 | ~spl3_6),
% 0.12/0.39    inference(avatar_split_clause,[],[f67,f59,f33,f37])).
% 0.12/0.39  thf(f67,plain,(
% 0.12/0.39    ((cB @ sK1) != $true) | ((cB @ sK2) != $true) | ((cB @ sK0) != $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f24,f13])).
% 0.12/0.39  thf(f24,plain,(
% 0.12/0.39    (cG = $true) | ((cB @ sK2) != $true) | ((cB @ sK1) != $true) | ((cB @ sK0) != $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f20])).
% 0.12/0.39  thf(f20,plain,(
% 0.12/0.39    ((cB @ sK2) != $true) | (cG = $true) | ((cB @ sK1) != $true) | ((cB @ sK0) != $true) | (cG = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f66,plain,(
% 0.12/0.39    spl3_3 | spl3_5 | spl3_4),
% 0.12/0.39    inference(avatar_split_clause,[],[f65,f47,f53,f41])).
% 0.12/0.39  thf(f65,plain,(
% 0.12/0.39    ($true = (cA @ sK0)) | ((cA @ sK1) = $true) | ((cA @ sK2) = $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f25,f13])).
% 0.12/0.39  thf(f25,plain,(
% 0.12/0.39    ((cA @ sK2) = $true) | ($true = (cA @ sK0)) | ((cA @ sK1) = $true) | (cG = $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f17])).
% 0.12/0.39  thf(f17,plain,(
% 0.12/0.39    ((cA @ sK1) = $true) | ($true = (cA @ sK0)) | (cG = $true) | ((cA @ sK2) = $true) | (cG = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f64,plain,(
% 0.12/0.39    ~spl3_6 | spl3_4 | ~spl3_1),
% 0.12/0.39    inference(avatar_split_clause,[],[f63,f33,f47,f59])).
% 0.12/0.39  thf(f63,plain,(
% 0.12/0.39    ((cA @ sK2) = $true) | ((cB @ sK1) != $true) | ((cB @ sK0) != $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f26,f13])).
% 0.12/0.39  thf(f26,plain,(
% 0.12/0.39    ((cB @ sK1) != $true) | ((cB @ sK0) != $true) | ((cA @ sK2) = $true) | (cG = $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f19])).
% 0.12/0.39  thf(f19,plain,(
% 0.12/0.39    (cG = $true) | ((cA @ sK2) = $true) | ((cB @ sK1) != $true) | (cG = $true) | ((cB @ sK0) != $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f62,plain,(
% 0.12/0.39    ~spl3_6 | spl3_5 | ~spl3_2),
% 0.12/0.39    inference(avatar_split_clause,[],[f57,f37,f53,f59])).
% 0.12/0.39  thf(f57,plain,(
% 0.12/0.39    ((cB @ sK0) != $true) | ((cB @ sK2) != $true) | ((cA @ sK1) = $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f27,f13])).
% 0.12/0.39  thf(f27,plain,(
% 0.12/0.39    (cG = $true) | ((cB @ sK2) != $true) | ((cB @ sK0) != $true) | ((cA @ sK1) = $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f22])).
% 0.12/0.39  thf(f22,plain,(
% 0.12/0.39    (cG = $true) | ((cB @ sK2) != $true) | ((cA @ sK1) = $true) | ((cB @ sK0) != $true) | (cG = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f56,plain,(
% 0.12/0.39    ~spl3_2 | spl3_5 | spl3_3),
% 0.12/0.39    inference(avatar_split_clause,[],[f51,f41,f53,f37])).
% 0.12/0.39  thf(f51,plain,(
% 0.12/0.39    ($true = (cA @ sK0)) | ((cA @ sK1) = $true) | ((cB @ sK2) != $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f28,f13])).
% 0.12/0.39  thf(f28,plain,(
% 0.12/0.39    (cG = $true) | ((cB @ sK2) != $true) | ((cA @ sK1) = $true) | ($true = (cA @ sK0))),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f18])).
% 0.12/0.39  thf(f18,plain,(
% 0.12/0.39    ((cB @ sK2) != $true) | (cG = $true) | (cG = $true) | ($true = (cA @ sK0)) | ((cA @ sK1) = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f50,plain,(
% 0.12/0.39    ~spl3_1 | spl3_4 | spl3_3),
% 0.12/0.39    inference(avatar_split_clause,[],[f45,f41,f47,f33])).
% 0.12/0.39  thf(f45,plain,(
% 0.12/0.39    ((cB @ sK1) != $true) | ($true = (cA @ sK0)) | ((cA @ sK2) = $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f29,f13])).
% 0.12/0.39  thf(f29,plain,(
% 0.12/0.39    ($true = (cA @ sK0)) | ((cA @ sK2) = $true) | (cG = $true) | ((cB @ sK1) != $true)),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f15])).
% 0.12/0.39  thf(f15,plain,(
% 0.12/0.39    (cG = $true) | ((cA @ sK2) = $true) | ($true = (cA @ sK0)) | ((cB @ sK1) != $true) | (cG = $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  thf(f44,plain,(
% 0.12/0.39    ~spl3_1 | ~spl3_2 | spl3_3),
% 0.12/0.39    inference(avatar_split_clause,[],[f31,f41,f37,f33])).
% 0.12/0.39  thf(f31,plain,(
% 0.12/0.39    ((cB @ sK1) != $true) | ($true = (cA @ sK0)) | ((cB @ sK2) != $true)),
% 0.12/0.39    inference(subsumption_resolution,[],[f30,f13])).
% 0.12/0.39  thf(f30,plain,(
% 0.12/0.39    ((cB @ sK2) != $true) | (cG = $true) | ((cB @ sK1) != $true) | ($true = (cA @ sK0))),
% 0.12/0.39    inference(duplicate_literal_removal,[],[f16])).
% 0.12/0.39  thf(f16,plain,(
% 0.12/0.39    (cG = $true) | ((cB @ sK1) != $true) | ($true = (cA @ sK0)) | (cG = $true) | ((cB @ sK2) != $true)),
% 0.12/0.39    inference(cnf_transformation,[],[f12])).
% 0.12/0.39  % SZS output end Proof for theBenchmark
% 0.12/0.39  % (6307)------------------------------
% 0.12/0.39  % (6307)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.39  % (6307)Termination reason: Refutation
% 0.12/0.39  
% 0.12/0.39  % (6307)Memory used [KB]: 5500
% 0.12/0.39  % (6307)Time elapsed: 0.007 s
% 0.12/0.39  % (6307)Instructions burned: 3 (million)
% 0.12/0.39  % (6307)------------------------------
% 0.12/0.39  % (6307)------------------------------
% 0.12/0.39  % (6300)Success in time 0.021 s
%------------------------------------------------------------------------------