%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SWV447^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n020.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:45:21 AM UTC 2026
% Result : Theorem 1.48s 1.29s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 17 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 112 ( 10 ~; 0 |; 0 &; 101 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 10 ^; 17 !; 2 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cons: $i > $i > $i ).
thf(func_def_2,type,
map: ( $i > $i ) > $i > $i ).
thf(func_def_10,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f23,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f22]) ).
thf(f22,plain,
( ( cons @ sK0 @ nil )
!= ( cons @ sK0 @ nil ) ),
inference(beta_eta_normalization,[status(thm)],[f19]) ).
thf(f19,plain,
( ( cons
@ ( ^ [Y0: $i] : Y0
@ sK0 )
@ nil )
!= ( cons @ sK0 @ nil ) ),
inference(superposition,[status(thm)],[f14,f15]) ).
thf(f15,plain,
! [X0: $i > $i,X1: $i] :
( ( cons @ ( X0 @ X1 ) @ nil )
= ( map @ X0 @ ( cons @ X1 @ nil ) ) ),
inference(superposition,[status(thm)],[f12,f13]) ).
thf(f13,plain,
! [X0: $i > $i] :
( nil
= ( map @ X0 @ nil ) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
thf(f1,axiom,
! [X0: $i > $i] :
( nil
= ( map @ X0 @ nil ) ),
file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',ax1) ).
thf(f12,plain,
! [X2: $i,X0: $i > $i,X1: $i] :
( ( cons @ ( X0 @ X2 ) @ ( map @ X0 @ X1 ) )
= ( map @ X0 @ ( cons @ X2 @ X1 ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: $i > $i,X1: $i,X2: $i] :
( ( cons @ ( X0 @ X2 ) @ ( map @ X0 @ X1 ) )
= ( map @ X0 @ ( cons @ X2 @ X1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X0: $i > $i,X2: $i,X1: $i] :
( ( map @ X0 @ ( cons @ X1 @ X2 ) )
= ( cons @ ( X0 @ X1 ) @ ( map @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',ax2) ).
thf(f14,plain,
( ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ sK0 @ nil ) )
!= ( cons @ sK0 @ nil ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ sK0 @ nil ) )
!= ( cons @ sK0 @ nil ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: $i] :
( ( cons @ X0 @ nil )
!= ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ X0 @ nil ) ) )
=> ( ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ sK0 @ nil ) )
!= ( cons @ sK0 @ nil ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
? [X0: $i] :
( ( cons @ X0 @ nil )
!= ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ X0 @ nil ) ) ),
inference(ennf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
~ ! [X0: $i] :
( ( cons @ X0 @ nil )
= ( map
@ ^ [Y0: $i] : Y0
@ ( cons @ X0 @ nil ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: $i] :
( ( cons @ X0 @ nil )
= ( map
@ ^ [X1: $i] : X1
@ ( cons @ X0 @ nil ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X3: $i] :
( ( cons @ X3 @ nil )
= ( map
@ ^ [X1: $i] : X1
@ ( cons @ X3 @ nil ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
! [X3: $i] :
( ( cons @ X3 @ nil )
= ( map
@ ^ [X1: $i] : X1
@ ( cons @ X3 @ nil ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',test) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV447^1 : TPTP v9.2.1. Released v3.7.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n020.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 13:23:57 EST 2026
% 0.16/0.35 % CPUTime :
% 0.16/0.35 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.47 ---- Original DTF file ---
% 0.32/0.47 thf(spec,logic,$$dhol).
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 % File : SWV447^1 : TPTP v9.2.1. Released v3.7.0.
% 0.32/0.47 % Domain : Software Verification
% 0.32/0.47 % Problem : Nipkow's simple map-cons problem
% 0.32/0.47 % Version : Especial.
% 0.32/0.47 % English :
% 0.32/0.47
% 0.32/0.47 % Refs :
% 0.32/0.47 % Source : [TPTP]
% 0.32/0.47 % Names :
% 0.32/0.47
% 0.32/0.47 % Status : Theorem
% 0.32/0.47 % Rating : 0.00 v8.2.0, 0.15 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.33 v5.4.0, 0.40 v5.3.0, 0.60 v5.2.0, 0.40 v5.1.0, 0.20 v5.0.0, 0.40 v4.1.0, 0.33 v3.7.0
% 0.32/0.47 % Syntax : Number of formulae : 6 ( 3 unt; 3 typ; 0 def)
% 0.32/0.47 % Number of atoms : 3 ( 3 equ; 0 cnn)
% 0.32/0.47 % Maximal formula atoms : 1 ( 1 avg)
% 0.32/0.47 % Number of connectives : 17 ( 0 ~; 0 |; 0 &; 17 @)
% 0.32/0.47 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.32/0.47 % Maximal formula depth : 4 ( 3 avg)
% 0.32/0.47 % Number of types : 1 ( 0 usr)
% 0.32/0.47 % Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% 0.32/0.47 % Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% 0.32/0.47 % Number of variables : 6 ( 1 ^; 5 !; 0 ?; 6 :)
% 0.32/0.47 % SPC : TH0_THM_EQU_NAR
% 0.32/0.47
% 0.32/0.47 % Comments :
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 thf(nil_type,type,
% 0.32/0.47 nil: $i ).
% 0.32/0.47
% 0.32/0.47 thf(cons_type,type,
% 0.32/0.47 cons: $i > $i > $i ).
% 0.32/0.47
% 0.32/0.47 thf(map_type,type,
% 0.32/0.47 map: ( $i > $i ) > $i > $i ).
% 0.32/0.47
% 0.32/0.47 thf(ax1,axiom,
% 0.32/0.47 ! [F: $i > $i] :
% 0.32/0.47 ( ( map @ F @ nil )
% 0.32/0.47 = nil ) ).
% 0.32/0.47
% 0.32/0.47 thf(ax2,axiom,
% 0.32/0.47 ! [F: $i > $i,X: $i,Y: $i] :
% 0.32/0.47 ( ( map @ F @ ( cons @ X @ Y ) )
% 0.32/0.47 = ( cons @ ( F @ X ) @ ( map @ F @ Y ) ) ) ).
% 0.32/0.47
% 0.32/0.47 thf(test,conjecture,
% 0.32/0.47 ! [A: $i] :
% 0.32/0.47 ( ( map
% 0.32/0.47 @ ^ [X: $i] : X
% 0.32/0.47 @ ( cons @ A @ nil ) )
% 0.32/0.47 = ( cons @ A @ nil ) ) ).
% 0.32/0.47
% 0.32/0.47 %------------------------------------------------------------------------------
% 0.32/0.47 ------------------------
% 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 13:23:58 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.ZWeY7SL2lk/DTF2DTF30148.p
% See solution above
% 1.48/1.25 ------------------------
% 1.48/1.26 ---- Cleaned THF ---
% 1.48/1.26 thf(nil_type,type,
% 1.48/1.26 nil: $i ).
% 1.48/1.26
% 1.48/1.26 thf(cons_type,type,
% 1.48/1.26 cons: $i > $i > $i ).
% 1.48/1.26
% 1.48/1.26 thf(map_type,type,
% 1.48/1.26 map: ( $i > $i ) > $i > $i ).
% 1.48/1.26
% 1.48/1.26 thf(ax1,axiom,
% 1.48/1.26 ! [F: $i > $i] :
% 1.48/1.26 ( ( map @ F @ nil )
% 1.48/1.26 = nil ) ).
% 1.48/1.26
% 1.48/1.26 thf(ax2,axiom,
% 1.48/1.26 ! [F: $i > $i,X: $i,Y: $i] :
% 1.48/1.26 ( ( map @ F @ ( cons @ X @ Y ) )
% 1.48/1.26 = ( cons @ ( F @ X ) @ ( map @ F @ Y ) ) ) ).
% 1.48/1.26
% 1.48/1.26 thf(test,conjecture,
% 1.48/1.26 ! [A: $i] :
% 1.48/1.26 ( ( map
% 1.48/1.26 @ ^ [X: $i] : X
% 1.48/1.26 @ ( cons @ A @ nil ) )
% 1.48/1.26 = ( cons @ A @ nil ) ) ).
% 1.48/1.26 ------------------------
% 1.48/1.27 % (30480)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_30148 for (2999ds/275Mi)
% 1.48/1.28 % (30478)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_30148 for (2999ds/2Mi)
% 1.48/1.28 % (30480)Refutation not found, incomplete strategy
% 1.48/1.28 % (30480)------------------------------
% 1.48/1.28 % (30480)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (30480)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.28
% 1.48/1.28
% 1.48/1.28 % (30480)Memory used [KB]: 5500
% 1.48/1.28 % (30480)Time elapsed: 0.002 s
% 1.48/1.28 % (30480)Instructions burned: 1 (million)
% 1.48/1.28 % (30480)------------------------------
% 1.48/1.28 % (30480)------------------------------
% 1.48/1.28 % (30478)Instruction limit reached!
% 1.48/1.28 % (30478)------------------------------
% 1.48/1.28 % (30478)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (30478)Termination reason: Unknown
% 1.48/1.28 % (30478)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (30478)Memory used [KB]: 5500
% 1.48/1.28 % (30478)Time elapsed: 0.002 s
% 1.48/1.28 % (30478)Instructions burned: 2 (million)
% 1.48/1.28 % (30478)------------------------------
% 1.48/1.28 % (30478)------------------------------
% 1.48/1.28 % (30475)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_30148 for (2999ds/183Mi)
% 1.48/1.28 % (30476)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_30148 for (2999ds/4Mi)
% 1.48/1.28 % (30477)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_30148 for (2999ds/27Mi)
% 1.48/1.28 % (30479)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_30148 for (2999ds/2Mi)
% 1.48/1.28 % (30481)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_30148 for (2999ds/18Mi)
% 1.48/1.28 % (30479)Instruction limit reached!
% 1.48/1.28 % (30479)------------------------------
% 1.48/1.28 % (30479)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (30479)Termination reason: Unknown
% 1.48/1.28 % (30479)Termination phase: Property scanning
% 1.48/1.28
% 1.48/1.28 % (30479)Memory used [KB]: 895
% 1.48/1.28 % (30479)Time elapsed: 0.003 s
% 1.48/1.28 % (30479)Instructions burned: 2 (million)
% 1.48/1.28 % (30479)------------------------------
% 1.48/1.28 % (30479)------------------------------
% 1.48/1.28 % (30476)Instruction limit reached!
% 1.48/1.28 % (30476)------------------------------
% 1.48/1.28 % (30476)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (30476)Termination reason: Unknown
% 1.48/1.28 % (30476)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (30476)Memory used [KB]: 5500
% 1.48/1.28 % (30476)Time elapsed: 0.005 s
% 1.48/1.28 % (30476)Instructions burned: 4 (million)
% 1.48/1.28 % (30476)------------------------------
% 1.48/1.28 % (30476)------------------------------
% 1.48/1.28 % (30475)First to succeed.
% 1.48/1.29 % (30483)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_30148 for (2999ds/37Mi)
% 1.48/1.29 % (30477)Also succeeded, but the first one will report.
% 1.48/1.29 % (30482)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_30148 for (2999ds/3Mi)
% 1.48/1.29 % (30475)Refutation found. Thanks to Tanya!
% 1.48/1.29 % SZS status Theorem for DTF2THF_30148
% 1.48/1.29 % SZS output start Proof for DTF2THF_30148
% 1.48/1.29 thf(func_def_1, type, cons: $i > $i > $i).
% 1.48/1.29 thf(func_def_2, type, map: ($i > $i) > $i > $i).
% 1.48/1.29 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 1.48/1.29 thf(f23,plain,(
% 1.48/1.29 $false),
% 1.48/1.29 inference(trivial_inequality_removal,[status(thm)],[f22])).
% 1.48/1.29 thf(f22,plain,(
% 1.48/1.29 ((cons @ sK0 @ nil) != (cons @ sK0 @ nil))),
% 1.48/1.29 inference(beta_eta_normalization,[status(thm)],[f19])).
% 1.48/1.29 thf(f19,plain,(
% 1.48/1.29 ((cons @ ((^[Y0 : $i]: (Y0)) @ sK0) @ nil) != (cons @ sK0 @ nil))),
% 1.48/1.29 inference(superposition,[status(thm)],[f14,f15])).
% 1.48/1.29 thf(f15,plain,(
% 1.48/1.29 ( ! [X0 : $i > $i,X1 : $i] : (((cons @ (X0 @ X1) @ nil) = (map @ X0 @ (cons @ X1 @ nil)))) )),
% 1.48/1.29 inference(superposition,[status(thm)],[f12,f13])).
% 1.48/1.29 thf(f13,plain,(
% 1.48/1.29 ( ! [X0 : $i > $i] : ((nil = (map @ X0 @ nil))) )),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f1])).
% 1.48/1.29 thf(f1,axiom,(
% 1.48/1.29 ! [X0 : $i > $i] : (nil = (map @ X0 @ nil))),
% 1.48/1.29 file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',ax1)).
% 1.48/1.29 thf(f12,plain,(
% 1.48/1.29 ( ! [X2 : $i,X0 : $i > $i,X1 : $i] : (((cons @ (X0 @ X2) @ (map @ X0 @ X1)) = (map @ X0 @ (cons @ X2 @ X1)))) )),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f8])).
% 1.48/1.29 thf(f8,plain,(
% 1.48/1.29 ! [X0 : $i > $i,X1 : $i,X2 : $i] : ((cons @ (X0 @ X2) @ (map @ X0 @ X1)) = (map @ X0 @ (cons @ X2 @ X1)))),
% 1.48/1.29 inference(rectify,[status(thm)],[f2])).
% 1.48/1.29 thf(f2,axiom,(
% 1.48/1.29 ! [X0 : $i > $i,X2 : $i,X1 : $i] : ((map @ X0 @ (cons @ X1 @ X2)) = (cons @ (X0 @ X1) @ (map @ X0 @ X2)))),
% 1.48/1.29 file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',ax2)).
% 1.48/1.29 thf(f14,plain,(
% 1.48/1.29 ((map @ (^[Y0 : $i]: (Y0)) @ (cons @ sK0 @ nil)) != (cons @ sK0 @ nil))),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.29 thf(f11,plain,(
% 1.48/1.29 ((map @ (^[Y0 : $i]: (Y0)) @ (cons @ sK0 @ nil)) != (cons @ sK0 @ nil))),
% 1.48/1.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 1.48/1.29 thf(f10,plain,(
% 1.48/1.29 ? [X0 : $i] : ((cons @ X0 @ nil) != (map @ (^[Y0 : $i]: (Y0)) @ (cons @ X0 @ nil))) => ((map @ (^[Y0 : $i]: (Y0)) @ (cons @ sK0 @ nil)) != (cons @ sK0 @ nil))),
% 1.48/1.29 introduced(definition,[],[choice_axiom])).
% 1.48/1.29 thf(f9,plain,(
% 1.48/1.29 ? [X0 : $i] : ((cons @ X0 @ nil) != (map @ (^[Y0 : $i]: (Y0)) @ (cons @ X0 @ nil)))),
% 1.48/1.29 inference(ennf_transformation,[status(thm)],[f7])).
% 1.48/1.29 thf(f7,plain,(
% 1.48/1.29 ~! [X0 : $i] : ((cons @ X0 @ nil) = (map @ (^[Y0 : $i]: (Y0)) @ (cons @ X0 @ nil)))),
% 1.48/1.29 inference(fool_elimination,[status(thm)],[f6])).
% 1.48/1.29 thf(f6,plain,(
% 1.48/1.29 ~! [X0 : $i] : ((cons @ X0 @ nil) = (map @ (^[X1 : $i] : (X1)) @ (cons @ X0 @ nil)))),
% 1.48/1.29 inference(rectify,[status(thm)],[f4])).
% 1.48/1.29 thf(f4,negated_conjecture,(
% 1.48/1.29 ~! [X3 : $i] : ((cons @ X3 @ nil) = (map @ (^[X1 : $i] : (X1)) @ (cons @ X3 @ nil)))),
% 1.48/1.29 inference(negated_conjecture,[status(cth)],[f3])).
% 1.48/1.29 thf(f3,conjecture,(
% 1.48/1.29 ! [X3 : $i] : ((cons @ X3 @ nil) = (map @ (^[X1 : $i] : (X1)) @ (cons @ X3 @ nil)))),
% 1.48/1.29 file('/export/starexec/sandbox/tmp/tmp.ZWeY7SL2lk/DTF2THF_30148.p',test)).
% 1.48/1.29 % SZS output end Proof for DTF2THF_30148
% 1.48/1.29 % (30475)------------------------------
% 1.48/1.29 % (30475)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.29 % (30475)Termination reason: Refutation
% 1.48/1.29
% 1.48/1.29 % (30475)Memory used [KB]: 5500
% 1.48/1.29 % (30475)Time elapsed: 0.005 s
% 1.48/1.29 % (30475)Instructions burned: 4 (million)
% 1.48/1.29 % (30475)------------------------------
% 1.48/1.29 % (30475)------------------------------
% 1.48/1.29 % (30474)Success in time 0.02 s
%------------------------------------------------------------------------------