%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYN984^1 : TPTP v9.2.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:51:39 AM UTC 2026
% Result : Theorem 1.65s 1.45s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 129 ( 27 equ; 0 cnn)
% Maximal formula atoms : 7 ( 6 avg)
% Number of connectives : 70 ( 16 ~; 4 |; 23 &; 23 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 35 ^; 0 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_2,type,
p: ( $i > $o ) > $o ).
thf(func_def_9,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f29,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f28]) ).
thf(f28,plain,
( ( ^ [Y0: $i] : b )
!= ( ^ [Y0: $i] : b ) ),
inference(boolean_simplification,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ^ [Y0: $i] : b )
!= ( ^ [Y0: $i] :
( b
& $true ) ) ),
inference(backward_demodulation,[status(thm)],[f14,f23]) ).
thf(f23,plain,
a = $true,
inference(duplicate_literal_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( a = $true )
| ( a = $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( ( a = $true )
| ( $true
= ( b
& a ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f16]) ).
thf(f16,plain,
( a
!= ( b
& a ) ),
inference(beta_eta_normalization,[status(thm)],[f15]) ).
thf(f15,plain,
( ( ^ [Y0: $i] : a
@ sK2 )
!= ( ^ [Y0: $i] :
( b
& a )
@ sK2 ) ),
inference(negative_extensionality,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ^ [Y0: $i] :
( b
& a ) )
!= ( ^ [Y0: $i] : a ) ),
inference(trivial_inequality_removal,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( ^ [Y0: $i] :
( b
& a ) )
!= ( ^ [Y0: $i] : a ) )
| ( $true != $true ) ),
inference(constrained_superposition,[status(thm)],[f10,f9]) ).
thf(f9,plain,
( $true
= ( p
@ ^ [Y0: $i] : a ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( ( $true
!= ( p
@ ^ [Y0: $i] :
( b
& a ) ) )
& ( $true
= ( p
@ ^ [Y0: $i] : a ) )
& ( $true
= ( p
@ ^ [Y0: $i] : b ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
( ( $true
!= ( p
@ ^ [Y0: $i] :
( b
& a ) ) )
& ( $true
= ( p
@ ^ [Y0: $i] : b ) )
& ( $true
= ( p
@ ^ [Y0: $i] : a ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( $true
= ( p
@ ^ [Y0: $i] : b ) )
& ( $true
= ( p
@ ^ [Y0: $i] : a ) ) )
=> ( $true
= ( p
@ ^ [Y0: $i] :
( b
& a ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ( p
@ ^ [X0: $i] : b )
& ( p
@ ^ [X1: $i] : a ) )
=> ( p
@ ^ [X2: $i] :
( a
& b ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( p
@ ^ [X0: $i] : b )
& ( p
@ ^ [X0: $i] : a ) )
=> ( p
@ ^ [X0: $i] :
( a
& b ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ( p
@ ^ [X0: $i] : b )
& ( p
@ ^ [X0: $i] : a ) )
=> ( p
@ ^ [X0: $i] :
( a
& b ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xB4bR6U07g/DTF2THF_13973.p',thm) ).
thf(f10,plain,
( $true
!= ( p
@ ^ [Y0: $i] :
( b
& a ) ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f14,plain,
( ( ^ [Y0: $i] : b )
!= ( ^ [Y0: $i] :
( b
& a ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f12]) ).
thf(f12,plain,
( ( $true != $true )
| ( ( ^ [Y0: $i] : b )
!= ( ^ [Y0: $i] :
( b
& a ) ) ) ),
inference(constrained_superposition,[status(thm)],[f10,f8]) ).
thf(f8,plain,
( $true
= ( p
@ ^ [Y0: $i] : b ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN984^1 : TPTP v9.2.1. Released v3.6.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n016.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 14:21:06 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.34/0.48 ---- Original DTF file ---
% 0.34/0.48 thf(spec,logic,$$dhol).
% 0.34/0.48 %------------------------------------------------------------------------------
% 0.34/0.48 % File : SYN984^1 : TPTP v9.2.1. Released v3.6.0.
% 0.34/0.48 % Domain : Syntactic
% 0.34/0.48 % Problem : Factoring application over conjunction with lambda
% 0.34/0.48 % Version : Especial.
% 0.34/0.48 % English : Variation of BB-1 with functional extensionality
% 0.34/0.48
% 0.34/0.48 % Refs : [BB05] Benzmueller & Brown (2005), A Structured Set of Higher-Ord
% 0.34/0.48 % : [Ben08] Benzmueller (2008), Email to G. Sutcliffe
% 0.34/0.48 % Source : [Ben08]
% 0.34/0.48 % Names : BB-2 [Ben08]
% 0.34/0.48
% 0.34/0.48 % Status : Theorem
% 0.34/0.48 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 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.2.0, 0.33 v6.1.0, 0.17 v5.5.0, 0.20 v5.4.0, 0.25 v5.3.0, 0.50 v4.1.0, 0.67 v4.0.0, 0.33 v3.7.0
% 0.34/0.48 % Syntax : Number of formulae : 4 ( 0 unt; 3 typ; 0 def)
% 0.34/0.48 % Number of atoms : 7 ( 0 equ; 0 cnn)
% 0.34/0.48 % Maximal formula atoms : 7 ( 7 avg)
% 0.34/0.48 % Number of connectives : 6 ( 0 ~; 0 |; 2 &; 3 @)
% 0.34/0.48 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.34/0.48 % Maximal formula depth : 5 ( 5 avg)
% 0.34/0.48 % Number of types : 2 ( 0 usr)
% 0.34/0.48 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.34/0.48 % Number of symbols : 3 ( 3 usr; 2 con; 0-1 aty)
% 0.34/0.48 % Number of variables : 3 ( 3 ^; 0 !; 0 ?; 3 :)
% 0.34/0.48 % SPC : TH0_THM_NEQ_NAR
% 0.34/0.48
% 0.34/0.48 % Comments : LEO-II can prove this theorem in 0.02 seconds
% 0.34/0.48 % : Requires Boolean extensionality and functional extensionality
% 0.34/0.48 % :
% 0.34/0.48 %------------------------------------------------------------------------------
% 0.34/0.48 thf(a_const,type,
% 0.34/0.48 a: $o ).
% 0.34/0.48
% 0.34/0.48 thf(b_const,type,
% 0.34/0.48 b: $o ).
% 0.34/0.48
% 0.34/0.48 thf(p_const,type,
% 0.34/0.48 p: ( $i > $o ) > $o ).
% 0.34/0.48
% 0.34/0.48 thf(thm,conjecture,
% 0.34/0.48 ( ( ( p
% 0.34/0.48 @ ^ [X: $i] : a )
% 0.34/0.48 & ( p
% 0.34/0.48 @ ^ [X: $i] : b ) )
% 0.34/0.48 => ( p
% 0.34/0.48 @ ^ [X: $i] :
% 0.34/0.48 ( a
% 0.34/0.48 & b ) ) ) ).
% 0.34/0.48
% 0.34/0.48 %------------------------------------------------------------------------------
% 0.34/0.48 ------------------------
% 1.65/1.42 ---- Embedded in THF ---
% 1.65/1.42 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.42 %%% Generated on Tue Feb 24 14:21:07 EST 2026
% 1.65/1.42 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.42 %%% Logic specification used:
% 1.65/1.42 %%% thf(spec, logic, $$dhol).
% 1.65/1.42
% 1.65/1.42 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.xB4bR6U07g/DTF2DTF13973.p
% See solution above
% 1.65/1.42 ------------------------
% 1.65/1.43 ---- Cleaned THF ---
% 1.65/1.43 thf(a_const,type,
% 1.65/1.43 a: $o ).
% 1.65/1.43
% 1.65/1.43 thf(b_const,type,
% 1.65/1.43 b: $o ).
% 1.65/1.43
% 1.65/1.43 thf(p_const,type,
% 1.65/1.43 p: ( $i > $o ) > $o ).
% 1.65/1.43
% 1.65/1.43 thf(thm,conjecture,
% 1.65/1.43 ( ( ( p
% 1.65/1.43 @ ^ [X: $i] : a )
% 1.65/1.43 & ( p
% 1.65/1.43 @ ^ [X: $i] : b ) )
% 1.65/1.43 => ( p
% 1.65/1.43 @ ^ [X: $i] :
% 1.65/1.43 ( a
% 1.65/1.43 & b ) ) ) ).
% 1.65/1.43 ------------------------
% 1.65/1.45 % (14074)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_13973 for (3000ds/2Mi)
% 1.65/1.45 % (14072)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_13973 for (3000ds/27Mi)
% 1.65/1.45 % (14071)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_13973 for (3000ds/4Mi)
% 1.65/1.45 % (14070)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13973 for (3000ds/183Mi)
% 1.65/1.45 % (14073)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_13973 for (3000ds/2Mi)
% 1.65/1.45 % (14076)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13973 for (3000ds/18Mi)
% 1.65/1.45 % (14075)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_13973 for (3000ds/275Mi)
% 1.65/1.45 % (14073)Refutation not found, incomplete strategy
% 1.65/1.45 % (14073)------------------------------
% 1.65/1.45 % (14073)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14072)Refutation not found, incomplete strategy
% 1.65/1.45 % (14072)------------------------------
% 1.65/1.45 % (14072)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14072)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.45
% 1.65/1.45
% 1.65/1.45 % (14072)Memory used [KB]: 5500
% 1.65/1.45 % (14072)Time elapsed: 0.003 s
% 1.65/1.45 % (14072)Instructions burned: 2 (million)
% 1.65/1.45 % (14072)------------------------------
% 1.65/1.45 % (14072)------------------------------
% 1.65/1.45 % (14073)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.45
% 1.65/1.45 % (14074)Instruction limit reached!
% 1.65/1.45 % (14074)------------------------------
% 1.65/1.45 % (14074)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14074)Termination reason: Unknown
% 1.65/1.45 % (14074)Termination phase: Saturation
% 1.65/1.45
% 1.65/1.45 % (14074)Memory used [KB]: 5500
% 1.65/1.45 % (14074)Time elapsed: 0.003 s
% 1.65/1.45 % (14074)Instructions burned: 2 (million)
% 1.65/1.45 % (14075)Refutation not found, incomplete strategy
% 1.65/1.45 % (14075)------------------------------
% 1.65/1.45 % (14075)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14074)------------------------------
% 1.65/1.45 % (14074)------------------------------
% 1.65/1.45 % (14075)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.45
% 1.65/1.45
% 1.65/1.45 % (14075)Memory used [KB]: 5373
% 1.65/1.45 % (14075)Time elapsed: 0.002 s
% 1.65/1.45 % (14075)Instructions burned: 1 (million)
% 1.65/1.45 % (14075)------------------------------
% 1.65/1.45 % (14075)------------------------------
% 1.65/1.45
% 1.65/1.45 % (14073)Memory used [KB]: 5500
% 1.65/1.45 % (14073)Time elapsed: 0.003 s
% 1.65/1.45 % (14073)Instructions burned: 1 (million)
% 1.65/1.45 % (14073)------------------------------
% 1.65/1.45 % (14073)------------------------------
% 1.65/1.45 % (14071)Refutation not found, incomplete strategy
% 1.65/1.45 % (14071)------------------------------
% 1.65/1.45 % (14071)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14071)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.45
% 1.65/1.45
% 1.65/1.45 % (14071)Memory used [KB]: 5500
% 1.65/1.45 % (14071)Time elapsed: 0.003 s
% 1.65/1.45 % (14071)Instructions burned: 2 (million)
% 1.65/1.45 % (14071)------------------------------
% 1.65/1.45 % (14071)------------------------------
% 1.65/1.45 % (14076)First to succeed.
% 1.65/1.45 % (14070)Also succeeded, but the first one will report.
% 1.65/1.45 % (14076)Refutation found. Thanks to Tanya!
% 1.65/1.45 % SZS status Theorem for DTF2THF_13973
% 1.65/1.45 % SZS output start Proof for DTF2THF_13973
% 1.65/1.45 thf(func_def_2, type, p: ($i > $o) > $o).
% 1.65/1.45 thf(func_def_9, type, ph1: !>[X0: $tType]:(X0)).
% 1.65/1.45 thf(f29,plain,(
% 1.65/1.45 $false),
% 1.65/1.45 inference(trivial_inequality_removal,[status(thm)],[f28])).
% 1.65/1.45 thf(f28,plain,(
% 1.65/1.45 ((^[Y0 : $i]: (b)) != (^[Y0 : $i]: (b)))),
% 1.65/1.45 inference(boolean_simplification,[status(thm)],[f25])).
% 1.65/1.45 thf(f25,plain,(
% 1.65/1.45 ((^[Y0 : $i]: (b)) != (^[Y0 : $i]: (b & $true)))),
% 1.65/1.45 inference(backward_demodulation,[status(thm)],[f14,f23])).
% 1.65/1.45 thf(f23,plain,(
% 1.65/1.45 (a = $true)),
% 1.65/1.45 inference(duplicate_literal_removal,[status(thm)],[f21])).
% 1.65/1.45 thf(f21,plain,(
% 1.65/1.45 (a = $true) | (a = $true)),
% 1.65/1.45 inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.65/1.45 thf(f17,plain,(
% 1.65/1.45 (a = $true) | ($true = (b & a))),
% 1.65/1.45 inference(binary_proxy_clausification,[status(thm)],[f16])).
% 1.65/1.45 thf(f16,plain,(
% 1.65/1.45 (a != (b & a))),
% 1.65/1.45 inference(beta_eta_normalization,[status(thm)],[f15])).
% 1.65/1.45 thf(f15,plain,(
% 1.65/1.45 (((^[Y0 : $i]: (a)) @ sK2) != ((^[Y0 : $i]: (b & a)) @ sK2))),
% 1.65/1.45 inference(negative_extensionality,[status(thm)],[f13])).
% 1.65/1.45 thf(f13,plain,(
% 1.65/1.45 ((^[Y0 : $i]: (b & a)) != (^[Y0 : $i]: (a)))),
% 1.65/1.45 inference(trivial_inequality_removal,[status(thm)],[f11])).
% 1.65/1.45 thf(f11,plain,(
% 1.65/1.45 ((^[Y0 : $i]: (b & a)) != (^[Y0 : $i]: (a))) | ($true != $true)),
% 1.65/1.45 inference(constrained_superposition,[status(thm)],[f10,f9])).
% 1.65/1.45 thf(f9,plain,(
% 1.65/1.45 ($true = (p @ (^[Y0 : $i]: (a))))),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f7])).
% 1.65/1.45 thf(f7,plain,(
% 1.65/1.45 ($true != (p @ (^[Y0 : $i]: (b & a)))) & ($true = (p @ (^[Y0 : $i]: (a)))) & ($true = (p @ (^[Y0 : $i]: (b))))),
% 1.65/1.45 inference(flattening,[status(thm)],[f6])).
% 1.65/1.45 thf(f6,plain,(
% 1.65/1.45 ($true != (p @ (^[Y0 : $i]: (b & a)))) & (($true = (p @ (^[Y0 : $i]: (b)))) & ($true = (p @ (^[Y0 : $i]: (a)))))),
% 1.65/1.45 inference(ennf_transformation,[status(thm)],[f5])).
% 1.65/1.45 thf(f5,plain,(
% 1.65/1.45 ~((($true = (p @ (^[Y0 : $i]: (b)))) & ($true = (p @ (^[Y0 : $i]: (a))))) => ($true = (p @ (^[Y0 : $i]: (b & a)))))),
% 1.65/1.45 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.45 thf(f4,plain,(
% 1.65/1.45 ~(((p @ (^[X0 : $i] : (b))) & (p @ (^[X1 : $i] : (a)))) => (p @ (^[X2 : $i] : (a & b))))),
% 1.65/1.45 inference(rectify,[status(thm)],[f2])).
% 1.65/1.45 thf(f2,negated_conjecture,(
% 1.65/1.45 ~(((p @ (^[X0 : $i] : (b))) & (p @ (^[X0 : $i] : (a)))) => (p @ (^[X0 : $i] : (a & b))))),
% 1.65/1.45 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.45 thf(f1,conjecture,(
% 1.65/1.45 ((p @ (^[X0 : $i] : (b))) & (p @ (^[X0 : $i] : (a)))) => (p @ (^[X0 : $i] : (a & b)))),
% 1.65/1.45 file('/export/starexec/sandbox/tmp/tmp.xB4bR6U07g/DTF2THF_13973.p',thm)).
% 1.65/1.45 thf(f10,plain,(
% 1.65/1.45 ($true != (p @ (^[Y0 : $i]: (b & a))))),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f7])).
% 1.65/1.45 thf(f14,plain,(
% 1.65/1.45 ((^[Y0 : $i]: (b)) != (^[Y0 : $i]: (b & a)))),
% 1.65/1.45 inference(trivial_inequality_removal,[status(thm)],[f12])).
% 1.65/1.45 thf(f12,plain,(
% 1.65/1.45 ($true != $true) | ((^[Y0 : $i]: (b)) != (^[Y0 : $i]: (b & a)))),
% 1.65/1.45 inference(constrained_superposition,[status(thm)],[f10,f8])).
% 1.65/1.45 thf(f8,plain,(
% 1.65/1.45 ($true = (p @ (^[Y0 : $i]: (b))))),
% 1.65/1.45 inference(cnf_transformation,[status(thm)],[f7])).
% 1.65/1.45 % SZS output end Proof for DTF2THF_13973
% 1.65/1.45 % (14076)------------------------------
% 1.65/1.45 % (14076)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.45 % (14076)Termination reason: Refutation
% 1.65/1.45
% 1.65/1.45 % (14076)Memory used [KB]: 5500
% 1.65/1.45 % (14076)Time elapsed: 0.003 s
% 1.65/1.45 % (14076)Instructions burned: 2 (million)
% 1.65/1.45 % (14076)------------------------------
% 1.65/1.45 % (14076)------------------------------
% 1.65/1.45 % (14069)Success in time 0.017 s
%------------------------------------------------------------------------------