%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO011^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n015.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:53:08 AM UTC 2026
% Result : Theorem 1.47s 1.29s
% Output : Refutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 29 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 111 ( 12 ~; 2 |; 8 &; 73 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 5 usr; 4 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 43 ( 25 ^; 18 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
leibeq: $i > $i > $o ).
thf(func_def_2,type,
p: ( $i > $i ) > $o ).
thf(func_def_3,type,
f: $i > $i ).
thf(func_def_14,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f53,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f51]) ).
thf(f51,plain,
sK2 != sK2,
inference(superposition,[status(thm)],[f23,f24]) ).
thf(f24,plain,
! [X0: $i] :
( ( f @ X0 )
= X0 ),
inference(leibniz_equality_elimination,[status(thm)],[f19]) ).
thf(f19,plain,
! [X0: $i,X1: $i > $o] :
( ( ( X1 @ ( f @ X0 ) )
= $false )
| ( $true
= ( X1 @ X0 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ( X1 @ ( f @ X0 ) )
=> ( X1 @ X0 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f17]) ).
thf(f17,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( Y0 @ ( f @ X0 ) )
=> ( Y0 @ X0 ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f16]) ).
thf(f16,plain,
! [X0: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( Y0 @ ( f @ X0 ) )
=> ( Y0 @ X0 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: $i] :
( ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ ( f @ X0 )
@ X0 )
= $true ),
inference(definition_unfolding,[status(thm)],[f14,f11]) ).
thf(f11,plain,
( leibeq
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( leibeq
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox/tmp/tmp.WWBU5KDAzP/DTF2THF_4897.p',leibeq) ).
thf(f14,plain,
! [X0: $i] :
( $true
= ( leibeq @ ( f @ X0 ) @ X0 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ! [X0: $i] :
( $true
= ( leibeq @ ( f @ X0 ) @ X0 ) )
& ( $true
= ( p
@ ^ [Y0: $i] : Y0 ) )
& ( ( p @ f )
!= $true ) ),
inference(flattening,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ( p @ f )
!= $true )
& ! [X0: $i] :
( $true
= ( leibeq @ ( f @ X0 ) @ X0 ) )
& ( $true
= ( p
@ ^ [Y0: $i] : Y0 ) ) ),
inference(ennf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
~ ( ( ! [X0: $i] :
( $true
= ( leibeq @ ( f @ X0 ) @ X0 ) )
& ( $true
= ( p
@ ^ [Y0: $i] : Y0 ) ) )
=> ( ( p @ f )
= $true ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
~ ( ( ! [X0: $i] : ( leibeq @ ( f @ X0 ) @ X0 )
& ( p
@ ^ [X1: $i] : X1 ) )
=> ( p @ f ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ( ( ! [X3: $i] : ( leibeq @ ( f @ X3 ) @ X3 )
& ( p
@ ^ [X3: $i] : X3 ) )
=> ( p @ f ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
( ( ! [X3: $i] : ( leibeq @ ( f @ X3 ) @ X3 )
& ( p
@ ^ [X3: $i] : X3 ) )
=> ( p @ f ) ),
file('/export/starexec/sandbox/tmp/tmp.WWBU5KDAzP/DTF2THF_4897.p',conj) ).
thf(f23,plain,
( sK2
!= ( f @ sK2 ) ),
inference(beta_eta_normalization,[status(thm)],[f22]) ).
thf(f22,plain,
( ( f @ sK2 )
!= ( ^ [Y0: $i] : Y0
@ sK2 ) ),
inference(negative_extensionality,[status(thm)],[f21]) ).
thf(f21,plain,
( f
!= ( ^ [Y0: $i] : Y0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f20]) ).
thf(f20,plain,
( ( f
!= ( ^ [Y0: $i] : Y0 ) )
| ( $true != $true ) ),
inference(constrained_superposition,[status(thm)],[f12,f13]) ).
thf(f13,plain,
( $true
= ( p
@ ^ [Y0: $i] : Y0 ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f12,plain,
( ( p @ f )
!= $true ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO011^1 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 14:21:31 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.29/0.45 ---- Original DTF file ---
% 0.29/0.46 thf(spec,logic,$$dhol).
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 % File : SYO011^1 : TPTP v9.2.1. Released v3.7.0.
% 0.29/0.46 % Domain : Syntactic
% 0.29/0.46 % Problem : Invalid formula in model classes not requiring f
% 0.29/0.46 % Version : Especial.
% 0.29/0.46 % English :
% 0.29/0.46
% 0.29/0.46 % Refs : [BB05] Benzmueller & Brown (2005), A Structured Set of Higher
% 0.29/0.46 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.29/0.46 % Source : [Ben09]
% 0.29/0.46 % Names : Example 14 [BB05]
% 0.29/0.46
% 0.29/0.46 % Status : Theorem
% 0.29/0.46 % : Without functional extensionality : CounterSatisfiable
% 0.29/0.46 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.10 v8.2.0, 0.38 v8.1.0, 0.36 v7.5.0, 0.29 v7.4.0, 0.11 v7.2.0, 0.12 v7.1.0, 0.00 v6.2.0, 0.29 v6.1.0, 0.43 v6.0.0, 0.29 v5.5.0, 0.33 v5.4.0, 0.40 v5.3.0, 0.60 v4.1.0, 0.67 v4.0.1, 1.00 v3.7.0
% 0.29/0.46 % Syntax : Number of formulae : 5 ( 1 unt; 3 typ; 1 def)
% 0.29/0.46 % Number of atoms : 5 ( 1 equ; 0 cnn)
% 0.29/0.46 % Maximal formula atoms : 3 ( 2 avg)
% 0.29/0.46 % Number of connectives : 10 ( 0 ~; 0 |; 1 &; 7 @)
% 0.29/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.29/0.46 % Maximal formula depth : 7 ( 4 avg)
% 0.29/0.46 % Number of types : 2 ( 0 usr)
% 0.29/0.46 % Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% 0.29/0.46 % Number of symbols : 4 ( 3 usr; 0 con; 1-2 aty)
% 0.29/0.46 % Number of variables : 5 ( 3 ^; 2 !; 0 ?; 5 :)
% 0.29/0.46 % SPC : TH0_THM_EQU_NAR
% 0.29/0.46
% 0.29/0.46 % Comments :
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 thf(leibeq_type,type,
% 0.29/0.46 leibeq: $i > $i > $o ).
% 0.29/0.46
% 0.29/0.46 thf(leibeq,definition,
% 0.29/0.46 ( leibeq
% 0.29/0.46 = ( ^ [U: $i,V: $i] :
% 0.29/0.46 ! [Q: $i > $o] :
% 0.29/0.46 ( ( Q @ U )
% 0.29/0.46 => ( Q @ V ) ) ) ) ).
% 0.29/0.46
% 0.29/0.46 thf(p_type,type,
% 0.29/0.46 p: ( $i > $i ) > $o ).
% 0.29/0.46
% 0.29/0.46 thf(f_type,type,
% 0.29/0.46 f: $i > $i ).
% 0.29/0.46
% 0.29/0.46 thf(conj,conjecture,
% 0.29/0.46 ( ( ! [X: $i] : ( leibeq @ ( f @ X ) @ X )
% 0.29/0.46 & ( p
% 0.29/0.46 @ ^ [X: $i] : X ) )
% 0.29/0.46 => ( p @ f ) ) ).
% 0.29/0.46
% 0.29/0.46 %------------------------------------------------------------------------------
% 0.29/0.46 ------------------------
% 1.47/1.26 ---- Embedded in THF ---
% 1.47/1.26 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.26 %%% Generated on Tue Feb 24 14:21:32 EST 2026
% 1.47/1.26 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.26 %%% Logic specification used:
% 1.47/1.26 %%% thf(spec, logic, $$dhol).
% 1.47/1.26
% 1.47/1.26 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.WWBU5KDAzP/DTF2DTF4897.p
% See solution above
% 1.47/1.26 ------------------------
% 1.47/1.27 ---- Cleaned THF ---
% 1.47/1.27 thf(leibeq_type,type,
% 1.47/1.27 leibeq: $i > $i > $o ).
% 1.47/1.27
% 1.47/1.27 thf(leibeq,definition,
% 1.47/1.27 ( leibeq
% 1.47/1.27 = ( ^ [U: $i,V: $i] :
% 1.47/1.27 ! [Q: $i > $o] :
% 1.47/1.27 ( ( Q @ U )
% 1.47/1.27 => ( Q @ V ) ) ) ) ).
% 1.47/1.27
% 1.47/1.27 thf(p_type,type,
% 1.47/1.27 p: ( $i > $i ) > $o ).
% 1.47/1.27
% 1.47/1.27 thf(f_type,type,
% 1.47/1.27 f: $i > $i ).
% 1.47/1.27
% 1.47/1.27 thf(conj,conjecture,
% 1.47/1.27 ( ( ! [X: $i] : ( leibeq @ ( f @ X ) @ X )
% 1.47/1.27 & ( p
% 1.47/1.27 @ ^ [X: $i] : X ) )
% 1.47/1.27 => ( p @ f ) ) ).
% 1.47/1.27 ------------------------
% 1.47/1.29 % (5173)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_4897 for (2999ds/183Mi)
% 1.47/1.29 % (5175)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_4897 for (2999ds/27Mi)
% 1.47/1.29 % (5175)Refutation not found, incomplete strategy
% 1.47/1.29 % (5175)------------------------------
% 1.47/1.29 % (5175)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.29 % (5175)Termination reason: Refutation not found, incomplete strategy
% 1.47/1.29
% 1.47/1.29
% 1.47/1.29 % (5175)Memory used [KB]: 5500
% 1.47/1.29 % (5175)Time elapsed: 0.002 s
% 1.47/1.29 % (5175)Instructions burned: 2 (million)
% 1.47/1.29 % (5175)------------------------------
% 1.47/1.29 % (5175)------------------------------
% 1.47/1.29 % (5173)First to succeed.
% 1.47/1.29 % (5173)Refutation found. Thanks to Tanya!
% 1.47/1.29 % SZS status Theorem for DTF2THF_4897
% 1.47/1.29 % SZS output start Proof for DTF2THF_4897
% 1.47/1.29 thf(func_def_0, type, leibeq: $i > $i > $o).
% 1.47/1.29 thf(func_def_2, type, p: ($i > $i) > $o).
% 1.47/1.29 thf(func_def_3, type, f: $i > $i).
% 1.47/1.29 thf(func_def_14, type, ph1: !>[X0: $tType]:(X0)).
% 1.47/1.29 thf(f53,plain,(
% 1.47/1.29 $false),
% 1.47/1.29 inference(trivial_inequality_removal,[status(thm)],[f51])).
% 1.47/1.29 thf(f51,plain,(
% 1.47/1.29 (sK2 != sK2)),
% 1.47/1.29 inference(superposition,[status(thm)],[f23,f24])).
% 1.47/1.29 thf(f24,plain,(
% 1.47/1.29 ( ! [X0 : $i] : (((f @ X0) = X0)) )),
% 1.47/1.29 inference(leibniz_equality_elimination,[status(thm)],[f19])).
% 1.47/1.29 thf(f19,plain,(
% 1.47/1.29 ( ! [X0 : $i,X1 : $i > $o] : (((X1 @ (f @ X0)) = $false) | ($true = (X1 @ X0))) )),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.47/1.29 thf(f18,plain,(
% 1.47/1.29 ( ! [X0 : $i,X1 : $i > $o] : (($true = ((X1 @ (f @ X0)) => (X1 @ X0)))) )),
% 1.47/1.29 inference(beta_eta_normalization,[status(thm)],[f17])).
% 1.47/1.29 thf(f17,plain,(
% 1.47/1.29 ( ! [X0 : $i,X1 : $i > $o] : (($true = ((^[Y0 : $i > $o]: ((Y0 @ (f @ X0)) => (Y0 @ X0))) @ X1))) )),
% 1.47/1.29 inference(pi_clausification,[status(thm)],[f16])).
% 1.47/1.29 thf(f16,plain,(
% 1.47/1.29 ( ! [X0 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ (f @ X0)) => (Y0 @ X0)))))) )),
% 1.47/1.29 inference(beta_eta_normalization,[status(thm)],[f15])).
% 1.47/1.29 thf(f15,plain,(
% 1.47/1.29 ( ! [X0 : $i] : ((((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))) @ (f @ X0) @ X0) = $true)) )),
% 1.47/1.29 inference(definition_unfolding,[status(thm)],[f14,f11])).
% 1.47/1.29 thf(f11,plain,(
% 1.47/1.29 (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 1.47/1.29 inference(cnf_transformation,[status(thm)],[f6])).
% 1.47/1.29 thf(f6,plain,(
% 1.47/1.29 (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 1.47/1.29 inference(fool_elimination,[status(thm)],[f5])).
% 1.47/1.29 thf(f5,plain,(
% 1.47/1.29 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))) = leibeq)),
% 1.47/1.29 inference(rectify,[status(thm)],[f1])).
% 1.47/1.29 thf(f1,axiom,(
% 1.47/1.29 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))) = leibeq)),
% 1.47/1.29 file('/export/starexec/sandbox/tmp/tmp.WWBU5KDAzP/DTF2THF_4897.p',leibeq)).
% 1.47/1.29 thf(f14,plain,(
% 1.47/1.29 ( ! [X0 : $i] : (($true = (leibeq @ (f @ X0) @ X0))) )),
% 1.47/1.29 inference(cnf_transformation,[status(thm)],[f10])).
% 1.47/1.29 thf(f10,plain,(
% 1.47/1.29 ! [X0 : $i] : ($true = (leibeq @ (f @ X0) @ X0)) & ($true = (p @ (^[Y0 : $i]: (Y0)))) & ((p @ f) != $true)),
% 1.47/1.29 inference(flattening,[status(thm)],[f9])).
% 1.47/1.29 thf(f9,plain,(
% 1.47/1.29 ((p @ f) != $true) & (! [X0 : $i] : ($true = (leibeq @ (f @ X0) @ X0)) & ($true = (p @ (^[Y0 : $i]: (Y0)))))),
% 1.47/1.29 inference(ennf_transformation,[status(thm)],[f8])).
% 1.47/1.29 thf(f8,plain,(
% 1.47/1.29 ~((! [X0 : $i] : ($true = (leibeq @ (f @ X0) @ X0)) & ($true = (p @ (^[Y0 : $i]: (Y0))))) => ((p @ f) = $true))),
% 1.47/1.29 inference(fool_elimination,[status(thm)],[f7])).
% 1.47/1.29 thf(f7,plain,(
% 1.47/1.29 ~((! [X0 : $i] : (leibeq @ (f @ X0) @ X0) & (p @ (^[X1 : $i] : (X1)))) => (p @ f))),
% 1.47/1.29 inference(rectify,[status(thm)],[f3])).
% 1.47/1.29 thf(f3,negated_conjecture,(
% 1.47/1.29 ~((! [X3 : $i] : (leibeq @ (f @ X3) @ X3) & (p @ (^[X3 : $i] : (X3)))) => (p @ f))),
% 1.47/1.29 inference(negated_conjecture,[status(cth)],[f2])).
% 1.47/1.29 thf(f2,conjecture,(
% 1.47/1.29 (! [X3 : $i] : (leibeq @ (f @ X3) @ X3) & (p @ (^[X3 : $i] : (X3)))) => (p @ f)),
% 1.47/1.29 file('/export/starexec/sandbox/tmp/tmp.WWBU5KDAzP/DTF2THF_4897.p',conj)).
% 1.47/1.29 thf(f23,plain,(
% 1.47/1.29 (sK2 != (f @ sK2))),
% 1.47/1.29 inference(beta_eta_normalization,[status(thm)],[f22])).
% 1.47/1.29 thf(f22,plain,(
% 1.47/1.29 ((f @ sK2) != ((^[Y0 : $i]: (Y0)) @ sK2))),
% 1.47/1.29 inference(negative_extensionality,[status(thm)],[f21])).
% 1.47/1.29 thf(f21,plain,(
% 1.47/1.29 (f != (^[Y0 : $i]: (Y0)))),
% 1.47/1.29 inference(trivial_inequality_removal,[status(thm)],[f20])).
% 1.47/1.29 thf(f20,plain,(
% 1.47/1.29 (f != (^[Y0 : $i]: (Y0))) | ($true != $true)),
% 1.47/1.29 inference(constrained_superposition,[status(thm)],[f12,f13])).
% 1.47/1.29 thf(f13,plain,(
% 1.47/1.29 ($true = (p @ (^[Y0 : $i]: (Y0))))),
% 1.47/1.29 inference(cnf_transformation,[status(thm)],[f10])).
% 1.47/1.29 thf(f12,plain,(
% 1.47/1.29 ((p @ f) != $true)),
% 1.47/1.29 inference(cnf_transformation,[status(thm)],[f10])).
% 1.47/1.29 % SZS output end Proof for DTF2THF_4897
% 1.47/1.29 % (5173)------------------------------
% 1.47/1.29 % (5173)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.29 % (5173)Termination reason: Refutation
% 1.47/1.29
% 1.47/1.29 % (5173)Memory used [KB]: 5500
% 1.47/1.29 % (5173)Time elapsed: 0.004 s
% 1.47/1.29 % (5173)Instructions burned: 2 (million)
% 1.47/1.29 % (5173)------------------------------
% 1.47/1.29 % (5173)------------------------------
% 1.47/1.29 % (5172)Success in time 0.012 s
%------------------------------------------------------------------------------