%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU541^2 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n014.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 : Wed Feb 25 09:35:10 AM UTC 2026
% Result : Theorem 1.64s 1.30s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 102 ( 11 ~; 2 |; 6 &; 64 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 6 con; 0-2 aty)
% ( 3 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 20 ( 9 ^; 9 !; 2 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
prop2set: $o > $i ).
thf(func_def_5,type,
set2prop: $i > $o ).
thf(func_def_15,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f26]) ).
thf(f26,plain,
( ( $true = $false )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f22,f25]) ).
thf(f25,plain,
! [X1: $o] :
( ( ( in @ emptyset @ ( prop2set @ X1 ) )
= $true )
| ( $false = X1 ) ),
inference(binary_proxy_clausification,[status(thm)],[f24]) ).
thf(f24,plain,
! [X1: $o] :
( ( X1
=> ( in @ emptyset @ ( prop2set @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f23]) ).
thf(f23,plain,
! [X1: $o] :
( $true
= ( ^ [Y0: $o] :
( Y0
=> ( in @ emptyset @ ( prop2set @ Y0 ) ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
( $true
= ( !! @ $o
@ ^ [Y0: $o] :
( Y0
=> ( in @ emptyset @ ( prop2set @ Y0 ) ) ) ) ),
inference(definition_unfolding,[status(thm)],[f19,f18]) ).
thf(f18,plain,
prop2setI = $true,
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( prop2setI = $true )
& ( $true = sK0 )
& ( $true
!= ( set2prop @ ( prop2set @ sK0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $o] :
( ( $true = X0 )
& ( ( set2prop @ ( prop2set @ X0 ) )
!= $true ) )
=> ( ( $true = sK0 )
& ( $true
!= ( set2prop @ ( prop2set @ sK0 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
( ( prop2setI = $true )
& ? [X0: $o] :
( ( $true = X0 )
& ( ( set2prop @ ( prop2set @ X0 ) )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( ( prop2setI = $true )
=> ! [X0: $o] :
( ( $true = X0 )
=> ( ( set2prop @ ( prop2set @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
~ ( prop2setI
=> ! [X0: $o] :
( X0
=> ( set2prop @ ( prop2set @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ( prop2setI
=> ! [X0: $o] :
( X0
=> ( set2prop @ ( prop2set @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
( prop2setI
=> ! [X0: $o] :
( X0
=> ( set2prop @ ( prop2set @ X0 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',prop2set2propI) ).
thf(f19,plain,
( prop2setI
= ( !! @ $o
@ ^ [Y0: $o] :
( Y0
=> ( in @ emptyset @ ( prop2set @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( prop2setI
= ( !! @ $o
@ ^ [Y0: $o] :
( Y0
=> ( in @ emptyset @ ( prop2set @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
! [X0: $o] :
( ( X0
=> ( in @ emptyset @ ( prop2set @ X0 ) ) )
= prop2setI ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
! [X0: $o] :
( ( X0
=> ( in @ emptyset @ ( prop2set @ X0 ) ) )
= prop2setI ),
file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',prop2setI) ).
thf(f22,plain,
( ( in @ emptyset @ ( prop2set @ $true ) )
!= $true ),
inference(beta_eta_normalization,[status(thm)],[f20]) ).
thf(f20,plain,
( $true
!= ( ^ [Y0: $i] : ( in @ emptyset @ Y0 )
@ ( prop2set @ $true ) ) ),
inference(definition_unfolding,[status(thm)],[f16,f15,f17]) ).
thf(f17,plain,
$true = sK0,
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f15,plain,
( set2prop
= ( ^ [Y0: $i] : ( in @ emptyset @ Y0 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( set2prop
= ( ^ [Y0: $i] : ( in @ emptyset @ Y0 ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [X0: $i] : ( in @ emptyset @ X0 ) )
= set2prop ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( ( ^ [X1: $i] : ( in @ emptyset @ X1 ) )
= set2prop ),
file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',set2prop) ).
thf(f16,plain,
( $true
!= ( set2prop @ ( prop2set @ sK0 ) ) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU541^2 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n014.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % 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 : Tue Feb 24 12:26:27 EST 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.31/0.46 ---- Original DTF file ---
% 0.31/0.46 thf(spec,logic,$$dhol).
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 % File : SEU541^2 : TPTP v9.2.1. Released v3.7.0.
% 0.31/0.46 % Domain : Set Theory
% 0.31/0.46 % Problem : Preliminary Notions - Dependent Connective Laws
% 0.31/0.46 % Version : Especial > Reduced > Especial.
% 0.31/0.46 % English : (! phi:o.phi -> set2prop (prop2set phi))
% 0.31/0.46
% 0.31/0.46 % Refs : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.31/0.46 % Source : [Bro08]
% 0.31/0.46 % Names : ZFC043l [Bro08]
% 0.31/0.46
% 0.31/0.46 % Status : Theorem
% 0.31/0.46 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v3.7.0
% 0.31/0.46 % Syntax : Number of formulae : 8 ( 2 unt; 5 typ; 2 def)
% 0.31/0.46 % Number of atoms : 8 ( 2 equ; 0 cnn)
% 0.31/0.46 % Maximal formula atoms : 2 ( 2 avg)
% 0.31/0.46 % Number of connectives : 10 ( 0 ~; 0 |; 0 &; 7 @)
% 0.31/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.31/0.46 % Maximal formula depth : 6 ( 3 avg)
% 0.31/0.46 % Number of types : 2 ( 0 usr)
% 0.31/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.31/0.46 % Number of symbols : 6 ( 5 usr; 2 con; 0-2 aty)
% 0.31/0.46 % Number of variables : 3 ( 1 ^; 2 !; 0 ?; 3 :)
% 0.31/0.46 % SPC : TH0_THM_EQU_NAR
% 0.31/0.46
% 0.31/0.46 % Comments : http://mathgate.info/detsetitem.php?id=456
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 thf(in_type,type,
% 0.31/0.46 in: $i > $i > $o ).
% 0.31/0.46
% 0.31/0.46 thf(emptyset_type,type,
% 0.31/0.46 emptyset: $i ).
% 0.31/0.46
% 0.31/0.46 thf(prop2set_type,type,
% 0.31/0.46 prop2set: $o > $i ).
% 0.31/0.46
% 0.31/0.46 thf(prop2setI_type,type,
% 0.31/0.46 prop2setI: $o ).
% 0.31/0.46
% 0.31/0.46 thf(prop2setI,definition,
% 0.31/0.46 ( prop2setI
% 0.31/0.46 = ( ! [Xphi: $o] :
% 0.31/0.46 ( Xphi
% 0.31/0.46 => ( in @ emptyset @ ( prop2set @ Xphi ) ) ) ) ) ).
% 0.31/0.46
% 0.31/0.46 thf(set2prop_type,type,
% 0.31/0.46 set2prop: $i > $o ).
% 0.31/0.46
% 0.31/0.46 thf(set2prop,definition,
% 0.31/0.46 ( set2prop
% 0.31/0.46 = ( ^ [A: $i] : ( in @ emptyset @ A ) ) ) ).
% 0.31/0.46
% 0.31/0.46 thf(prop2set2propI,conjecture,
% 0.31/0.46 ( prop2setI
% 0.31/0.46 => ! [Xphi: $o] :
% 0.31/0.46 ( Xphi
% 0.31/0.46 => ( set2prop @ ( prop2set @ Xphi ) ) ) ) ).
% 0.31/0.46
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 ------------------------
% 1.46/1.27 ---- Embedded in THF ---
% 1.46/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.28 %%% Generated on Tue Feb 24 12:26:28 EST 2026
% 1.46/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.28 %%% Logic specification used:
% 1.46/1.28 %%% thf(spec, logic, $$dhol).
% 1.46/1.28
% 1.46/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2DTF16493.p
% See solution above
% 1.46/1.28 ------------------------
% 1.46/1.29 ---- Cleaned THF ---
% 1.46/1.29 thf(in_type,type,
% 1.46/1.29 in: $i > $i > $o ).
% 1.46/1.29
% 1.46/1.29 thf(emptyset_type,type,
% 1.46/1.29 emptyset: $i ).
% 1.46/1.29
% 1.46/1.29 thf(prop2set_type,type,
% 1.46/1.29 prop2set: $o > $i ).
% 1.46/1.29
% 1.46/1.29 thf(prop2setI_type,type,
% 1.46/1.29 prop2setI: $o ).
% 1.46/1.29
% 1.46/1.29 thf(prop2setI,definition,
% 1.46/1.29 ( prop2setI
% 1.46/1.29 = ( ! [Xphi: $o] :
% 1.46/1.29 ( Xphi
% 1.46/1.29 => ( in @ emptyset @ ( prop2set @ Xphi ) ) ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(set2prop_type,type,
% 1.46/1.29 set2prop: $i > $o ).
% 1.46/1.29
% 1.46/1.29 thf(set2prop,definition,
% 1.46/1.29 ( set2prop
% 1.46/1.29 = ( ^ [A: $i] : ( in @ emptyset @ A ) ) ) ).
% 1.46/1.29
% 1.46/1.29 thf(prop2set2propI,conjecture,
% 1.46/1.29 ( prop2setI
% 1.46/1.29 => ! [Xphi: $o] :
% 1.46/1.29 ( Xphi
% 1.46/1.29 => ( set2prop @ ( prop2set @ Xphi ) ) ) ) ).
% 1.46/1.29 ------------------------
% 1.64/1.30 % (16729)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_16493 for (2999ds/2Mi)
% 1.64/1.30 % (16729)Instruction limit reached!
% 1.64/1.30 % (16729)------------------------------
% 1.64/1.30 % (16729)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (16729)Termination reason: Unknown
% 1.64/1.30 % (16729)Termination phase: Saturation
% 1.64/1.30
% 1.64/1.30 % (16729)Memory used [KB]: 5373
% 1.64/1.30 % (16729)Time elapsed: 0.002 s
% 1.64/1.30 % (16729)Instructions burned: 2 (million)
% 1.64/1.30 % (16729)------------------------------
% 1.64/1.30 % (16729)------------------------------
% 1.64/1.30 % (16726)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16493 for (2999ds/183Mi)
% 1.64/1.30 % (16728)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 DTF2THF_16493 for (2999ds/27Mi)
% 1.64/1.30 % (16726)First to succeed.
% 1.64/1.30 % (16728)Also succeeded, but the first one will report.
% 1.64/1.30 % (16726)Refutation found. Thanks to Tanya!
% 1.64/1.30 % SZS status Theorem for DTF2THF_16493
% 1.64/1.30 % SZS output start Proof for DTF2THF_16493
% 1.64/1.30 thf(func_def_0, type, in: $i > $i > $o).
% 1.64/1.30 thf(func_def_2, type, prop2set: $o > $i).
% 1.64/1.30 thf(func_def_5, type, set2prop: $i > $o).
% 1.64/1.30 thf(func_def_15, type, ph2: !>[X0: $tType]:(X0)).
% 1.64/1.30 thf(f27,plain,(
% 1.64/1.30 $false),
% 1.64/1.30 inference(trivial_inequality_removal,[status(thm)],[f26])).
% 1.64/1.30 thf(f26,plain,(
% 1.64/1.30 ($true = $false) | ($true != $true)),
% 1.64/1.30 inference(superposition,[status(thm)],[f22,f25])).
% 1.64/1.30 thf(f25,plain,(
% 1.64/1.30 ( ! [X1 : $o] : (((in @ emptyset @ (prop2set @ X1)) = $true) | ($false = X1)) )),
% 1.64/1.30 inference(binary_proxy_clausification,[status(thm)],[f24])).
% 1.64/1.30 thf(f24,plain,(
% 1.64/1.30 ( ! [X1 : $o] : (((X1 => (in @ emptyset @ (prop2set @ X1))) = $true)) )),
% 1.64/1.30 inference(beta_eta_normalization,[status(thm)],[f23])).
% 1.64/1.30 thf(f23,plain,(
% 1.64/1.30 ( ! [X1 : $o] : (($true = ((^[Y0 : $o]: (Y0 => (in @ emptyset @ (prop2set @ Y0)))) @ X1))) )),
% 1.64/1.30 inference(pi_clausification,[status(thm)],[f21])).
% 1.64/1.30 thf(f21,plain,(
% 1.64/1.30 ($true = (!! @ $o @ (^[Y0 : $o]: (Y0 => (in @ emptyset @ (prop2set @ Y0))))))),
% 1.64/1.30 inference(definition_unfolding,[status(thm)],[f19,f18])).
% 1.64/1.30 thf(f18,plain,(
% 1.64/1.30 (prop2setI = $true)),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f14])).
% 1.64/1.30 thf(f14,plain,(
% 1.64/1.30 (prop2setI = $true) & (($true = sK0) & ($true != (set2prop @ (prop2set @ sK0))))),
% 1.64/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13])).
% 1.64/1.30 thf(f13,plain,(
% 1.64/1.30 ? [X0 : $o] : (($true = X0) & ((set2prop @ (prop2set @ X0)) != $true)) => (($true = sK0) & ($true != (set2prop @ (prop2set @ sK0))))),
% 1.64/1.30 introduced(definition,[],[choice_axiom])).
% 1.64/1.30 thf(f12,plain,(
% 1.64/1.30 (prop2setI = $true) & ? [X0 : $o] : (($true = X0) & ((set2prop @ (prop2set @ X0)) != $true))),
% 1.64/1.30 inference(ennf_transformation,[status(thm)],[f9])).
% 1.64/1.30 thf(f9,plain,(
% 1.64/1.30 ~((prop2setI = $true) => ! [X0 : $o] : (($true = X0) => ((set2prop @ (prop2set @ X0)) = $true)))),
% 1.64/1.30 inference(fool_elimination,[status(thm)],[f8])).
% 1.64/1.30 thf(f8,plain,(
% 1.64/1.30 ~(prop2setI => ! [X0 : $o] : (X0 => (set2prop @ (prop2set @ X0))))),
% 1.64/1.30 inference(rectify,[status(thm)],[f4])).
% 1.64/1.30 thf(f4,negated_conjecture,(
% 1.64/1.30 ~(prop2setI => ! [X0 : $o] : (X0 => (set2prop @ (prop2set @ X0))))),
% 1.64/1.30 inference(negated_conjecture,[status(cth)],[f3])).
% 1.64/1.30 thf(f3,conjecture,(
% 1.64/1.30 prop2setI => ! [X0 : $o] : (X0 => (set2prop @ (prop2set @ X0)))),
% 1.64/1.30 file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',prop2set2propI)).
% 1.64/1.30 thf(f19,plain,(
% 1.64/1.30 (prop2setI = (!! @ $o @ (^[Y0 : $o]: (Y0 => (in @ emptyset @ (prop2set @ Y0))))))),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f7])).
% 1.64/1.30 thf(f7,plain,(
% 1.64/1.30 (prop2setI = (!! @ $o @ (^[Y0 : $o]: (Y0 => (in @ emptyset @ (prop2set @ Y0))))))),
% 1.64/1.30 inference(fool_elimination,[status(thm)],[f6])).
% 1.64/1.30 thf(f6,plain,(
% 1.64/1.30 (! [X0 : $o] : (X0 => (in @ emptyset @ (prop2set @ X0))) = prop2setI)),
% 1.64/1.30 inference(rectify,[status(thm)],[f1])).
% 1.64/1.30 thf(f1,axiom,(
% 1.64/1.30 (! [X0 : $o] : (X0 => (in @ emptyset @ (prop2set @ X0))) = prop2setI)),
% 1.64/1.30 file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',prop2setI)).
% 1.64/1.30 thf(f22,plain,(
% 1.64/1.30 ((in @ emptyset @ (prop2set @ $true)) != $true)),
% 1.64/1.30 inference(beta_eta_normalization,[status(thm)],[f20])).
% 1.64/1.30 thf(f20,plain,(
% 1.64/1.30 ($true != ((^[Y0 : $i]: (in @ emptyset @ Y0)) @ (prop2set @ $true)))),
% 1.64/1.30 inference(definition_unfolding,[status(thm)],[f16,f15,f17])).
% 1.64/1.30 thf(f17,plain,(
% 1.64/1.30 ($true = sK0)),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f14])).
% 1.64/1.30 thf(f15,plain,(
% 1.64/1.30 (set2prop = (^[Y0 : $i]: (in @ emptyset @ Y0)))),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f11])).
% 1.64/1.30 thf(f11,plain,(
% 1.64/1.30 (set2prop = (^[Y0 : $i]: (in @ emptyset @ Y0)))),
% 1.64/1.30 inference(fool_elimination,[status(thm)],[f10])).
% 1.64/1.30 thf(f10,plain,(
% 1.64/1.30 ((^[X0 : $i] : (in @ emptyset @ X0)) = set2prop)),
% 1.64/1.30 inference(rectify,[status(thm)],[f2])).
% 1.64/1.30 thf(f2,axiom,(
% 1.64/1.30 ((^[X1 : $i] : (in @ emptyset @ X1)) = set2prop)),
% 1.64/1.30 file('/export/starexec/sandbox2/tmp/tmp.CkM1UcKGC8/DTF2THF_16493.p',set2prop)).
% 1.64/1.30 thf(f16,plain,(
% 1.64/1.30 ($true != (set2prop @ (prop2set @ sK0)))),
% 1.64/1.30 inference(cnf_transformation,[status(thm)],[f14])).
% 1.64/1.30 % SZS output end Proof for DTF2THF_16493
% 1.64/1.30 % (16726)------------------------------
% 1.64/1.30 % (16726)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (16726)Termination reason: Refutation
% 1.64/1.30
% 1.64/1.30 % (16726)Memory used [KB]: 5500
% 1.64/1.30 % (16726)Time elapsed: 0.002 s
% 1.64/1.30 % (16726)Instructions burned: 2 (million)
% 1.64/1.30 % (16726)------------------------------
% 1.64/1.30 % (16726)------------------------------
% 1.64/1.30 % (16725)Success in time 0.012 s
%------------------------------------------------------------------------------