%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : PUZ113^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:28:31 AM UTC 2026
% Result : Theorem 1.49s 1.29s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 6
% Syntax : Number of formulae : 70 ( 27 unt; 0 typ; 3 def)
% Number of atoms : 527 ( 106 equ; 0 cnn)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 888 ( 26 ~; 56 |; 44 &; 680 @)
% ( 3 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 54 ( 54 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 13 usr; 9 con; 0-2 aty)
% ( 38 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 97 ( 56 ^; 37 !; 4 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
s: $i > $i ).
thf(func_def_2,type,
cCKB6_BLACK: $i > $i > $o ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_17,type,
sK3: ( $i > $i > $o ) > $i ).
thf(func_def_18,type,
sK4: ( $i > $i > $o ) > $i ).
thf(func_def_19,type,
sK5: $i > $i > $o ).
thf(func_def_20,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f97,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f72,f82,f93,f96]) ).
thf(f96,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[status(thm)],[f95]) ).
thf(f95,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[status(thm)],[f94]) ).
thf(f94,plain,
( ( $true = $false )
| ~ spl2_1 ),
inference(forward_demodulation,[status(thm)],[f60,f75]) ).
thf(f75,plain,
( $false
= ( sK5 @ sK1 @ sK0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f73]) ).
thf(f73,plain,
( ( $false
= ( sK5 @ sK1 @ sK0 ) )
| ( $true = $false ) ),
inference(superposition,[status(thm)],[f49,f42]) ).
thf(f42,plain,
! [X2: $i,X1: $i] :
( ( ( sK5 @ ( s @ X2 ) @ ( s @ X1 ) )
= $true )
| ( ( sK5 @ X2 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f40]) ).
thf(f40,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( sK5 @ ( s @ X2 ) @ ( s @ X1 ) )
& ( sK5 @ ( s @ ( s @ X2 ) ) @ X1 ) ) )
| ( ( sK5 @ X2 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f39]) ).
thf(f39,plain,
! [X2: $i,X1: $i] :
( ( ( sK5 @ X2 @ X1 )
=> ( ( sK5 @ ( s @ X2 ) @ ( s @ X1 ) )
& ( sK5 @ ( s @ ( s @ X2 ) ) @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f38]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK5 @ Y0 @ X1 )
=> ( ( sK5 @ ( s @ Y0 ) @ ( s @ X1 ) )
& ( sK5 @ ( s @ ( s @ Y0 ) ) @ X1 ) ) )
@ X2 ) ),
inference(pi_clausification,[status(thm)],[f37]) ).
thf(f37,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK5 @ Y0 @ X1 )
=> ( ( sK5 @ ( s @ Y0 ) @ ( s @ X1 ) )
& ( sK5 @ ( s @ ( s @ Y0 ) ) @ X1 ) ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f36]) ).
thf(f36,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK5 @ Y1 @ Y0 )
=> ( ( sK5 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( sK5 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f35]) ).
thf(f35,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK5 @ Y1 @ Y0 )
=> ( ( sK5 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( sK5 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f33]) ).
thf(f33,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK5 @ Y1 @ Y0 )
=> ( ( sK5 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( sK5 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) )
& ( sK5 @ c1 @ c1 ) )
= $true ),
inference(binary_proxy_clausification,[status(thm)],[f31]) ).
thf(f31,plain,
( ( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK5 @ Y1 @ Y0 )
=> ( ( sK5 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( sK5 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) )
& ( sK5 @ c1 @ c1 ) )
=> ( sK5 @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) )
= $false ),
inference(beta_eta_normalization,[status(thm)],[f30]) ).
thf(f30,plain,
( ( ^ [Y0: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ( Y0 @ ( s @ Y2 ) @ ( s @ Y1 ) )
& ( Y0 @ ( s @ ( s @ Y2 ) ) @ Y1 ) ) ) ) )
& ( Y0 @ c1 @ c1 ) )
=> ( Y0 @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) )
@ sK5 )
= $false ),
inference(sigma_clausification,[status(thm)],[f29]) ).
thf(f29,plain,
( ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ( Y0 @ ( s @ Y2 ) @ ( s @ Y1 ) )
& ( Y0 @ ( s @ ( s @ Y2 ) ) @ Y1 ) ) ) ) )
& ( Y0 @ c1 @ c1 ) )
=> ( Y0 @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) ) )
!= $true ),
inference(beta_eta_normalization,[status(thm)],[f15]) ).
thf(f15,plain,
( $true
!= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 @ Y3 )
=> ( ( Y2 @ ( s @ Y4 ) @ ( s @ Y3 ) )
& ( Y2 @ ( s @ ( s @ Y4 ) ) @ Y3 ) ) ) ) )
& ( Y2 @ c1 @ c1 ) )
=> ( Y2 @ Y0 @ Y1 ) ) )
@ ( s @ ( s @ sK1 ) )
@ ( s @ ( s @ sK0 ) ) ) ),
inference(definition_unfolding,[status(thm)],[f13,f14]) ).
thf(f14,plain,
( cCKB6_BLACK
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 @ Y3 )
=> ( ( Y2 @ ( s @ Y4 ) @ ( s @ Y3 ) )
& ( Y2 @ ( s @ ( s @ Y4 ) ) @ Y3 ) ) ) ) )
& ( Y2 @ c1 @ c1 ) )
=> ( Y2 @ Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( cCKB6_BLACK
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 @ Y3 )
=> ( ( Y2 @ ( s @ Y4 ) @ ( s @ Y3 ) )
& ( Y2 @ ( s @ ( s @ Y4 ) ) @ Y3 ) ) ) ) )
& ( Y2 @ c1 @ c1 ) )
=> ( Y2 @ Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i > $i > $o] :
( ( ( X2 @ c1 @ c1 )
& ! [X3: $i,X4: $i] :
( ( X2 @ X3 @ X4 )
=> ( ( X2 @ ( s @ ( s @ X3 ) ) @ X4 )
& ( X2 @ ( s @ X3 ) @ ( s @ X4 ) ) ) ) )
=> ( X2 @ X0 @ X1 ) ) )
= cCKB6_BLACK ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $i,X1: $i] :
! [X2: $i > $i > $o] :
( ( ( X2 @ c1 @ c1 )
& ! [X3: $i,X4: $i] :
( ( X2 @ X3 @ X4 )
=> ( ( X2 @ ( s @ ( s @ X3 ) ) @ X4 )
& ( X2 @ ( s @ X3 ) @ ( s @ X4 ) ) ) ) )
=> ( X2 @ X0 @ X1 ) ) )
= cCKB6_BLACK ),
file('/export/starexec/sandbox2/tmp/tmp.HhM0i9KLll/DTF2THF_16979.p',cCKB6_BLACK_def) ).
thf(f13,plain,
( $true
!= ( cCKB6_BLACK @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( $true
!= ( cCKB6_BLACK @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) )
& ( $true
= ( cCKB6_BLACK @ sK1 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: $i,X1: $i] :
( ( ( cCKB6_BLACK @ ( s @ ( s @ X1 ) ) @ ( s @ ( s @ X0 ) ) )
!= $true )
& ( $true
= ( cCKB6_BLACK @ X1 @ X0 ) ) )
=> ( ( $true
!= ( cCKB6_BLACK @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) ) )
& ( $true
= ( cCKB6_BLACK @ sK1 @ sK0 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
? [X0: $i,X1: $i] :
( ( ( cCKB6_BLACK @ ( s @ ( s @ X1 ) ) @ ( s @ ( s @ X0 ) ) )
!= $true )
& ( $true
= ( cCKB6_BLACK @ X1 @ X0 ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: $i,X1: $i] :
( ( $true
= ( cCKB6_BLACK @ X1 @ X0 ) )
=> ( ( cCKB6_BLACK @ ( s @ ( s @ X1 ) ) @ ( s @ ( s @ X0 ) ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i,X1: $i] :
( ( cCKB6_BLACK @ X1 @ X0 )
=> ( cCKB6_BLACK @ ( s @ ( s @ X1 ) ) @ ( s @ ( s @ X0 ) ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X4: $i,X3: $i] :
( ( cCKB6_BLACK @ X3 @ X4 )
=> ( cCKB6_BLACK @ ( s @ ( s @ X3 ) ) @ ( s @ ( s @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
! [X4: $i,X3: $i] :
( ( cCKB6_BLACK @ X3 @ X4 )
=> ( cCKB6_BLACK @ ( s @ ( s @ X3 ) ) @ ( s @ ( s @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HhM0i9KLll/DTF2THF_16979.p',cCKB6_L11000) ).
thf(f49,plain,
( ( sK5 @ ( s @ sK1 ) @ ( s @ sK0 ) )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f47]) ).
thf(f47,plain,
( ( ( sK5 @ ( s @ sK1 ) @ ( s @ sK0 ) )
= $false )
| ( $true = $false ) ),
inference(superposition,[status(thm)],[f42,f32]) ).
thf(f32,plain,
( ( sK5 @ ( s @ ( s @ sK1 ) ) @ ( s @ ( s @ sK0 ) ) )
= $false ),
inference(binary_proxy_clausification,[status(thm)],[f31]) ).
thf(f60,plain,
( ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f58]) ).
thf(f58,definition,
( spl2_1
<=> ( $true
= ( sK5 @ sK1 @ sK0 ) ) ),
introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition]) ).
thf(f93,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[status(thm)],[f92]) ).
thf(f92,plain,
( $false
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f91]) ).
thf(f91,plain,
( ( $true = $false )
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f90,f75]) ).
thf(f90,plain,
( ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f89]) ).
thf(f89,plain,
( ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ( $true = $false )
| ~ spl2_3 ),
inference(forward_demodulation,[status(thm)],[f85,f34]) ).
thf(f34,plain,
( ( sK5 @ c1 @ c1 )
= $true ),
inference(binary_proxy_clausification,[status(thm)],[f33]) ).
thf(f85,plain,
( ( ( sK5 @ c1 @ c1 )
= $false )
| ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f84]) ).
thf(f84,plain,
( ( $true = $false )
| ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ( ( sK5 @ c1 @ c1 )
= $false )
| ~ spl2_3 ),
inference(superposition,[status(thm)],[f27,f68]) ).
thf(f68,plain,
( ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[status(thm)],[f66]) ).
thf(f66,definition,
( spl2_3
<=> ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition]) ).
thf(f27,plain,
! [X1: $i > $i > $o] :
( ( $true
= ( X1 @ ( sK4 @ X1 ) @ ( sK3 @ X1 ) ) )
| ( ( X1 @ sK1 @ sK0 )
= $true )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: $i > $i > $o] :
( ( $false
= ( ( X1 @ ( sK4 @ X1 ) @ ( sK3 @ X1 ) )
=> ( ( X1 @ ( s @ ( sK4 @ X1 ) ) @ ( s @ ( sK3 @ X1 ) ) )
& ( X1 @ ( s @ ( s @ ( sK4 @ X1 ) ) ) @ ( sK3 @ X1 ) ) ) ) )
| ( ( X1 @ sK1 @ sK0 )
= $true )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(beta_eta_normalization,[status(thm)],[f24]) ).
thf(f24,plain,
! [X1: $i > $i > $o] :
( ( ( ^ [Y0: $i] :
( ( X1 @ Y0 @ ( sK3 @ X1 ) )
=> ( ( X1 @ ( s @ Y0 ) @ ( s @ ( sK3 @ X1 ) ) )
& ( X1 @ ( s @ ( s @ Y0 ) ) @ ( sK3 @ X1 ) ) ) )
@ ( sK4 @ X1 ) )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(sigma_clausification,[status(thm)],[f23]) ).
thf(f23,plain,
! [X1: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 @ ( sK3 @ X1 ) )
=> ( ( X1 @ ( s @ Y0 ) @ ( s @ ( sK3 @ X1 ) ) )
& ( X1 @ ( s @ ( s @ Y0 ) ) @ ( sK3 @ X1 ) ) ) ) )
= $false )
| ( ( X1 @ c1 @ c1 )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true ) ),
inference(beta_eta_normalization,[status(thm)],[f22]) ).
thf(f22,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ sK1 @ sK0 )
= $true )
| ( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 @ Y0 )
=> ( ( X1 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( X1 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) )
@ ( sK3 @ X1 ) ) )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(sigma_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
! [X1: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 @ Y0 )
=> ( ( X1 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( X1 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f20,plain,
! [X1: $i > $i > $o] :
( ( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 @ Y0 )
=> ( ( X1 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( X1 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) )
& ( X1 @ c1 @ c1 ) )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
! [X1: $i > $i > $o] :
( $true
= ( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 @ Y0 )
=> ( ( X1 @ ( s @ Y1 ) @ ( s @ Y0 ) )
& ( X1 @ ( s @ ( s @ Y1 ) ) @ Y0 ) ) ) ) )
& ( X1 @ c1 @ c1 ) )
=> ( X1 @ sK1 @ sK0 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f18]) ).
thf(f18,plain,
! [X1: $i > $i > $o] :
( ( ^ [Y0: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ( Y0 @ ( s @ Y2 ) @ ( s @ Y1 ) )
& ( Y0 @ ( s @ ( s @ Y2 ) ) @ Y1 ) ) ) ) )
& ( Y0 @ c1 @ c1 ) )
=> ( Y0 @ sK1 @ sK0 ) )
@ X1 )
= $true ),
inference(pi_clausification,[status(thm)],[f17]) ).
thf(f17,plain,
( $true
= ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( ( Y0 @ ( s @ Y2 ) @ ( s @ Y1 ) )
& ( Y0 @ ( s @ ( s @ Y2 ) ) @ Y1 ) ) ) ) )
& ( Y0 @ c1 @ c1 ) )
=> ( Y0 @ sK1 @ sK0 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f16]) ).
thf(f16,plain,
( $true
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ( ( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 @ Y3 )
=> ( ( Y2 @ ( s @ Y4 ) @ ( s @ Y3 ) )
& ( Y2 @ ( s @ ( s @ Y4 ) ) @ Y3 ) ) ) ) )
& ( Y2 @ c1 @ c1 ) )
=> ( Y2 @ Y0 @ Y1 ) ) )
@ sK1
@ sK0 ) ),
inference(definition_unfolding,[status(thm)],[f12,f14]) ).
thf(f12,plain,
( $true
= ( cCKB6_BLACK @ sK1 @ sK0 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f82,plain,
( spl2_3
| ~ spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f79,f62,f66]) ).
thf(f62,definition,
( spl2_2
<=> ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition]) ).
thf(f79,plain,
( ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[status(thm)],[f77]) ).
thf(f77,plain,
( ( $true = $false )
| ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) )
| ~ spl2_2 ),
inference(superposition,[status(thm)],[f64,f41]) ).
thf(f41,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( sK5 @ ( s @ ( s @ X2 ) ) @ X1 ) )
| ( ( sK5 @ X2 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f40]) ).
thf(f64,plain,
( ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false )
| ~ spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f62]) ).
thf(f72,plain,
( spl2_2
| spl2_3
| spl2_1 ),
inference(avatar_split_clause,[status(thm)],[f71,f58,f66,f62]) ).
thf(f71,plain,
( ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false )
| ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f70]) ).
thf(f70,plain,
( ( $true = $false )
| ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false )
| ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) ) ),
inference(forward_demodulation,[status(thm)],[f53,f34]) ).
thf(f53,plain,
( ( ( sK5 @ c1 @ c1 )
= $false )
| ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false )
| ( $true
= ( sK5 @ sK1 @ sK0 ) )
| ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f52]) ).
thf(f52,plain,
( ( ( sK5 @ ( s @ ( s @ ( sK4 @ sK5 ) ) ) @ ( sK3 @ sK5 ) )
= $false )
| ( $false
= ( sK5 @ ( sK4 @ sK5 ) @ ( sK3 @ sK5 ) ) )
| ( $true = $false )
| ( ( sK5 @ c1 @ c1 )
= $false )
| ( $true
= ( sK5 @ sK1 @ sK0 ) ) ),
inference(superposition,[status(thm)],[f42,f28]) ).
thf(f28,plain,
! [X1: $i > $i > $o] :
( ( ( X1 @ ( s @ ( sK4 @ X1 ) ) @ ( s @ ( sK3 @ X1 ) ) )
= $false )
| ( ( X1 @ ( s @ ( s @ ( sK4 @ X1 ) ) ) @ ( sK3 @ X1 ) )
= $false )
| ( ( X1 @ c1 @ c1 )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f26]) ).
thf(f26,plain,
! [X1: $i > $i > $o] :
( ( ( ( X1 @ ( s @ ( sK4 @ X1 ) ) @ ( s @ ( sK3 @ X1 ) ) )
& ( X1 @ ( s @ ( s @ ( sK4 @ X1 ) ) ) @ ( sK3 @ X1 ) ) )
= $false )
| ( ( X1 @ sK1 @ sK0 )
= $true )
| ( ( X1 @ c1 @ c1 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ113^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n019.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 11:33:24 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.20/0.45 ---- Original DTF file ---
% 0.20/0.46 thf(spec,logic,$$dhol).
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 % File : PUZ113^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.20/0.46 % Domain : Puzzles
% 0.20/0.46 % Problem : TPS problem from CHECKERBOARD-THMS
% 0.20/0.46 % Version : Especial.
% 0.20/0.46 % English :
% 0.20/0.46
% 0.20/0.46 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.46 % Source : [Bro09]
% 0.20/0.46 % Names : tps_0704 [Bro09]
% 0.20/0.46
% 0.20/0.46 % Status : Theorem
% 0.20/0.46 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.10 v8.2.0, 0.23 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.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.2.0
% 0.20/0.46 % Syntax : Number of formulae : 5 ( 1 unt; 3 typ; 1 def)
% 0.20/0.46 % Number of atoms : 4 ( 1 equ; 0 cnn)
% 0.20/0.46 % Maximal formula atoms : 2 ( 2 avg)
% 0.20/0.46 % Number of connectives : 27 ( 0 ~; 0 |; 2 &; 22 @)
% 0.20/0.46 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.46 % Maximal formula depth : 8 ( 5 avg)
% 0.20/0.46 % Number of types : 2 ( 0 usr)
% 0.20/0.46 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.20/0.46 % Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% 0.20/0.46 % Number of variables : 7 ( 2 ^; 5 !; 0 ?; 7 :)
% 0.20/0.46 % SPC : TH0_THM_EQU_NAR
% 0.20/0.46
% 0.20/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.46 % Bugfixes : v5.2.0 - Added missing type declarations.
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 thf(c1_type,type,
% 0.20/0.46 c1: $i ).
% 0.20/0.46
% 0.20/0.46 thf(s_type,type,
% 0.20/0.46 s: $i > $i ).
% 0.20/0.46
% 0.20/0.46 thf(cCKB6_BLACK_type,type,
% 0.20/0.46 cCKB6_BLACK: $i > $i > $o ).
% 0.20/0.46
% 0.20/0.46 thf(cCKB6_BLACK_def,definition,
% 0.20/0.46 ( cCKB6_BLACK
% 0.20/0.46 = ( ^ [Xu: $i,Xv: $i] :
% 0.20/0.46 ! [Xw: $i > $i > $o] :
% 0.20/0.46 ( ( ( Xw @ c1 @ c1 )
% 0.20/0.46 & ! [Xj: $i,Xk: $i] :
% 0.20/0.46 ( ( Xw @ Xj @ Xk )
% 0.20/0.46 => ( ( Xw @ ( s @ ( s @ Xj ) ) @ Xk )
% 0.20/0.46 & ( Xw @ ( s @ Xj ) @ ( s @ Xk ) ) ) ) )
% 0.20/0.46 => ( Xw @ Xu @ Xv ) ) ) ) ).
% 0.20/0.46
% 0.20/0.46 thf(cCKB6_L11000,conjecture,
% 0.20/0.46 ! [Xj: $i,Xk: $i] :
% 0.20/0.46 ( ( cCKB6_BLACK @ Xj @ Xk )
% 0.20/0.46 => ( cCKB6_BLACK @ ( s @ ( s @ Xj ) ) @ ( s @ ( s @ Xk ) ) ) ) ).
% 0.20/0.46
% 0.20/0.46 %------------------------------------------------------------------------------
% 0.20/0.46 ------------------------
% 1.49/1.24 ---- Embedded in THF ---
% 1.49/1.25 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.25 %%% Generated on Tue Feb 24 11:33:25 EST 2026
% 1.49/1.25 %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.25 %%% Logic specification used:
% 1.49/1.25 %%% thf(spec, logic, $$dhol).
% 1.49/1.25
% 1.49/1.25 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.HhM0i9KLll/DTF2DTF16979.p
% See solution above
% 1.49/1.25 ------------------------
% 1.49/1.25 ---- Cleaned THF ---
% 1.49/1.25 thf(c1_type,type,
% 1.49/1.25 c1: $i ).
% 1.49/1.25
% 1.49/1.25 thf(s_type,type,
% 1.49/1.25 s: $i > $i ).
% 1.49/1.25
% 1.49/1.25 thf(cCKB6_BLACK_type,type,
% 1.49/1.25 cCKB6_BLACK: $i > $i > $o ).
% 1.49/1.25
% 1.49/1.25 thf(cCKB6_BLACK_def,definition,
% 1.49/1.25 ( cCKB6_BLACK
% 1.49/1.25 = ( ^ [Xu: $i,Xv: $i] :
% 1.49/1.25 ! [Xw: $i > $i > $o] :
% 1.49/1.25 ( ( ( Xw @ c1 @ c1 )
% 1.49/1.25 & ! [Xj: $i,Xk: $i] :
% 1.49/1.25 ( ( Xw @ Xj @ Xk )
% 1.49/1.25 => ( ( Xw @ ( s @ ( s @ Xj ) ) @ Xk )
% 1.49/1.25 & ( Xw @ ( s @ Xj ) @ ( s @ Xk ) ) ) ) )
% 1.49/1.25 => ( Xw @ Xu @ Xv ) ) ) ) ).
% 1.49/1.25
% 1.49/1.25 thf(cCKB6_L11000,conjecture,
% 1.49/1.25 ! [Xj: $i,Xk: $i] :
% 1.49/1.25 ( ( cCKB6_BLACK @ Xj @ Xk )
% 1.49/1.25 => ( cCKB6_BLACK @ ( s @ ( s @ Xj ) ) @ ( s @ ( s @ Xk ) ) ) ) ).
% 1.49/1.25 ------------------------
% 1.49/1.27 % (17196)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_16979 for (2999ds/4Mi)
% 1.49/1.27 % (17195)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16979 for (2999ds/183Mi)
% 1.49/1.27 % (17196)Instruction limit reached!
% 1.49/1.27 % (17196)------------------------------
% 1.49/1.27 % (17196)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.27 % (17196)Termination reason: Unknown
% 1.49/1.27 % (17196)Termination phase: Saturation
% 1.49/1.27
% 1.49/1.27 % (17196)Memory used [KB]: 5500
% 1.49/1.27 % (17196)Time elapsed: 0.003 s
% 1.49/1.27 % (17196)Instructions burned: 5 (million)
% 1.49/1.27 % (17196)------------------------------
% 1.49/1.27 % (17196)------------------------------
% 1.49/1.28 % (17197)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_16979 for (2999ds/27Mi)
% 1.49/1.28 % (17198)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_16979 for (2999ds/2Mi)
% 1.49/1.28 % (17199)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_16979 for (2999ds/2Mi)
% 1.49/1.28 % (17200)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_16979 for (2999ds/275Mi)
% 1.49/1.28 % (17201)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_16979 for (2999ds/18Mi)
% 1.49/1.28 % (17198)Instruction limit reached!
% 1.49/1.28 % (17198)------------------------------
% 1.49/1.28 % (17198)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.28 % (17198)Termination reason: Unknown
% 1.49/1.28 % (17198)Termination phase: Preprocessing 3
% 1.49/1.28
% 1.49/1.28 % (17198)Memory used [KB]: 895
% 1.49/1.28 % (17198)Time elapsed: 0.003 s
% 1.49/1.28 % (17198)Instructions burned: 2 (million)
% 1.49/1.28 % (17198)------------------------------
% 1.49/1.28 % (17198)------------------------------
% 1.49/1.28 % (17199)Instruction limit reached!
% 1.49/1.28 % (17199)------------------------------
% 1.49/1.28 % (17199)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.28 % (17199)Termination reason: Unknown
% 1.49/1.28 % (17199)Termination phase: Property scanning
% 1.49/1.28
% 1.49/1.28 % (17199)Memory used [KB]: 895
% 1.49/1.28 % (17199)Time elapsed: 0.003 s
% 1.49/1.28 % (17199)Instructions burned: 2 (million)
% 1.49/1.28 % (17199)------------------------------
% 1.49/1.28 % (17199)------------------------------
% 1.49/1.28 % (17200)Refutation not found, incomplete strategy
% 1.49/1.28 % (17200)------------------------------
% 1.49/1.28 % (17200)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.28 % (17200)Termination reason: Refutation not found, incomplete strategy
% 1.49/1.28
% 1.49/1.28
% 1.49/1.28 % (17200)Memory used [KB]: 5500
% 1.49/1.28 % (17200)Time elapsed: 0.003 s
% 1.49/1.28 % (17200)Instructions burned: 2 (million)
% 1.49/1.28 % (17200)------------------------------
% 1.49/1.28 % (17200)------------------------------
% 1.49/1.28 % (17202)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_16979 for (2999ds/3Mi)
% 1.49/1.28 % (17202)Instruction limit reached!
% 1.49/1.28 % (17202)------------------------------
% 1.49/1.28 % (17202)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.28 % (17202)Termination reason: Unknown
% 1.49/1.28 % (17202)Termination phase: Saturation
% 1.49/1.28
% 1.49/1.28 % (17202)Memory used [KB]: 5500
% 1.49/1.28 % (17202)Time elapsed: 0.002 s
% 1.49/1.28 % (17202)Instructions burned: 3 (million)
% 1.49/1.28 % (17202)------------------------------
% 1.49/1.28 % (17202)------------------------------
% 1.49/1.28 % (17197)First to succeed.
% 1.49/1.29 % (17201)Instruction limit reached!
% 1.49/1.29 % (17201)------------------------------
% 1.49/1.29 % (17201)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.29 % (17201)Termination reason: Unknown
% 1.49/1.29 % (17201)Termination phase: Saturation
% 1.49/1.29
% 1.49/1.29 % (17201)Memory used [KB]: 5628
% 1.49/1.29 % (17201)Time elapsed: 0.013 s
% 1.49/1.29 % (17201)Instructions burned: 18 (million)
% 1.49/1.29 % (17201)------------------------------
% 1.49/1.29 % (17201)------------------------------
% 1.49/1.29 % (17197)Refutation found. Thanks to Tanya!
% 1.49/1.29 % SZS status Theorem for DTF2THF_16979
% 1.49/1.29 % SZS output start Proof for DTF2THF_16979
% 1.49/1.29 thf(func_def_1, type, s: $i > $i).
% 1.49/1.29 thf(func_def_2, type, cCKB6_BLACK: $i > $i > $o).
% 1.49/1.29 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 1.49/1.29 thf(func_def_17, type, sK3: ($i > $i > $o) > $i).
% 1.49/1.29 thf(func_def_18, type, sK4: ($i > $i > $o) > $i).
% 1.49/1.29 thf(func_def_19, type, sK5: $i > $i > $o).
% 1.49/1.29 thf(func_def_20, type, ph6: !>[X0: $tType]:(X0)).
% 1.49/1.29 thf(f97,plain,(
% 1.49/1.29 $false),
% 1.49/1.29 inference(avatar_sat_refutation,[status(thm)],[f72,f82,f93,f96])).
% 1.49/1.29 thf(f96,plain,(
% 1.49/1.29 ~spl2_1),
% 1.49/1.29 inference(avatar_contradiction_clause,[status(thm)],[f95])).
% 1.49/1.29 thf(f95,plain,(
% 1.49/1.29 $false | ~spl2_1),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f94])).
% 1.49/1.29 thf(f94,plain,(
% 1.49/1.29 ($true = $false) | ~spl2_1),
% 1.49/1.29 inference(forward_demodulation,[status(thm)],[f60,f75])).
% 1.49/1.29 thf(f75,plain,(
% 1.49/1.29 ($false = (sK5 @ sK1 @ sK0))),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f73])).
% 1.49/1.29 thf(f73,plain,(
% 1.49/1.29 ($false = (sK5 @ sK1 @ sK0)) | ($true = $false)),
% 1.49/1.29 inference(superposition,[status(thm)],[f49,f42])).
% 1.49/1.29 thf(f42,plain,(
% 1.49/1.29 ( ! [X2 : $i,X1 : $i] : (((sK5 @ (s @ X2) @ (s @ X1)) = $true) | ((sK5 @ X2 @ X1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f40])).
% 1.49/1.29 thf(f40,plain,(
% 1.49/1.29 ( ! [X2 : $i,X1 : $i] : (($true = ((sK5 @ (s @ X2) @ (s @ X1)) & (sK5 @ (s @ (s @ X2)) @ X1))) | ((sK5 @ X2 @ X1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f39])).
% 1.49/1.29 thf(f39,plain,(
% 1.49/1.29 ( ! [X2 : $i,X1 : $i] : ((((sK5 @ X2 @ X1) => ((sK5 @ (s @ X2) @ (s @ X1)) & (sK5 @ (s @ (s @ X2)) @ X1))) = $true)) )),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f38])).
% 1.49/1.29 thf(f38,plain,(
% 1.49/1.29 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((sK5 @ Y0 @ X1) => ((sK5 @ (s @ Y0) @ (s @ X1)) & (sK5 @ (s @ (s @ Y0)) @ X1)))) @ X2))) )),
% 1.49/1.29 inference(pi_clausification,[status(thm)],[f37])).
% 1.49/1.29 thf(f37,plain,(
% 1.49/1.29 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((sK5 @ Y0 @ X1) => ((sK5 @ (s @ Y0) @ (s @ X1)) & (sK5 @ (s @ (s @ Y0)) @ X1))))) = $true)) )),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f36])).
% 1.49/1.29 thf(f36,plain,(
% 1.49/1.29 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y1 @ Y0) => ((sK5 @ (s @ Y1) @ (s @ Y0)) & (sK5 @ (s @ (s @ Y1)) @ Y0)))))) @ X1))) )),
% 1.49/1.29 inference(pi_clausification,[status(thm)],[f35])).
% 1.49/1.29 thf(f35,plain,(
% 1.49/1.29 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y1 @ Y0) => ((sK5 @ (s @ Y1) @ (s @ Y0)) & (sK5 @ (s @ (s @ Y1)) @ Y0))))))))),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f33])).
% 1.49/1.29 thf(f33,plain,(
% 1.49/1.29 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y1 @ Y0) => ((sK5 @ (s @ Y1) @ (s @ Y0)) & (sK5 @ (s @ (s @ Y1)) @ Y0))))))) & (sK5 @ c1 @ c1)) = $true)),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f31])).
% 1.49/1.29 thf(f31,plain,(
% 1.49/1.29 ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y1 @ Y0) => ((sK5 @ (s @ Y1) @ (s @ Y0)) & (sK5 @ (s @ (s @ Y1)) @ Y0))))))) & (sK5 @ c1 @ c1)) => (sK5 @ (s @ (s @ sK1)) @ (s @ (s @ sK0)))) = $false)),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f30])).
% 1.49/1.29 thf(f30,plain,(
% 1.49/1.29 (((^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => ((Y0 @ (s @ Y2) @ (s @ Y1)) & (Y0 @ (s @ (s @ Y2)) @ Y1))))))) & (Y0 @ c1 @ c1)) => (Y0 @ (s @ (s @ sK1)) @ (s @ (s @ sK0))))) @ sK5) = $false)),
% 1.49/1.29 inference(sigma_clausification,[status(thm)],[f29])).
% 1.49/1.29 thf(f29,plain,(
% 1.49/1.29 ((!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => ((Y0 @ (s @ Y2) @ (s @ Y1)) & (Y0 @ (s @ (s @ Y2)) @ Y1))))))) & (Y0 @ c1 @ c1)) => (Y0 @ (s @ (s @ sK1)) @ (s @ (s @ sK0)))))) != $true)),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f15])).
% 1.49/1.29 thf(f15,plain,(
% 1.49/1.29 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4 @ Y3) => ((Y2 @ (s @ Y4) @ (s @ Y3)) & (Y2 @ (s @ (s @ Y4)) @ Y3))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))) @ (s @ (s @ sK1)) @ (s @ (s @ sK0))))),
% 1.49/1.29 inference(definition_unfolding,[status(thm)],[f13,f14])).
% 1.49/1.29 thf(f14,plain,(
% 1.49/1.29 (cCKB6_BLACK = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4 @ Y3) => ((Y2 @ (s @ Y4) @ (s @ Y3)) & (Y2 @ (s @ (s @ Y4)) @ Y3))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))))),
% 1.49/1.29 inference(cnf_transformation,[status(thm)],[f8])).
% 1.49/1.29 thf(f8,plain,(
% 1.49/1.29 (cCKB6_BLACK = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4 @ Y3) => ((Y2 @ (s @ Y4) @ (s @ Y3)) & (Y2 @ (s @ (s @ Y4)) @ Y3))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))))),
% 1.49/1.29 inference(fool_elimination,[status(thm)],[f7])).
% 1.49/1.29 thf(f7,plain,(
% 1.49/1.29 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $i > $o] : (((X2 @ c1 @ c1) & ! [X3 : $i,X4 : $i] : ((X2 @ X3 @ X4) => ((X2 @ (s @ (s @ X3)) @ X4) & (X2 @ (s @ X3) @ (s @ X4))))) => (X2 @ X0 @ X1)))) = cCKB6_BLACK)),
% 1.49/1.29 inference(rectify,[status(thm)],[f1])).
% 1.49/1.29 thf(f1,axiom,(
% 1.49/1.29 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $i > $o] : (((X2 @ c1 @ c1) & ! [X3 : $i,X4 : $i] : ((X2 @ X3 @ X4) => ((X2 @ (s @ (s @ X3)) @ X4) & (X2 @ (s @ X3) @ (s @ X4))))) => (X2 @ X0 @ X1)))) = cCKB6_BLACK)),
% 1.49/1.29 file('/export/starexec/sandbox2/tmp/tmp.HhM0i9KLll/DTF2THF_16979.p',cCKB6_BLACK_def)).
% 1.49/1.29 thf(f13,plain,(
% 1.49/1.29 ($true != (cCKB6_BLACK @ (s @ (s @ sK1)) @ (s @ (s @ sK0))))),
% 1.49/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.29 thf(f11,plain,(
% 1.49/1.29 ($true != (cCKB6_BLACK @ (s @ (s @ sK1)) @ (s @ (s @ sK0)))) & ($true = (cCKB6_BLACK @ sK1 @ sK0))),
% 1.49/1.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10])).
% 1.49/1.29 thf(f10,plain,(
% 1.49/1.29 ? [X0 : $i,X1 : $i] : (((cCKB6_BLACK @ (s @ (s @ X1)) @ (s @ (s @ X0))) != $true) & ($true = (cCKB6_BLACK @ X1 @ X0))) => (($true != (cCKB6_BLACK @ (s @ (s @ sK1)) @ (s @ (s @ sK0)))) & ($true = (cCKB6_BLACK @ sK1 @ sK0)))),
% 1.49/1.29 introduced(definition,[],[choice_axiom])).
% 1.49/1.29 thf(f9,plain,(
% 1.49/1.29 ? [X0 : $i,X1 : $i] : (((cCKB6_BLACK @ (s @ (s @ X1)) @ (s @ (s @ X0))) != $true) & ($true = (cCKB6_BLACK @ X1 @ X0)))),
% 1.49/1.29 inference(ennf_transformation,[status(thm)],[f6])).
% 1.49/1.29 thf(f6,plain,(
% 1.49/1.29 ~! [X0 : $i,X1 : $i] : (($true = (cCKB6_BLACK @ X1 @ X0)) => ((cCKB6_BLACK @ (s @ (s @ X1)) @ (s @ (s @ X0))) = $true))),
% 1.49/1.29 inference(fool_elimination,[status(thm)],[f5])).
% 1.49/1.29 thf(f5,plain,(
% 1.49/1.29 ~! [X0 : $i,X1 : $i] : ((cCKB6_BLACK @ X1 @ X0) => (cCKB6_BLACK @ (s @ (s @ X1)) @ (s @ (s @ X0))))),
% 1.49/1.29 inference(rectify,[status(thm)],[f3])).
% 1.49/1.29 thf(f3,negated_conjecture,(
% 1.49/1.29 ~! [X4 : $i,X3 : $i] : ((cCKB6_BLACK @ X3 @ X4) => (cCKB6_BLACK @ (s @ (s @ X3)) @ (s @ (s @ X4))))),
% 1.49/1.29 inference(negated_conjecture,[status(cth)],[f2])).
% 1.49/1.29 thf(f2,conjecture,(
% 1.49/1.29 ! [X4 : $i,X3 : $i] : ((cCKB6_BLACK @ X3 @ X4) => (cCKB6_BLACK @ (s @ (s @ X3)) @ (s @ (s @ X4))))),
% 1.49/1.29 file('/export/starexec/sandbox2/tmp/tmp.HhM0i9KLll/DTF2THF_16979.p',cCKB6_L11000)).
% 1.49/1.29 thf(f49,plain,(
% 1.49/1.29 ((sK5 @ (s @ sK1) @ (s @ sK0)) = $false)),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f47])).
% 1.49/1.29 thf(f47,plain,(
% 1.49/1.29 ((sK5 @ (s @ sK1) @ (s @ sK0)) = $false) | ($true = $false)),
% 1.49/1.29 inference(superposition,[status(thm)],[f42,f32])).
% 1.49/1.29 thf(f32,plain,(
% 1.49/1.29 ((sK5 @ (s @ (s @ sK1)) @ (s @ (s @ sK0))) = $false)),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f31])).
% 1.49/1.29 thf(f60,plain,(
% 1.49/1.29 ($true = (sK5 @ sK1 @ sK0)) | ~spl2_1),
% 1.49/1.29 inference(avatar_component_clause,[status(thm)],[f58])).
% 1.49/1.29 thf(f58,definition,(
% 1.49/1.29 spl2_1 <=> ($true = (sK5 @ sK1 @ sK0))),
% 1.49/1.29 introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition])).
% 1.49/1.29 thf(f93,plain,(
% 1.49/1.29 ~spl2_3),
% 1.49/1.29 inference(avatar_contradiction_clause,[status(thm)],[f92])).
% 1.49/1.29 thf(f92,plain,(
% 1.49/1.29 $false | ~spl2_3),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f91])).
% 1.49/1.29 thf(f91,plain,(
% 1.49/1.29 ($true = $false) | ~spl2_3),
% 1.49/1.29 inference(forward_demodulation,[status(thm)],[f90,f75])).
% 1.49/1.29 thf(f90,plain,(
% 1.49/1.29 ($true = (sK5 @ sK1 @ sK0)) | ~spl2_3),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f89])).
% 1.49/1.29 thf(f89,plain,(
% 1.49/1.29 ($true = (sK5 @ sK1 @ sK0)) | ($true = $false) | ~spl2_3),
% 1.49/1.29 inference(forward_demodulation,[status(thm)],[f85,f34])).
% 1.49/1.29 thf(f34,plain,(
% 1.49/1.29 ((sK5 @ c1 @ c1) = $true)),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f33])).
% 1.49/1.29 thf(f85,plain,(
% 1.49/1.29 ((sK5 @ c1 @ c1) = $false) | ($true = (sK5 @ sK1 @ sK0)) | ~spl2_3),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f84])).
% 1.49/1.29 thf(f84,plain,(
% 1.49/1.29 ($true = $false) | ($true = (sK5 @ sK1 @ sK0)) | ((sK5 @ c1 @ c1) = $false) | ~spl2_3),
% 1.49/1.29 inference(superposition,[status(thm)],[f27,f68])).
% 1.49/1.29 thf(f68,plain,(
% 1.49/1.29 ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5))) | ~spl2_3),
% 1.49/1.29 inference(avatar_component_clause,[status(thm)],[f66])).
% 1.49/1.29 thf(f66,definition,(
% 1.49/1.29 spl2_3 <=> ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5)))),
% 1.49/1.29 introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition])).
% 1.49/1.29 thf(f27,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (($true = (X1 @ (sK4 @ X1) @ (sK3 @ X1))) | ((X1 @ sK1 @ sK0) = $true) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.49/1.29 thf(f25,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (($false = ((X1 @ (sK4 @ X1) @ (sK3 @ X1)) => ((X1 @ (s @ (sK4 @ X1)) @ (s @ (sK3 @ X1))) & (X1 @ (s @ (s @ (sK4 @ X1))) @ (sK3 @ X1))))) | ((X1 @ sK1 @ sK0) = $true) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f24])).
% 1.49/1.29 thf(f24,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : ((((^[Y0 : $i]: ((X1 @ Y0 @ (sK3 @ X1)) => ((X1 @ (s @ Y0) @ (s @ (sK3 @ X1))) & (X1 @ (s @ (s @ Y0)) @ (sK3 @ X1))))) @ (sK4 @ X1)) = $false) | ((X1 @ sK1 @ sK0) = $true) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(sigma_clausification,[status(thm)],[f23])).
% 1.49/1.29 thf(f23,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0 @ (sK3 @ X1)) => ((X1 @ (s @ Y0) @ (s @ (sK3 @ X1))) & (X1 @ (s @ (s @ Y0)) @ (sK3 @ X1)))))) = $false) | ((X1 @ c1 @ c1) = $false) | ((X1 @ sK1 @ sK0) = $true)) )),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f22])).
% 1.49/1.29 thf(f22,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (((X1 @ sK1 @ sK0) = $true) | ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1 @ Y0) => ((X1 @ (s @ Y1) @ (s @ Y0)) & (X1 @ (s @ (s @ Y1)) @ Y0)))))) @ (sK3 @ X1))) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(sigma_clausification,[status(thm)],[f21])).
% 1.49/1.29 thf(f21,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1 @ Y0) => ((X1 @ (s @ Y1) @ (s @ Y0)) & (X1 @ (s @ (s @ Y1)) @ Y0))))))) = $false) | ((X1 @ sK1 @ sK0) = $true) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.49/1.29 thf(f20,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1 @ Y0) => ((X1 @ (s @ Y1) @ (s @ Y0)) & (X1 @ (s @ (s @ Y1)) @ Y0))))))) & (X1 @ c1 @ c1)) = $false) | ((X1 @ sK1 @ sK0) = $true)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.49/1.29 thf(f19,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (($true = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1 @ Y0) => ((X1 @ (s @ Y1) @ (s @ Y0)) & (X1 @ (s @ (s @ Y1)) @ Y0))))))) & (X1 @ c1 @ c1)) => (X1 @ sK1 @ sK0)))) )),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f18])).
% 1.49/1.29 thf(f18,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : ((((^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => ((Y0 @ (s @ Y2) @ (s @ Y1)) & (Y0 @ (s @ (s @ Y2)) @ Y1))))))) & (Y0 @ c1 @ c1)) => (Y0 @ sK1 @ sK0))) @ X1) = $true)) )),
% 1.49/1.29 inference(pi_clausification,[status(thm)],[f17])).
% 1.49/1.29 thf(f17,plain,(
% 1.49/1.29 ($true = (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2 @ Y1) => ((Y0 @ (s @ Y2) @ (s @ Y1)) & (Y0 @ (s @ (s @ Y2)) @ Y1))))))) & (Y0 @ c1 @ c1)) => (Y0 @ sK1 @ sK0)))))),
% 1.49/1.29 inference(beta_eta_normalization,[status(thm)],[f16])).
% 1.49/1.29 thf(f16,plain,(
% 1.49/1.29 ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4 @ Y3) => ((Y2 @ (s @ Y4) @ (s @ Y3)) & (Y2 @ (s @ (s @ Y4)) @ Y3))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))) @ sK1 @ sK0))),
% 1.49/1.29 inference(definition_unfolding,[status(thm)],[f12,f14])).
% 1.49/1.29 thf(f12,plain,(
% 1.49/1.29 ($true = (cCKB6_BLACK @ sK1 @ sK0))),
% 1.49/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.49/1.29 thf(f82,plain,(
% 1.49/1.29 spl2_3 | ~spl2_2),
% 1.49/1.29 inference(avatar_split_clause,[status(thm)],[f79,f62,f66])).
% 1.49/1.29 thf(f62,definition,(
% 1.49/1.29 spl2_2 <=> ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false)),
% 1.49/1.29 introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition])).
% 1.49/1.29 thf(f79,plain,(
% 1.49/1.29 ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5))) | ~spl2_2),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f77])).
% 1.49/1.29 thf(f77,plain,(
% 1.49/1.29 ($true = $false) | ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5))) | ~spl2_2),
% 1.49/1.29 inference(superposition,[status(thm)],[f64,f41])).
% 1.49/1.29 thf(f41,plain,(
% 1.49/1.29 ( ! [X2 : $i,X1 : $i] : (($true = (sK5 @ (s @ (s @ X2)) @ X1)) | ((sK5 @ X2 @ X1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f40])).
% 1.49/1.29 thf(f64,plain,(
% 1.49/1.29 ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false) | ~spl2_2),
% 1.49/1.29 inference(avatar_component_clause,[status(thm)],[f62])).
% 1.49/1.29 thf(f72,plain,(
% 1.49/1.29 spl2_2 | spl2_3 | spl2_1),
% 1.49/1.29 inference(avatar_split_clause,[status(thm)],[f71,f58,f66,f62])).
% 1.49/1.29 thf(f71,plain,(
% 1.49/1.29 ($true = (sK5 @ sK1 @ sK0)) | ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false) | ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5)))),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f70])).
% 1.49/1.29 thf(f70,plain,(
% 1.49/1.29 ($true = $false) | ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false) | ($true = (sK5 @ sK1 @ sK0)) | ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5)))),
% 1.49/1.29 inference(forward_demodulation,[status(thm)],[f53,f34])).
% 1.49/1.29 thf(f53,plain,(
% 1.49/1.29 ((sK5 @ c1 @ c1) = $false) | ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false) | ($true = (sK5 @ sK1 @ sK0)) | ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5)))),
% 1.49/1.29 inference(trivial_inequality_removal,[status(thm)],[f52])).
% 1.49/1.29 thf(f52,plain,(
% 1.49/1.29 ((sK5 @ (s @ (s @ (sK4 @ sK5))) @ (sK3 @ sK5)) = $false) | ($false = (sK5 @ (sK4 @ sK5) @ (sK3 @ sK5))) | ($true = $false) | ((sK5 @ c1 @ c1) = $false) | ($true = (sK5 @ sK1 @ sK0))),
% 1.49/1.29 inference(superposition,[status(thm)],[f42,f28])).
% 1.49/1.29 thf(f28,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : (((X1 @ (s @ (sK4 @ X1)) @ (s @ (sK3 @ X1))) = $false) | ((X1 @ (s @ (s @ (sK4 @ X1))) @ (sK3 @ X1)) = $false) | ((X1 @ c1 @ c1) = $false) | ((X1 @ sK1 @ sK0) = $true)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f26])).
% 1.49/1.29 thf(f26,plain,(
% 1.49/1.29 ( ! [X1 : $i > $i > $o] : ((((X1 @ (s @ (sK4 @ X1)) @ (s @ (sK3 @ X1))) & (X1 @ (s @ (s @ (sK4 @ X1))) @ (sK3 @ X1))) = $false) | ((X1 @ sK1 @ sK0) = $true) | ((X1 @ c1 @ c1) = $false)) )),
% 1.49/1.29 inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.49/1.29 % SZS output end Proof for DTF2THF_16979
% 1.49/1.29 % (17197)------------------------------
% 1.49/1.29 % (17197)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.29 % (17197)Termination reason: Refutation
% 1.49/1.29
% 1.49/1.29 % (17197)Memory used [KB]: 5628
% 1.49/1.29 % (17197)Time elapsed: 0.012 s
% 1.49/1.29 % (17197)Instructions burned: 12 (million)
% 1.49/1.29 % (17197)------------------------------
% 1.49/1.29 % (17197)------------------------------
% 1.49/1.29 % (17194)Success in time 0.027 s
%------------------------------------------------------------------------------