%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV232^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 : n012.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:40:37 AM UTC 2026
% Result : Theorem 0.85s 0.87s
% Output : Refutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 43 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 6 avg)
% Number of connectives : 137 ( 5 ~; 0 |; 12 &; 84 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 114 ( 114 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 36 ( 24 ^; 12 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cS: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_1,type,
c0: ( $i > $o ) > $o ).
thf(f8,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ Y2 ) ) ) )
& ( Y1 @ c0 ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ( X1 @ c0 )
& ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ X2 ) ) ) )
=> ( X1 @ X0 ) ) )
!= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ( X4 @ c0 )
& ! [X5: ( $i > $o ) > $o] :
( ( X4 @ X5 )
=> ( X4 @ ( cS @ X5 ) ) ) )
=> ( X4 @ X3 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ( X1 @ c0 )
& ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ X2 ) ) ) )
=> ( X1 @ X0 ) ) )
!= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ( X4 @ c0 )
& ! [X2: ( $i > $o ) > $o] :
( ( X4 @ X2 )
=> ( X4 @ ( cS @ X2 ) ) ) )
=> ( X4 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ( X1 @ c0 )
& ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ X2 ) ) ) )
=> ( X1 @ X0 ) ) )
= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ( X4 @ c0 )
& ! [X2: ( $i > $o ) > $o] :
( ( X4 @ X2 )
=> ( X4 @ ( cS @ X2 ) ) ) )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEAC7YBhWI/DTF2THF_20901.p',cX6007_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SEV232^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.24 % Computer : n012.cluster.edu
% 0.07/0.24 % Model : x86_64 x86_64
% 0.07/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24 % Memory : 8042.1875MB
% 0.07/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24 % CPULimit : 300
% 0.07/0.24 % WCLimit : 300
% 0.07/0.24 % DateTime : Tue Feb 24 12:42:15 EST 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.25 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.31 ---- Original DTF file ---
% 0.07/0.31 thf(spec,logic,$$dhol).
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 % File : SEV232^5 : TPTP v9.2.1. Released v4.0.0.
% 0.07/0.31 % Domain : Set Theory (Sets of sets)
% 0.07/0.31 % Problem : TPS problem X6007
% 0.07/0.31 % Version : Especial.
% 0.07/0.31 % English :
% 0.07/0.31
% 0.07/0.31 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.07/0.31 % Source : [Bro09]
% 0.07/0.31 % Names : tps_0359 [Bro09]
% 0.07/0.31 % : X6007 [TPS]
% 0.07/0.31
% 0.07/0.31 % Status : Theorem
% 0.07/0.31 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.09 v7.5.0, 0.00 v6.2.0, 0.14 v6.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.07/0.31 % Syntax : Number of formulae : 3 ( 1 unt; 2 typ; 0 def)
% 0.07/0.31 % Number of atoms : 5 ( 1 equ; 0 cnn)
% 0.07/0.31 % Maximal formula atoms : 1 ( 5 avg)
% 0.07/0.31 % Number of connectives : 16 ( 0 ~; 0 |; 2 &; 10 @)
% 0.07/0.31 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.07/0.31 % Maximal formula depth : 1 ( 1 avg)
% 0.07/0.31 % Number of types : 2 ( 0 usr)
% 0.07/0.31 % Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% 0.07/0.31 % Number of symbols : 3 ( 2 usr; 0 con; 1-2 aty)
% 0.07/0.31 % Number of variables : 6 ( 2 ^; 4 !; 0 ?; 6 :)
% 0.07/0.31 % SPC : TH0_THM_EQU_NAR
% 0.07/0.31
% 0.07/0.31 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.07/0.31 % project in the Department of Mathematical Sciences at Carnegie
% 0.07/0.31 % Mellon University. Distributed under the Creative Commons copyleft
% 0.07/0.31 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.07/0.31 % : Polymorphic definitions expanded.
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 thf(cS,type,
% 0.07/0.31 cS: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
% 0.07/0.31
% 0.07/0.31 thf(c0,type,
% 0.07/0.31 c0: ( $i > $o ) > $o ).
% 0.07/0.31
% 0.07/0.31 thf(cX6007_pme,conjecture,
% 0.07/0.31 ( ( ^ [N: ( $i > $o ) > $o] :
% 0.07/0.31 ! [P: ( ( $i > $o ) > $o ) > $o] :
% 0.07/0.31 ( ( ( P @ c0 )
% 0.07/0.31 & ! [X: ( $i > $o ) > $o] :
% 0.07/0.31 ( ( P @ X )
% 0.07/0.31 => ( P @ ( cS @ X ) ) ) )
% 0.07/0.31 => ( P @ N ) ) )
% 0.07/0.31 = ( ^ [Xx: ( $i > $o ) > $o] :
% 0.07/0.31 ! [S0: ( ( $i > $o ) > $o ) > $o] :
% 0.07/0.31 ( ( ( S0 @ c0 )
% 0.07/0.31 & ! [X: ( $i > $o ) > $o] :
% 0.07/0.31 ( ( S0 @ X )
% 0.07/0.31 => ( S0 @ ( cS @ X ) ) ) )
% 0.07/0.31 => ( S0 @ Xx ) ) ) ) ).
% 0.07/0.31
% 0.07/0.31 %------------------------------------------------------------------------------
% 0.07/0.31 ------------------------
% 0.85/0.85 ---- Embedded in THF ---
% 0.85/0.85 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 0.85/0.85 %%% Generated on Tue Feb 24 12:42:16 EST 2026
% 0.85/0.85 %%% using '$$dhol' embedding, version 1.3.0.
% 0.85/0.85 %%% Logic specification used:
% 0.85/0.85 %%% thf(spec, logic, $$dhol).
% 0.85/0.85
% 0.85/0.85 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.iEAC7YBhWI/DTF2DTF20901.p
% See solution above
% 0.85/0.85 ------------------------
% 0.85/0.86 ---- Cleaned THF ---
% 0.85/0.86 thf(cS,type,
% 0.85/0.86 cS: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
% 0.85/0.86
% 0.85/0.86 thf(c0,type,
% 0.85/0.86 c0: ( $i > $o ) > $o ).
% 0.85/0.86
% 0.85/0.86 thf(cX6007_pme,conjecture,
% 0.85/0.86 ( ( ^ [N: ( $i > $o ) > $o] :
% 0.85/0.86 ! [P: ( ( $i > $o ) > $o ) > $o] :
% 0.85/0.86 ( ( ( P @ c0 )
% 0.85/0.86 & ! [X: ( $i > $o ) > $o] :
% 0.85/0.86 ( ( P @ X )
% 0.85/0.86 => ( P @ ( cS @ X ) ) ) )
% 0.85/0.86 => ( P @ N ) ) )
% 0.85/0.86 = ( ^ [Xx: ( $i > $o ) > $o] :
% 0.85/0.86 ! [S0: ( ( $i > $o ) > $o ) > $o] :
% 0.85/0.86 ( ( ( S0 @ c0 )
% 0.85/0.86 & ! [X: ( $i > $o ) > $o] :
% 0.85/0.86 ( ( S0 @ X )
% 0.85/0.86 => ( S0 @ ( cS @ X ) ) ) )
% 0.85/0.86 => ( S0 @ Xx ) ) ) ) ).
% 0.85/0.86 ------------------------
% 0.85/0.87 % (21097)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_20901 for (3000ds/183Mi)
% 0.85/0.87 % (21098)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_20901 for (3000ds/4Mi)
% 0.85/0.87 % (21099)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_20901 for (3000ds/27Mi)
% 0.85/0.87 % (21100)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_20901 for (3000ds/2Mi)
% 0.85/0.87 % (21101)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_20901 for (3000ds/2Mi)
% 0.85/0.87 % (21103)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_20901 for (3000ds/18Mi)
% 0.85/0.87 % (21102)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_20901 for (3000ds/275Mi)
% 0.85/0.87 % (21097)First to succeed.
% 0.85/0.87 % (21099)Also succeeded, but the first one will report.
% 0.85/0.87 % (21100)Instruction limit reached!
% 0.85/0.87 % (21100)------------------------------
% 0.85/0.87 % (21100)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.85/0.87 % (21100)Termination reason: Unknown
% 0.85/0.87 % (21100)Termination phase: Saturation
% 0.85/0.87
% 0.85/0.87 % (21100)Memory used [KB]: 5500
% 0.85/0.87 % (21100)Time elapsed: 0.002 s
% 0.85/0.87 % (21100)Instructions burned: 3 (million)
% 0.85/0.87 % (21100)------------------------------
% 0.85/0.87 % (21100)------------------------------
% 0.85/0.87 % (21101)Instruction limit reached!
% 0.85/0.87 % (21101)------------------------------
% 0.85/0.87 % (21101)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.85/0.87 % (21101)Termination reason: Unknown
% 0.85/0.87 % (21101)Termination phase: Saturation
% 0.85/0.87
% 0.85/0.87 % (21101)Memory used [KB]: 5500
% 0.85/0.87 % (21101)Time elapsed: 0.002 s
% 0.85/0.87 % (21101)Instructions burned: 3 (million)
% 0.85/0.87 % (21101)------------------------------
% 0.85/0.87 % (21101)------------------------------
% 0.85/0.87 % (21097)Refutation found. Thanks to Tanya!
% 0.85/0.87 % SZS status Theorem for DTF2THF_20901
% 0.85/0.87 % SZS output start Proof for DTF2THF_20901
% 0.85/0.87 thf(func_def_0, type, cS: (($i > $o) > $o) > ($i > $o) > $o).
% 0.85/0.87 thf(func_def_1, type, c0: ($i > $o) > $o).
% 0.85/0.87 thf(f8,plain,(
% 0.85/0.87 $false),
% 0.85/0.87 inference(trivial_inequality_removal,[status(thm)],[f7])).
% 0.85/0.87 thf(f7,plain,(
% 0.85/0.87 ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))) != (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))))),
% 0.85/0.87 inference(cnf_transformation,[status(thm)],[f6])).
% 0.85/0.87 thf(f6,plain,(
% 0.85/0.87 ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))) != (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))))),
% 0.85/0.87 inference(flattening,[status(thm)],[f5])).
% 0.85/0.87 thf(f5,plain,(
% 0.85/0.87 ~((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))) = (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cS @ Y2))))) & (Y1 @ c0)) => (Y1 @ Y0))))))),
% 0.85/0.87 inference(fool_elimination,[status(thm)],[f4])).
% 0.85/0.87 thf(f4,plain,(
% 0.85/0.87 ~((^[X0 : ($i > $o) > $o] : (! [X1 : (($i > $o) > $o) > $o] : (((X1 @ c0) & ! [X2 : ($i > $o) > $o] : ((X1 @ X2) => (X1 @ (cS @ X2)))) => (X1 @ X0)))) = (^[X3 : ($i > $o) > $o] : (! [X4 : (($i > $o) > $o) > $o] : (((X4 @ c0) & ! [X5 : ($i > $o) > $o] : ((X4 @ X5) => (X4 @ (cS @ X5)))) => (X4 @ X3)))))),
% 0.85/0.87 inference(rectify,[status(thm)],[f2])).
% 0.85/0.87 thf(f2,negated_conjecture,(
% 0.85/0.87 ~((^[X0 : ($i > $o) > $o] : (! [X1 : (($i > $o) > $o) > $o] : (((X1 @ c0) & ! [X2 : ($i > $o) > $o] : ((X1 @ X2) => (X1 @ (cS @ X2)))) => (X1 @ X0)))) = (^[X3 : ($i > $o) > $o] : (! [X4 : (($i > $o) > $o) > $o] : (((X4 @ c0) & ! [X2 : ($i > $o) > $o] : ((X4 @ X2) => (X4 @ (cS @ X2)))) => (X4 @ X3)))))),
% 0.85/0.87 inference(negated_conjecture,[status(cth)],[f1])).
% 0.85/0.87 thf(f1,conjecture,(
% 0.85/0.87 ((^[X0 : ($i > $o) > $o] : (! [X1 : (($i > $o) > $o) > $o] : (((X1 @ c0) & ! [X2 : ($i > $o) > $o] : ((X1 @ X2) => (X1 @ (cS @ X2)))) => (X1 @ X0)))) = (^[X3 : ($i > $o) > $o] : (! [X4 : (($i > $o) > $o) > $o] : (((X4 @ c0) & ! [X2 : ($i > $o) > $o] : ((X4 @ X2) => (X4 @ (cS @ X2)))) => (X4 @ X3)))))),
% 0.85/0.87 file('/export/starexec/sandbox2/tmp/tmp.iEAC7YBhWI/DTF2THF_20901.p',cX6007_pme)).
% 0.85/0.87 % SZS output end Proof for DTF2THF_20901
% 0.85/0.87 % (21097)------------------------------
% 0.85/0.87 % (21097)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.85/0.87 % (21097)Termination reason: Refutation
% 0.85/0.87
% 0.85/0.87 % (21097)Memory used [KB]: 5500
% 0.85/0.87 % (21097)Time elapsed: 0.002 s
% 0.85/0.87 % (21097)------------------------------
% 0.85/0.87 % (21097)------------------------------
% 0.85/0.87 % (21096)Success in time 0.01 s
%------------------------------------------------------------------------------