%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV080^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 : n005.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:14 AM UTC 2026
% Result : Theorem 1.53s 1.39s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 5
% Syntax : Number of formulae : 96 ( 13 unt; 0 typ; 4 def)
% Number of atoms : 673 ( 289 equ; 21 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 1053 ( 78 ~; 145 |; 48 &; 697 @)
% ( 4 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 67 ( 67 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 10 usr; 9 con; 0-2 aty)
% ( 24 !!; 23 ??; 0 @@+; 0 @@-)
% Number of variables : 291 ( 201 ^; 84 !; 6 ?; 291 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_17,type,
sK1: a > $o ).
thf(func_def_18,type,
sK2: ( a > a ) > a ).
thf(func_def_19,type,
sK3: ( a > a ) > a ).
thf(func_def_20,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_21,type,
sK5: ( a > a ) > a > a ).
thf(func_def_22,type,
sK6: ( a > a ) > a > a ).
thf(f322,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f233,f252,f263,f309,f321]) ).
thf(f321,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[status(thm)],[f320]) ).
thf(f320,plain,
( $false
| ~ spl0_5
| ~ spl0_6 ),
inference(trivial_inequality_removal,[status(thm)],[f319]) ).
thf(f319,plain,
( ( $true = $false )
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f313,f246]) ).
thf(f246,plain,
( ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_5 ),
inference(avatar_component_clause,[status(thm)],[f244]) ).
thf(f244,definition,
( spl0_5
<=> ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition]) ).
thf(f313,plain,
( ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_6 ),
inference(trivial_inequality_removal,[status(thm)],[f311]) ).
thf(f311,plain,
( ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( $true = $false )
| ~ spl0_6 ),
inference(superposition,[status(thm)],[f251,f26]) ).
thf(f26,plain,
! [X1: a > a] :
( ( $true
= ( sK1 @ ( sK3 @ X1 ) ) )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: a > a] :
( ( ( ( sK1 @ ( sK3 @ X1 ) )
=> ( ?? @ a
@ ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) ) ) )
= $false )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
! [X1: a > a] :
( ( ( ( sK1 @ ( sK2 @ X1 ) )
=> ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
= $false )
| ( ( ( sK1 @ ( sK3 @ X1 ) )
=> ( ?? @ a
@ ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) ) ) )
= $false ) ),
inference(beta_eta_normalization,[status(thm)],[f16]) ).
thf(f16,plain,
! [X1: a > a] :
( ( $false
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( ?? @ a
@ ^ [Y1: a] :
( ( (=) @ Y1 )
= ( ^ [Y2: a] :
( ( sK1 @ Y2 )
& ( ( X1 @ Y2 )
= Y0 ) ) ) ) ) )
@ ( sK3 @ X1 ) ) )
| ( ( ( sK1 @ ( sK2 @ X1 ) )
=> ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
= $false ) ),
inference(sigma_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
! [X1: a > a] :
( ( $false
= ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( ?? @ a
@ ^ [Y1: a] :
( ( (=) @ Y1 )
= ( ^ [Y2: a] :
( ( sK1 @ Y2 )
& ( ( X1 @ Y2 )
= Y0 ) ) ) ) ) ) ) )
| ( ( ( sK1 @ ( sK2 @ X1 ) )
=> ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
= $false ) ),
inference(beta_eta_normalization,[status(thm)],[f14]) ).
thf(f14,plain,
! [X1: a > a] :
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( sK1 @ ( X1 @ Y0 ) ) )
@ ( sK2 @ X1 ) )
= $false )
| ( $false
= ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( ?? @ a
@ ^ [Y1: a] :
( ( (=) @ Y1 )
= ( ^ [Y2: a] :
( ( sK1 @ Y2 )
& ( ( X1 @ Y2 )
= Y0 ) ) ) ) ) ) ) ) ),
inference(sigma_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
! [X1: a > a] :
( ( $false
= ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( sK1 @ ( X1 @ Y0 ) ) ) ) )
| ( $false
= ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( ?? @ a
@ ^ [Y1: a] :
( ( (=) @ Y1 )
= ( ^ [Y2: a] :
( ( sK1 @ Y2 )
& ( ( X1 @ Y2 )
= Y0 ) ) ) ) ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
! [X1: a > a] :
( $false
= ( ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( sK1 @ ( X1 @ Y0 ) ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( ( sK1 @ Y0 )
=> ( ?? @ a
@ ^ [Y1: a] :
( ( (=) @ Y1 )
= ( ^ [Y2: a] :
( ( sK1 @ Y2 )
& ( ( X1 @ Y2 )
= Y0 ) ) ) ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f11]) ).
thf(f11,plain,
! [X1: a > a] :
( ( ^ [Y0: a > a] :
( ( !! @ a
@ ^ [Y1: a] :
( ( sK1 @ Y1 )
=> ( sK1 @ ( Y0 @ Y1 ) ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( sK1 @ Y1 )
=> ( ?? @ a
@ ^ [Y2: a] :
( ( (=) @ Y2 )
= ( ^ [Y3: a] :
( ( sK1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y1 ) ) ) ) ) ) ) )
@ X1 )
= $false ),
inference(pi_clausification,[status(thm)],[f10]) ).
thf(f10,plain,
( $false
= ( ?? @ ( a > a )
@ ^ [Y0: a > a] :
( ( !! @ a
@ ^ [Y1: a] :
( ( sK1 @ Y1 )
=> ( sK1 @ ( Y0 @ Y1 ) ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( ( sK1 @ Y1 )
=> ( ?? @ a
@ ^ [Y2: a] :
( ( (=) @ Y2 )
= ( ^ [Y3: a] :
( ( sK1 @ Y3 )
& ( ( Y0 @ Y3 )
= Y1 ) ) ) ) ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f9]) ).
thf(f9,plain,
( $false
= ( ^ [Y0: a > $o] :
( ?? @ ( a > a )
@ ^ [Y1: a > a] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y0 @ ( Y1 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( ?? @ a
@ ^ [Y3: a] :
( ( (=) @ Y3 )
= ( ^ [Y4: a] :
( ( Y0 @ Y4 )
& ( ( Y1 @ Y4 )
= Y2 ) ) ) ) ) ) ) ) )
@ sK1 ) ),
inference(sigma_clausification,[status(thm)],[f8]) ).
thf(f8,plain,
( $false
= ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ?? @ ( a > a )
@ ^ [Y1: a > a] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y0 @ ( Y1 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( ?? @ a
@ ^ [Y3: a] :
( ( (=) @ Y3 )
= ( ^ [Y4: a] :
( ( Y0 @ Y4 )
& ( ( Y1 @ Y4 )
= Y2 ) ) ) ) ) ) ) ) ) ) ),
inference(not_proxy_clausification,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ~ ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ?? @ ( a > a )
@ ^ [Y1: a > a] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y0 @ ( Y1 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( ?? @ a
@ ^ [Y3: a] :
( ( (=) @ Y3 )
= ( ^ [Y4: a] :
( ( Y0 @ Y4 )
& ( ( Y1 @ Y4 )
= Y2 ) ) ) ) ) ) ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f6]) ).
thf(f6,plain,
( $true
= ( ~ ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ?? @ ( a > a )
@ ^ [Y1: a > a] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y0 @ ( Y1 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( ?? @ a
@ ^ [Y3: a] :
( ( ^ [Y4: a,Y5: a] : ( Y4 = Y5 )
@ Y3 )
= ( ^ [Y4: a] :
( ( Y0 @ Y4 )
& ( ( Y1 @ Y4 )
= Y2 ) ) ) ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
( $true
= ( ~ ( !! @ ( a > $o )
@ ^ [Y0: a > $o] :
( ?? @ ( a > a )
@ ^ [Y1: a > a] :
( ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( Y0 @ ( Y1 @ Y2 ) ) ) )
& ( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
=> ( ?? @ a
@ ^ [Y3: a] :
( ( ^ [Y4: a,Y5: a] : ( Y4 = Y5 )
@ Y3 )
= ( ^ [Y4: a] :
( ( Y0 @ Y4 )
& ( ( Y1 @ Y4 )
= Y2 ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o] :
? [X1: a > a] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ? [X3: a] :
( ( ^ [X4: a,X5: a] : ( X4 = X5 )
@ X3 )
= ( ^ [X6: a] :
( ( ( X1 @ X6 )
= X2 )
& ( X0 @ X6 ) ) ) ) )
& ! [X7: a] :
( ( X0 @ X7 )
=> ( X0 @ ( X1 @ X7 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o] :
? [X1: a > a] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ? [X4: a] :
( ( ^ [X0: a,X3: a] : ( X0 = X3 )
@ X4 )
= ( ^ [X2: a] :
( ( ( X1 @ X2 )
= X3 )
& ( X0 @ X2 ) ) ) ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( X0 @ ( X1 @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o] :
? [X1: a > a] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ? [X4: a] :
( ( ^ [X0: a,X3: a] : ( X0 = X3 )
@ X4 )
= ( ^ [X2: a] :
( ( ( X1 @ X2 )
= X3 )
& ( X0 @ X2 ) ) ) ) )
& ! [X2: a] :
( ( X0 @ X2 )
=> ( X0 @ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZHHU49V7l1/DTF2THF_11069.p',cEQP_1A_pme) ).
thf(f251,plain,
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[status(thm)],[f249]) ).
thf(f249,definition,
( spl0_6
<=> ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition]) ).
thf(f309,plain,
( spl0_6
| ~ spl0_1
| ~ spl0_5 ),
inference(avatar_split_clause,[status(thm)],[f308,f244,f71,f249]) ).
thf(f71,definition,
( spl0_1
<=> ! [X0: a] :
( ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f308,plain,
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ~ spl0_1
| ~ spl0_5 ),
inference(trivial_inequality_removal,[status(thm)],[f307]) ).
thf(f307,plain,
( ( $true = $false )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ~ spl0_1
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f306,f246]) ).
thf(f306,plain,
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f305,f267]) ).
thf(f267,plain,
( ( ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ~ spl0_1 ),
inference(equality_resolution,[status(thm)],[f72]) ).
thf(f72,plain,
( ! [X0: a] :
( ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f71]) ).
thf(f305,plain,
( ( $false
= ( sK1
@ ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f292,f267]) ).
thf(f292,plain,
( ( $false
= ( sK1
@ ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[status(thm)],[f284]) ).
thf(f284,plain,
( ( ( sK3
@ ^ [Y0: a] : Y0 )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( $false
= ( sK1
@ ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ~ spl0_1 ),
inference(superposition,[status(thm)],[f45,f267]) ).
thf(f45,plain,
! [X2: a,X1: a > a] :
( ( ( sK3 @ X1 )
!= ( X1 @ ( sK5 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( sK5 @ X1 @ X2 ) ) )
| ( ( sK5 @ X1 @ X2 )
!= X2 )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f44]) ).
thf(f44,plain,
! [X2: a,X1: a > a] :
( ( ( sK5 @ X1 @ X2 )
!= X2 )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) )
= $false )
| ( $false
= ( sK1 @ ( sK5 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f43]) ).
thf(f43,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( ( ( sK1 @ ( sK5 @ X1 @ X2 ) )
& ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $false )
| ( ( sK5 @ X1 @ X2 )
!= X2 ) ),
inference(equality_proxy_clausification,[status(thm)],[f42]) ).
thf(f42,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( $false
= ( X2
= ( sK5 @ X1 @ X2 ) ) )
| ( ( ( sK1 @ ( sK5 @ X1 @ X2 ) )
& ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f40]) ).
thf(f40,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( ( ( sK1 @ ( sK5 @ X1 @ X2 ) )
& ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
!= ( X2
= ( sK5 @ X1 @ X2 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f39]) ).
thf(f39,plain,
! [X2: a,X1: a > a] :
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) )
@ ( sK5 @ X1 @ X2 ) )
!= ( X2
= ( sK5 @ X1 @ X2 ) ) )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(negative_extensionality,[status(thm)],[f29]) ).
thf(f29,plain,
! [X2: a,X1: a > a] :
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) ) )
!= ( (=) @ X2 ) )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f28]) ).
thf(f28,plain,
! [X2: a,X1: a > a] :
( ( ( ( (=) @ X2 )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) ) ) )
= $false )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f27]) ).
thf(f27,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) )
@ X2 ) ) ),
inference(pi_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( $false
= ( ?? @ a
@ ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f263,plain,
( spl0_5
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f262,f74,f244]) ).
thf(f74,definition,
( spl0_2
<=> ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f262,plain,
( ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f258]) ).
thf(f258,plain,
( ( $true != $true )
| ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| spl0_2 ),
inference(fool_paramodulation,[status(thm)],[f75]) ).
thf(f75,plain,
( ( $true
!= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f74]) ).
thf(f252,plain,
( spl0_6
| spl0_2
| spl0_1 ),
inference(avatar_split_clause,[status(thm)],[f197,f71,f74,f249]) ).
thf(f197,plain,
! [X0: a] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f196]) ).
thf(f196,plain,
! [X0: a] :
( ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 ) ),
inference(beta_eta_normalization,[status(thm)],[f195]) ).
thf(f195,plain,
! [X0: a] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f189]) ).
thf(f189,plain,
! [X0: a] :
( ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( sK5
@ ^ [Y0: a] : Y0
@ X0 )
= X0 )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 ) ),
inference(superposition,[status(thm)],[f45,f49]) ).
thf(f49,plain,
! [X2: a,X1: a > a] :
( ( ( sK3 @ X1 )
= ( X1 @ ( sK5 @ X1 @ X2 ) ) )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( ( sK5 @ X1 @ X2 )
= X2 ) ),
inference(equality_proxy_clausification,[status(thm)],[f47]) ).
thf(f47,plain,
! [X2: a,X1: a > a] :
( ( ( sK5 @ X1 @ X2 )
= X2 )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f46]) ).
thf(f46,plain,
! [X2: a,X1: a > a] :
( ( ( ( sK1 @ ( sK5 @ X1 @ X2 ) )
& ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $true )
| ( ( sK5 @ X1 @ X2 )
= X2 )
| ( $true
= ( sK1 @ ( sK2 @ X1 ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f41]) ).
thf(f41,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( sK1 @ ( sK2 @ X1 ) ) )
| ( $true
= ( X2
= ( sK5 @ X1 @ X2 ) ) )
| ( ( ( sK1 @ ( sK5 @ X1 @ X2 ) )
& ( ( X1 @ ( sK5 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f40]) ).
thf(f233,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f232]) ).
thf(f232,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f227]) ).
thf(f227,plain,
( ( $true = $false )
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f83,f224]) ).
thf(f224,plain,
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= $false )
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f223,f170]) ).
thf(f170,plain,
( ( ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ~ spl0_2 ),
inference(equality_resolution,[status(thm)],[f169]) ).
thf(f169,plain,
( ! [X0: a] :
( ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ X0 )
= X0 ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f168]) ).
thf(f168,plain,
( ! [X0: a] :
( ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( $true = $false )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ X0 )
= X0 ) )
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f156,f76]) ).
thf(f76,plain,
( ( $true
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f74]) ).
thf(f156,plain,
! [X0: a] :
( ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ X0 )
= X0 ) ),
inference(beta_eta_normalization,[status(thm)],[f152]) ).
thf(f152,plain,
! [X0: a] :
( ( ( sK1
@ ( ^ [Y0: a] : Y0
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
= $false )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ X0 )
= X0 )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= X0 ) ),
inference(equality_factoring,[status(thm)],[f99]) ).
thf(f99,plain,
! [X2: a,X1: a > a] :
( ( ( sK3 @ X1 )
= ( X1 @ ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( sK6 @ X1 @ X2 )
= X2 ) ),
inference(equality_proxy_clausification,[status(thm)],[f97]) ).
thf(f97,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
| ( ( sK6 @ X1 @ X2 )
= X2 )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f96]) ).
thf(f96,plain,
! [X2: a,X1: a > a] :
( ( ( sK6 @ X1 @ X2 )
= X2 )
| ( ( ( sK1 @ ( sK6 @ X1 @ X2 ) )
& ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $true )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f91]) ).
thf(f91,plain,
! [X2: a,X1: a > a] :
( ( $true
= ( X2
= ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( ( sK1 @ ( sK6 @ X1 @ X2 ) )
& ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f90]) ).
thf(f90,plain,
! [X2: a,X1: a > a] :
( ( ( ( sK1 @ ( sK6 @ X1 @ X2 ) )
& ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
!= ( X2
= ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f89]) ).
thf(f89,plain,
! [X2: a,X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) )
@ ( sK6 @ X1 @ X2 ) )
!= ( X2
= ( sK6 @ X1 @ X2 ) ) ) ),
inference(negative_extensionality,[status(thm)],[f24]) ).
thf(f24,plain,
! [X2: a,X1: a > a] :
( ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) ) )
!= ( (=) @ X2 ) )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
! [X2: a,X1: a > a] :
( ( ( ( (=) @ X2 )
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( ( X1 @ Y0 )
= ( sK3 @ X1 ) ) ) ) )
= $false )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f22]) ).
thf(f22,plain,
! [X2: a,X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( $false
= ( ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) )
@ X2 ) ) ),
inference(pi_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( $false
= ( ?? @ a
@ ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
! [X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( ( sK1 @ ( sK3 @ X1 ) )
=> ( ?? @ a
@ ^ [Y0: a] :
( ( (=) @ Y0 )
= ( ^ [Y1: a] :
( ( sK1 @ Y1 )
& ( ( X1 @ Y1 )
= ( sK3 @ X1 ) ) ) ) ) ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f17]) ).
thf(f223,plain,
( ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f222]) ).
thf(f222,plain,
( ( $true = $false )
| ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f221,f76]) ).
thf(f221,plain,
( ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ~ spl0_2 ),
inference(subsumption_resolution,[status(thm)],[f220,f170]) ).
thf(f220,plain,
( ( $false
= ( sK1
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ~ spl0_2 ),
inference(beta_eta_normalization,[status(thm)],[f219]) ).
thf(f219,plain,
( ( ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ( ( sK1
@ ( ^ [Y0: a] : Y0
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
= $false )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f205]) ).
thf(f205,plain,
( ( $false
= ( sK1
@ ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) ) )
| ( ( sK6
@ ^ [Y0: a] : Y0
@ ( sK3
@ ^ [Y0: a] : Y0 ) )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( ( sK3
@ ^ [Y0: a] : Y0 )
!= ( sK3
@ ^ [Y0: a] : Y0 ) )
| ( ( sK1
@ ( ^ [Y0: a] : Y0
@ ( sK2
@ ^ [Y0: a] : Y0 ) ) )
= $false )
| ~ spl0_2 ),
inference(superposition,[status(thm)],[f95,f170]) ).
thf(f95,plain,
! [X2: a,X1: a > a] :
( ( ( sK3 @ X1 )
!= ( X1 @ ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( sK6 @ X1 @ X2 )
!= X2 ) ),
inference(equality_proxy_clausification,[status(thm)],[f94]) ).
thf(f94,plain,
! [X2: a,X1: a > a] :
( ( $false
= ( sK1 @ ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
| ( ( sK6 @ X1 @ X2 )
!= X2 )
| ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f93]) ).
thf(f93,plain,
! [X2: a,X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( $false
= ( sK1 @ ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( X2
= ( sK6 @ X1 @ X2 ) ) )
| ( $false
= ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f92]) ).
thf(f92,plain,
! [X2: a,X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( ( ( sK1 @ ( sK6 @ X1 @ X2 ) )
& ( ( X1 @ ( sK6 @ X1 @ X2 ) )
= ( sK3 @ X1 ) ) )
= $false )
| ( $false
= ( X2
= ( sK6 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f90]) ).
thf(f83,plain,
( ( $true
= ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[status(thm)],[f79]) ).
thf(f79,plain,
( ( $true = $false )
| ( $true
= ( sK1
@ ( sK3
@ ^ [Y0: a] : Y0 ) ) )
| ~ spl0_2 ),
inference(superposition,[status(thm)],[f76,f21]) ).
thf(f21,plain,
! [X1: a > a] :
( ( $false
= ( sK1 @ ( X1 @ ( sK2 @ X1 ) ) ) )
| ( $true
= ( sK1 @ ( sK3 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV080^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 : n005.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:39:44 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 : SEV080^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 RELN-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_0857 [Bro09]
% 0.28/0.46
% 0.28/0.46 % Status : Theorem
% 0.28/0.46 % Rating : 0.22 v9.1.0, 0.38 v9.0.0, 0.50 v8.2.0, 0.62 v8.1.0, 0.64 v7.5.0, 0.43 v7.4.0, 0.44 v7.2.0, 0.38 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.29 v5.5.0, 0.33 v5.4.0, 0.40 v4.1.0, 0.33 v4.0.1, 0.67 v4.0.0
% 0.28/0.46 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.28/0.46 % Number of atoms : 3 ( 3 equ; 0 cnn)
% 0.28/0.46 % Maximal formula atoms : 1 ( 3 avg)
% 0.28/0.46 % Number of connectives : 11 ( 0 ~; 0 |; 2 &; 7 @)
% 0.28/0.46 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.28/0.46 % Maximal formula depth : 8 ( 8 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 : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.28/0.46 % Number of variables : 8 ( 3 ^; 3 !; 2 ?; 8 :)
% 0.28/0.46 % SPC : TH0_THM_EQU_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(cEQP_1A_pme,conjecture,
% 0.28/0.46 ! [Xx: a > $o] :
% 0.28/0.46 ? [Xs: a > a] :
% 0.28/0.46 ( ! [Xx0: a] :
% 0.28/0.46 ( ( Xx @ Xx0 )
% 0.28/0.46 => ( Xx @ ( Xs @ Xx0 ) ) )
% 0.28/0.46 & ! [Xy: a] :
% 0.28/0.46 ( ( Xx @ Xy )
% 0.28/0.46 => ? [Xy_28: a] :
% 0.28/0.46 ( ( ^ [Xx0: a] :
% 0.28/0.46 ( ( Xx @ Xx0 )
% 0.28/0.46 & ( Xy
% 0.28/0.46 = ( Xs @ Xx0 ) ) ) )
% 0.28/0.46 = ( ^ [Xx: a,Xy: a] : ( Xx = Xy )
% 0.28/0.46 @ Xy_28 ) ) ) ) ).
% 0.28/0.46
% 0.28/0.46 %------------------------------------------------------------------------------
% 0.28/0.46 ------------------------
% 1.48/1.23 ---- Embedded in THF ---
% 1.48/1.23 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.23 %%% Generated on Tue Feb 24 12:39:45 EST 2026
% 1.48/1.23 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.23 %%% Logic specification used:
% 1.48/1.23 %%% thf(spec, logic, $$dhol).
% 1.48/1.23
% 1.48/1.23 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ZHHU49V7l1/DTF2DTF11069.p
% See solution above
% 1.48/1.23 ------------------------
% 1.48/1.24 ---- Cleaned THF ---
% 1.48/1.24 thf(a_type,type,
% 1.48/1.24 a: $tType ).
% 1.48/1.24
% 1.48/1.24 thf(cEQP_1A_pme,conjecture,
% 1.48/1.24 ! [Xx: a > $o] :
% 1.48/1.24 ? [Xs: a > a] :
% 1.48/1.24 ( ! [Xx0: a] :
% 1.48/1.24 ( ( Xx @ Xx0 )
% 1.48/1.24 => ( Xx @ ( Xs @ Xx0 ) ) )
% 1.48/1.24 & ! [Xy: a] :
% 1.48/1.24 ( ( Xx @ Xy )
% 1.48/1.24 => ? [Xy_28: a] :
% 1.48/1.24 ( ( ^ [Xx0: a] :
% 1.48/1.24 ( ( Xx @ Xx0 )
% 1.48/1.24 & ( Xy
% 1.48/1.24 = ( Xs @ Xx0 ) ) ) )
% 1.48/1.24 = ( ^ [Xx: a,Xy: a] : ( Xx = Xy )
% 1.48/1.24 @ Xy_28 ) ) ) ) ).
% 1.48/1.24 ------------------------
% 1.48/1.25 % (11350)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/183Mi)
% 1.48/1.26 % (11351)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_11069 for (2999ds/4Mi)
% 1.48/1.26 % (11351)Instruction limit reached!
% 1.48/1.26 % (11351)------------------------------
% 1.48/1.26 % (11351)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (11351)Termination reason: Unknown
% 1.48/1.26 % (11351)Termination phase: Saturation
% 1.48/1.26
% 1.48/1.26 % (11351)Memory used [KB]: 5500
% 1.48/1.26 % (11351)Time elapsed: 0.003 s
% 1.48/1.26 % (11351)Instructions burned: 5 (million)
% 1.48/1.26 % (11351)------------------------------
% 1.48/1.26 % (11351)------------------------------
% 1.48/1.26 % (11352)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_11069 for (2999ds/27Mi)
% 1.48/1.26 % (11353)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/2Mi)
% 1.48/1.26 % (11354)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_11069 for (2999ds/2Mi)
% 1.48/1.26 % (11355)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_11069 for (2999ds/275Mi)
% 1.48/1.26 % (11356)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/18Mi)
% 1.48/1.26 % (11354)Instruction limit reached!
% 1.48/1.26 % (11354)------------------------------
% 1.48/1.26 % (11354)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (11354)Termination reason: Unknown
% 1.48/1.26 % (11354)Termination phase: Property scanning
% 1.48/1.26
% 1.48/1.26 % (11354)Memory used [KB]: 895
% 1.48/1.26 % (11354)Time elapsed: 0.003 s
% 1.48/1.26 % (11354)Instructions burned: 2 (million)
% 1.48/1.26 % (11354)------------------------------
% 1.48/1.26 % (11354)------------------------------
% 1.48/1.26 % (11353)Instruction limit reached!
% 1.48/1.26 % (11353)------------------------------
% 1.48/1.26 % (11353)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.26 % (11353)Termination reason: Unknown
% 1.48/1.26 % (11353)Termination phase: Saturation
% 1.48/1.26
% 1.48/1.26 % (11353)Memory used [KB]: 5500
% 1.48/1.26 % (11353)Time elapsed: 0.004 s
% 1.48/1.26 % (11353)Instructions burned: 3 (million)
% 1.48/1.26 % (11353)------------------------------
% 1.48/1.26 % (11353)------------------------------
% 1.48/1.27 % (11355)Refutation not found, incomplete strategy
% 1.48/1.27 % (11355)------------------------------
% 1.48/1.27 % (11355)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (11355)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.27
% 1.48/1.27
% 1.48/1.27 % (11355)Memory used [KB]: 5500
% 1.48/1.27 % (11355)Time elapsed: 0.006 s
% 1.48/1.27 % (11355)Instructions burned: 5 (million)
% 1.48/1.27 % (11355)------------------------------
% 1.48/1.27 % (11355)------------------------------
% 1.48/1.27 % (11356)Instruction limit reached!
% 1.48/1.27 % (11356)------------------------------
% 1.48/1.27 % (11356)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.27 % (11356)Termination reason: Unknown
% 1.48/1.27 % (11356)Termination phase: Saturation
% 1.48/1.27
% 1.48/1.27 % (11356)Memory used [KB]: 5628
% 1.48/1.27 % (11356)Time elapsed: 0.014 s
% 1.48/1.27 % (11356)Instructions burned: 18 (million)
% 1.48/1.27 % (11356)------------------------------
% 1.48/1.27 % (11356)------------------------------
% 1.48/1.27 % (11357)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/3Mi)
% 1.48/1.28 % (11357)Instruction limit reached!
% 1.48/1.28 % (11357)------------------------------
% 1.48/1.28 % (11357)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (11357)Termination reason: Unknown
% 1.48/1.28 % (11357)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (11357)Memory used [KB]: 5500
% 1.48/1.28 % (11357)Time elapsed: 0.004 s
% 1.48/1.28 % (11357)Instructions burned: 3 (million)
% 1.48/1.28 % (11357)------------------------------
% 1.48/1.28 % (11357)------------------------------
% 1.48/1.28 % (11352)Instruction limit reached!
% 1.48/1.28 % (11352)------------------------------
% 1.48/1.28 % (11352)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.28 % (11352)Termination reason: Unknown
% 1.48/1.28 % (11352)Termination phase: Saturation
% 1.48/1.28
% 1.48/1.28 % (11352)Memory used [KB]: 5628
% 1.48/1.28 % (11352)Time elapsed: 0.019 s
% 1.48/1.28 % (11352)Instructions burned: 27 (million)
% 1.48/1.28 % (11352)------------------------------
% 1.48/1.28 % (11352)------------------------------
% 1.48/1.28 % (11358)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_11069 for (2999ds/37Mi)
% 1.48/1.28 % (11359)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/15Mi)
% 1.48/1.29 % (11360)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/3Mi)
% 1.48/1.29 % (11360)Instruction limit reached!
% 1.48/1.29 % (11360)------------------------------
% 1.48/1.29 % (11360)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.29 % (11360)Termination reason: Unknown
% 1.48/1.29 % (11360)Termination phase: Saturation
% 1.48/1.29
% 1.48/1.29 % (11360)Memory used [KB]: 5500
% 1.48/1.29 % (11360)Time elapsed: 0.004 s
% 1.48/1.29 % (11360)Instructions burned: 3 (million)
% 1.48/1.29 % (11360)------------------------------
% 1.48/1.29 % (11360)------------------------------
% 1.48/1.29 % (11359)Refutation not found, incomplete strategy
% 1.48/1.29 % (11359)------------------------------
% 1.48/1.29 % (11359)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.29 % (11359)Termination reason: Refutation not found, incomplete strategy
% 1.48/1.29
% 1.48/1.29
% 1.48/1.29 % (11359)Memory used [KB]: 5500
% 1.48/1.29 % (11359)Time elapsed: 0.009 s
% 1.48/1.29 % (11359)Instructions burned: 11 (million)
% 1.48/1.29 % (11359)------------------------------
% 1.48/1.29 % (11359)------------------------------
% 1.48/1.29 % (11361)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/1041Mi)
% 1.48/1.29 % (11362)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/7Mi)
% 1.53/1.30 % (11363)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/16Mi)
% 1.53/1.30 % (11362)Instruction limit reached!
% 1.53/1.30 % (11362)------------------------------
% 1.53/1.30 % (11362)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.30 % (11362)Termination reason: Unknown
% 1.53/1.30 % (11362)Termination phase: Saturation
% 1.53/1.30
% 1.53/1.30 % (11362)Memory used [KB]: 1023
% 1.53/1.30 % (11362)Time elapsed: 0.007 s
% 1.53/1.30 % (11362)Instructions burned: 7 (million)
% 1.53/1.30 % (11362)------------------------------
% 1.53/1.30 % (11362)------------------------------
% 1.53/1.30 % (11358)Instruction limit reached!
% 1.53/1.30 % (11358)------------------------------
% 1.53/1.30 % (11358)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.30 % (11358)Termination reason: Unknown
% 1.53/1.30 % (11358)Termination phase: Saturation
% 1.53/1.30
% 1.53/1.30 % (11358)Memory used [KB]: 6012
% 1.53/1.30 % (11358)Time elapsed: 0.021 s
% 1.53/1.30 % (11358)Instructions burned: 37 (million)
% 1.53/1.30 % (11358)------------------------------
% 1.53/1.30 % (11358)------------------------------
% 1.53/1.30 % (11364)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/3Mi)
% 1.53/1.31 % (11364)Instruction limit reached!
% 1.53/1.31 % (11364)------------------------------
% 1.53/1.31 % (11364)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (11364)Termination reason: Unknown
% 1.53/1.31 % (11364)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (11364)Memory used [KB]: 5500
% 1.53/1.31 % (11364)Time elapsed: 0.004 s
% 1.53/1.31 % (11364)Instructions burned: 3 (million)
% 1.53/1.31 % (11364)------------------------------
% 1.53/1.31 % (11364)------------------------------
% 1.53/1.31 % (11365)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/3Mi)
% 1.53/1.31 % (11363)Instruction limit reached!
% 1.53/1.31 % (11363)------------------------------
% 1.53/1.31 % (11363)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (11363)Termination reason: Unknown
% 1.53/1.31 % (11363)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (11363)Memory used [KB]: 5628
% 1.53/1.31 % (11363)Time elapsed: 0.013 s
% 1.53/1.31 % (11363)Instructions burned: 17 (million)
% 1.53/1.31 % (11363)------------------------------
% 1.53/1.31 % (11363)------------------------------
% 1.53/1.31 % (11350)Instruction limit reached!
% 1.53/1.31 % (11350)------------------------------
% 1.53/1.31 % (11350)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (11350)Termination reason: Unknown
% 1.53/1.31 % (11350)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (11350)Memory used [KB]: 6524
% 1.53/1.31 % (11350)Time elapsed: 0.055 s
% 1.53/1.31 % (11350)Instructions burned: 184 (million)
% 1.53/1.31 % (11350)------------------------------
% 1.53/1.31 % (11350)------------------------------
% 1.53/1.31 % (11365)Instruction limit reached!
% 1.53/1.31 % (11365)------------------------------
% 1.53/1.31 % (11365)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.31 % (11365)Termination reason: Unknown
% 1.53/1.31 % (11365)Termination phase: Saturation
% 1.53/1.31
% 1.53/1.31 % (11365)Memory used [KB]: 1023
% 1.53/1.31 % (11365)Time elapsed: 0.004 s
% 1.53/1.31 % (11365)Instructions burned: 3 (million)
% 1.53/1.31 % (11365)------------------------------
% 1.53/1.31 % (11365)------------------------------
% 1.53/1.32 % (11366)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/7Mi)
% 1.53/1.32 % (11367)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/3Mi)
% 1.53/1.32 % (11370)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/710Mi)
% 1.53/1.32 % (11367)Instruction limit reached!
% 1.53/1.32 % (11367)------------------------------
% 1.53/1.32 % (11367)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.32 % (11367)Termination reason: Unknown
% 1.53/1.32 % (11367)Termination phase: Saturation
% 1.53/1.32
% 1.53/1.32 % (11367)Memory used [KB]: 5500
% 1.53/1.32 % (11367)Time elapsed: 0.004 s
% 1.53/1.32 % (11367)Instructions burned: 3 (million)
% 1.53/1.32 % (11367)------------------------------
% 1.53/1.32 % (11367)------------------------------
% 1.53/1.32 % (11366)Refutation not found, incomplete strategy
% 1.53/1.32 % (11366)------------------------------
% 1.53/1.32 % (11366)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.32 % (11366)Termination reason: Refutation not found, incomplete strategy
% 1.53/1.32
% 1.53/1.32
% 1.53/1.32 % (11366)Memory used [KB]: 5500
% 1.53/1.32 % (11366)Time elapsed: 0.005 s
% 1.53/1.32 % (11366)Instructions burned: 5 (million)
% 1.53/1.32 % (11366)------------------------------
% 1.53/1.32 % (11366)------------------------------
% 1.53/1.32 % (11369)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/18Mi)
% 1.53/1.32 % (11368)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/4Mi)
% 1.53/1.33 % (11371)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/6Mi)
% 1.53/1.33 % (11368)Instruction limit reached!
% 1.53/1.33 % (11368)------------------------------
% 1.53/1.33 % (11368)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.33 % (11368)Termination reason: Unknown
% 1.53/1.33 % (11368)Termination phase: Saturation
% 1.53/1.33
% 1.53/1.33 % (11368)Memory used [KB]: 5500
% 1.53/1.33 % (11368)Time elapsed: 0.005 s
% 1.53/1.33 % (11368)Instructions burned: 4 (million)
% 1.53/1.33 % (11368)------------------------------
% 1.53/1.33 % (11368)------------------------------
% 1.53/1.33 % (11369)Instruction limit reached!
% 1.53/1.33 % (11369)------------------------------
% 1.53/1.33 % (11369)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.33 % (11369)Termination reason: Unknown
% 1.53/1.33 % (11369)Termination phase: Saturation
% 1.53/1.33
% 1.53/1.33 % (11369)Memory used [KB]: 5628
% 1.53/1.33 % (11369)Time elapsed: 0.009 s
% 1.53/1.33 % (11369)Instructions burned: 19 (million)
% 1.53/1.33 % (11369)------------------------------
% 1.53/1.33 % (11369)------------------------------
% 1.53/1.33 % (11371)Instruction limit reached!
% 1.53/1.33 % (11371)------------------------------
% 1.53/1.33 % (11371)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.33 % (11371)Termination reason: Unknown
% 1.53/1.33 % (11371)Termination phase: Saturation
% 1.53/1.33
% 1.53/1.33 % (11371)Memory used [KB]: 5500
% 1.53/1.33 % (11371)Time elapsed: 0.006 s
% 1.53/1.33 % (11371)Instructions burned: 6 (million)
% 1.53/1.33 % (11371)------------------------------
% 1.53/1.33 % (11371)------------------------------
% 1.53/1.34 % (11372)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/902Mi)
% 1.53/1.34 % (11375)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/6Mi)
% 1.53/1.34 % (11373)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/21Mi)
% 1.53/1.34 % (11372)Refutation not found, incomplete strategy
% 1.53/1.34 % (11372)------------------------------
% 1.53/1.34 % (11372)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.34 % (11372)Termination reason: Refutation not found, incomplete strategy
% 1.53/1.34
% 1.53/1.34
% 1.53/1.34 % (11372)Memory used [KB]: 5500
% 1.53/1.34 % (11372)Time elapsed: 0.005 s
% 1.53/1.34 % (11372)Instructions burned: 5 (million)
% 1.53/1.34 % (11372)------------------------------
% 1.53/1.34 % (11372)------------------------------
% 1.53/1.34 % (11375)Instruction limit reached!
% 1.53/1.34 % (11375)------------------------------
% 1.53/1.34 % (11375)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.34 % (11375)Termination reason: Unknown
% 1.53/1.34 % (11375)Termination phase: Saturation
% 1.53/1.34
% 1.53/1.34 % (11375)Memory used [KB]: 5500
% 1.53/1.34 % (11375)Time elapsed: 0.004 s
% 1.53/1.34 % (11375)Instructions burned: 7 (million)
% 1.53/1.34 % (11375)------------------------------
% 1.53/1.34 % (11375)------------------------------
% 1.53/1.34 % (11374)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/5Mi)
% 1.53/1.35 % (11374)Instruction limit reached!
% 1.53/1.35 % (11374)------------------------------
% 1.53/1.35 % (11374)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.35 % (11374)Termination reason: Unknown
% 1.53/1.35 % (11374)Termination phase: Saturation
% 1.53/1.35
% 1.53/1.35 % (11374)Memory used [KB]: 5500
% 1.53/1.35 % (11374)Time elapsed: 0.005 s
% 1.53/1.35 % (11374)Instructions burned: 5 (million)
% 1.53/1.35 % (11374)------------------------------
% 1.53/1.35 % (11374)------------------------------
% 1.53/1.35 % (11376)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/377Mi)
% 1.53/1.35 % (11377)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/779Mi)
% 1.53/1.35 % (11373)Instruction limit reached!
% 1.53/1.35 % (11373)------------------------------
% 1.53/1.35 % (11373)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.35 % (11373)Termination reason: Unknown
% 1.53/1.35 % (11373)Termination phase: Saturation
% 1.53/1.35
% 1.53/1.35 % (11373)Memory used [KB]: 5628
% 1.53/1.35 % (11373)Time elapsed: 0.016 s
% 1.53/1.35 % (11373)Instructions burned: 21 (million)
% 1.53/1.35 % (11373)------------------------------
% 1.53/1.35 % (11373)------------------------------
% 1.53/1.36 % (11378)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/19Mi)
% 1.53/1.36 % (11379)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/879Mi)
% 1.53/1.36 % (11378)Instruction limit reached!
% 1.53/1.36 % (11378)------------------------------
% 1.53/1.36 % (11378)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.36 % (11378)Termination reason: Unknown
% 1.53/1.36 % (11378)Termination phase: Saturation
% 1.53/1.36
% 1.53/1.36 % (11378)Memory used [KB]: 5500
% 1.53/1.36 % (11378)Time elapsed: 0.009 s
% 1.53/1.36 % (11378)Instructions burned: 19 (million)
% 1.53/1.36 % (11378)------------------------------
% 1.53/1.36 % (11378)------------------------------
% 1.53/1.36 % (11380)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_11069 for (2999ds/17Mi)
% 1.53/1.37 % (11380)Instruction limit reached!
% 1.53/1.37 % (11380)------------------------------
% 1.53/1.37 % (11380)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.37 % (11380)Termination reason: Unknown
% 1.53/1.37 % (11380)Termination phase: Saturation
% 1.53/1.37
% 1.53/1.37 % (11380)Memory used [KB]: 5628
% 1.53/1.37 % (11380)Time elapsed: 0.029 s
% 1.53/1.37 % (11380)Instructions burned: 17 (million)
% 1.53/1.37 % (11380)------------------------------
% 1.53/1.37 % (11380)------------------------------
% 1.53/1.37 % (11381)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_11069 for (2998ds/3Mi)
% 1.53/1.38 % (11381)Instruction limit reached!
% 1.53/1.38 % (11381)------------------------------
% 1.53/1.38 % (11381)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.38 % (11381)Termination reason: Unknown
% 1.53/1.38 % (11381)Termination phase: Saturation
% 1.53/1.38
% 1.53/1.38 % (11381)Memory used [KB]: 5500
% 1.53/1.38 % (11381)Time elapsed: 0.003 s
% 1.53/1.38 % (11381)Instructions burned: 4 (million)
% 1.53/1.38 % (11381)------------------------------
% 1.53/1.38 % (11381)------------------------------
% 1.53/1.38 % (11382)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_11069 for (2998ds/30Mi)
% 1.53/1.38 % (11377)First to succeed.
% 1.53/1.39 % (11383)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_11069 for (2998ds/127Mi)
% 1.53/1.39 % (11377)Refutation found. Thanks to Tanya!
% 1.53/1.39 % SZS status Theorem for DTF2THF_11069
% 1.53/1.39 % SZS output start Proof for DTF2THF_11069
% 1.53/1.39 thf(type_def_5, type, a: $tType).
% 1.53/1.39 thf(func_def_0, type, a: $tType).
% 1.53/1.39 thf(func_def_17, type, sK1: a > $o).
% 1.53/1.39 thf(func_def_18, type, sK2: (a > a) > a).
% 1.53/1.39 thf(func_def_19, type, sK3: (a > a) > a).
% 1.53/1.39 thf(func_def_20, type, ph4: !>[X0: $tType]:(X0)).
% 1.53/1.39 thf(func_def_21, type, sK5: (a > a) > a > a).
% 1.53/1.39 thf(func_def_22, type, sK6: (a > a) > a > a).
% 1.53/1.39 thf(f322,plain,(
% 1.53/1.39 $false),
% 1.53/1.39 inference(avatar_sat_refutation,[status(thm)],[f233,f252,f263,f309,f321])).
% 1.53/1.39 thf(f321,plain,(
% 1.53/1.39 ~spl0_5 | ~spl0_6),
% 1.53/1.39 inference(avatar_contradiction_clause,[status(thm)],[f320])).
% 1.53/1.39 thf(f320,plain,(
% 1.53/1.39 $false | (~spl0_5 | ~spl0_6)),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f319])).
% 1.53/1.39 thf(f319,plain,(
% 1.53/1.39 ($true = $false) | (~spl0_5 | ~spl0_6)),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f313,f246])).
% 1.53/1.39 thf(f246,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ~spl0_5),
% 1.53/1.39 inference(avatar_component_clause,[status(thm)],[f244])).
% 1.53/1.39 thf(f244,definition,(
% 1.53/1.39 spl0_5 <=> ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0)))))),
% 1.53/1.39 introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition])).
% 1.53/1.39 thf(f313,plain,(
% 1.53/1.39 ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ~spl0_6),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f311])).
% 1.53/1.39 thf(f311,plain,(
% 1.53/1.39 ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ($true = $false) | ~spl0_6),
% 1.53/1.39 inference(superposition,[status(thm)],[f251,f26])).
% 1.53/1.39 thf(f26,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($true = (sK1 @ (sK3 @ X1))) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.53/1.39 thf(f19,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : ((((sK1 @ (sK3 @ X1)) => (?? @ a @ (^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1)))))))) = $false) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.53/1.39 thf(f17,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : ((((sK1 @ (sK2 @ X1)) => (sK1 @ (X1 @ (sK2 @ X1)))) = $false) | (((sK1 @ (sK3 @ X1)) => (?? @ a @ (^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1)))))))) = $false)) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f16])).
% 1.53/1.39 thf(f16,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = ((^[Y0 : a]: ((sK1 @ Y0) => (?? @ a @ (^[Y1 : a]: ((= @ Y1) = (^[Y2 : a]: ((sK1 @ Y2) & ((X1 @ Y2) = Y0)))))))) @ (sK3 @ X1))) | (((sK1 @ (sK2 @ X1)) => (sK1 @ (X1 @ (sK2 @ X1)))) = $false)) )),
% 1.53/1.39 inference(sigma_clausification,[status(thm)],[f15])).
% 1.53/1.39 thf(f15,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = (!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (?? @ a @ (^[Y1 : a]: ((= @ Y1) = (^[Y2 : a]: ((sK1 @ Y2) & ((X1 @ Y2) = Y0)))))))))) | (((sK1 @ (sK2 @ X1)) => (sK1 @ (X1 @ (sK2 @ X1)))) = $false)) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f14])).
% 1.53/1.39 thf(f14,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : ((((^[Y0 : a]: ((sK1 @ Y0) => (sK1 @ (X1 @ Y0)))) @ (sK2 @ X1)) = $false) | ($false = (!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (?? @ a @ (^[Y1 : a]: ((= @ Y1) = (^[Y2 : a]: ((sK1 @ Y2) & ((X1 @ Y2) = Y0))))))))))) )),
% 1.53/1.39 inference(sigma_clausification,[status(thm)],[f13])).
% 1.53/1.39 thf(f13,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = (!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (sK1 @ (X1 @ Y0)))))) | ($false = (!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (?? @ a @ (^[Y1 : a]: ((= @ Y1) = (^[Y2 : a]: ((sK1 @ Y2) & ((X1 @ Y2) = Y0))))))))))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.53/1.39 thf(f12,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = ((!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (sK1 @ (X1 @ Y0))))) & (!! @ a @ (^[Y0 : a]: ((sK1 @ Y0) => (?? @ a @ (^[Y1 : a]: ((= @ Y1) = (^[Y2 : a]: ((sK1 @ Y2) & ((X1 @ Y2) = Y0)))))))))))) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f11])).
% 1.53/1.39 thf(f11,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : ((((^[Y0 : a > a]: ((!! @ a @ (^[Y1 : a]: ((sK1 @ Y1) => (sK1 @ (Y0 @ Y1))))) & (!! @ a @ (^[Y1 : a]: ((sK1 @ Y1) => (?? @ a @ (^[Y2 : a]: ((= @ Y2) = (^[Y3 : a]: ((sK1 @ Y3) & ((Y0 @ Y3) = Y1))))))))))) @ X1) = $false)) )),
% 1.53/1.39 inference(pi_clausification,[status(thm)],[f10])).
% 1.53/1.39 thf(f10,plain,(
% 1.53/1.39 ($false = (?? @ (a > a) @ (^[Y0 : a > a]: ((!! @ a @ (^[Y1 : a]: ((sK1 @ Y1) => (sK1 @ (Y0 @ Y1))))) & (!! @ a @ (^[Y1 : a]: ((sK1 @ Y1) => (?? @ a @ (^[Y2 : a]: ((= @ Y2) = (^[Y3 : a]: ((sK1 @ Y3) & ((Y0 @ Y3) = Y1)))))))))))))),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f9])).
% 1.53/1.39 thf(f9,plain,(
% 1.53/1.39 ($false = ((^[Y0 : a > $o]: (?? @ (a > a) @ (^[Y1 : a > a]: ((!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (Y0 @ (Y1 @ Y2))))) & (!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (?? @ a @ (^[Y3 : a]: ((= @ Y3) = (^[Y4 : a]: ((Y0 @ Y4) & ((Y1 @ Y4) = Y2))))))))))))) @ sK1))),
% 1.53/1.39 inference(sigma_clausification,[status(thm)],[f8])).
% 1.53/1.39 thf(f8,plain,(
% 1.53/1.39 ($false = (!! @ (a > $o) @ (^[Y0 : a > $o]: (?? @ (a > a) @ (^[Y1 : a > a]: ((!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (Y0 @ (Y1 @ Y2))))) & (!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (?? @ a @ (^[Y3 : a]: ((= @ Y3) = (^[Y4 : a]: ((Y0 @ Y4) & ((Y1 @ Y4) = Y2)))))))))))))))),
% 1.53/1.39 inference(not_proxy_clausification,[status(thm)],[f7])).
% 1.53/1.39 thf(f7,plain,(
% 1.53/1.39 ((~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (?? @ (a > a) @ (^[Y1 : a > a]: ((!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (Y0 @ (Y1 @ Y2))))) & (!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (?? @ a @ (^[Y3 : a]: ((= @ Y3) = (^[Y4 : a]: ((Y0 @ Y4) & ((Y1 @ Y4) = Y2))))))))))))))) = $true)),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f6])).
% 1.53/1.39 thf(f6,plain,(
% 1.53/1.39 ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (?? @ (a > a) @ (^[Y1 : a > a]: ((!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (Y0 @ (Y1 @ Y2))))) & (!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (?? @ a @ (^[Y3 : a]: (((^[Y4 : a]: ((^[Y5 : a]: (Y4 = Y5)))) @ Y3) = (^[Y4 : a]: ((Y0 @ Y4) & ((Y1 @ Y4) = Y2))))))))))))))))),
% 1.53/1.39 inference(cnf_transformation,[status(thm)],[f5])).
% 1.53/1.39 thf(f5,plain,(
% 1.53/1.39 ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (?? @ (a > a) @ (^[Y1 : a > a]: ((!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (Y0 @ (Y1 @ Y2))))) & (!! @ a @ (^[Y2 : a]: ((Y0 @ Y2) => (?? @ a @ (^[Y3 : a]: (((^[Y4 : a]: ((^[Y5 : a]: (Y4 = Y5)))) @ Y3) = (^[Y4 : a]: ((Y0 @ Y4) & ((Y1 @ Y4) = Y2))))))))))))))))),
% 1.53/1.39 inference(fool_elimination,[status(thm)],[f4])).
% 1.53/1.39 thf(f4,plain,(
% 1.53/1.39 ~! [X0 : a > $o] : ? [X1 : a > a] : (! [X2 : a] : ((X0 @ X2) => ? [X3 : a] : (((^[X4 : a, X5 : a] : ((X4 = X5))) @ X3) = (^[X6 : a] : (((X1 @ X6) = X2) & (X0 @ X6))))) & ! [X7 : a] : ((X0 @ X7) => (X0 @ (X1 @ X7))))),
% 1.53/1.39 inference(rectify,[status(thm)],[f2])).
% 1.53/1.39 thf(f2,negated_conjecture,(
% 1.53/1.39 ~! [X0 : a > $o] : ? [X1 : a > a] : (! [X3 : a] : ((X0 @ X3) => ? [X4 : a] : (((^[X0 : a, X3 : a] : ((X0 = X3))) @ X4) = (^[X2 : a] : (((X1 @ X2) = X3) & (X0 @ X2))))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 1.53/1.39 inference(negated_conjecture,[status(cth)],[f1])).
% 1.53/1.39 thf(f1,conjecture,(
% 1.53/1.39 ! [X0 : a > $o] : ? [X1 : a > a] : (! [X3 : a] : ((X0 @ X3) => ? [X4 : a] : (((^[X0 : a, X3 : a] : ((X0 = X3))) @ X4) = (^[X2 : a] : (((X1 @ X2) = X3) & (X0 @ X2))))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 1.53/1.39 file('/export/starexec/sandbox/tmp/tmp.ZHHU49V7l1/DTF2THF_11069.p',cEQP_1A_pme)).
% 1.53/1.39 thf(f251,plain,(
% 1.53/1.39 ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ~spl0_6),
% 1.53/1.39 inference(avatar_component_clause,[status(thm)],[f249])).
% 1.53/1.39 thf(f249,definition,(
% 1.53/1.39 spl0_6 <=> ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false)),
% 1.53/1.39 introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition])).
% 1.53/1.39 thf(f309,plain,(
% 1.53/1.39 spl0_6 | ~spl0_1 | ~spl0_5),
% 1.53/1.39 inference(avatar_split_clause,[status(thm)],[f308,f244,f71,f249])).
% 1.53/1.39 thf(f71,definition,(
% 1.53/1.39 spl0_1 <=> ! [X0 : a] : (((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0))),
% 1.53/1.39 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.53/1.39 thf(f308,plain,(
% 1.53/1.39 ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | (~spl0_1 | ~spl0_5)),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f307])).
% 1.53/1.39 thf(f307,plain,(
% 1.53/1.39 ($true = $false) | ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | (~spl0_1 | ~spl0_5)),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f306,f246])).
% 1.53/1.39 thf(f306,plain,(
% 1.53/1.39 ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ~spl0_1),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f305,f267])).
% 1.53/1.39 thf(f267,plain,(
% 1.53/1.39 ((sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) = (sK3 @ (^[Y0 : a]: (Y0)))) | ~spl0_1),
% 1.53/1.39 inference(equality_resolution,[status(thm)],[f72])).
% 1.53/1.39 thf(f72,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0)) ) | ~spl0_1),
% 1.53/1.39 inference(avatar_component_clause,[status(thm)],[f71])).
% 1.53/1.39 thf(f305,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ~spl0_1),
% 1.53/1.39 inference(subsumption_resolution,[status(thm)],[f292,f267])).
% 1.53/1.39 thf(f292,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ((sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ~spl0_1),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f284])).
% 1.53/1.39 thf(f284,plain,(
% 1.53/1.39 ((sK3 @ (^[Y0 : a]: (Y0))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ($false = (sK1 @ (sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ((sK5 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ~spl0_1),
% 1.53/1.39 inference(superposition,[status(thm)],[f45,f267])).
% 1.53/1.39 thf(f45,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK3 @ X1) != (X1 @ (sK5 @ X1 @ X2))) | ($false = (sK1 @ (sK5 @ X1 @ X2))) | ((sK5 @ X1 @ X2) != X2) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f44])).
% 1.53/1.39 thf(f44,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK5 @ X1 @ X2) != X2) | ($true = (sK1 @ (sK2 @ X1))) | (((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1)) = $false) | ($false = (sK1 @ (sK5 @ X1 @ X2)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f43])).
% 1.53/1.39 thf(f43,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | (((sK1 @ (sK5 @ X1 @ X2)) & ((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1))) = $false) | ((sK5 @ X1 @ X2) != X2)) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f42])).
% 1.53/1.39 thf(f42,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | ($false = (X2 = (sK5 @ X1 @ X2))) | (((sK1 @ (sK5 @ X1 @ X2)) & ((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1))) = $false)) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f40])).
% 1.53/1.39 thf(f40,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | (((sK1 @ (sK5 @ X1 @ X2)) & ((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1))) != (X2 = (sK5 @ X1 @ X2)))) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f39])).
% 1.53/1.39 thf(f39,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : ((((^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1)))) @ (sK5 @ X1 @ X2)) != (X2 = (sK5 @ X1 @ X2))) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(negative_extensionality,[status(thm)],[f29])).
% 1.53/1.39 thf(f29,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1)))) != (= @ X2)) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f28])).
% 1.53/1.39 thf(f28,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : ((((= @ X2) = (^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1))))) = $false) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f27])).
% 1.53/1.39 thf(f27,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | ($false = ((^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1)))))) @ X2))) )),
% 1.53/1.39 inference(pi_clausification,[status(thm)],[f25])).
% 1.53/1.39 thf(f25,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | ($false = (?? @ a @ (^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1))))))))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.53/1.39 thf(f263,plain,(
% 1.53/1.39 spl0_5 | spl0_2),
% 1.53/1.39 inference(avatar_split_clause,[status(thm)],[f262,f74,f244])).
% 1.53/1.39 thf(f74,definition,(
% 1.53/1.39 spl0_2 <=> ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0)))))),
% 1.53/1.39 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.53/1.39 thf(f262,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f258])).
% 1.53/1.39 thf(f258,plain,(
% 1.53/1.39 ($true != $true) | ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | spl0_2),
% 1.53/1.39 inference(fool_paramodulation,[status(thm)],[f75])).
% 1.53/1.39 thf(f75,plain,(
% 1.53/1.39 ($true != (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | spl0_2),
% 1.53/1.39 inference(avatar_component_clause,[status(thm)],[f74])).
% 1.53/1.39 thf(f252,plain,(
% 1.53/1.39 spl0_6 | spl0_2 | spl0_1),
% 1.53/1.39 inference(avatar_split_clause,[status(thm)],[f197,f71,f74,f249])).
% 1.53/1.39 thf(f197,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0)))))) )),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f196])).
% 1.53/1.39 thf(f196,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0) | ((sK3 @ (^[Y0 : a]: (Y0))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0)) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f195])).
% 1.53/1.39 thf(f195,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | (((^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0))))) )),
% 1.53/1.39 inference(duplicate_literal_removal,[status(thm)],[f189])).
% 1.53/1.39 thf(f189,plain,(
% 1.53/1.39 ( ! [X0 : a] : (($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ((sK5 @ (^[Y0 : a]: (Y0)) @ X0) = X0) | ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | (((^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0)) )),
% 1.53/1.39 inference(superposition,[status(thm)],[f45,f49])).
% 1.53/1.39 thf(f49,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK3 @ X1) = (X1 @ (sK5 @ X1 @ X2))) | ($true = (sK1 @ (sK2 @ X1))) | ((sK5 @ X1 @ X2) = X2)) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f47])).
% 1.53/1.39 thf(f47,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK5 @ X1 @ X2) = X2) | ($true = (sK1 @ (sK2 @ X1))) | (((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1)) = $true)) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f46])).
% 1.53/1.39 thf(f46,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : ((((sK1 @ (sK5 @ X1 @ X2)) & ((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1))) = $true) | ((sK5 @ X1 @ X2) = X2) | ($true = (sK1 @ (sK2 @ X1)))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f41])).
% 1.53/1.39 thf(f41,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (sK1 @ (sK2 @ X1))) | ($true = (X2 = (sK5 @ X1 @ X2))) | (((sK1 @ (sK5 @ X1 @ X2)) & ((X1 @ (sK5 @ X1 @ X2)) = (sK3 @ X1))) = $true)) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f40])).
% 1.53/1.39 thf(f233,plain,(
% 1.53/1.39 ~spl0_2),
% 1.53/1.39 inference(avatar_contradiction_clause,[status(thm)],[f232])).
% 1.53/1.39 thf(f232,plain,(
% 1.53/1.39 $false | ~spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f227])).
% 1.53/1.39 thf(f227,plain,(
% 1.53/1.39 ($true = $false) | ~spl0_2),
% 1.53/1.39 inference(backward_demodulation,[status(thm)],[f83,f224])).
% 1.53/1.39 thf(f224,plain,(
% 1.53/1.39 ((sK1 @ (sK3 @ (^[Y0 : a]: (Y0)))) = $false) | ~spl0_2),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f223,f170])).
% 1.53/1.39 thf(f170,plain,(
% 1.53/1.39 ((sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) = (sK3 @ (^[Y0 : a]: (Y0)))) | ~spl0_2),
% 1.53/1.39 inference(equality_resolution,[status(thm)],[f169])).
% 1.53/1.39 thf(f169,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK6 @ (^[Y0 : a]: (Y0)) @ X0) = X0)) ) | ~spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f168])).
% 1.53/1.39 thf(f168,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ($true = $false) | ((sK6 @ (^[Y0 : a]: (Y0)) @ X0) = X0)) ) | ~spl0_2),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f156,f76])).
% 1.53/1.39 thf(f76,plain,(
% 1.53/1.39 ($true = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ~spl0_2),
% 1.53/1.39 inference(avatar_component_clause,[status(thm)],[f74])).
% 1.53/1.39 thf(f156,plain,(
% 1.53/1.39 ( ! [X0 : a] : (($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0) | ((sK6 @ (^[Y0 : a]: (Y0)) @ X0) = X0)) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f152])).
% 1.53/1.39 thf(f152,plain,(
% 1.53/1.39 ( ! [X0 : a] : (((sK1 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))) = $false) | ((sK6 @ (^[Y0 : a]: (Y0)) @ X0) = X0) | ((sK3 @ (^[Y0 : a]: (Y0))) != X0)) )),
% 1.53/1.39 inference(equality_factoring,[status(thm)],[f99])).
% 1.53/1.39 thf(f99,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK3 @ X1) = (X1 @ (sK6 @ X1 @ X2))) | ($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ((sK6 @ X1 @ X2) = X2)) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f97])).
% 1.53/1.39 thf(f97,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) | ((sK6 @ X1 @ X2) = X2) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f96])).
% 1.53/1.39 thf(f96,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK6 @ X1 @ X2) = X2) | (((sK1 @ (sK6 @ X1 @ X2)) & ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) = $true) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f91])).
% 1.53/1.39 thf(f91,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($true = (X2 = (sK6 @ X1 @ X2))) | ($false = (sK1 @ (X1 @ (sK2 @ X1)))) | (((sK1 @ (sK6 @ X1 @ X2)) & ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) = $true)) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f90])).
% 1.53/1.39 thf(f90,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : ((((sK1 @ (sK6 @ X1 @ X2)) & ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) != (X2 = (sK6 @ X1 @ X2))) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f89])).
% 1.53/1.39 thf(f89,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | (((^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1)))) @ (sK6 @ X1 @ X2)) != (X2 = (sK6 @ X1 @ X2)))) )),
% 1.53/1.39 inference(negative_extensionality,[status(thm)],[f24])).
% 1.53/1.39 thf(f24,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1)))) != (= @ X2)) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f23])).
% 1.53/1.39 thf(f23,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : ((((= @ X2) = (^[Y0 : a]: ((sK1 @ Y0) & ((X1 @ Y0) = (sK3 @ X1))))) = $false) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f22])).
% 1.53/1.39 thf(f22,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ($false = ((^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1)))))) @ X2))) )),
% 1.53/1.39 inference(pi_clausification,[status(thm)],[f20])).
% 1.53/1.39 thf(f20,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ($false = (?? @ a @ (^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1))))))))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.53/1.39 thf(f18,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | (((sK1 @ (sK3 @ X1)) => (?? @ a @ (^[Y0 : a]: ((= @ Y0) = (^[Y1 : a]: ((sK1 @ Y1) & ((X1 @ Y1) = (sK3 @ X1)))))))) = $false)) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.53/1.39 thf(f223,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ~spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f222])).
% 1.53/1.39 thf(f222,plain,(
% 1.53/1.39 ($true = $false) | ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ~spl0_2),
% 1.53/1.39 inference(forward_demodulation,[status(thm)],[f221,f76])).
% 1.53/1.39 thf(f221,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ~spl0_2),
% 1.53/1.39 inference(subsumption_resolution,[status(thm)],[f220,f170])).
% 1.53/1.39 thf(f220,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK2 @ (^[Y0 : a]: (Y0))))) | ((sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ~spl0_2),
% 1.53/1.39 inference(beta_eta_normalization,[status(thm)],[f219])).
% 1.53/1.39 thf(f219,plain,(
% 1.53/1.39 ((sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ((sK1 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))) = $false) | ~spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f205])).
% 1.53/1.39 thf(f205,plain,(
% 1.53/1.39 ($false = (sK1 @ (sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ((sK6 @ (^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0)))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ((sK3 @ (^[Y0 : a]: (Y0))) != (sK3 @ (^[Y0 : a]: (Y0)))) | ((sK1 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))) = $false) | ~spl0_2),
% 1.53/1.39 inference(superposition,[status(thm)],[f95,f170])).
% 1.53/1.39 thf(f95,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (((sK3 @ X1) != (X1 @ (sK6 @ X1 @ X2))) | ($false = (sK1 @ (sK6 @ X1 @ X2))) | ($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ((sK6 @ X1 @ X2) != X2)) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f94])).
% 1.53/1.39 thf(f94,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($false = (sK1 @ (sK6 @ X1 @ X2))) | ($false = ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) | ((sK6 @ X1 @ X2) != X2) | ($false = (sK1 @ (X1 @ (sK2 @ X1))))) )),
% 1.53/1.39 inference(equality_proxy_clausification,[status(thm)],[f93])).
% 1.53/1.39 thf(f93,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ($false = (sK1 @ (sK6 @ X1 @ X2))) | ($false = (X2 = (sK6 @ X1 @ X2))) | ($false = ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f92])).
% 1.53/1.39 thf(f92,plain,(
% 1.53/1.39 ( ! [X2 : a,X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | (((sK1 @ (sK6 @ X1 @ X2)) & ((X1 @ (sK6 @ X1 @ X2)) = (sK3 @ X1))) = $false) | ($false = (X2 = (sK6 @ X1 @ X2)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f90])).
% 1.53/1.39 thf(f83,plain,(
% 1.53/1.39 ($true = (sK1 @ (sK3 @ (^[Y0 : a]: (Y0))))) | ~spl0_2),
% 1.53/1.39 inference(trivial_inequality_removal,[status(thm)],[f79])).
% 1.53/1.39 thf(f79,plain,(
% 1.53/1.39 ($true = $false) | ($true = (sK1 @ (sK3 @ (^[Y0 : a]: (Y0))))) | ~spl0_2),
% 1.53/1.39 inference(superposition,[status(thm)],[f76,f21])).
% 1.53/1.39 thf(f21,plain,(
% 1.53/1.39 ( ! [X1 : a > a] : (($false = (sK1 @ (X1 @ (sK2 @ X1)))) | ($true = (sK1 @ (sK3 @ X1)))) )),
% 1.53/1.39 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.53/1.39 % SZS output end Proof for DTF2THF_11069
% 1.53/1.39 % (11377)------------------------------
% 1.53/1.39 % (11377)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.39 % (11377)Termination reason: Refutation
% 1.53/1.39
% 1.53/1.39 % (11377)Memory used [KB]: 5884
% 1.53/1.39 % (11377)Time elapsed: 0.057 s
% 1.53/1.39 % (11377)Instructions burned: 96 (million)
% 1.53/1.39 % (11377)------------------------------
% 1.53/1.39 % (11377)------------------------------
% 1.53/1.39 % (11349)Success in time 0.15 s
%------------------------------------------------------------------------------