%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU828^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 : n025.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:37:32 AM UTC 2026
% Result : Theorem 1.65s 1.31s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 57 ( 25 unt; 0 typ; 3 def)
% Number of atoms : 268 ( 79 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 216 ( 43 ~; 29 |; 0 &; 115 @)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 62 ( 62 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 11 usr; 8 con; 0-2 aty)
% ( 17 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 96 ( 84 ^; 12 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
seteq: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(func_def_2,type,
subseteq: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_3,type,
powerset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_4,type,
emptyset: $i > $o ).
thf(func_def_17,type,
sK1: $i > $o ).
thf(func_def_19,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f65,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f46,f51,f55,f61,f64]) ).
thf(f64,plain,
( spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[status(thm)],[f63,f40,f44]) ).
thf(f44,definition,
( spl0_2
<=> ! [X1: $i] :
( $false
= ( sK1 @ X1 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f40,definition,
( spl0_1
<=> ( sK1
= ( ^ [Y0: $i] : $false ) ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f63,plain,
( ! [X1: $i] :
( $false
= ( sK1 @ X1 ) )
| ~ spl0_1 ),
inference(beta_eta_normalization,[status(thm)],[f62]) ).
thf(f62,plain,
( ! [X1: $i] :
( ( sK1 @ X1 )
= ( ^ [Y0: $i] : $false
@ X1 ) )
| ~ spl0_1 ),
inference(argument_congruence,[status(thm)],[f42]) ).
thf(f42,plain,
( ( sK1
= ( ^ [Y0: $i] : $false ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f40]) ).
thf(f61,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f60]) ).
thf(f60,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[status(thm)],[f56]) ).
thf(f56,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(superposition,[status(thm)],[f50,f45]) ).
thf(f45,plain,
( ! [X1: $i] :
( $false
= ( sK1 @ X1 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f44]) ).
thf(f50,plain,
( ( ( sK1 @ sK2 )
= $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[status(thm)],[f48]) ).
thf(f48,definition,
( spl0_3
<=> ( ( sK1 @ sK2 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).
thf(f55,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[status(thm)],[f54]) ).
thf(f54,plain,
( $false
| spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f53,f45]) ).
thf(f53,plain,
( ( ( sK1 @ sK4 )
!= $false )
| spl0_1 ),
inference(beta_eta_normalization,[status(thm)],[f52]) ).
thf(f52,plain,
( ( ( sK1 @ sK4 )
!= ( ^ [Y0: $i] : $false
@ sK4 ) )
| spl0_1 ),
inference(negative_extensionality,[status(thm)],[f41]) ).
thf(f41,plain,
( ( sK1
!= ( ^ [Y0: $i] : $false ) )
| spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f40]) ).
thf(f51,plain,
( spl0_3
| ~ spl0_1 ),
inference(avatar_split_clause,[status(thm)],[f34,f40,f48]) ).
thf(f34,plain,
( ( sK1
!= ( ^ [Y0: $i] : $false ) )
| ( ( sK1 @ sK2 )
= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f33]) ).
thf(f33,plain,
( ( $false
= ( ~ ( sK1 @ sK2 ) ) )
| ( sK1
!= ( ^ [Y0: $i] : $false ) ) ),
inference(beta_eta_normalization,[status(thm)],[f32]) ).
thf(f32,plain,
( ( sK1
!= ( ^ [Y0: $i] : $false ) )
| ( $false
= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ sK2 ) ) ),
inference(sigma_clausification,[status(thm)],[f31]) ).
thf(f31,plain,
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
| ( sK1
!= ( ^ [Y0: $i] : $false ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f30]) ).
thf(f30,plain,
( ( $false
= ( ( ^ [Y0: $i] : $false )
= sK1 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f28]) ).
thf(f28,plain,
( ( ( ^ [Y0: $i] : $false )
= sK1 )
!= ( !! @ $i
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f27]) ).
thf(f27,plain,
( $false
= ( ( ( ^ [Y0: $i] : $false )
= sK1 )
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f26]) ).
thf(f26,plain,
( ( ^ [Y0: $i > $o] :
( ( ( ^ [Y1: $i] : $false )
= Y0 )
= ( !! @ $i
@ ^ [Y1: $i] :
~ ( Y0 @ Y1 ) ) )
@ sK1 )
= $false ),
inference(sigma_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( ^ [Y1: $i] : $false )
= Y0 )
= ( !! @ $i
@ ^ [Y1: $i] :
~ ( Y0 @ Y1 ) ) ) )
!= $true ),
inference(boolean_simplification,[status(thm)],[f24]) ).
thf(f24,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( ^ [Y1: $i] : $false )
= Y0 )
= ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> $false ) ) ) )
!= $true ),
inference(beta_eta_normalization,[status(thm)],[f23]) ).
thf(f23,plain,
( $true
!= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y1 @ Y2 )
= ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 )
=> ( Y3 @ Y4 ) ) )
@ Y1
@ Y0 )
@ ^ [Y0: $i] : $false )
@ ^ [Y0: $i > $o] :
( ( ^ [Y1: $i] : $false )
= Y0 ) ) ),
inference(definition_unfolding,[status(thm)],[f20,f18,f22,f21,f21]) ).
thf(f21,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,axiom,
( ( ^ [X0: $i] : $false )
= emptyset ),
file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',emptyset) ).
thf(f22,plain,
( powerset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 )
=> ( Y3 @ Y4 ) ) )
@ Y1
@ Y0 ) ) ),
inference(definition_unfolding,[status(thm)],[f19,f17]) ).
thf(f17,plain,
( subseteq
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( subseteq
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subseteq ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subseteq ),
file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',subseteq) ).
thf(f19,plain,
( powerset
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( subseteq @ Y1 @ Y0 ) ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( powerset
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( subseteq @ Y1 @ Y0 ) ) ),
inference(fool_elimination,[status(thm)],[f3]) ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( subseteq @ X1 @ X0 ) )
= powerset ),
file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',poserset) ).
thf(f18,plain,
( seteq
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y1 @ Y2 )
= ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( seteq
= ( ^ [Y0: ( $i > $o ) > $o,Y1: ( $i > $o ) > $o] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y1 @ Y2 )
= ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
! [X2: $i > $o] :
( ( X1 @ X2 )
<=> ( X0 @ X2 ) ) )
= seteq ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: ( $i > $o ) > $o,X1: ( $i > $o ) > $o] :
! [X2: $i > $o] :
( ( X1 @ X2 )
<=> ( X0 @ X2 ) ) )
= seteq ),
file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',seteq) ).
thf(f20,plain,
( $true
!= ( seteq @ ( powerset @ emptyset )
@ ^ [Y0: $i > $o] : ( emptyset = Y0 ) ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
( $true
!= ( seteq @ ( powerset @ emptyset )
@ ^ [Y0: $i > $o] : ( emptyset = Y0 ) ) ),
inference(flattening,[status(thm)],[f15]) ).
thf(f15,plain,
( $true
!= ( seteq @ ( powerset @ emptyset )
@ ^ [Y0: $i > $o] : ( emptyset = Y0 ) ) ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,plain,
~ ( seteq @ ( powerset @ emptyset )
@ ^ [X0: $i > $o] : ( emptyset = X0 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,negated_conjecture,
~ ( seteq @ ( powerset @ emptyset )
@ ^ [X0: $i > $o] : ( emptyset = X0 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f5,conjecture,
( seteq @ ( powerset @ emptyset )
@ ^ [X0: $i > $o] : ( emptyset = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',conj) ).
thf(f46,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f38,f44,f40]) ).
thf(f38,plain,
! [X1: $i] :
( ( $false
= ( sK1 @ X1 ) )
| ( sK1
= ( ^ [Y0: $i] : $false ) ) ),
inference(not_proxy_clausification,[status(thm)],[f37]) ).
thf(f37,plain,
! [X1: $i] :
( ( ( ~ ( sK1 @ X1 ) )
= $true )
| ( sK1
= ( ^ [Y0: $i] : $false ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f36]) ).
thf(f36,plain,
! [X1: $i] :
( ( $true
= ( ( ^ [Y0: $i] : $false )
= sK1 ) )
| ( ( ~ ( sK1 @ X1 ) )
= $true ) ),
inference(beta_eta_normalization,[status(thm)],[f35]) ).
thf(f35,plain,
! [X1: $i] :
( ( $true
= ( ( ^ [Y0: $i] : $false )
= sK1 ) )
| ( $true
= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ X1 ) ) ),
inference(pi_clausification,[status(thm)],[f29]) ).
thf(f29,plain,
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
| ( $true
= ( ( ^ [Y0: $i] : $false )
= sK1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU828^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 : n025.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 12:35:27 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.26/0.46 ---- Original DTF file ---
% 0.26/0.46 thf(spec,logic,$$dhol).
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 % File : SEU828^1 : TPTP v9.2.1. Released v3.7.0.
% 0.26/0.46 % Domain : Set Theory
% 0.26/0.46 % Problem : About powersets 1
% 0.26/0.46 % Version : Especial.
% 0.26/0.46 % English :
% 0.26/0.46
% 0.26/0.46 % Refs : [BB05] Benzmueller & Brown (2005), A Structured Set of Higher
% 0.26/0.46 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.26/0.46 % Source : [Ben09]
% 0.26/0.46 % Names : Example 22c [BB05]
% 0.26/0.46
% 0.26/0.46 % Status : Theorem
% 0.26/0.46 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.20 v8.2.0, 0.31 v8.1.0, 0.18 v7.5.0, 0.14 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v3.7.0
% 0.26/0.46 % Syntax : Number of formulae : 9 ( 4 unt; 4 typ; 4 def)
% 0.26/0.46 % Number of atoms : 15 ( 5 equ; 0 cnn)
% 0.26/0.46 % Maximal formula atoms : 4 ( 3 avg)
% 0.26/0.46 % Number of connectives : 11 ( 0 ~; 0 |; 0 &; 9 @)
% 0.26/0.46 % ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% 0.26/0.46 % Maximal formula depth : 4 ( 2 avg)
% 0.26/0.46 % Number of types : 2 ( 0 usr)
% 0.26/0.46 % Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% 0.26/0.46 % Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% 0.26/0.46 % Number of variables : 10 ( 8 ^; 2 !; 0 ?; 10 :)
% 0.26/0.46 % SPC : TH0_THM_EQU_NAR
% 0.26/0.46
% 0.26/0.46 % Comments :
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 thf(seteq_type,type,
% 0.26/0.46 seteq: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
% 0.26/0.46
% 0.26/0.46 thf(seteq,definition,
% 0.26/0.46 ( seteq
% 0.26/0.46 = ( ^ [X: ( $i > $o ) > $o,Y: ( $i > $o ) > $o] :
% 0.26/0.46 ! [U: $i > $o] :
% 0.26/0.46 ( ( X @ U )
% 0.26/0.46 <=> ( Y @ U ) ) ) ) ).
% 0.26/0.46
% 0.26/0.46 thf(subseteq_type,type,
% 0.26/0.46 subseteq: ( $i > $o ) > ( $i > $o ) > $o ).
% 0.26/0.46
% 0.26/0.46 thf(subseteq,definition,
% 0.26/0.46 ( subseteq
% 0.26/0.46 = ( ^ [X: $i > $o,Y: $i > $o] :
% 0.26/0.46 ! [U: $i] :
% 0.26/0.46 ( ( X @ U )
% 0.26/0.46 => ( Y @ U ) ) ) ) ).
% 0.26/0.46
% 0.26/0.46 thf(powerset_type,type,
% 0.26/0.46 powerset: ( $i > $o ) > ( $i > $o ) > $o ).
% 0.26/0.46
% 0.26/0.46 thf(poserset,definition,
% 0.26/0.46 ( powerset
% 0.26/0.46 = ( ^ [X: $i > $o,Y: $i > $o] : ( subseteq @ Y @ X ) ) ) ).
% 0.26/0.46
% 0.26/0.46 thf(emptyset_type,type,
% 0.26/0.46 emptyset: $i > $o ).
% 0.26/0.46
% 0.26/0.46 thf(emptyset,definition,
% 0.26/0.46 ( emptyset
% 0.26/0.46 = ( ^ [X: $i] : $false ) ) ).
% 0.26/0.46
% 0.26/0.46 thf(conj,conjecture,
% 0.26/0.46 ( seteq @ ( powerset @ emptyset )
% 0.26/0.46 @ ^ [X: $i > $o] : ( X = emptyset ) ) ).
% 0.26/0.46
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 ------------------------
% 1.47/1.27 ---- Embedded in THF ---
% 1.47/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.27 %%% Generated on Tue Feb 24 12:35:28 EST 2026
% 1.47/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.27 %%% Logic specification used:
% 1.47/1.27 %%% thf(spec, logic, $$dhol).
% 1.47/1.27
% 1.47/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2DTF8058.p
% See solution above
% 1.47/1.28 ------------------------
% 1.47/1.29 ---- Cleaned THF ---
% 1.47/1.29 thf(seteq_type,type,
% 1.47/1.29 seteq: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
% 1.47/1.29
% 1.47/1.29 thf(seteq,definition,
% 1.47/1.29 ( seteq
% 1.47/1.29 = ( ^ [X: ( $i > $o ) > $o,Y: ( $i > $o ) > $o] :
% 1.47/1.29 ! [U: $i > $o] :
% 1.47/1.29 ( ( X @ U )
% 1.47/1.29 <=> ( Y @ U ) ) ) ) ).
% 1.47/1.29
% 1.47/1.29 thf(subseteq_type,type,
% 1.47/1.29 subseteq: ( $i > $o ) > ( $i > $o ) > $o ).
% 1.47/1.29
% 1.47/1.29 thf(subseteq,definition,
% 1.47/1.29 ( subseteq
% 1.47/1.29 = ( ^ [X: $i > $o,Y: $i > $o] :
% 1.47/1.29 ! [U: $i] :
% 1.47/1.29 ( ( X @ U )
% 1.47/1.29 => ( Y @ U ) ) ) ) ).
% 1.47/1.29
% 1.47/1.29 thf(powerset_type,type,
% 1.47/1.29 powerset: ( $i > $o ) > ( $i > $o ) > $o ).
% 1.47/1.29
% 1.47/1.29 thf(poserset,definition,
% 1.47/1.29 ( powerset
% 1.47/1.29 = ( ^ [X: $i > $o,Y: $i > $o] : ( subseteq @ Y @ X ) ) ) ).
% 1.47/1.29
% 1.47/1.29 thf(emptyset_type,type,
% 1.47/1.29 emptyset: $i > $o ).
% 1.47/1.29
% 1.47/1.29 thf(emptyset,definition,
% 1.47/1.29 ( emptyset
% 1.47/1.29 = ( ^ [X: $i] : $false ) ) ).
% 1.47/1.29
% 1.47/1.29 thf(conj,conjecture,
% 1.47/1.29 ( seteq @ ( powerset @ emptyset )
% 1.47/1.29 @ ^ [X: $i > $o] : ( X = emptyset ) ) ).
% 1.47/1.29 ------------------------
% 1.65/1.30 % (8346)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_8058 for (2999ds/2Mi)
% 1.65/1.30 % (8346)Instruction limit reached!
% 1.65/1.30 % (8346)------------------------------
% 1.65/1.30 % (8346)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.30 % (8346)Termination reason: Unknown
% 1.65/1.30 % (8346)Termination phase: Function definition elimination
% 1.65/1.30
% 1.65/1.30 % (8346)Memory used [KB]: 895
% 1.65/1.30 % (8346)Time elapsed: 0.002 s
% 1.65/1.30 % (8346)Instructions burned: 2 (million)
% 1.65/1.30 % (8346)------------------------------
% 1.65/1.30 % (8346)------------------------------
% 1.65/1.31 % (8343)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_8058 for (2999ds/183Mi)
% 1.65/1.31 % (8344)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_8058 for (2999ds/4Mi)
% 1.65/1.31 % (8345)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_8058 for (2999ds/27Mi)
% 1.65/1.31 % (8347)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_8058 for (2999ds/2Mi)
% 1.65/1.31 % (8349)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_8058 for (2999ds/18Mi)
% 1.65/1.31 % (8348)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_8058 for (2999ds/275Mi)
% 1.65/1.31 % (8347)Instruction limit reached!
% 1.65/1.31 % (8347)------------------------------
% 1.65/1.31 % (8347)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.31 % (8347)Termination reason: Unknown
% 1.65/1.31 % (8347)Termination phase: Function definition elimination
% 1.65/1.31
% 1.65/1.31 % (8347)Memory used [KB]: 895
% 1.65/1.31 % (8347)Time elapsed: 0.003 s
% 1.65/1.31 % (8347)Instructions burned: 2 (million)
% 1.65/1.31 % (8347)------------------------------
% 1.65/1.31 % (8347)------------------------------
% 1.65/1.31 % (8348)Refutation not found, incomplete strategy
% 1.65/1.31 % (8348)------------------------------
% 1.65/1.31 % (8348)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.31 % (8348)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.31
% 1.65/1.31
% 1.65/1.31 % (8348)Memory used [KB]: 5500
% 1.65/1.31 % (8348)Time elapsed: 0.003 s
% 1.65/1.31 % (8348)Instructions burned: 2 (million)
% 1.65/1.31 % (8348)------------------------------
% 1.65/1.31 % (8348)------------------------------
% 1.65/1.31 % (8350)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_8058 for (2999ds/3Mi)
% 1.65/1.31 % (8343)First to succeed.
% 1.65/1.31 % (8350)Refutation not found, incomplete strategy
% 1.65/1.31 % (8350)------------------------------
% 1.65/1.31 % (8350)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.31 % (8350)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.31
% 1.65/1.31
% 1.65/1.31 % (8350)Memory used [KB]: 5500
% 1.65/1.31 % (8350)Time elapsed: 0.001 s
% 1.65/1.31 % (8350)Instructions burned: 1 (million)
% 1.65/1.31 % (8350)------------------------------
% 1.65/1.31 % (8350)------------------------------
% 1.65/1.31 % (8349)Also succeeded, but the first one will report.
% 1.65/1.31 % (8343)Refutation found. Thanks to Tanya!
% 1.65/1.31 % SZS status Theorem for DTF2THF_8058
% 1.65/1.31 % SZS output start Proof for DTF2THF_8058
% 1.65/1.31 thf(func_def_0, type, seteq: (($i > $o) > $o) > (($i > $o) > $o) > $o).
% 1.65/1.31 thf(func_def_2, type, subseteq: ($i > $o) > ($i > $o) > $o).
% 1.65/1.31 thf(func_def_3, type, powerset: ($i > $o) > ($i > $o) > $o).
% 1.65/1.31 thf(func_def_4, type, emptyset: $i > $o).
% 1.65/1.31 thf(func_def_17, type, sK1: $i > $o).
% 1.65/1.31 thf(func_def_19, type, ph3: !>[X0: $tType]:(X0)).
% 1.65/1.31 thf(f65,plain,(
% 1.65/1.31 $false),
% 1.65/1.31 inference(avatar_sat_refutation,[status(thm)],[f46,f51,f55,f61,f64])).
% 1.65/1.31 thf(f64,plain,(
% 1.65/1.31 spl0_2 | ~spl0_1),
% 1.65/1.31 inference(avatar_split_clause,[status(thm)],[f63,f40,f44])).
% 1.65/1.31 thf(f44,definition,(
% 1.65/1.31 spl0_2 <=> ! [X1 : $i] : ($false = (sK1 @ X1))),
% 1.65/1.31 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.65/1.31 thf(f40,definition,(
% 1.65/1.31 spl0_1 <=> (sK1 = (^[Y0 : $i]: ($false)))),
% 1.65/1.31 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.65/1.31 thf(f63,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (($false = (sK1 @ X1))) ) | ~spl0_1),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f62])).
% 1.65/1.31 thf(f62,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (((sK1 @ X1) = ((^[Y0 : $i]: ($false)) @ X1))) ) | ~spl0_1),
% 1.65/1.31 inference(argument_congruence,[status(thm)],[f42])).
% 1.65/1.31 thf(f42,plain,(
% 1.65/1.31 (sK1 = (^[Y0 : $i]: ($false))) | ~spl0_1),
% 1.65/1.31 inference(avatar_component_clause,[status(thm)],[f40])).
% 1.65/1.31 thf(f61,plain,(
% 1.65/1.31 ~spl0_2 | ~spl0_3),
% 1.65/1.31 inference(avatar_contradiction_clause,[status(thm)],[f60])).
% 1.65/1.31 thf(f60,plain,(
% 1.65/1.31 $false | (~spl0_2 | ~spl0_3)),
% 1.65/1.31 inference(trivial_inequality_removal,[status(thm)],[f56])).
% 1.65/1.31 thf(f56,plain,(
% 1.65/1.31 ($false = $true) | (~spl0_2 | ~spl0_3)),
% 1.65/1.31 inference(superposition,[status(thm)],[f50,f45])).
% 1.65/1.31 thf(f45,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (($false = (sK1 @ X1))) ) | ~spl0_2),
% 1.65/1.31 inference(avatar_component_clause,[status(thm)],[f44])).
% 1.65/1.31 thf(f50,plain,(
% 1.65/1.31 ((sK1 @ sK2) = $true) | ~spl0_3),
% 1.65/1.31 inference(avatar_component_clause,[status(thm)],[f48])).
% 1.65/1.31 thf(f48,definition,(
% 1.65/1.31 spl0_3 <=> ((sK1 @ sK2) = $true)),
% 1.65/1.31 introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.65/1.31 thf(f55,plain,(
% 1.65/1.31 spl0_1 | ~spl0_2),
% 1.65/1.31 inference(avatar_contradiction_clause,[status(thm)],[f54])).
% 1.65/1.31 thf(f54,plain,(
% 1.65/1.31 $false | (spl0_1 | ~spl0_2)),
% 1.65/1.31 inference(subsumption_resolution,[status(thm)],[f53,f45])).
% 1.65/1.31 thf(f53,plain,(
% 1.65/1.31 ((sK1 @ sK4) != $false) | spl0_1),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f52])).
% 1.65/1.31 thf(f52,plain,(
% 1.65/1.31 ((sK1 @ sK4) != ((^[Y0 : $i]: ($false)) @ sK4)) | spl0_1),
% 1.65/1.31 inference(negative_extensionality,[status(thm)],[f41])).
% 1.65/1.31 thf(f41,plain,(
% 1.65/1.31 (sK1 != (^[Y0 : $i]: ($false))) | spl0_1),
% 1.65/1.31 inference(avatar_component_clause,[status(thm)],[f40])).
% 1.65/1.31 thf(f51,plain,(
% 1.65/1.31 spl0_3 | ~spl0_1),
% 1.65/1.31 inference(avatar_split_clause,[status(thm)],[f34,f40,f48])).
% 1.65/1.31 thf(f34,plain,(
% 1.65/1.31 (sK1 != (^[Y0 : $i]: ($false))) | ((sK1 @ sK2) = $true)),
% 1.65/1.31 inference(not_proxy_clausification,[status(thm)],[f33])).
% 1.65/1.31 thf(f33,plain,(
% 1.65/1.31 ($false = (~ (sK1 @ sK2))) | (sK1 != (^[Y0 : $i]: ($false)))),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f32])).
% 1.65/1.31 thf(f32,plain,(
% 1.65/1.31 (sK1 != (^[Y0 : $i]: ($false))) | ($false = ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK2))),
% 1.65/1.31 inference(sigma_clausification,[status(thm)],[f31])).
% 1.65/1.31 thf(f31,plain,(
% 1.65/1.31 ($false = (!! @ $i @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) | (sK1 != (^[Y0 : $i]: ($false)))),
% 1.65/1.31 inference(equality_proxy_clausification,[status(thm)],[f30])).
% 1.65/1.31 thf(f30,plain,(
% 1.65/1.31 ($false = ((^[Y0 : $i]: ($false)) = sK1)) | ($false = (!! @ $i @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))),
% 1.65/1.31 inference(binary_proxy_clausification,[status(thm)],[f28])).
% 1.65/1.31 thf(f28,plain,(
% 1.65/1.31 (((^[Y0 : $i]: ($false)) = sK1) != (!! @ $i @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))),
% 1.65/1.31 inference(binary_proxy_clausification,[status(thm)],[f27])).
% 1.65/1.31 thf(f27,plain,(
% 1.65/1.31 ($false = (((^[Y0 : $i]: ($false)) = sK1) = (!! @ $i @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f26])).
% 1.65/1.31 thf(f26,plain,(
% 1.65/1.31 (((^[Y0 : $i > $o]: (((^[Y1 : $i]: ($false)) = Y0) = (!! @ $i @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))) @ sK1) = $false)),
% 1.65/1.31 inference(sigma_clausification,[status(thm)],[f25])).
% 1.65/1.31 thf(f25,plain,(
% 1.65/1.31 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((^[Y1 : $i]: ($false)) = Y0) = (!! @ $i @ (^[Y1 : $i]: (~ (Y0 @ Y1))))))) != $true)),
% 1.65/1.31 inference(boolean_simplification,[status(thm)],[f24])).
% 1.65/1.31 thf(f24,plain,(
% 1.65/1.31 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((^[Y1 : $i]: ($false)) = Y0) = (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => $false)))))) != $true)),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f23])).
% 1.65/1.31 thf(f23,plain,(
% 1.65/1.31 ($true != ((^[Y0 : ($i > $o) > $o]: ((^[Y1 : ($i > $o) > $o]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y1 @ Y2) = (Y0 @ Y2))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) => (Y3 @ Y4))))))) @ Y1 @ Y0)))) @ (^[Y0 : $i]: ($false))) @ (^[Y0 : $i > $o]: ((^[Y1 : $i]: ($false)) = Y0))))),
% 1.65/1.31 inference(definition_unfolding,[status(thm)],[f20,f18,f22,f21,f21])).
% 1.65/1.31 thf(f21,plain,(
% 1.65/1.31 (emptyset = (^[Y0 : $i]: ($false)))),
% 1.65/1.31 inference(cnf_transformation,[status(thm)],[f12])).
% 1.65/1.31 thf(f12,plain,(
% 1.65/1.31 (emptyset = (^[Y0 : $i]: ($false)))),
% 1.65/1.31 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.31 thf(f4,axiom,(
% 1.65/1.31 ((^[X0 : $i] : ($false)) = emptyset)),
% 1.65/1.31 file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',emptyset)).
% 1.65/1.31 thf(f22,plain,(
% 1.65/1.31 (powerset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) => (Y3 @ Y4))))))) @ Y1 @ Y0)))))),
% 1.65/1.31 inference(definition_unfolding,[status(thm)],[f19,f17])).
% 1.65/1.31 thf(f17,plain,(
% 1.65/1.31 (subseteq = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 1.65/1.31 inference(cnf_transformation,[status(thm)],[f11])).
% 1.65/1.31 thf(f11,plain,(
% 1.65/1.31 (subseteq = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 1.65/1.31 inference(fool_elimination,[status(thm)],[f10])).
% 1.65/1.31 thf(f10,plain,(
% 1.65/1.31 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2 : $i] : ((X0 @ X2) => (X1 @ X2)))) = subseteq)),
% 1.65/1.31 inference(rectify,[status(thm)],[f2])).
% 1.65/1.31 thf(f2,axiom,(
% 1.65/1.31 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2 : $i] : ((X0 @ X2) => (X1 @ X2)))) = subseteq)),
% 1.65/1.31 file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',subseteq)).
% 1.65/1.31 thf(f19,plain,(
% 1.65/1.31 (powerset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (subseteq @ Y1 @ Y0)))))),
% 1.65/1.31 inference(cnf_transformation,[status(thm)],[f13])).
% 1.65/1.31 thf(f13,plain,(
% 1.65/1.31 (powerset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (subseteq @ Y1 @ Y0)))))),
% 1.65/1.31 inference(fool_elimination,[status(thm)],[f3])).
% 1.65/1.31 thf(f3,axiom,(
% 1.65/1.31 ((^[X0 : $i > $o, X1 : $i > $o] : (subseteq @ X1 @ X0)) = powerset)),
% 1.65/1.31 file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',poserset)).
% 1.65/1.31 thf(f18,plain,(
% 1.65/1.31 (seteq = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : ($i > $o) > $o]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y1 @ Y2) = (Y0 @ Y2))))))))),
% 1.65/1.31 inference(cnf_transformation,[status(thm)],[f9])).
% 1.65/1.31 thf(f9,plain,(
% 1.65/1.31 (seteq = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : ($i > $o) > $o]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y1 @ Y2) = (Y0 @ Y2))))))))),
% 1.65/1.31 inference(fool_elimination,[status(thm)],[f8])).
% 1.65/1.31 thf(f8,plain,(
% 1.65/1.31 ((^[X0 : ($i > $o) > $o, X1 : ($i > $o) > $o] : (! [X2 : $i > $o] : ((X1 @ X2) <=> (X0 @ X2)))) = seteq)),
% 1.65/1.31 inference(rectify,[status(thm)],[f1])).
% 1.65/1.31 thf(f1,axiom,(
% 1.65/1.31 ((^[X0 : ($i > $o) > $o, X1 : ($i > $o) > $o] : (! [X2 : $i > $o] : ((X1 @ X2) <=> (X0 @ X2)))) = seteq)),
% 1.65/1.31 file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',seteq)).
% 1.65/1.31 thf(f20,plain,(
% 1.65/1.31 ($true != (seteq @ (powerset @ emptyset) @ (^[Y0 : $i > $o]: (emptyset = Y0))))),
% 1.65/1.31 inference(cnf_transformation,[status(thm)],[f16])).
% 1.65/1.31 thf(f16,plain,(
% 1.65/1.31 ($true != (seteq @ (powerset @ emptyset) @ (^[Y0 : $i > $o]: (emptyset = Y0))))),
% 1.65/1.31 inference(flattening,[status(thm)],[f15])).
% 1.65/1.31 thf(f15,plain,(
% 1.65/1.31 ~($true = (seteq @ (powerset @ emptyset) @ (^[Y0 : $i > $o]: (emptyset = Y0))))),
% 1.65/1.31 inference(fool_elimination,[status(thm)],[f14])).
% 1.65/1.31 thf(f14,plain,(
% 1.65/1.31 ~(seteq @ (powerset @ emptyset) @ (^[X0 : $i > $o] : ((emptyset = X0))))),
% 1.65/1.31 inference(rectify,[status(thm)],[f6])).
% 1.65/1.31 thf(f6,negated_conjecture,(
% 1.65/1.31 ~(seteq @ (powerset @ emptyset) @ (^[X0 : $i > $o] : ((emptyset = X0))))),
% 1.65/1.31 inference(negated_conjecture,[status(cth)],[f5])).
% 1.65/1.31 thf(f5,conjecture,(
% 1.65/1.31 (seteq @ (powerset @ emptyset) @ (^[X0 : $i > $o] : ((emptyset = X0))))),
% 1.65/1.31 file('/export/starexec/sandbox/tmp/tmp.bk7zN6BJi7/DTF2THF_8058.p',conj)).
% 1.65/1.31 thf(f46,plain,(
% 1.65/1.31 spl0_1 | spl0_2),
% 1.65/1.31 inference(avatar_split_clause,[status(thm)],[f38,f44,f40])).
% 1.65/1.31 thf(f38,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (($false = (sK1 @ X1)) | (sK1 = (^[Y0 : $i]: ($false)))) )),
% 1.65/1.31 inference(not_proxy_clausification,[status(thm)],[f37])).
% 1.65/1.31 thf(f37,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (((~ (sK1 @ X1)) = $true) | (sK1 = (^[Y0 : $i]: ($false)))) )),
% 1.65/1.31 inference(equality_proxy_clausification,[status(thm)],[f36])).
% 1.65/1.31 thf(f36,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ($false)) = sK1)) | ((~ (sK1 @ X1)) = $true)) )),
% 1.65/1.31 inference(beta_eta_normalization,[status(thm)],[f35])).
% 1.65/1.31 thf(f35,plain,(
% 1.65/1.31 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ($false)) = sK1)) | ($true = ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ X1))) )),
% 1.65/1.31 inference(pi_clausification,[status(thm)],[f29])).
% 1.65/1.31 thf(f29,plain,(
% 1.65/1.31 ($true = (!! @ $i @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) | ($true = ((^[Y0 : $i]: ($false)) = sK1))),
% 1.65/1.31 inference(binary_proxy_clausification,[status(thm)],[f28])).
% 1.65/1.31 % SZS output end Proof for DTF2THF_8058
% 1.65/1.31 % (8343)------------------------------
% 1.65/1.31 % (8343)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.31 % (8343)Termination reason: Refutation
% 1.65/1.31
% 1.65/1.31 % (8343)Memory used [KB]: 5500
% 1.65/1.31 % (8343)Time elapsed: 0.006 s
% 1.65/1.31 % (8343)Instructions burned: 3 (million)
% 1.65/1.31 % (8343)------------------------------
% 1.65/1.31 % (8343)------------------------------
% 1.65/1.31 % (8342)Success in time 0.021 s
%------------------------------------------------------------------------------