%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO090^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 : n006.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:21 AM UTC 2026
% Result : Theorem 1.62s 1.32s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 502 ( 141 equ)
% Maximal formula atoms : 26 ( 26 avg)
% Number of connectives : 351 ( 150 ~; 100 |; 96 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 282 ( 282 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f48,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f41,f47]) ).
tff(f47,plain,
p = $true,
inference(trivial_inequality_removal,[status(thm)],[f46]) ).
tff(f46,plain,
( ( p = $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f29]) ).
tff(f29,plain,
( ( $true != $true )
| ( p = $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f17,f10,f11,f23,f23,f11,f10]) ).
tff(f23,plain,
s = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f9,plain,
( ( s = $true )
& ( ( ( s = $true )
& ( q = $true )
& ( ( p != $true )
| ( s != $true )
| ( q != $true )
| ( t != $true ) )
& ( t = $true ) )
| ( q != $true )
| ( t != $true )
| ( s != $true ) )
& ( ( ( ( q != $true )
| ( t != $true )
| ( ( t = $true )
& ( p = $true )
& ( s = $true )
& ( q = $true ) )
| ( s != $true ) )
& ( t = $true )
& ( q = $true )
& ( s = $true ) )
| ( s != $true )
| ( t != $true )
| ( q != $true ) )
& ( t = $true )
& ( q = $true ) ),
inference(flattening,[status(thm)],[f8]) ).
tff(f8,plain,
( ( s = $true )
& ( t = $true )
& ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( ( s = $true )
& ( t = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p != $true ) )
& ( q = $true ) )
| ( q != $true ) )
& ( ( ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( ( q = $true )
& ( p = $true )
& ( t = $true )
& ( s = $true ) ) )
& ( t = $true )
& ( s = $true ) )
| ( s != $true )
| ( t != $true )
| ( q != $true ) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
tff(f7,plain,
~ ( ( ~ ( ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( t = $true )
& ( s = $true ) ) ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) )
| ( s != $true )
| ( t != $true )
| ( q != $true ) )
=> ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) )
& ( q = $true ) ) )
& ( q = $true ) ) ) ) ) ),
inference(flattening,[status(thm)],[f6]) ).
tff(f6,plain,
~ ( ( ( t != $true )
| ( s != $true )
| ~ ( ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( t = $true )
& ( s = $true ) ) ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) )
| ( q != $true ) )
=> ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) )
& ( q = $true ) ) )
& ( q = $true ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
tff(f5,plain,
~ ( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( q
& ( ~ ( q
& p )
| ~ ( t
& s ) ) )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( ( ~ ( q
& ( ~ ( t
& s )
| ~ ( ( ~ ( q
& p )
| ~ ( s
& t ) )
& q ) ) )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
inference(rectify,[status(thm)],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( q
& ( ~ ( q
& p )
| ~ ( t
& s ) ) )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( ( ~ ( q
& ( ~ ( t
& s )
| ~ ( ( ~ ( q
& p )
| ~ ( s
& t ) )
& q ) ) )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f1,conjecture,
( ( ~ t
| ~ s
| ~ ( ~ ( q
& ( ~ ( q
& ( ~ ( q
& p )
| ~ ( t
& s ) ) )
| ~ ( t
& s ) ) )
| ~ ( s
& t ) )
| ~ q )
=> ( ~ ( ( ~ ( q
& ( ~ ( t
& s )
| ~ ( ( ~ ( q
& p )
| ~ ( s
& t ) )
& q ) ) )
| ~ ( s
& t ) )
& q )
| ~ ( s
& t ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JpaHDQQKc5/DTF2THF_10974.p',cDMG8) ).
tff(f11,plain,
t = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f10,plain,
q = $true,
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f17,plain,
( ( q != $true )
| ( t != $true )
| ( p = $true )
| ( s != $true )
| ( s != $true )
| ( t != $true )
| ( q != $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
tff(f41,plain,
p != $true,
inference(trivial_inequality_removal,[status(thm)],[f40]) ).
tff(f40,plain,
( ( p != $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f26]) ).
tff(f26,plain,
( ( p != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[status(thm)],[f20,f23,f10,f11,f10,f11,f23]) ).
tff(f20,plain,
( ( p != $true )
| ( s != $true )
| ( q != $true )
| ( t != $true )
| ( q != $true )
| ( t != $true )
| ( s != $true ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO090^5 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n006.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.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 14:24:00 EST 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.28/0.45 ---- Original DTF file ---
% 0.28/0.45 thf(spec,logic,$$dhol).
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 % File : SYO090^5 : TPTP v9.2.1. Released v4.0.0.
% 0.28/0.45 % Domain : Syntactic
% 0.28/0.45 % Problem : TPS problem DMG8
% 0.28/0.45 % Version : Especial.
% 0.28/0.45 % English : A propositional problem suggested by Jay Hunschel Kim.
% 0.28/0.45
% 0.28/0.45 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.28/0.45 % Source : [Bro09]
% 0.28/0.45 % Names : tps_0164 [Bro09]
% 0.28/0.45 % : DMG8 [TPS]
% 0.28/0.45
% 0.28/0.45 % Status : Theorem
% 0.28/0.45 % Rating : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v6.2.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.28/0.45 % Syntax : Number of formulae : 5 ( 0 unt; 4 typ; 0 def)
% 0.28/0.45 % Number of atoms : 26 ( 0 equ; 0 cnn)
% 0.28/0.45 % Maximal formula atoms : 26 ( 26 avg)
% 0.28/0.45 % Number of connectives : 43 ( 18 ~; 10 |; 14 &; 0 @)
% 0.28/0.45 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.28/0.45 % Maximal formula depth : 14 ( 14 avg)
% 0.28/0.45 % Number of types : 1 ( 0 usr)
% 0.28/0.45 % Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 0.28/0.45 % Number of symbols : 4 ( 4 usr; 4 con; 0-0 aty)
% 0.28/0.45 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.28/0.45 % SPC : TH0_THM_NEQ_NAR
% 0.28/0.45
% 0.28/0.45 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.28/0.45 % project in the Department of Mathematical Sciences at Carnegie
% 0.28/0.45 % Mellon University. Distributed under the Creative Commons copyleft
% 0.28/0.45 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 thf(t,type,
% 0.28/0.45 t: $o ).
% 0.28/0.45
% 0.28/0.45 thf(s,type,
% 0.28/0.45 s: $o ).
% 0.28/0.45
% 0.28/0.45 thf(q,type,
% 0.28/0.45 q: $o ).
% 0.28/0.45
% 0.28/0.45 thf(p,type,
% 0.28/0.45 p: $o ).
% 0.28/0.45
% 0.28/0.45 thf(cDMG8,conjecture,
% 0.28/0.45 ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 | ~ q
% 0.28/0.45 | ~ s
% 0.28/0.45 | ~ t )
% 0.28/0.45 => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) )
% 0.28/0.45 & q )
% 0.28/0.45 | ~ ( s
% 0.28/0.45 & t ) ) ) ).
% 0.28/0.45
% 0.28/0.45 %------------------------------------------------------------------------------
% 0.28/0.45 ------------------------
% 1.44/1.29 ---- Embedded in THF ---
% 1.44/1.29 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.44/1.29 %%% Generated on Tue Feb 24 14:24:01 EST 2026
% 1.44/1.29 %%% using '$$dhol' embedding, version 1.3.0.
% 1.44/1.29 %%% Logic specification used:
% 1.44/1.29 %%% thf(spec, logic, $$dhol).
% 1.44/1.29
% 1.44/1.29 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.JpaHDQQKc5/DTF2DTF10974.p
% See solution above
% 1.44/1.29 ------------------------
% 1.62/1.30 ---- Cleaned THF ---
% 1.62/1.30 thf(t,type,
% 1.62/1.30 t: $o ).
% 1.62/1.30
% 1.62/1.30 thf(s,type,
% 1.62/1.30 s: $o ).
% 1.62/1.30
% 1.62/1.30 thf(q,type,
% 1.62/1.30 q: $o ).
% 1.62/1.30
% 1.62/1.30 thf(p,type,
% 1.62/1.30 p: $o ).
% 1.62/1.30
% 1.62/1.30 thf(cDMG8,conjecture,
% 1.62/1.30 ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 | ~ q
% 1.62/1.30 | ~ s
% 1.62/1.30 | ~ t )
% 1.62/1.30 => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) )
% 1.62/1.30 & q )
% 1.62/1.30 | ~ ( s
% 1.62/1.30 & t ) ) ) ).
% 1.62/1.30 ------------------------
% 1.62/1.32 % (11091)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_10974 for (2999ds/2Mi)
% 1.62/1.32 % (11091)First to succeed.
% 1.62/1.32 % (11091)Refutation found. Thanks to Tanya!
% 1.62/1.32 % SZS status Theorem for DTF2THF_10974
% 1.62/1.32 % SZS output start Proof for DTF2THF_10974
% 1.62/1.32 tff(f48,plain,(
% 1.62/1.32 $false),
% 1.62/1.32 inference(subsumption_resolution,[status(thm)],[f41,f47])).
% 1.62/1.32 tff(f47,plain,(
% 1.62/1.32 (p = $true)),
% 1.62/1.32 inference(trivial_inequality_removal,[status(thm)],[f46])).
% 1.62/1.32 tff(f46,plain,(
% 1.62/1.32 (p = $true) | ($true != $true)),
% 1.62/1.32 inference(duplicate_literal_removal,[status(thm)],[f29])).
% 1.62/1.32 tff(f29,plain,(
% 1.62/1.32 ($true != $true) | (p = $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true)),
% 1.62/1.32 inference(definition_unfolding,[status(thm)],[f17,f10,f11,f23,f23,f11,f10])).
% 1.62/1.32 tff(f23,plain,(
% 1.62/1.32 (s = $true)),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.62/1.32 tff(f9,plain,(
% 1.62/1.32 (s = $true) & (((s = $true) & (q = $true) & ((p != $true) | (s != $true) | (q != $true) | (t != $true)) & (t = $true)) | (q != $true) | (t != $true) | (s != $true)) & ((((q != $true) | (t != $true) | ((t = $true) & (p = $true) & (s = $true) & (q = $true)) | (s != $true)) & (t = $true) & (q = $true) & (s = $true)) | (s != $true) | (t != $true) | (q != $true)) & (t = $true) & (q = $true)),
% 1.62/1.32 inference(flattening,[status(thm)],[f8])).
% 1.62/1.32 tff(f8,plain,(
% 1.62/1.32 (((s = $true) & (t = $true)) & ((q = $true) & (((t != $true) | (s != $true)) | ((((s = $true) & (t = $true)) & ((((t != $true) | (s != $true)) | ((q != $true) | (p != $true))) & (q = $true))) | (q != $true))))) & ((((q = $true) & (((t != $true) | (s != $true)) | ((q != $true) | (((q = $true) & (p = $true)) & ((t = $true) & (s = $true)))))) & ((t = $true) & (s = $true))) | (s != $true) | (t != $true) | (q != $true))),
% 1.62/1.32 inference(ennf_transformation,[status(thm)],[f7])).
% 1.62/1.32 tff(f7,plain,(
% 1.62/1.32 ~((~(~((q = $true) & (~((t = $true) & (s = $true)) | ~((q = $true) & (~((q = $true) & (p = $true)) | ~((t = $true) & (s = $true)))))) | ~((t = $true) & (s = $true))) | (s != $true) | (t != $true) | (q != $true)) => (~((s = $true) & (t = $true)) | ~((q = $true) & (~((t = $true) & (s = $true)) | ~((~((s = $true) & (t = $true)) | ~((~((t = $true) & (s = $true)) | ~((q = $true) & (p = $true))) & (q = $true))) & (q = $true))))))),
% 1.62/1.32 inference(flattening,[status(thm)],[f6])).
% 1.62/1.32 tff(f6,plain,(
% 1.62/1.32 ~((~(t = $true) | ~(s = $true) | ~(~((q = $true) & (~((t = $true) & (s = $true)) | ~((q = $true) & (~((q = $true) & (p = $true)) | ~((t = $true) & (s = $true)))))) | ~((t = $true) & (s = $true))) | ~(q = $true)) => (~((s = $true) & (t = $true)) | ~((q = $true) & (~((t = $true) & (s = $true)) | ~((~((s = $true) & (t = $true)) | ~((~((t = $true) & (s = $true)) | ~((q = $true) & (p = $true))) & (q = $true))) & (q = $true))))))),
% 1.62/1.32 inference(fool_elimination,[status(thm)],[f5])).
% 1.62/1.32 tff(f5,plain,(
% 1.62/1.32 ~((~t | ~s | ~(~(q & (~(q & (~(q & p) | ~(t & s))) | ~(t & s))) | ~(s & t)) | ~q) => (~((~(q & (~(t & s) | ~((~(q & p) | ~(s & t)) & q))) | ~(s & t)) & q) | ~(s & t)))),
% 1.62/1.32 inference(rectify,[status(thm)],[f2])).
% 1.62/1.32 tff(f2,negated_conjecture,(
% 1.62/1.32 ~((~t | ~s | ~(~(q & (~(q & (~(q & p) | ~(t & s))) | ~(t & s))) | ~(s & t)) | ~q) => (~((~(q & (~(t & s) | ~((~(q & p) | ~(s & t)) & q))) | ~(s & t)) & q) | ~(s & t)))),
% 1.62/1.32 inference(negated_conjecture,[status(cth)],[f1])).
% 1.62/1.32 tff(f1,conjecture,(
% 1.62/1.32 (~t | ~s | ~(~(q & (~(q & (~(q & p) | ~(t & s))) | ~(t & s))) | ~(s & t)) | ~q) => (~((~(q & (~(t & s) | ~((~(q & p) | ~(s & t)) & q))) | ~(s & t)) & q) | ~(s & t))),
% 1.62/1.32 file('/export/starexec/sandbox2/tmp/tmp.JpaHDQQKc5/DTF2THF_10974.p',cDMG8)).
% 1.62/1.32 tff(f11,plain,(
% 1.62/1.32 (t = $true)),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.62/1.32 tff(f10,plain,(
% 1.62/1.32 (q = $true)),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.62/1.32 tff(f17,plain,(
% 1.62/1.32 (q != $true) | (t != $true) | (p = $true) | (s != $true) | (s != $true) | (t != $true) | (q != $true)),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.62/1.32 tff(f41,plain,(
% 1.62/1.32 (p != $true)),
% 1.62/1.32 inference(trivial_inequality_removal,[status(thm)],[f40])).
% 1.62/1.32 tff(f40,plain,(
% 1.62/1.32 (p != $true) | ($true != $true)),
% 1.62/1.32 inference(duplicate_literal_removal,[status(thm)],[f26])).
% 1.62/1.32 tff(f26,plain,(
% 1.62/1.32 (p != $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true) | ($true != $true)),
% 1.62/1.32 inference(definition_unfolding,[status(thm)],[f20,f23,f10,f11,f10,f11,f23])).
% 1.62/1.32 tff(f20,plain,(
% 1.62/1.32 (p != $true) | (s != $true) | (q != $true) | (t != $true) | (q != $true) | (t != $true) | (s != $true)),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f9])).
% 1.62/1.32 % SZS output end Proof for DTF2THF_10974
% 1.62/1.32 % (11091)------------------------------
% 1.62/1.32 % (11091)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.32 % (11091)Termination reason: Refutation
% 1.62/1.32
% 1.62/1.32 % (11091)Memory used [KB]: 5500
% 1.62/1.32 % (11091)Time elapsed: 0.002 s
% 1.62/1.32 % (11091)------------------------------
% 1.62/1.32 % (11091)------------------------------
% 1.62/1.32 % (11087)Success in time 0.005 s
%------------------------------------------------------------------------------