%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO143^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:53:29 AM UTC 2026
% Result : Theorem 1.55s 1.34s
% Output : Refutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 3 unt; 0 typ; 3 def)
% Number of atoms : 136 ( 33 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 117 ( 28 ~; 18 |; 8 &; 50 @)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 ^; 18 !; 18 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
cQ: $i > $o ).
thf(func_def_1,type,
cP: $i > $o ).
thf(func_def_5,type,
sK0: $i > $i ).
thf(f30,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f21,f25,f27,f29]) ).
thf(f29,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[status(thm)],[f28]) ).
thf(f28,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[status(thm)],[f17,f13]) ).
thf(f13,plain,
! [X0: $i] :
( ( cQ @ X0 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
( ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
& ( ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
& ( ( cP @ ( sK0 @ X1 ) )
!= $true ) )
| ( ( cQ @ sK1 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
thf(f8,plain,
! [X1: $i] :
( ? [X2: $i] :
( ( ( cP @ X1 )
= $true )
& ( ( cP @ X2 )
!= $true ) )
=> ( ( ( cP @ X1 )
= $true )
& ( ( cP @ ( sK0 @ X1 ) )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ? [X3: $i] :
( $true
= ( cQ @ X3 ) )
=> ( ( cQ @ sK1 )
= $true ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f7,plain,
( ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
& ( ! [X1: $i] :
? [X2: $i] :
( ( ( cP @ X1 )
= $true )
& ( ( cP @ X2 )
!= $true ) )
| ? [X3: $i] :
( $true
= ( cQ @ X3 ) ) ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,plain,
( ! [X3: $i] :
( $true
!= ( cQ @ X3 ) )
& ( ! [X1: $i] :
? [X2: $i] :
( ( ( cP @ X1 )
= $true )
& ( ( cP @ X2 )
!= $true ) )
| ? [X0: $i] :
( ( cQ @ X0 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ~ ? [X1: $i] :
! [X2: $i] :
( ( ( cP @ X1 )
= $true )
=> ( ( cP @ X2 )
= $true ) )
| ? [X0: $i] :
( ( cQ @ X0 )
= $true ) )
=> ? [X3: $i] :
( $true
= ( cQ @ X3 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ? [X0: $i] : ( cQ @ X0 )
| ~ ? [X1: $i] :
! [X2: $i] :
( ( cP @ X1 )
=> ( cP @ X2 ) ) )
=> ? [X3: $i] : ( cQ @ X3 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ? [X2: $i] : ( cQ @ X2 )
| ~ ? [X0: $i] :
! [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ) )
=> ? [X2: $i] : ( cQ @ X2 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ? [X2: $i] : ( cQ @ X2 )
| ~ ? [X0: $i] :
! [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ) )
=> ? [X2: $i] : ( cQ @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.l1hMlIjERv/DTF2THF_26934.p',cDUP_BUG_1) ).
thf(f17,plain,
( ( ( cQ @ sK1 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f15]) ).
thf(f15,definition,
( spl2_1
<=> ( ( cQ @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition]) ).
thf(f27,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f26]) ).
thf(f26,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(subsumption_resolution,[status(thm)],[f24,f20]) ).
thf(f20,plain,
( ! [X1: $i] :
( ( cP @ X1 )
= $true )
| ~ spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f19]) ).
thf(f19,definition,
( spl2_2
<=> ! [X1: $i] :
( ( cP @ X1 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition]) ).
thf(f24,plain,
( ! [X1: $i] :
( ( cP @ ( sK0 @ X1 ) )
!= $true )
| ~ spl2_3 ),
inference(avatar_component_clause,[status(thm)],[f23]) ).
thf(f23,definition,
( spl2_3
<=> ! [X1: $i] :
( ( cP @ ( sK0 @ X1 ) )
!= $true ) ),
introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition]) ).
thf(f25,plain,
( spl2_1
| spl2_3 ),
inference(avatar_split_clause,[status(thm)],[f11,f23,f15]) ).
thf(f11,plain,
! [X1: $i] :
( ( ( cQ @ sK1 )
= $true )
| ( ( cP @ ( sK0 @ X1 ) )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f21,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f12,f19,f15]) ).
thf(f12,plain,
! [X1: $i] :
( ( ( cQ @ sK1 )
= $true )
| ( ( cP @ X1 )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO143^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.30 % Computer : n015.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Feb 24 14:27:16 EST 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.39 ---- Original DTF file ---
% 0.17/0.39 thf(spec,logic,$$dhol).
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 % File : SYO143^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.39 % Domain : Syntactic
% 0.17/0.39 % Problem : TPS problem from BASIC-FO-THMS
% 0.17/0.39 % Version : Especial.
% 0.17/0.39 % English :
% 0.17/0.39
% 0.17/0.39 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.39 % Source : [Bro09]
% 0.17/0.39 % Names : tps_0776 [Bro09]
% 0.17/0.39
% 0.17/0.39 % Status : Theorem
% 0.17/0.39 % Rating : 0.17 v9.1.0, 0.12 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.17/0.39 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.17/0.39 % Number of atoms : 4 ( 0 equ; 0 cnn)
% 0.17/0.39 % Maximal formula atoms : 4 ( 4 avg)
% 0.17/0.39 % Number of connectives : 8 ( 1 ~; 1 |; 0 &; 4 @)
% 0.17/0.39 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.17/0.39 % Maximal formula depth : 8 ( 8 avg)
% 0.17/0.39 % Number of types : 2 ( 0 usr)
% 0.17/0.39 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.17/0.39 % Number of symbols : 2 ( 2 usr; 0 con; 1-1 aty)
% 0.17/0.39 % Number of variables : 4 ( 0 ^; 1 !; 3 ?; 4 :)
% 0.17/0.39 % SPC : TH0_THM_NEQ_NAR
% 0.17/0.39
% 0.17/0.39 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.39 % project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.39 % Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.39 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 thf(cQ,type,
% 0.17/0.39 cQ: $i > $o ).
% 0.17/0.39
% 0.17/0.39 thf(cP,type,
% 0.17/0.39 cP: $i > $o ).
% 0.17/0.39
% 0.17/0.39 thf(cDUP_BUG_1,conjecture,
% 0.17/0.39 ( ( ~ ? [Xy: $i] :
% 0.17/0.39 ! [Xx: $i] :
% 0.17/0.39 ( ( cP @ Xy )
% 0.17/0.39 => ( cP @ Xx ) )
% 0.17/0.39 | ? [Xz: $i] : ( cQ @ Xz ) )
% 0.17/0.39 => ? [Xz: $i] : ( cQ @ Xz ) ) ).
% 0.17/0.39
% 0.17/0.39 %------------------------------------------------------------------------------
% 0.17/0.39 ------------------------
% 1.55/1.31 ---- Embedded in THF ---
% 1.55/1.31 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.55/1.31 %%% Generated on Tue Feb 24 14:27:17 EST 2026
% 1.55/1.31 %%% using '$$dhol' embedding, version 1.3.0.
% 1.55/1.31 %%% Logic specification used:
% 1.55/1.31 %%% thf(spec, logic, $$dhol).
% 1.55/1.31
% 1.55/1.31 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.l1hMlIjERv/DTF2DTF26934.p
% See solution above
% 1.55/1.31 ------------------------
% 1.55/1.32 ---- Cleaned THF ---
% 1.55/1.32 thf(cQ,type,
% 1.55/1.32 cQ: $i > $o ).
% 1.55/1.32
% 1.55/1.32 thf(cP,type,
% 1.55/1.32 cP: $i > $o ).
% 1.55/1.32
% 1.55/1.32 thf(cDUP_BUG_1,conjecture,
% 1.55/1.32 ( ( ~ ? [Xy: $i] :
% 1.55/1.32 ! [Xx: $i] :
% 1.55/1.32 ( ( cP @ Xy )
% 1.55/1.32 => ( cP @ Xx ) )
% 1.55/1.32 | ? [Xz: $i] : ( cQ @ Xz ) )
% 1.55/1.32 => ? [Xz: $i] : ( cQ @ Xz ) ) ).
% 1.55/1.32 ------------------------
% 1.55/1.34 % (27032)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_26934 for (3000ds/4Mi)
% 1.55/1.34 % (27033)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_26934 for (3000ds/27Mi)
% 1.55/1.34 % (27037)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_26934 for (3000ds/18Mi)
% 1.55/1.34 % (27036)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_26934 for (3000ds/275Mi)
% 1.55/1.34 % (27031)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_26934 for (3000ds/183Mi)
% 1.55/1.34 % (27035)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_26934 for (3000ds/2Mi)
% 1.55/1.34 % (27034)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_26934 for (3000ds/2Mi)
% 1.55/1.34 % (27035)Instruction limit reached!
% 1.55/1.34 % (27035)------------------------------
% 1.55/1.34 % (27035)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.34 % (27035)Termination reason: Unknown
% 1.55/1.34 % (27035)Termination phase: Saturation
% 1.55/1.34
% 1.55/1.34 % (27035)Memory used [KB]: 5500
% 1.55/1.34 % (27035)Time elapsed: 0.003 s
% 1.55/1.34 % (27035)Instructions burned: 2 (million)
% 1.55/1.34 % (27035)------------------------------
% 1.55/1.34 % (27035)------------------------------
% 1.55/1.34 % (27036)First to succeed.
% 1.55/1.34 % (27037)Also succeeded, but the first one will report.
% 1.55/1.34 % (27031)Also succeeded, but the first one will report.
% 1.55/1.34 % (27036)Refutation found. Thanks to Tanya!
% 1.55/1.34 % SZS status Theorem for DTF2THF_26934
% 1.55/1.34 % SZS output start Proof for DTF2THF_26934
% 1.55/1.34 thf(func_def_0, type, cQ: $i > $o).
% 1.55/1.34 thf(func_def_1, type, cP: $i > $o).
% 1.55/1.34 thf(func_def_5, type, sK0: $i > $i).
% 1.55/1.34 thf(f30,plain,(
% 1.55/1.34 $false),
% 1.55/1.34 inference(avatar_sat_refutation,[status(thm)],[f21,f25,f27,f29])).
% 1.55/1.34 thf(f29,plain,(
% 1.55/1.34 ~spl2_1),
% 1.55/1.34 inference(avatar_contradiction_clause,[status(thm)],[f28])).
% 1.55/1.34 thf(f28,plain,(
% 1.55/1.34 $false | ~spl2_1),
% 1.55/1.34 inference(subsumption_resolution,[status(thm)],[f17,f13])).
% 1.55/1.34 thf(f13,plain,(
% 1.55/1.34 ( ! [X0 : $i] : (((cQ @ X0) != $true)) )),
% 1.55/1.34 inference(cnf_transformation,[status(thm)],[f10])).
% 1.55/1.34 thf(f10,plain,(
% 1.55/1.34 ! [X0 : $i] : ((cQ @ X0) != $true) & (! [X1 : $i] : (((cP @ X1) = $true) & ((cP @ (sK0 @ X1)) != $true)) | ((cQ @ sK1) = $true))),
% 1.55/1.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8])).
% 1.55/1.34 thf(f8,plain,(
% 1.55/1.34 ! [X1 : $i] : (? [X2 : $i] : (((cP @ X1) = $true) & ((cP @ X2) != $true)) => (((cP @ X1) = $true) & ((cP @ (sK0 @ X1)) != $true)))),
% 1.55/1.34 introduced(definition,[],[choice_axiom])).
% 1.55/1.34 thf(f9,plain,(
% 1.55/1.34 ? [X3 : $i] : ($true = (cQ @ X3)) => ((cQ @ sK1) = $true)),
% 1.55/1.34 introduced(definition,[],[choice_axiom])).
% 1.55/1.34 thf(f7,plain,(
% 1.55/1.34 ! [X0 : $i] : ((cQ @ X0) != $true) & (! [X1 : $i] : ? [X2 : $i] : (((cP @ X1) = $true) & ((cP @ X2) != $true)) | ? [X3 : $i] : ($true = (cQ @ X3)))),
% 1.55/1.34 inference(rectify,[status(thm)],[f6])).
% 1.55/1.34 thf(f6,plain,(
% 1.55/1.34 ! [X3 : $i] : ($true != (cQ @ X3)) & (! [X1 : $i] : ? [X2 : $i] : (((cP @ X1) = $true) & ((cP @ X2) != $true)) | ? [X0 : $i] : ((cQ @ X0) = $true))),
% 1.55/1.34 inference(ennf_transformation,[status(thm)],[f5])).
% 1.55/1.34 thf(f5,plain,(
% 1.55/1.34 ~((~? [X1 : $i] : ! [X2 : $i] : (((cP @ X1) = $true) => ((cP @ X2) = $true)) | ? [X0 : $i] : ((cQ @ X0) = $true)) => ? [X3 : $i] : ($true = (cQ @ X3)))),
% 1.55/1.34 inference(fool_elimination,[status(thm)],[f4])).
% 1.55/1.34 thf(f4,plain,(
% 1.55/1.34 ~((? [X0 : $i] : (cQ @ X0) | ~? [X1 : $i] : ! [X2 : $i] : ((cP @ X1) => (cP @ X2))) => ? [X3 : $i] : (cQ @ X3))),
% 1.55/1.34 inference(rectify,[status(thm)],[f2])).
% 1.55/1.34 thf(f2,negated_conjecture,(
% 1.55/1.34 ~((? [X2 : $i] : (cQ @ X2) | ~? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1))) => ? [X2 : $i] : (cQ @ X2))),
% 1.55/1.34 inference(negated_conjecture,[status(cth)],[f1])).
% 1.55/1.34 thf(f1,conjecture,(
% 1.55/1.34 (? [X2 : $i] : (cQ @ X2) | ~? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1))) => ? [X2 : $i] : (cQ @ X2)),
% 1.55/1.34 file('/export/starexec/sandbox/tmp/tmp.l1hMlIjERv/DTF2THF_26934.p',cDUP_BUG_1)).
% 1.55/1.34 thf(f17,plain,(
% 1.55/1.34 ((cQ @ sK1) = $true) | ~spl2_1),
% 1.55/1.34 inference(avatar_component_clause,[status(thm)],[f15])).
% 1.55/1.34 thf(f15,definition,(
% 1.55/1.34 spl2_1 <=> ((cQ @ sK1) = $true)),
% 1.55/1.34 introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition])).
% 1.55/1.34 thf(f27,plain,(
% 1.55/1.34 ~spl2_2 | ~spl2_3),
% 1.55/1.34 inference(avatar_contradiction_clause,[status(thm)],[f26])).
% 1.55/1.34 thf(f26,plain,(
% 1.55/1.34 $false | (~spl2_2 | ~spl2_3)),
% 1.55/1.34 inference(subsumption_resolution,[status(thm)],[f24,f20])).
% 1.55/1.34 thf(f20,plain,(
% 1.55/1.34 ( ! [X1 : $i] : (((cP @ X1) = $true)) ) | ~spl2_2),
% 1.55/1.34 inference(avatar_component_clause,[status(thm)],[f19])).
% 1.55/1.34 thf(f19,definition,(
% 1.55/1.34 spl2_2 <=> ! [X1 : $i] : ((cP @ X1) = $true)),
% 1.55/1.34 introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition])).
% 1.55/1.34 thf(f24,plain,(
% 1.55/1.34 ( ! [X1 : $i] : (((cP @ (sK0 @ X1)) != $true)) ) | ~spl2_3),
% 1.55/1.34 inference(avatar_component_clause,[status(thm)],[f23])).
% 1.55/1.34 thf(f23,definition,(
% 1.55/1.34 spl2_3 <=> ! [X1 : $i] : ((cP @ (sK0 @ X1)) != $true)),
% 1.55/1.34 introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition])).
% 1.55/1.34 thf(f25,plain,(
% 1.55/1.34 spl2_1 | spl2_3),
% 1.55/1.34 inference(avatar_split_clause,[status(thm)],[f11,f23,f15])).
% 1.55/1.34 thf(f11,plain,(
% 1.55/1.34 ( ! [X1 : $i] : (((cQ @ sK1) = $true) | ((cP @ (sK0 @ X1)) != $true)) )),
% 1.55/1.34 inference(cnf_transformation,[status(thm)],[f10])).
% 1.55/1.34 thf(f21,plain,(
% 1.55/1.34 spl2_1 | spl2_2),
% 1.55/1.34 inference(avatar_split_clause,[status(thm)],[f12,f19,f15])).
% 1.55/1.34 thf(f12,plain,(
% 1.55/1.34 ( ! [X1 : $i] : (((cQ @ sK1) = $true) | ((cP @ X1) = $true)) )),
% 1.55/1.34 inference(cnf_transformation,[status(thm)],[f10])).
% 1.55/1.34 % SZS output end Proof for DTF2THF_26934
% 1.55/1.34 % (27036)------------------------------
% 1.55/1.34 % (27036)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.34 % (27036)Termination reason: Refutation
% 1.55/1.34
% 1.55/1.34 % (27036)Memory used [KB]: 5500
% 1.55/1.34 % (27036)Time elapsed: 0.003 s
% 1.55/1.34 % (27036)Instructions burned: 2 (million)
% 1.55/1.34 % (27036)------------------------------
% 1.55/1.34 % (27036)------------------------------
% 1.55/1.34 % (27030)Success in time 0.018 s
%------------------------------------------------------------------------------