%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM802^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:24:47 AM UTC 2026
% Result : Theorem 1.48s 1.28s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 144 ( 44 equ; 1 cnn)
% Maximal formula atoms : 7 ( 8 avg)
% Number of connectives : 165 ( 31 ~; 10 |; 13 &; 95 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 0 ^; 32 !; 9 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
absval: $i > $i ).
thf(func_def_3,type,
c_less_: $i > $i > $o ).
thf(func_def_7,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_10,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f26,f13]) ).
thf(f13,plain,
( ( c_less_ @ c_2 @ c0 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X0: $i,X1: $i] :
( ( ( c_less_ @ X0 @ c0 )
!= $true )
| ( ( absval @ X1 )
!= X0 ) )
& ( ( c_less_ @ c_2 @ c0 )
= $true )
& ! [X2: $i > $o] :
( ( ( X2 @ ( absval @ ( sK0 @ X2 ) ) )
= $true )
| ( ( X2 @ c_2 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
= $true )
=> ( ( X2 @ ( absval @ ( sK0 @ X2 ) ) )
= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ! [X0: $i,X1: $i] :
( ( ( c_less_ @ X0 @ c0 )
!= $true )
| ( ( absval @ X1 )
!= X0 ) )
& ( ( c_less_ @ c_2 @ c0 )
= $true )
& ! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
= $true )
| ( ( X2 @ c_2 )
!= $true ) ) ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,plain,
( ! [X1: $i,X0: $i] :
( ( ( c_less_ @ X1 @ c0 )
!= $true )
| ( ( absval @ X0 )
!= X1 ) )
& ( ( c_less_ @ c_2 @ c0 )
= $true )
& ! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
= $true )
| ( ( X2 @ c_2 )
!= $true ) ) ),
inference(flattening,[status(thm)],[f7]) ).
thf(f7,plain,
( ! [X2: $i > $o] :
( ? [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
= $true )
| ( ( X2 @ c_2 )
!= $true ) )
& ! [X1: $i,X0: $i] :
( ( ( c_less_ @ X1 @ c0 )
!= $true )
| ( ( absval @ X0 )
!= X1 ) )
& ( ( c_less_ @ c_2 @ c0 )
= $true ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( ( ( c_less_ @ c_2 @ c0 )
= $true )
=> ( ! [X1: $i,X0: $i] :
( ( ( c_less_ @ X1 @ c0 )
= $true )
=> ( ( absval @ X0 )
!= X1 ) )
=> ? [X2: $i > $o] :
( ! [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
!= $true )
& ( ( X2 @ c_2 )
= $true ) ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( c_less_ @ c_2 @ c0 )
= $true )
=> ( ! [X1: $i,X0: $i] :
( ( ( c_less_ @ X1 @ c0 )
= $true )
=> ( ( absval @ X0 )
!= X1 ) )
=> ? [X2: $i > $o] :
( ( ( X2 @ c_2 )
= $true )
& ! [X3: $i] :
( ( X2 @ ( absval @ X3 ) )
!= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( c_less_ @ c_2 @ c0 )
=> ( ! [X0: $i,X1: $i] :
( ( c_less_ @ X1 @ c0 )
=> ( ( absval @ X0 )
!= X1 ) )
=> ? [X2: $i > $o] :
( ( X2 @ c_2 )
& ! [X3: $i] :
~ ( X2 @ ( absval @ X3 ) ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( c_less_ @ c_2 @ c0 )
=> ( ! [X1: $i,X0: $i] :
( ( c_less_ @ X0 @ c0 )
=> ( ( absval @ X1 )
!= X0 ) )
=> ? [X2: $i > $o] :
( ( X2 @ c_2 )
& ! [X3: $i] :
~ ( X2 @ ( absval @ X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( c_less_ @ c_2 @ c0 )
=> ( ! [X1: $i,X0: $i] :
( ( c_less_ @ X0 @ c0 )
=> ( ( absval @ X1 )
!= X0 ) )
=> ? [X2: $i > $o] :
( ( X2 @ c_2 )
& ! [X3: $i] :
~ ( X2 @ ( absval @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.w1R1fAjAre/DTF2THF_18772.p',cBLEDSOE_FENG_8) ).
thf(f26,plain,
( ( c_less_ @ c_2 @ c0 )
!= $true ),
inference(superposition,[status(thm)],[f15,f16]) ).
thf(f16,plain,
( c_2
= ( absval @ ( sK0 @ ( (=) @ c_2 ) ) ) ),
inference(leibniz_equality_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
! [X2: $i > $o] :
( ( ( X2 @ ( absval @ ( sK0 @ X2 ) ) )
= $true )
| ( ( X2 @ c_2 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f15,plain,
! [X1: $i] :
( ( c_less_ @ ( absval @ X1 ) @ c0 )
!= $true ),
inference(equality_resolution,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: $i,X1: $i] :
( ( ( c_less_ @ X0 @ c0 )
!= $true )
| ( ( absval @ X1 )
!= X0 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM802^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n016.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 11:15:06 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.46 ---- Original DTF file ---
% 0.30/0.46 thf(spec,logic,$$dhol).
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 % File : NUM802^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.46 % Domain : Number Theory
% 0.30/0.46 % Problem : TPS problem BLEDSOE-FENG-8
% 0.30/0.46 % Version : Especial.
% 0.30/0.46 % English : There is a set containing no nonnegative numbers and containing
% 0.30/0.46 % -2.
% 0.30/0.46
% 0.30/0.46 % Refs : [BF93] Bledsoe & Feng (1993), SET-VAR
% 0.30/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.46 % Source : [Bro09]
% 0.30/0.46 % Names : tps_0143 [Bro09]
% 0.30/0.46 % : BLEDSOE-FENG-8 [TPS]
% 0.30/0.46 % : Example 8 [BF93]
% 0.30/0.46
% 0.30/0.46 % Status : Theorem
% 0.30/0.46 % Rating : 0.33 v9.1.0, 0.25 v9.0.0, 0.30 v8.2.0, 0.38 v8.1.0, 0.45 v7.5.0, 0.14 v7.4.0, 0.33 v7.2.0, 0.12 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v6.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.40 v5.0.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.30/0.46 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.30/0.46 % Number of atoms : 3 ( 1 equ; 0 cnn)
% 0.30/0.46 % Maximal formula atoms : 3 ( 3 avg)
% 0.30/0.46 % Number of connectives : 14 ( 2 ~; 0 |; 1 &; 8 @)
% 0.30/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.30/0.46 % Maximal formula depth : 9 ( 9 avg)
% 0.30/0.46 % Number of types : 2 ( 0 usr)
% 0.30/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.30/0.46 % Number of symbols : 5 ( 4 usr; 2 con; 0-2 aty)
% 0.30/0.46 % Number of variables : 4 ( 0 ^; 3 !; 1 ?; 4 :)
% 0.30/0.46 % SPC : TH0_THM_EQU_NAR
% 0.30/0.46
% 0.30/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.46 % :
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 thf(c_2,type,
% 0.30/0.46 c_2: $i ).
% 0.30/0.46
% 0.30/0.46 thf(absval,type,
% 0.30/0.46 absval: $i > $i ).
% 0.30/0.46
% 0.30/0.46 thf(c0,type,
% 0.30/0.46 c0: $i ).
% 0.30/0.46
% 0.30/0.46 thf(c_less_,type,
% 0.30/0.46 c_less_: $i > $i > $o ).
% 0.30/0.46
% 0.30/0.46 thf(cBLEDSOE_FENG_8,conjecture,
% 0.30/0.46 ( ( c_less_ @ c_2 @ c0 )
% 0.30/0.46 => ( ! [Xu: $i,Xv: $i] :
% 0.30/0.46 ( ( c_less_ @ Xu @ c0 )
% 0.30/0.46 => ( Xu
% 0.30/0.46 != ( absval @ Xv ) ) )
% 0.30/0.46 => ? [A: $i > $o] :
% 0.30/0.46 ( ! [Xy: $i] :
% 0.30/0.46 ~ ( A @ ( absval @ Xy ) )
% 0.30/0.46 & ( A @ c_2 ) ) ) ) ).
% 0.30/0.46
% 0.30/0.46 %------------------------------------------------------------------------------
% 0.30/0.46 ------------------------
% 1.48/1.25 ---- Embedded in THF ---
% 1.48/1.25 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.25 %%% Generated on Tue Feb 24 11:15:07 EST 2026
% 1.48/1.25 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.25 %%% Logic specification used:
% 1.48/1.25 %%% thf(spec, logic, $$dhol).
% 1.48/1.25
% 1.48/1.25 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.w1R1fAjAre/DTF2DTF18772.p
% See solution above
% 1.48/1.25 ------------------------
% 1.48/1.27 ---- Cleaned THF ---
% 1.48/1.27 thf(c_2,type,
% 1.48/1.27 c_2: $i ).
% 1.48/1.27
% 1.48/1.27 thf(absval,type,
% 1.48/1.27 absval: $i > $i ).
% 1.48/1.27
% 1.48/1.27 thf(c0,type,
% 1.48/1.27 c0: $i ).
% 1.48/1.27
% 1.48/1.27 thf(c_less_,type,
% 1.48/1.27 c_less_: $i > $i > $o ).
% 1.48/1.27
% 1.48/1.27 thf(cBLEDSOE_FENG_8,conjecture,
% 1.48/1.27 ( ( c_less_ @ c_2 @ c0 )
% 1.48/1.27 => ( ! [Xu: $i,Xv: $i] :
% 1.48/1.27 ( ( c_less_ @ Xu @ c0 )
% 1.48/1.27 => ( Xu
% 1.48/1.27 != ( absval @ Xv ) ) )
% 1.48/1.27 => ? [A: $i > $o] :
% 1.48/1.27 ( ! [Xy: $i] :
% 1.48/1.27 ~ ( A @ ( absval @ Xy ) )
% 1.48/1.27 & ( A @ c_2 ) ) ) ) ).
% 1.48/1.27 ------------------------
% 1.48/1.28 % (19050)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_18772 for (2999ds/275Mi)
% 1.48/1.28 % (19049)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_18772 for (2999ds/2Mi)
% 1.48/1.28 % (19050)First to succeed.
% 1.48/1.28 % (19049)Instruction limit reached!
% 1.48/1.28 % (19049)------------------------------
% 1.48/1.28 % (19049)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (19049)Termination reason: Unknown
% 1.48/1.28 % (19049)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (19049)Memory used [KB]: 5500
% 1.48/1.28 % (19049)Time elapsed: 0.002 s
% 1.48/1.28 % (19049)Instructions burned: 2 (million)
% 1.48/1.28 % (19049)------------------------------
% 1.48/1.28 % (19049)------------------------------
% 1.48/1.28 % (19050)Refutation found. Thanks to Tanya!
% 1.48/1.28 % SZS status Theorem for DTF2THF_18772
% 1.48/1.28 % SZS output start Proof for DTF2THF_18772
% 1.48/1.28 thf(func_def_1, type, absval: $i > $i).
% 1.48/1.28 thf(func_def_3, type, c_less_: $i > $i > $o).
% 1.48/1.28 thf(func_def_7, type, sK0: ($i > $o) > $i).
% 1.48/1.28 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 1.48/1.28 thf(f27,plain,(
% 1.48/1.28 $false),
% 1.48/1.28 inference(subsumption_resolution,[status(thm)],[f26,f13])).
% 1.48/1.28 thf(f13,plain,(
% 1.48/1.28 ((c_less_ @ c_2 @ c0) = $true)),
% 1.48/1.28 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.28 thf(f11,plain,(
% 1.48/1.28 ! [X0 : $i,X1 : $i] : (((c_less_ @ X0 @ c0) != $true) | ((absval @ X1) != X0)) & ((c_less_ @ c_2 @ c0) = $true) & ! [X2 : $i > $o] : (((X2 @ (absval @ (sK0 @ X2))) = $true) | ((X2 @ c_2) != $true))),
% 1.48/1.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 1.48/1.28 thf(f10,plain,(
% 1.48/1.28 ! [X2 : $i > $o] : (? [X3 : $i] : ((X2 @ (absval @ X3)) = $true) => ((X2 @ (absval @ (sK0 @ X2))) = $true))),
% 1.48/1.28 introduced(definition,[],[choice_axiom])).
% 1.48/1.28 thf(f9,plain,(
% 1.48/1.28 ! [X0 : $i,X1 : $i] : (((c_less_ @ X0 @ c0) != $true) | ((absval @ X1) != X0)) & ((c_less_ @ c_2 @ c0) = $true) & ! [X2 : $i > $o] : (? [X3 : $i] : ((X2 @ (absval @ X3)) = $true) | ((X2 @ c_2) != $true))),
% 1.48/1.28 inference(rectify,[status(thm)],[f8])).
% 1.48/1.28 thf(f8,plain,(
% 1.48/1.28 ! [X1 : $i,X0 : $i] : (((c_less_ @ X1 @ c0) != $true) | ((absval @ X0) != X1)) & ((c_less_ @ c_2 @ c0) = $true) & ! [X2 : $i > $o] : (? [X3 : $i] : ((X2 @ (absval @ X3)) = $true) | ((X2 @ c_2) != $true))),
% 1.48/1.28 inference(flattening,[status(thm)],[f7])).
% 1.48/1.28 thf(f7,plain,(
% 1.48/1.28 (! [X2 : $i > $o] : (? [X3 : $i] : ((X2 @ (absval @ X3)) = $true) | ((X2 @ c_2) != $true)) & ! [X1 : $i,X0 : $i] : (((c_less_ @ X1 @ c0) != $true) | ((absval @ X0) != X1))) & ((c_less_ @ c_2 @ c0) = $true)),
% 1.48/1.28 inference(ennf_transformation,[status(thm)],[f6])).
% 1.48/1.28 thf(f6,plain,(
% 1.48/1.28 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1 : $i,X0 : $i] : (((c_less_ @ X1 @ c0) = $true) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : (! [X3 : $i] : ((X2 @ (absval @ X3)) != $true) & ((X2 @ c_2) = $true))))),
% 1.48/1.28 inference(flattening,[status(thm)],[f5])).
% 1.48/1.28 thf(f5,plain,(
% 1.48/1.28 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1 : $i,X0 : $i] : (((c_less_ @ X1 @ c0) = $true) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : (((X2 @ c_2) = $true) & ! [X3 : $i] : ~((X2 @ (absval @ X3)) = $true))))),
% 1.48/1.28 inference(fool_elimination,[status(thm)],[f4])).
% 1.48/1.28 thf(f4,plain,(
% 1.48/1.28 ~((c_less_ @ c_2 @ c0) => (! [X0 : $i,X1 : $i] : ((c_less_ @ X1 @ c0) => ((absval @ X0) != X1)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3 : $i] : ~(X2 @ (absval @ X3)))))),
% 1.48/1.28 inference(rectify,[status(thm)],[f2])).
% 1.48/1.28 thf(f2,negated_conjecture,(
% 1.48/1.28 ~((c_less_ @ c_2 @ c0) => (! [X1 : $i,X0 : $i] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3 : $i] : ~(X2 @ (absval @ X3)))))),
% 1.48/1.28 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.28 thf(f1,conjecture,(
% 1.48/1.28 (c_less_ @ c_2 @ c0) => (! [X1 : $i,X0 : $i] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3 : $i] : ~(X2 @ (absval @ X3))))),
% 1.48/1.28 file('/export/starexec/sandbox/tmp/tmp.w1R1fAjAre/DTF2THF_18772.p',cBLEDSOE_FENG_8)).
% 1.48/1.28 thf(f26,plain,(
% 1.48/1.28 ((c_less_ @ c_2 @ c0) != $true)),
% 1.48/1.28 inference(superposition,[status(thm)],[f15,f16])).
% 1.48/1.28 thf(f16,plain,(
% 1.48/1.28 (c_2 = (absval @ (sK0 @ (= @ c_2))))),
% 1.48/1.28 inference(leibniz_equality_elimination,[status(thm)],[f12])).
% 1.48/1.28 thf(f12,plain,(
% 1.48/1.28 ( ! [X2 : $i > $o] : (((X2 @ (absval @ (sK0 @ X2))) = $true) | ((X2 @ c_2) != $true)) )),
% 1.48/1.28 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.28 thf(f15,plain,(
% 1.48/1.28 ( ! [X1 : $i] : (((c_less_ @ (absval @ X1) @ c0) != $true)) )),
% 1.48/1.28 inference(equality_resolution,[status(thm)],[f14])).
% 1.48/1.28 thf(f14,plain,(
% 1.48/1.28 ( ! [X0 : $i,X1 : $i] : (((c_less_ @ X0 @ c0) != $true) | ((absval @ X1) != X0)) )),
% 1.48/1.28 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.28 % SZS output end Proof for DTF2THF_18772
% 1.48/1.28 % (19050)------------------------------
% 1.48/1.28 % (19050)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (19050)Termination reason: Refutation
% 1.48/1.28
% 1.48/1.28 % (19050)Memory used [KB]: 5500
% 1.48/1.28 % (19050)Time elapsed: 0.003 s
% 1.48/1.28 % (19050)Instructions burned: 2 (million)
% 1.48/1.28 % (19050)------------------------------
% 1.48/1.28 % (19050)------------------------------
% 1.48/1.28 % (19044)Success in time 0.012 s
%------------------------------------------------------------------------------