%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV014^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 : 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:40:03 AM UTC 2026
% Result : Theorem 1.63s 1.30s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 128 ( 54 equ; 0 cnn)
% Maximal formula atoms : 14 ( 9 avg)
% Number of connectives : 241 ( 31 ~; 18 |; 30 &; 148 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 0 ^; 69 !; 10 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > a > $o ).
thf(func_def_5,type,
sK1: a ).
thf(f20,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f18]) ).
thf(f18,plain,
$true != $true,
inference(superposition,[status(thm)],[f14,f12]) ).
thf(f12,plain,
! [X7: a] :
( ( sK0 @ X7 @ X7 )
= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X1: a,X2: a,X3: a] :
( ( ( sK0 @ X1 @ X2 )
!= $true )
| ( ( sK0 @ X2 @ X3 )
!= $true )
| ( ( sK0 @ X1 @ X3 )
= $true ) )
& ( ( sK0 @ sK1 @ sK1 )
!= $true )
& ! [X5: a,X6: a] :
( ( ( sK0 @ X6 @ X5 )
= $true )
| ( ( sK0 @ X5 @ X6 )
!= $true ) )
& ! [X7: a] :
( ( sK0 @ X7 @ X7 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > a > $o] :
( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X3 )
= $true ) )
& ? [X4: a] :
( ( X0 @ X4 @ X4 )
!= $true )
& ! [X5: a,X6: a] :
( ( ( X0 @ X6 @ X5 )
= $true )
| ( ( X0 @ X5 @ X6 )
!= $true ) )
& ! [X7: a] :
( ( X0 @ X7 @ X7 )
= $true ) )
=> ( ! [X3: a,X2: a,X1: a] :
( ( ( sK0 @ X1 @ X2 )
!= $true )
| ( ( sK0 @ X2 @ X3 )
!= $true )
| ( ( sK0 @ X1 @ X3 )
= $true ) )
& ? [X4: a] :
( ( sK0 @ X4 @ X4 )
!= $true )
& ! [X6: a,X5: a] :
( ( ( sK0 @ X6 @ X5 )
= $true )
| ( ( sK0 @ X5 @ X6 )
!= $true ) )
& ! [X7: a] :
( ( sK0 @ X7 @ X7 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X4: a] :
( ( sK0 @ X4 @ X4 )
!= $true )
=> ( ( sK0 @ sK1 @ sK1 )
!= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: a > a > $o] :
( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X3 )
= $true ) )
& ? [X4: a] :
( ( X0 @ X4 @ X4 )
!= $true )
& ! [X5: a,X6: a] :
( ( ( X0 @ X6 @ X5 )
= $true )
| ( ( X0 @ X5 @ X6 )
!= $true ) )
& ! [X7: a] :
( ( X0 @ X7 @ X7 )
= $true ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X0: a > a > $o] :
( ! [X3: a,X1: a,X2: a] :
( ( ( X0 @ X3 @ X1 )
!= $true )
| ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X3 @ X2 )
= $true ) )
& ? [X7: a] :
( ( X0 @ X7 @ X7 )
!= $true )
& ! [X6: a,X5: a] :
( ( ( X0 @ X5 @ X6 )
= $true )
| ( ( X0 @ X6 @ X5 )
!= $true ) )
& ! [X4: a] :
( ( X0 @ X4 @ X4 )
= $true ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > a > $o] :
( ? [X7: a] :
( ( X0 @ X7 @ X7 )
!= $true )
& ! [X4: a] :
( ( X0 @ X4 @ X4 )
= $true )
& ! [X6: a,X5: a] :
( ( ( X0 @ X5 @ X6 )
= $true )
| ( ( X0 @ X6 @ X5 )
!= $true ) )
& ! [X1: a,X3: a,X2: a] :
( ( ( X0 @ X3 @ X2 )
= $true )
| ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X3 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o] :
( ( ! [X4: a] :
( ( X0 @ X4 @ X4 )
= $true )
& ! [X6: a,X5: a] :
( ( ( X0 @ X6 @ X5 )
= $true )
=> ( ( X0 @ X5 @ X6 )
= $true ) )
& ! [X1: a,X3: a,X2: a] :
( ( ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
= $true ) )
=> ( ( X0 @ X3 @ X2 )
= $true ) ) )
=> ! [X7: a] :
( ( X0 @ X7 @ X7 )
= $true ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X2 )
& ( X0 @ X3 @ X1 ) )
=> ( X0 @ X3 @ X2 ) )
& ! [X4: a] : ( X0 @ X4 @ X4 )
& ! [X5: a,X6: a] :
( ( X0 @ X6 @ X5 )
=> ( X0 @ X5 @ X6 ) ) )
=> ! [X7: a] : ( X0 @ X7 @ X7 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o] :
( ( ! [X2: a,X3: a,X1: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) )
& ! [X1: a] : ( X0 @ X1 @ X1 )
& ! [X2: a,X1: a] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) ) )
=> ! [X1: a] : ( X0 @ X1 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o] :
( ( ! [X2: a,X3: a,X1: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) )
& ! [X1: a] : ( X0 @ X1 @ X1 )
& ! [X2: a,X1: a] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) ) )
=> ! [X1: a] : ( X0 @ X1 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.QEFQZMckx0/DTF2THF_6941.p',cTHM513_pme) ).
thf(f14,plain,
( ( sK0 @ sK1 @ sK1 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV014^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 : n015.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:38:46 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.28/0.46 ---- Original DTF file ---
% 0.28/0.46 thf(spec,logic,$$dhol).
% 0.28/0.46 %------------------------------------------------------------------------------
% 0.28/0.46 % File : SEV014^5 : TPTP v9.2.1. Released v4.0.0.
% 0.28/0.46 % Domain : Set Theory (Relations)
% 0.28/0.46 % Problem : TPS problem from EQUIVALENCE-RELATIONS-THMS
% 0.28/0.46 % Version : Especial.
% 0.28/0.46 % English :
% 0.28/0.46
% 0.28/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.28/0.46 % Source : [Bro09]
% 0.28/0.46 % Names : tps_0911 [Bro09]
% 0.28/0.46
% 0.28/0.46 % Status : Theorem
% 0.28/0.46 % Rating : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.28/0.46 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.28/0.46 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.28/0.46 % Maximal formula atoms : 0 ( 0 avg)
% 0.28/0.46 % Number of connectives : 20 ( 0 ~; 0 |; 3 &; 14 @)
% 0.28/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.28/0.46 % Maximal formula depth : 12 ( 12 avg)
% 0.28/0.46 % Number of types : 2 ( 1 usr)
% 0.28/0.46 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.28/0.46 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.28/0.46 % Number of variables : 8 ( 0 ^; 8 !; 0 ?; 8 :)
% 0.28/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.28/0.46
% 0.28/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.28/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.28/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.28/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.28/0.46 %------------------------------------------------------------------------------
% 0.28/0.46 thf(a_type,type,
% 0.28/0.46 a: $tType ).
% 0.28/0.46
% 0.28/0.46 thf(cTHM513_pme,conjecture,
% 0.28/0.46 ! [Xr: a > a > $o] :
% 0.28/0.46 ( ( ! [Xx: a] : ( Xr @ Xx @ Xx )
% 0.28/0.46 & ! [Xx: a,Xy: a] :
% 0.28/0.46 ( ( Xr @ Xx @ Xy )
% 0.28/0.46 => ( Xr @ Xy @ Xx ) )
% 0.28/0.46 & ! [Xx: a,Xy: a,Xz: a] :
% 0.28/0.46 ( ( ( Xr @ Xx @ Xy )
% 0.28/0.46 & ( Xr @ Xy @ Xz ) )
% 0.28/0.46 => ( Xr @ Xx @ Xz ) ) )
% 0.28/0.46 => ! [Xx: a] : ( Xr @ Xx @ Xx ) ) ).
% 0.28/0.46
% 0.28/0.46 %------------------------------------------------------------------------------
% 0.28/0.46 ------------------------
% 1.46/1.27 ---- Embedded in THF ---
% 1.46/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.27 %%% Generated on Tue Feb 24 12:38:47 EST 2026
% 1.46/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.27 %%% Logic specification used:
% 1.46/1.27 %%% thf(spec, logic, $$dhol).
% 1.46/1.27
% 1.46/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.QEFQZMckx0/DTF2DTF6941.p
% See solution above
% 1.46/1.27 ------------------------
% 1.46/1.28 ---- Cleaned THF ---
% 1.46/1.28 thf(a_type,type,
% 1.46/1.28 a: $tType ).
% 1.46/1.28
% 1.46/1.28 thf(cTHM513_pme,conjecture,
% 1.46/1.28 ! [Xr: a > a > $o] :
% 1.46/1.28 ( ( ! [Xx: a] : ( Xr @ Xx @ Xx )
% 1.46/1.28 & ! [Xx: a,Xy: a] :
% 1.46/1.28 ( ( Xr @ Xx @ Xy )
% 1.46/1.28 => ( Xr @ Xy @ Xx ) )
% 1.46/1.28 & ! [Xx: a,Xy: a,Xz: a] :
% 1.46/1.28 ( ( ( Xr @ Xx @ Xy )
% 1.46/1.28 & ( Xr @ Xy @ Xz ) )
% 1.46/1.28 => ( Xr @ Xx @ Xz ) ) )
% 1.46/1.28 => ! [Xx: a] : ( Xr @ Xx @ Xx ) ) ).
% 1.46/1.28 ------------------------
% 1.63/1.30 % (7216)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_6941 for (2999ds/4Mi)
% 1.63/1.30 % (7215)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_6941 for (2999ds/183Mi)
% 1.63/1.30 % (7216)First to succeed.
% 1.63/1.30 % (7215)Also succeeded, but the first one will report.
% 1.63/1.30 % (7216)Refutation found. Thanks to Tanya!
% 1.63/1.30 % SZS status Theorem for DTF2THF_6941
% 1.63/1.30 % SZS output start Proof for DTF2THF_6941
% 1.63/1.30 thf(type_def_5, type, a: $tType).
% 1.63/1.30 thf(func_def_0, type, a: $tType).
% 1.63/1.30 thf(func_def_4, type, sK0: a > a > $o).
% 1.63/1.30 thf(func_def_5, type, sK1: a).
% 1.63/1.30 thf(f20,plain,(
% 1.63/1.30 $false),
% 1.63/1.30 inference(trivial_inequality_removal,[status(thm)],[f18])).
% 1.63/1.30 thf(f18,plain,(
% 1.63/1.30 ($true != $true)),
% 1.63/1.30 inference(superposition,[status(thm)],[f14,f12])).
% 1.63/1.30 thf(f12,plain,(
% 1.63/1.30 ( ! [X7 : a] : (((sK0 @ X7 @ X7) = $true)) )),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f11])).
% 1.63/1.30 thf(f11,plain,(
% 1.63/1.30 ! [X1 : a,X2 : a,X3 : a] : (((sK0 @ X1 @ X2) != $true) | ((sK0 @ X2 @ X3) != $true) | ((sK0 @ X1 @ X3) = $true)) & ((sK0 @ sK1 @ sK1) != $true) & ! [X5 : a,X6 : a] : (((sK0 @ X6 @ X5) = $true) | ((sK0 @ X5 @ X6) != $true)) & ! [X7 : a] : ((sK0 @ X7 @ X7) = $true)),
% 1.63/1.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9])).
% 1.63/1.30 thf(f9,plain,(
% 1.63/1.30 ? [X0 : a > a > $o] : (! [X1 : a,X2 : a,X3 : a] : (((X0 @ X1 @ X2) != $true) | ((X0 @ X2 @ X3) != $true) | ((X0 @ X1 @ X3) = $true)) & ? [X4 : a] : ((X0 @ X4 @ X4) != $true) & ! [X5 : a,X6 : a] : (((X0 @ X6 @ X5) = $true) | ((X0 @ X5 @ X6) != $true)) & ! [X7 : a] : ((X0 @ X7 @ X7) = $true)) => (! [X3 : a,X2 : a,X1 : a] : (((sK0 @ X1 @ X2) != $true) | ((sK0 @ X2 @ X3) != $true) | ((sK0 @ X1 @ X3) = $true)) & ? [X4 : a] : ((sK0 @ X4 @ X4) != $true) & ! [X6 : a,X5 : a] : (((sK0 @ X6 @ X5) = $true) | ((sK0 @ X5 @ X6) != $true)) & ! [X7 : a] : ((sK0 @ X7 @ X7) = $true))),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f10,plain,(
% 1.63/1.30 ? [X4 : a] : ((sK0 @ X4 @ X4) != $true) => ((sK0 @ sK1 @ sK1) != $true)),
% 1.63/1.30 introduced(definition,[],[choice_axiom])).
% 1.63/1.30 thf(f8,plain,(
% 1.63/1.30 ? [X0 : a > a > $o] : (! [X1 : a,X2 : a,X3 : a] : (((X0 @ X1 @ X2) != $true) | ((X0 @ X2 @ X3) != $true) | ((X0 @ X1 @ X3) = $true)) & ? [X4 : a] : ((X0 @ X4 @ X4) != $true) & ! [X5 : a,X6 : a] : (((X0 @ X6 @ X5) = $true) | ((X0 @ X5 @ X6) != $true)) & ! [X7 : a] : ((X0 @ X7 @ X7) = $true))),
% 1.63/1.30 inference(rectify,[status(thm)],[f7])).
% 1.63/1.30 thf(f7,plain,(
% 1.63/1.30 ? [X0 : a > a > $o] : (! [X3 : a,X1 : a,X2 : a] : (((X0 @ X3 @ X1) != $true) | ((X0 @ X1 @ X2) != $true) | ((X0 @ X3 @ X2) = $true)) & ? [X7 : a] : ((X0 @ X7 @ X7) != $true) & ! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) = $true) | ((X0 @ X6 @ X5) != $true)) & ! [X4 : a] : ((X0 @ X4 @ X4) = $true))),
% 1.63/1.30 inference(flattening,[status(thm)],[f6])).
% 1.63/1.30 thf(f6,plain,(
% 1.63/1.30 ? [X0 : a > a > $o] : (? [X7 : a] : ((X0 @ X7 @ X7) != $true) & (! [X4 : a] : ((X0 @ X4 @ X4) = $true) & ! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) = $true) | ((X0 @ X6 @ X5) != $true)) & ! [X1 : a,X3 : a,X2 : a] : (((X0 @ X3 @ X2) = $true) | (((X0 @ X1 @ X2) != $true) | ((X0 @ X3 @ X1) != $true)))))),
% 1.63/1.30 inference(ennf_transformation,[status(thm)],[f5])).
% 1.63/1.30 thf(f5,plain,(
% 1.63/1.30 ~! [X0 : a > a > $o] : ((! [X4 : a] : ((X0 @ X4 @ X4) = $true) & ! [X6 : a,X5 : a] : (((X0 @ X6 @ X5) = $true) => ((X0 @ X5 @ X6) = $true)) & ! [X1 : a,X3 : a,X2 : a] : ((((X0 @ X1 @ X2) = $true) & ((X0 @ X3 @ X1) = $true)) => ((X0 @ X3 @ X2) = $true))) => ! [X7 : a] : ((X0 @ X7 @ X7) = $true))),
% 1.63/1.30 inference(fool_elimination,[status(thm)],[f4])).
% 1.63/1.30 thf(f4,plain,(
% 1.63/1.30 ~! [X0 : a > a > $o] : ((! [X1 : a,X2 : a,X3 : a] : (((X0 @ X1 @ X2) & (X0 @ X3 @ X1)) => (X0 @ X3 @ X2)) & ! [X4 : a] : (X0 @ X4 @ X4) & ! [X5 : a,X6 : a] : ((X0 @ X6 @ X5) => (X0 @ X5 @ X6))) => ! [X7 : a] : (X0 @ X7 @ X7))),
% 1.63/1.30 inference(rectify,[status(thm)],[f2])).
% 1.63/1.30 thf(f2,negated_conjecture,(
% 1.63/1.30 ~! [X0 : a > a > $o] : ((! [X2 : a,X3 : a,X1 : a] : (((X0 @ X2 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X1 @ X3)) & ! [X1 : a] : (X0 @ X1 @ X1) & ! [X2 : a,X1 : a] : ((X0 @ X1 @ X2) => (X0 @ X2 @ X1))) => ! [X1 : a] : (X0 @ X1 @ X1))),
% 1.63/1.30 inference(negated_conjecture,[status(cth)],[f1])).
% 1.63/1.30 thf(f1,conjecture,(
% 1.63/1.30 ! [X0 : a > a > $o] : ((! [X2 : a,X3 : a,X1 : a] : (((X0 @ X2 @ X3) & (X0 @ X1 @ X2)) => (X0 @ X1 @ X3)) & ! [X1 : a] : (X0 @ X1 @ X1) & ! [X2 : a,X1 : a] : ((X0 @ X1 @ X2) => (X0 @ X2 @ X1))) => ! [X1 : a] : (X0 @ X1 @ X1))),
% 1.63/1.30 file('/export/starexec/sandbox/tmp/tmp.QEFQZMckx0/DTF2THF_6941.p',cTHM513_pme)).
% 1.63/1.30 thf(f14,plain,(
% 1.63/1.30 ((sK0 @ sK1 @ sK1) != $true)),
% 1.63/1.30 inference(cnf_transformation,[status(thm)],[f11])).
% 1.63/1.30 % SZS output end Proof for DTF2THF_6941
% 1.63/1.30 % (7216)------------------------------
% 1.63/1.30 % (7216)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.30 % (7216)Termination reason: Refutation
% 1.63/1.30
% 1.63/1.30 % (7216)Memory used [KB]: 5500
% 1.63/1.30 % (7216)Time elapsed: 0.002 s
% 1.63/1.30 % (7216)Instructions burned: 2 (million)
% 1.63/1.30 % (7216)------------------------------
% 1.63/1.30 % (7216)------------------------------
% 1.63/1.30 % (7214)Success in time 0.012 s
%------------------------------------------------------------------------------