%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU927^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:37:46 AM UTC 2026
% Result : Theorem 1.49s 1.27s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 93 ( 36 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 142 ( 18 ~; 8 |; 14 &; 93 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 36 ^; 18 !; 6 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: a > a ).
thf(func_def_8,type,
sK1: ( a > a ) > $o ).
thf(func_def_10,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f20,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f18]) ).
thf(f18,plain,
$true != $true,
inference(superposition,[status(thm)],[f11,f17]) ).
thf(f17,plain,
( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( sK0 @ Y0 ) ) )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( sK0 @ Y0 ) ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f12,f15]) ).
thf(f15,plain,
( ( sK1 @ sK0 )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f14]) ).
thf(f14,plain,
( ( sK1
@ ^ [Y0: a] :
( sK0
@ ( ^ [Y1: a] : Y1
@ Y0 ) ) )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( sK1
@ ^ [Y0: a] :
( sK0
@ ( ^ [Y1: a] : Y1
@ Y0 ) ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[status(thm)],[f12,f10]) ).
thf(f10,plain,
( ( sK1
@ ^ [Y0: a] : Y0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( ! [X2: a > a] :
( ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( X2 @ Y0 ) ) )
= $true )
| ( ( sK1 @ X2 )
!= $true ) )
& ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( sK0 @ Y0 ) ) )
!= $true )
& ( ( sK1
@ ^ [Y0: a] : Y0 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a > a,X1: ( a > a ) > $o] :
( ! [X2: a > a] :
( ( $true
= ( X1
@ ^ [Y0: a] : ( X0 @ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1
@ ^ [Y0: a] : ( X0 @ ( X0 @ Y0 ) ) )
!= $true )
& ( ( X1
@ ^ [Y0: a] : Y0 )
= $true ) )
=> ( ! [X2: a > a] :
( ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( X2 @ Y0 ) ) )
= $true )
| ( ( sK1 @ X2 )
!= $true ) )
& ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( sK0 @ Y0 ) ) )
!= $true )
& ( ( sK1
@ ^ [Y0: a] : Y0 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
? [X0: a > a,X1: ( a > a ) > $o] :
( ! [X2: a > a] :
( ( $true
= ( X1
@ ^ [Y0: a] : ( X0 @ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1
@ ^ [Y0: a] : ( X0 @ ( X0 @ Y0 ) ) )
!= $true )
& ( ( X1
@ ^ [Y0: a] : Y0 )
= $true ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > a,X1: ( a > a ) > $o] :
( ( ( X1
@ ^ [Y0: a] : ( X0 @ ( X0 @ Y0 ) ) )
!= $true )
& ! [X2: a > a] :
( ( $true
= ( X1
@ ^ [Y0: a] : ( X0 @ ( X2 @ Y0 ) ) ) )
| ( $true
!= ( X1 @ X2 ) ) )
& ( ( X1
@ ^ [Y0: a] : Y0 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a,X1: ( a > a ) > $o] :
( ( ! [X2: a > a] :
( ( $true
= ( X1 @ X2 ) )
=> ( $true
= ( X1
@ ^ [Y0: a] : ( X0 @ ( X2 @ Y0 ) ) ) ) )
& ( ( X1
@ ^ [Y0: a] : Y0 )
= $true ) )
=> ( ( X1
@ ^ [Y0: a] : ( X0 @ ( X0 @ Y0 ) ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a,X1: ( a > a ) > $o] :
( ( ! [X2: a > a] :
( ( X1 @ X2 )
=> ( X1
@ ^ [X3: a] : ( X0 @ ( X2 @ X3 ) ) ) )
& ( X1
@ ^ [X4: a] : X4 ) )
=> ( X1
@ ^ [X5: a] : ( X0 @ ( X0 @ X5 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a,X1: ( a > a ) > $o] :
( ( ! [X3: a > a] :
( ( X1 @ X3 )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X3 @ X4 ) ) ) )
& ( X1
@ ^ [X2: a] : X2 ) )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X0 @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > a,X1: ( a > a ) > $o] :
( ( ! [X3: a > a] :
( ( X1 @ X3 )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X3 @ X4 ) ) ) )
& ( X1
@ ^ [X2: a] : X2 ) )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X0 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JRfeVVQ9zT/DTF2THF_9354.p',cTHM92_pme) ).
thf(f12,plain,
! [X2: a > a] :
( ( ( sK1 @ X2 )
!= $true )
| ( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( X2 @ Y0 ) ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f11,plain,
( ( sK1
@ ^ [Y0: a] : ( sK0 @ ( sK0 @ Y0 ) ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU927^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n019.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Feb 24 12:37:24 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/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 : SEU927^5 : TPTP v9.2.1. Released v4.0.0.
% 0.31/0.46 % Domain : Set Theory (Functions)
% 0.31/0.46 % Problem : TPS problem THM92
% 0.31/0.46 % Version : Especial.
% 0.31/0.46 % English : Trivial theorem which gives nice simple example of an expansion
% 0.31/0.46 % proof.
% 0.31/0.46
% 0.31/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.31/0.46 % Source : [Bro09]
% 0.31/0.46 % Names : tps_0233 [Bro09]
% 0.31/0.46 % : THM92 [TPS]
% 0.31/0.46
% 0.31/0.46 % Status : Theorem
% 0.31/0.46 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.25 v7.4.0, 0.22 v7.3.0, 0.20 v7.2.0, 0.25 v7.1.0, 0.29 v7.0.0, 0.25 v6.4.0, 0.29 v6.3.0, 0.33 v6.1.0, 0.17 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.31/0.46 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.31/0.46 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.31/0.46 % Maximal formula atoms : 0 ( 0 avg)
% 0.31/0.46 % Number of connectives : 11 ( 0 ~; 0 |; 1 &; 8 @)
% 0.31/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.31/0.46 % Maximal formula depth : 11 ( 11 avg)
% 0.31/0.46 % Number of types : 2 ( 1 usr)
% 0.31/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.31/0.46 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.31/0.46 % Number of variables : 6 ( 3 ^; 3 !; 0 ?; 6 :)
% 0.31/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.31/0.46
% 0.31/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.31/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.31/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.31/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.31/0.46 % : Polymorphic definitions expanded.
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 thf(a_type,type,
% 0.31/0.46 a: $tType ).
% 0.31/0.46
% 0.31/0.46 thf(cTHM92_pme,conjecture,
% 0.31/0.46 ! [Xf: a > a,Xp: ( a > a ) > $o] :
% 0.31/0.46 ( ( ( Xp
% 0.31/0.46 @ ^ [Xu: a] : Xu )
% 0.31/0.46 & ! [Xj: a > a] :
% 0.31/0.46 ( ( Xp @ Xj )
% 0.31/0.46 => ( Xp
% 0.31/0.46 @ ^ [Xx: a] : ( Xf @ ( Xj @ Xx ) ) ) ) )
% 0.31/0.46 => ( Xp
% 0.31/0.46 @ ^ [Xx: a] : ( Xf @ ( Xf @ Xx ) ) ) ) ).
% 0.31/0.46
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 ------------------------
% 1.49/1.24 ---- Embedded in THF ---
% 1.49/1.24 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.24 %%% Generated on Tue Feb 24 12:37:25 EST 2026
% 1.49/1.24 %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.24 %%% Logic specification used:
% 1.49/1.24 %%% thf(spec, logic, $$dhol).
% 1.49/1.24
% 1.49/1.24 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.JRfeVVQ9zT/DTF2DTF9354.p
% See solution above
% 1.49/1.24 ------------------------
% 1.49/1.25 ---- Cleaned THF ---
% 1.49/1.25 thf(a_type,type,
% 1.49/1.25 a: $tType ).
% 1.49/1.25
% 1.49/1.25 thf(cTHM92_pme,conjecture,
% 1.49/1.25 ! [Xf: a > a,Xp: ( a > a ) > $o] :
% 1.49/1.25 ( ( ( Xp
% 1.49/1.25 @ ^ [Xu: a] : Xu )
% 1.49/1.25 & ! [Xj: a > a] :
% 1.49/1.25 ( ( Xp @ Xj )
% 1.49/1.25 => ( Xp
% 1.49/1.25 @ ^ [Xx: a] : ( Xf @ ( Xj @ Xx ) ) ) ) )
% 1.49/1.25 => ( Xp
% 1.49/1.25 @ ^ [Xx: a] : ( Xf @ ( Xf @ Xx ) ) ) ) ).
% 1.49/1.25 ------------------------
% 1.49/1.26 % (9569)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_9354 for (2999ds/27Mi)
% 1.49/1.26 % (9568)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 DTF2THF_9354 for (2999ds/4Mi)
% 1.49/1.26 % (9569)First to succeed.
% 1.49/1.27 % (9568)Also succeeded, but the first one will report.
% 1.49/1.27 % (9569)Refutation found. Thanks to Tanya!
% 1.49/1.27 % SZS status Theorem for DTF2THF_9354
% 1.49/1.27 % SZS output start Proof for DTF2THF_9354
% 1.49/1.27 thf(type_def_5, type, a: $tType).
% 1.49/1.27 thf(func_def_0, type, a: $tType).
% 1.49/1.27 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.49/1.27 thf(func_def_7, type, sK0: a > a).
% 1.49/1.27 thf(func_def_8, type, sK1: (a > a) > $o).
% 1.49/1.27 thf(func_def_10, type, ph3: !>[X0: $tType]:(X0)).
% 1.49/1.27 thf(f20,plain,(
% 1.49/1.27 $false),
% 1.49/1.27 inference(trivial_inequality_removal,[status(thm)],[f18])).
% 1.49/1.27 thf(f18,plain,(
% 1.49/1.27 ($true != $true)),
% 1.49/1.27 inference(superposition,[status(thm)],[f11,f17])).
% 1.49/1.27 thf(f17,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (sK0 @ (sK0 @ Y0)))) = $true)),
% 1.49/1.27 inference(trivial_inequality_removal,[status(thm)],[f16])).
% 1.49/1.27 thf(f16,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (sK0 @ (sK0 @ Y0)))) = $true) | ($true != $true)),
% 1.49/1.27 inference(superposition,[status(thm)],[f12,f15])).
% 1.49/1.27 thf(f15,plain,(
% 1.49/1.27 ((sK1 @ sK0) = $true)),
% 1.49/1.27 inference(beta_eta_normalization,[status(thm)],[f14])).
% 1.49/1.27 thf(f14,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (sK0 @ ((^[Y1 : a]: (Y1)) @ Y0)))) = $true)),
% 1.49/1.27 inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.49/1.27 thf(f13,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (sK0 @ ((^[Y1 : a]: (Y1)) @ Y0)))) = $true) | ($true != $true)),
% 1.49/1.27 inference(superposition,[status(thm)],[f12,f10])).
% 1.49/1.27 thf(f10,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (Y0))) = $true)),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27 thf(f9,plain,(
% 1.49/1.27 ! [X2 : a > a] : (((sK1 @ (^[Y0 : a]: (sK0 @ (X2 @ Y0)))) = $true) | ((sK1 @ X2) != $true)) & ((sK1 @ (^[Y0 : a]: (sK0 @ (sK0 @ Y0)))) != $true) & ((sK1 @ (^[Y0 : a]: (Y0))) = $true)),
% 1.49/1.27 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8])).
% 1.49/1.27 thf(f8,plain,(
% 1.49/1.27 ? [X0 : a > a,X1 : (a > a) > $o] : (! [X2 : a > a] : (($true = (X1 @ (^[Y0 : a]: (X0 @ (X2 @ Y0))))) | ($true != (X1 @ X2))) & ((X1 @ (^[Y0 : a]: (X0 @ (X0 @ Y0)))) != $true) & ((X1 @ (^[Y0 : a]: (Y0))) = $true)) => (! [X2 : a > a] : (((sK1 @ (^[Y0 : a]: (sK0 @ (X2 @ Y0)))) = $true) | ((sK1 @ X2) != $true)) & ((sK1 @ (^[Y0 : a]: (sK0 @ (sK0 @ Y0)))) != $true) & ((sK1 @ (^[Y0 : a]: (Y0))) = $true))),
% 1.49/1.27 introduced(definition,[],[choice_axiom])).
% 1.49/1.27 thf(f7,plain,(
% 1.49/1.27 ? [X0 : a > a,X1 : (a > a) > $o] : (! [X2 : a > a] : (($true = (X1 @ (^[Y0 : a]: (X0 @ (X2 @ Y0))))) | ($true != (X1 @ X2))) & ((X1 @ (^[Y0 : a]: (X0 @ (X0 @ Y0)))) != $true) & ((X1 @ (^[Y0 : a]: (Y0))) = $true))),
% 1.49/1.27 inference(flattening,[status(thm)],[f6])).
% 1.49/1.27 thf(f6,plain,(
% 1.49/1.27 ? [X0 : a > a,X1 : (a > a) > $o] : (((X1 @ (^[Y0 : a]: (X0 @ (X0 @ Y0)))) != $true) & (! [X2 : a > a] : (($true = (X1 @ (^[Y0 : a]: (X0 @ (X2 @ Y0))))) | ($true != (X1 @ X2))) & ((X1 @ (^[Y0 : a]: (Y0))) = $true)))),
% 1.49/1.27 inference(ennf_transformation,[status(thm)],[f5])).
% 1.49/1.27 thf(f5,plain,(
% 1.49/1.27 ~! [X0 : a > a,X1 : (a > a) > $o] : ((! [X2 : a > a] : (($true = (X1 @ X2)) => ($true = (X1 @ (^[Y0 : a]: (X0 @ (X2 @ Y0)))))) & ((X1 @ (^[Y0 : a]: (Y0))) = $true)) => ((X1 @ (^[Y0 : a]: (X0 @ (X0 @ Y0)))) = $true))),
% 1.49/1.27 inference(fool_elimination,[status(thm)],[f4])).
% 1.49/1.27 thf(f4,plain,(
% 1.49/1.27 ~! [X0 : a > a,X1 : (a > a) > $o] : ((! [X2 : a > a] : ((X1 @ X2) => (X1 @ (^[X3 : a] : (X0 @ (X2 @ X3))))) & (X1 @ (^[X4 : a] : (X4)))) => (X1 @ (^[X5 : a] : (X0 @ (X0 @ X5)))))),
% 1.49/1.27 inference(rectify,[status(thm)],[f2])).
% 1.49/1.27 thf(f2,negated_conjecture,(
% 1.49/1.27 ~! [X0 : a > a,X1 : (a > a) > $o] : ((! [X3 : a > a] : ((X1 @ X3) => (X1 @ (^[X4 : a] : (X0 @ (X3 @ X4))))) & (X1 @ (^[X2 : a] : (X2)))) => (X1 @ (^[X4 : a] : (X0 @ (X0 @ X4)))))),
% 1.49/1.27 inference(negated_conjecture,[status(cth)],[f1])).
% 1.49/1.27 thf(f1,conjecture,(
% 1.49/1.27 ! [X0 : a > a,X1 : (a > a) > $o] : ((! [X3 : a > a] : ((X1 @ X3) => (X1 @ (^[X4 : a] : (X0 @ (X3 @ X4))))) & (X1 @ (^[X2 : a] : (X2)))) => (X1 @ (^[X4 : a] : (X0 @ (X0 @ X4)))))),
% 1.49/1.27 file('/export/starexec/sandbox2/tmp/tmp.JRfeVVQ9zT/DTF2THF_9354.p',cTHM92_pme)).
% 1.49/1.27 thf(f12,plain,(
% 1.49/1.27 ( ! [X2 : a > a] : (((sK1 @ X2) != $true) | ((sK1 @ (^[Y0 : a]: (sK0 @ (X2 @ Y0)))) = $true)) )),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27 thf(f11,plain,(
% 1.49/1.27 ((sK1 @ (^[Y0 : a]: (sK0 @ (sK0 @ Y0)))) != $true)),
% 1.49/1.27 inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27 % SZS output end Proof for DTF2THF_9354
% 1.49/1.27 % (9569)------------------------------
% 1.49/1.27 % (9569)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.27 % (9569)Termination reason: Refutation
% 1.49/1.27
% 1.49/1.27 % (9569)Memory used [KB]: 5500
% 1.49/1.27 % (9569)Time elapsed: 0.003 s
% 1.49/1.27 % (9569)Instructions burned: 1 (million)
% 1.49/1.27 % (9569)------------------------------
% 1.49/1.27 % (9569)------------------------------
% 1.49/1.27 % (9566)Success in time 0.012 s
%------------------------------------------------------------------------------