%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO264^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 : n021.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:53:48 AM UTC 2026
% Result : Theorem 0.23s 1.35s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 2 unt; 0 typ; 6 def)
% Number of atoms : 663 ( 204 equ; 0 cnn)
% Maximal formula atoms : 18 ( 9 avg)
% Number of connectives : 833 ( 239 ~; 188 |; 40 &; 351 @)
% ( 11 <=>; 2 =>; 0 <=; 2 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 70 ( 70 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 157 ( 41 ^; 79 !; 37 ?; 157 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
sP0: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
sK1: $i > $o ).
thf(func_def_8,type,
sK5: ( $i > $o ) > $i ).
thf(func_def_10,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f389,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f33,f41,f56,f60,f114,f258,f388]) ).
thf(f388,plain,
( ~ spl6_4
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[status(thm)],[f387]) ).
thf(f387,plain,
( $false
| ~ spl6_4
| ~ spl6_9 ),
inference(subsumption_resolution,[status(thm)],[f384,f377]) ).
thf(f377,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ~ spl6_4
| ~ spl6_9 ),
inference(not_proxy_clausification,[status(thm)],[f376]) ).
thf(f376,plain,
( ( ( ~ ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
!= $true )
| ~ spl6_4
| ~ spl6_9 ),
inference(beta_eta_normalization,[status(thm)],[f375]) ).
thf(f375,plain,
( ( $true
!= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
| ~ spl6_4
| ~ spl6_9 ),
inference(trivial_inequality_removal,[status(thm)],[f337]) ).
thf(f337,plain,
( ( $true != $true )
| ( $true
!= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
| ( $false = $true )
| ~ spl6_4
| ~ spl6_9 ),
inference(superposition,[status(thm)],[f269,f59]) ).
thf(f59,plain,
( ! [X4: $i > $o] :
( ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true ) )
| ~ spl6_9 ),
inference(avatar_component_clause,[status(thm)],[f58]) ).
thf(f58,definition,
( spl6_9
<=> ! [X4: $i > $o] :
( ( ( X4 @ ( sK5 @ X4 ) )
!= $true )
| ( $true
= ( sK1 @ ( sK5 @ X4 ) ) ) ) ),
introduced(definition,[new_symbols(naming,[spl6_9])],[avatar_definition]) ).
thf(f269,plain,
( ! [X7: $i > $o] :
( ( $false
= ( X7
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) ) )
| ~ spl6_4 ),
inference(not_proxy_clausification,[status(thm)],[f268]) ).
thf(f268,plain,
( ! [X7: $i > $o] :
( ( ( ~ ( X7
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
= $true )
| ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) ) )
| ~ spl6_4 ),
inference(beta_eta_normalization,[status(thm)],[f261]) ).
thf(f261,plain,
( ! [X7: $i > $o] :
( ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $true
= ( ^ [Y0: $i] :
~ ( X7 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) ) )
| ~ spl6_4 ),
inference(primitive_instantiation,[status(thm)],[f40]) ).
thf(f40,plain,
( ! [X4: $i > $o] :
( ( ( X4 @ ( sK5 @ X4 ) )
= $true )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) ) )
| ~ spl6_4 ),
inference(avatar_component_clause,[status(thm)],[f39]) ).
thf(f39,definition,
( spl6_4
<=> ! [X4: $i > $o] :
( ( ( X4 @ ( sK5 @ X4 ) )
= $true )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) ) ) ),
introduced(definition,[new_symbols(naming,[spl6_4])],[avatar_definition]) ).
thf(f384,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
!= $true )
| ~ spl6_4
| ~ spl6_9 ),
inference(trivial_inequality_removal,[status(thm)],[f379]) ).
thf(f379,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
!= $true )
| ( $false = $true )
| ~ spl6_4
| ~ spl6_9 ),
inference(superposition,[status(thm)],[f377,f269]) ).
thf(f258,plain,
( ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[status(thm)],[f257]) ).
thf(f257,plain,
( $false
| ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(subsumption_resolution,[status(thm)],[f256,f233]) ).
thf(f233,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(subsumption_resolution,[status(thm)],[f205,f37]) ).
thf(f37,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| spl6_3 ),
inference(avatar_component_clause,[status(thm)],[f35]) ).
thf(f35,definition,
( spl6_3
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(naming,[spl6_3])],[avatar_definition]) ).
thf(f205,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ~ spl6_1
| ~ spl6_8 ),
inference(duplicate_literal_removal,[status(thm)],[f204]) ).
thf(f204,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ( $true
= ( sK1 @ sK3 ) )
| ~ spl6_1
| ~ spl6_8 ),
inference(not_proxy_clausification,[status(thm)],[f203]) ).
thf(f203,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ( $true
= ( sK1 @ sK3 ) )
| ( ( ~ ( sK1 @ sK3 ) )
!= $true )
| ~ spl6_1
| ~ spl6_8 ),
inference(not_proxy_clausification,[status(thm)],[f202]) ).
thf(f202,plain,
( ( ( ~ ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
!= $true )
| ( $true
= ( sK1 @ sK3 ) )
| ( ( ~ ( sK1 @ sK3 ) )
!= $true )
| ~ spl6_1
| ~ spl6_8 ),
inference(beta_eta_normalization,[status(thm)],[f201]) ).
thf(f201,plain,
( ( ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ sK3 )
!= $true )
| ( $true
!= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
| ( $true
= ( sK1 @ sK3 ) )
| ~ spl6_1
| ~ spl6_8 ),
inference(trivial_inequality_removal,[status(thm)],[f183]) ).
thf(f183,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
!= ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: $i] :
~ ( sK1 @ Y0 )
@ sK3 )
!= $true )
| ( $true != $true )
| ( $false = $true )
| ~ spl6_1
| ~ spl6_8 ),
inference(superposition,[status(thm)],[f124,f55]) ).
thf(f55,plain,
( ! [X4: $i > $o] :
( ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ sK3 )
!= $true )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true ) )
| ~ spl6_8 ),
inference(avatar_component_clause,[status(thm)],[f54]) ).
thf(f54,definition,
( spl6_8
<=> ! [X4: $i > $o] :
( ( ( X4 @ sK3 )
!= $true )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true )
| ( $true
= ( sK1 @ ( sK5 @ X4 ) ) ) ) ),
introduced(definition,[new_symbols(naming,[spl6_8])],[avatar_definition]) ).
thf(f124,plain,
( ! [X7: $i > $o] :
( ( $false
= ( X7
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $true
= ( X7 @ sK3 ) ) )
| ~ spl6_1 ),
inference(not_proxy_clausification,[status(thm)],[f123]) ).
thf(f123,plain,
( ! [X7: $i > $o] :
( ( $true
!= ( ~ ( X7 @ sK3 ) ) )
| ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $false
= ( X7
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) ) )
| ~ spl6_1 ),
inference(not_proxy_clausification,[status(thm)],[f122]) ).
thf(f122,plain,
( ! [X7: $i > $o] :
( ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( ( ~ ( X7
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
= $true )
| ( $true
!= ( ~ ( X7 @ sK3 ) ) ) )
| ~ spl6_1 ),
inference(beta_eta_normalization,[status(thm)],[f118]) ).
thf(f118,plain,
( ! [X7: $i > $o] :
( ( $true
!= ( ^ [Y0: $i] :
~ ( X7 @ Y0 )
@ sK3 ) )
| ( $true
!= ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) )
| ( $true
= ( ^ [Y0: $i] :
~ ( X7 @ Y0 )
@ ( sK5
@ ^ [Y0: $i] :
~ ( X7 @ Y0 ) ) ) ) )
| ~ spl6_1 ),
inference(primitive_instantiation,[status(thm)],[f29]) ).
thf(f29,plain,
( ! [X4: $i > $o] :
( ( ( X4 @ ( sK5 @ X4 ) )
= $true )
| ( ( X4 @ sK3 )
!= $true )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f28,definition,
( spl6_1
<=> ! [X4: $i > $o] :
( ( ( X4 @ sK3 )
!= $true )
| ( ( X4 @ ( sK5 @ X4 ) )
= $true )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) ) ) ),
introduced(definition,[new_symbols(naming,[spl6_1])],[avatar_definition]) ).
thf(f256,plain,
( ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
!= $true )
| ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(subsumption_resolution,[status(thm)],[f252,f37]) ).
thf(f252,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
!= $true )
| ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(trivial_inequality_removal,[status(thm)],[f250]) ).
thf(f250,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( ( sK1
@ ( sK5
@ ^ [Y0: $i] :
~ ( sK1 @ Y0 ) ) )
!= $true )
| ( $false = $true )
| ~ spl6_1
| spl6_3
| ~ spl6_8 ),
inference(superposition,[status(thm)],[f233,f124]) ).
thf(f114,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[status(thm)],[f113]) ).
thf(f113,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[status(thm)],[f112]) ).
thf(f112,plain,
( ( $true != $true )
| ~ spl6_2 ),
inference(duplicate_literal_removal,[status(thm)],[f111]) ).
thf(f111,plain,
( ( $true != $true )
| ( $true != $true )
| ~ spl6_2 ),
inference(beta_eta_normalization,[status(thm)],[f99]) ).
thf(f99,plain,
( ( $true
!= ( ^ [Y0: $i] : $true
@ sK2 ) )
| ( $true
!= ( ^ [Y0: $i] : $true
@ sK4 ) )
| ~ spl6_2 ),
inference(primitive_instantiation,[status(thm)],[f90]) ).
thf(f90,plain,
( ! [X0: $i > $o] :
( ( ( X0 @ sK4 )
!= $true )
| ( ( X0 @ sK2 )
!= $true ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[status(thm)],[f87]) ).
thf(f87,plain,
( ! [X0: $i > $o] :
( ( ( X0 @ sK2 )
!= $true )
| ( ( X0 @ sK4 )
!= $true )
| ( $true != $true ) )
| ~ spl6_2 ),
inference(superposition,[status(thm)],[f17,f32]) ).
thf(f32,plain,
( ! [X5: $i > $o] :
( ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( $true
!= ( X5 @ sK2 ) ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[status(thm)],[f31]) ).
thf(f31,definition,
( spl6_2
<=> ! [X5: $i > $o] :
( ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( $true
!= ( X5 @ sK2 ) ) ) ),
introduced(definition,[new_symbols(naming,[spl6_2])],[avatar_definition]) ).
thf(f17,plain,
! [X2: $i > $o,X0: $i,X1: $i > $o] :
( ( ( sP0 @ X2 @ X1 @ X0 )
!= $true )
| ( $true
!= ( X2 @ X0 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: $i,X1: $i > $o,X2: $i > $o] :
( ( ( $true
= ( X1 @ X0 ) )
& ( $true
!= ( X2 @ X0 ) ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
!= $true ) ),
inference(rectify,[status(thm)],[f10]) ).
thf(f10,plain,
! [X2: $i,X0: $i > $o,X5: $i > $o] :
( ( ( $true
= ( X0 @ X2 ) )
& ( $true
!= ( X5 @ X2 ) ) )
| ( $true
!= ( sP0 @ X5 @ X0 @ X2 ) ) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X2: $i,X0: $i > $o,X5: $i > $o] :
( ( ( $true
= ( X0 @ X2 ) )
& ( $true
!= ( X5 @ X2 ) ) )
| ( $true
!= ( sP0 @ X5 @ X0 @ X2 ) ) ),
introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction]) ).
thf(f60,plain,
( ~ spl6_3
| spl6_9
| spl6_2 ),
inference(avatar_split_clause,[status(thm)],[f26,f31,f58,f35]) ).
thf(f26,plain,
! [X4: $i > $o,X5: $i > $o] :
( ( $true
!= ( sK1 @ sK3 ) )
| ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true )
| ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( $true
!= ( X5 @ sK2 ) ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
! [X4: $i > $o,X5: $i > $o] :
( ( ( $true
!= ( X5 @ sK2 ) )
& ( $true
!= ( X4 @ sK2 ) ) )
| ( ( $true
!= ( sK1 @ sK3 ) )
& ( ( X4 @ sK3 )
!= $true ) )
| ( ( ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true ) )
& ( ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
= $true ) ) )
| ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f13,f15,f14]) ).
thf(f14,plain,
( ? [X0: $i > $o,X1: $i,X2: $i,X3: $i] :
! [X4: $i > $o,X5: $i > $o] :
( ( ( ( X5 @ X1 )
!= $true )
& ( ( X4 @ X1 )
!= $true ) )
| ( ( $true
!= ( X0 @ X2 ) )
& ( ( X4 @ X2 )
!= $true ) )
| ? [X6: $i] :
( ( ( ( X0 @ X6 )
= $true )
| ( ( X4 @ X6 )
!= $true ) )
& ( ( ( X0 @ X6 )
!= $true )
| ( ( X4 @ X6 )
= $true ) ) )
| ( $true
= ( sP0 @ X5 @ X0 @ X3 ) ) )
=> ! [X5: $i > $o,X4: $i > $o] :
( ( ( $true
!= ( X5 @ sK2 ) )
& ( $true
!= ( X4 @ sK2 ) ) )
| ( ( $true
!= ( sK1 @ sK3 ) )
& ( ( X4 @ sK3 )
!= $true ) )
| ? [X6: $i] :
( ( ( $true
= ( sK1 @ X6 ) )
| ( ( X4 @ X6 )
!= $true ) )
& ( ( $true
!= ( sK1 @ X6 ) )
| ( ( X4 @ X6 )
= $true ) ) )
| ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f15,plain,
! [X4: $i > $o] :
( ? [X6: $i] :
( ( ( $true
= ( sK1 @ X6 ) )
| ( ( X4 @ X6 )
!= $true ) )
& ( ( $true
!= ( sK1 @ X6 ) )
| ( ( X4 @ X6 )
= $true ) ) )
=> ( ( ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true ) )
& ( ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
= $true ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f13,plain,
? [X0: $i > $o,X1: $i,X2: $i,X3: $i] :
! [X4: $i > $o,X5: $i > $o] :
( ( ( ( X5 @ X1 )
!= $true )
& ( ( X4 @ X1 )
!= $true ) )
| ( ( $true
!= ( X0 @ X2 ) )
& ( ( X4 @ X2 )
!= $true ) )
| ? [X6: $i] :
( ( ( ( X0 @ X6 )
= $true )
| ( ( X4 @ X6 )
!= $true ) )
& ( ( ( X0 @ X6 )
!= $true )
| ( ( X4 @ X6 )
= $true ) ) )
| ( $true
= ( sP0 @ X5 @ X0 @ X3 ) ) ),
inference(rectify,[status(thm)],[f12]) ).
thf(f12,plain,
? [X0: $i > $o,X1: $i,X3: $i,X2: $i] :
! [X4: $i > $o,X5: $i > $o] :
( ( ( ( X5 @ X1 )
!= $true )
& ( ( X4 @ X1 )
!= $true ) )
| ( ( ( X0 @ X3 )
!= $true )
& ( ( X4 @ X3 )
!= $true ) )
| ? [X6: $i] :
( ( ( ( X0 @ X6 )
= $true )
| ( ( X4 @ X6 )
!= $true ) )
& ( ( ( X0 @ X6 )
!= $true )
| ( ( X4 @ X6 )
= $true ) ) )
| ( $true
= ( sP0 @ X5 @ X0 @ X2 ) ) ),
inference(nnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
? [X0: $i > $o,X1: $i,X3: $i,X2: $i] :
! [X4: $i > $o,X5: $i > $o] :
( ( ( ( X5 @ X1 )
!= $true )
& ( ( X4 @ X1 )
!= $true ) )
| ( ( ( X0 @ X3 )
!= $true )
& ( ( X4 @ X3 )
!= $true ) )
| ? [X6: $i] :
( ( ( X4 @ X6 )
= $true )
<~> ( ( X0 @ X6 )
!= $true ) )
| ( $true
= ( sP0 @ X5 @ X0 @ X2 ) ) ),
inference(definition_folding,[status(thm)],[f7,f8]) ).
thf(f7,plain,
? [X0: $i > $o,X1: $i,X3: $i,X2: $i] :
! [X4: $i > $o,X5: $i > $o] :
( ( ( ( X5 @ X1 )
!= $true )
& ( ( X4 @ X1 )
!= $true ) )
| ( ( ( X0 @ X3 )
!= $true )
& ( ( X4 @ X3 )
!= $true ) )
| ? [X6: $i] :
( ( ( X4 @ X6 )
= $true )
<~> ( ( X0 @ X6 )
!= $true ) )
| ( ( $true
= ( X0 @ X2 ) )
& ( $true
!= ( X5 @ X2 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ! [X0: $i > $o,X1: $i,X2: $i,X3: $i] :
? [X4: $i > $o,X5: $i > $o] :
( ( ( $true
= ( X5 @ X2 ) )
| ( $true
!= ( X0 @ X2 ) ) )
& ! [X6: $i] :
( ( ( X0 @ X6 )
!= $true )
<=> ( ( X4 @ X6 )
= $true ) )
& ( ( ( X5 @ X1 )
= $true )
| ( ( X4 @ X1 )
= $true ) )
& ( ( ( X0 @ X3 )
= $true )
| ( ( X4 @ X3 )
= $true ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: $i > $o,X1: $i,X2: $i,X3: $i] :
? [X4: $i > $o,X5: $i > $o] :
( ( ( ( X0 @ X3 )
= $true )
| ( ( X4 @ X3 )
= $true ) )
& ! [X6: $i] :
( ( ( X0 @ X6 )
!= $true )
<=> ( ( X4 @ X6 )
= $true ) )
& ( ( $true
= ( X5 @ X2 ) )
| ( $true
!= ( X0 @ X2 ) ) )
& ( ( ( X5 @ X1 )
= $true )
| ( ( X4 @ X1 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: $i > $o,X1: $i,X2: $i,X3: $i] :
? [X4: $i > $o,X5: $i > $o] :
( ( ( X4 @ X3 )
| ( X0 @ X3 ) )
& ! [X6: $i] :
( ~ ( X0 @ X6 )
<=> ( X4 @ X6 ) )
& ( ( X5 @ X2 )
| ~ ( X0 @ X2 ) )
& ( ( X4 @ X1 )
| ( X5 @ X1 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X3: $i > $o,X0: $i,X2: $i,X1: $i] :
? [X5: $i > $o,X4: $i > $o] :
( ( ( X5 @ X1 )
| ( X3 @ X1 ) )
& ! [X6: $i] :
( ~ ( X3 @ X6 )
<=> ( X5 @ X6 ) )
& ( ( X4 @ X2 )
| ~ ( X3 @ X2 ) )
& ( ( X5 @ X0 )
| ( X4 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X3: $i > $o,X0: $i,X2: $i,X1: $i] :
? [X5: $i > $o,X4: $i > $o] :
( ( ( X5 @ X1 )
| ( X3 @ X1 ) )
& ! [X6: $i] :
( ~ ( X3 @ X6 )
<=> ( X5 @ X6 ) )
& ( ( X4 @ X2 )
| ~ ( X3 @ X2 ) )
& ( ( X5 @ X0 )
| ( X4 @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Frpegf8kH1/DTF2THF_7277.p',cTHM125C) ).
thf(f56,plain,
( spl6_2
| spl6_8 ),
inference(avatar_split_clause,[status(thm)],[f24,f54,f31]) ).
thf(f24,plain,
! [X4: $i > $o,X5: $i > $o] :
( ( ( X4 @ sK3 )
!= $true )
| ( $true
= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
!= $true )
| ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( $true
!= ( X5 @ sK2 ) ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f41,plain,
( ~ spl6_3
| spl6_4
| spl6_2 ),
inference(avatar_split_clause,[status(thm)],[f25,f31,f39,f35]) ).
thf(f25,plain,
! [X4: $i > $o,X5: $i > $o] :
( ( $true
!= ( sK1 @ sK3 ) )
| ( ( X4 @ ( sK5 @ X4 ) )
= $true )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( $true
!= ( X5 @ sK2 ) ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f33,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[status(thm)],[f23,f31,f28]) ).
thf(f23,plain,
! [X4: $i > $o,X5: $i > $o] :
( ( ( sP0 @ X5 @ sK1 @ sK4 )
= $true )
| ( ( X4 @ sK3 )
!= $true )
| ( $true
!= ( X5 @ sK2 ) )
| ( $true
!= ( sK1 @ ( sK5 @ X4 ) ) )
| ( ( X4 @ ( sK5 @ X4 ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO264^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.30 % Computer : n021.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.30 % WCLimit : 300
% 0.12/0.30 % DateTime : Tue Feb 24 14:27:08 EST 2026
% 0.12/0.30 % CPUTime :
% 0.12/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.39 ---- Original DTF file ---
% 0.17/0.40 thf(spec,logic,$$dhol).
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 % File : SYO264^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.40 % Domain : Syntactic
% 0.17/0.40 % Problem : TPS problem THM125C
% 0.17/0.40 % Version : Especial.
% 0.17/0.40 % English : Trivial theorem to test flexible-flexible pairs.
% 0.17/0.40
% 0.17/0.40 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.40 % Source : [Bro09]
% 0.17/0.40 % Names : tps_0158 [Bro09]
% 0.17/0.40 % : THM125C [TPS]
% 0.17/0.40
% 0.17/0.40 % Status : Theorem
% 0.17/0.40 % Rating : 0.25 v8.2.0, 0.18 v8.1.0, 0.25 v7.4.0, 0.22 v7.3.0, 0.20 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.25 v6.4.0, 0.29 v6.3.0, 0.33 v6.2.0, 0.67 v6.1.0, 0.50 v5.5.0, 0.40 v5.4.0, 0.25 v5.1.0, 0.50 v4.1.0, 0.67 v4.0.0
% 0.17/0.40 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.17/0.40 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.17/0.40 % Maximal formula atoms : 0 ( 0 avg)
% 0.17/0.40 % Number of connectives : 17 ( 2 ~; 3 |; 3 &; 8 @)
% 0.17/0.40 % ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% 0.17/0.40 % Maximal formula depth : 14 ( 14 avg)
% 0.17/0.40 % Number of types : 2 ( 0 usr)
% 0.17/0.40 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.17/0.40 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.17/0.40 % Number of variables : 7 ( 0 ^; 5 !; 2 ?; 7 :)
% 0.17/0.40 % SPC : TH0_THM_NEQ_NAR
% 0.17/0.40
% 0.17/0.40 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.40 % project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.40 % Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.40 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 thf(cTHM125C,conjecture,
% 0.17/0.40 ! [Xa: $i,Xb: $i,Xc: $i,P: $i > $o] :
% 0.17/0.40 ? [Xm: $i > $o,Xn: $i > $o] :
% 0.17/0.40 ( ( ( Xm @ Xa )
% 0.17/0.40 | ( Xn @ Xa ) )
% 0.17/0.40 & ( ( P @ Xb )
% 0.17/0.40 | ( Xn @ Xb ) )
% 0.17/0.40 & ( ( Xm @ Xc )
% 0.17/0.40 | ~ ( P @ Xc ) )
% 0.17/0.40 & ! [Xx: $i] :
% 0.17/0.40 ( ( Xn @ Xx )
% 0.17/0.40 <=> ~ ( P @ Xx ) ) ) ).
% 0.17/0.40
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 ------------------------
% 0.23/1.30 ---- Embedded in THF ---
% 0.23/1.30 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 0.23/1.30 %%% Generated on Tue Feb 24 14:27:09 EST 2026
% 0.23/1.30 %%% using '$$dhol' embedding, version 1.3.0.
% 0.23/1.30 %%% Logic specification used:
% 0.23/1.30 %%% thf(spec, logic, $$dhol).
% 0.23/1.30
% 0.23/1.30 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.Frpegf8kH1/DTF2DTF7277.p
% See solution above
% 0.23/1.30 ------------------------
% 0.23/1.31 ---- Cleaned THF ---
% 0.23/1.31 thf(cTHM125C,conjecture,
% 0.23/1.31 ! [Xa: $i,Xb: $i,Xc: $i,P: $i > $o] :
% 0.23/1.31 ? [Xm: $i > $o,Xn: $i > $o] :
% 0.23/1.31 ( ( ( Xm @ Xa )
% 0.23/1.31 | ( Xn @ Xa ) )
% 0.23/1.31 & ( ( P @ Xb )
% 0.23/1.31 | ( Xn @ Xb ) )
% 0.23/1.31 & ( ( Xm @ Xc )
% 0.23/1.31 | ~ ( P @ Xc ) )
% 0.23/1.31 & ! [Xx: $i] :
% 0.23/1.31 ( ( Xn @ Xx )
% 0.23/1.31 <=> ~ ( P @ Xx ) ) ) ).
% 0.23/1.31 ------------------------
% 0.23/1.33 % (7378)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_7277 for (3000ds/2Mi)
% 0.23/1.33 % (7374)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_7277 for (3000ds/183Mi)
% 0.23/1.33 % (7377)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_7277 for (3000ds/2Mi)
% 0.23/1.33 % (7375)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_7277 for (3000ds/4Mi)
% 0.23/1.33 % (7380)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_7277 for (3000ds/18Mi)
% 0.23/1.33 % (7379)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_7277 for (3000ds/275Mi)
% 0.23/1.33 % (7376)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_7277 for (3000ds/27Mi)
% 0.23/1.33 % (7377)Instruction limit reached!
% 0.23/1.33 % (7377)------------------------------
% 0.23/1.33 % (7377)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.33 % (7377)Termination reason: Unknown
% 0.23/1.33 % (7377)Termination phase: Saturation
% 0.23/1.33
% 0.23/1.33 % (7377)Memory used [KB]: 895
% 0.23/1.33 % (7377)Time elapsed: 0.003 s
% 0.23/1.33 % (7377)Instructions burned: 2 (million)
% 0.23/1.33 % (7377)------------------------------
% 0.23/1.33 % (7377)------------------------------
% 0.23/1.33 % (7378)Instruction limit reached!
% 0.23/1.33 % (7378)------------------------------
% 0.23/1.33 % (7378)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.33 % (7378)Termination reason: Unknown
% 0.23/1.33 % (7378)Termination phase: Saturation
% 0.23/1.33
% 0.23/1.33 % (7378)Memory used [KB]: 895
% 0.23/1.33 % (7378)Time elapsed: 0.003 s
% 0.23/1.33 % (7378)Instructions burned: 2 (million)
% 0.23/1.33 % (7378)------------------------------
% 0.23/1.33 % (7378)------------------------------
% 0.23/1.33 % (7375)Instruction limit reached!
% 0.23/1.33 % (7375)------------------------------
% 0.23/1.33 % (7375)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.33 % (7375)Termination reason: Unknown
% 0.23/1.33 % (7375)Termination phase: Saturation
% 0.23/1.33
% 0.23/1.33 % (7375)Memory used [KB]: 5500
% 0.23/1.33 % (7375)Time elapsed: 0.005 s
% 0.23/1.33 % (7375)Instructions burned: 5 (million)
% 0.23/1.33 % (7375)------------------------------
% 0.23/1.33 % (7375)------------------------------
% 0.23/1.33 % (7376)Refutation not found, incomplete strategy
% 0.23/1.33 % (7376)------------------------------
% 0.23/1.33 % (7376)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.33 % (7376)Termination reason: Refutation not found, incomplete strategy
% 0.23/1.33
% 0.23/1.33
% 0.23/1.33 % (7376)Memory used [KB]: 5500
% 0.23/1.33 % (7376)Time elapsed: 0.005 s
% 0.23/1.33 % (7376)Instructions burned: 5 (million)
% 0.23/1.33 % (7376)------------------------------
% 0.23/1.33 % (7376)------------------------------
% 0.23/1.34 % (7380)Instruction limit reached!
% 0.23/1.34 % (7380)------------------------------
% 0.23/1.34 % (7380)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.34 % (7380)Termination reason: Unknown
% 0.23/1.34 % (7380)Termination phase: Saturation
% 0.23/1.34
% 0.23/1.34 % (7380)Memory used [KB]: 5628
% 0.23/1.34 % (7380)Time elapsed: 0.012 s
% 0.23/1.34 % (7380)Instructions burned: 19 (million)
% 0.23/1.34 % (7380)------------------------------
% 0.23/1.34 % (7380)------------------------------
% 0.23/1.35 % (7382)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_7277 for (2999ds/37Mi)
% 0.23/1.35 % (7381)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_7277 for (2999ds/3Mi)
% 0.23/1.35 % (7379)First to succeed.
% 0.23/1.35 % (7383)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_7277 for (2999ds/15Mi)
% 0.23/1.35 % (7381)Instruction limit reached!
% 0.23/1.35 % (7381)------------------------------
% 0.23/1.35 % (7381)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.35 % (7381)Termination reason: Unknown
% 0.23/1.35 % (7381)Termination phase: Saturation
% 0.23/1.35
% 0.23/1.35 % (7381)Memory used [KB]: 5500
% 0.23/1.35 % (7384)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_7277 for (2999ds/3Mi)
% 0.23/1.35 % (7381)Time elapsed: 0.003 s
% 0.23/1.35 % (7381)Instructions burned: 3 (million)
% 0.23/1.35 % (7381)------------------------------
% 0.23/1.35 % (7381)------------------------------
% 0.23/1.35 % (7384)Instruction limit reached!
% 0.23/1.35 % (7384)------------------------------
% 0.23/1.35 % (7384)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.35 % (7384)Termination reason: Unknown
% 0.23/1.35 % (7384)Termination phase: Saturation
% 0.23/1.35
% 0.23/1.35 % (7379)Refutation found. Thanks to Tanya!
% 0.23/1.35 % SZS status Theorem for DTF2THF_7277
% 0.23/1.35 % SZS output start Proof for DTF2THF_7277
% 0.23/1.35 thf(func_def_3, type, sP0: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/1.35 thf(func_def_4, type, sK1: $i > $o).
% 0.23/1.35 thf(func_def_8, type, sK5: ($i > $o) > $i).
% 0.23/1.35 thf(func_def_10, type, ph7: !>[X0: $tType]:(X0)).
% 0.23/1.35 thf(f389,plain,(
% 0.23/1.35 $false),
% 0.23/1.35 inference(avatar_sat_refutation,[status(thm)],[f33,f41,f56,f60,f114,f258,f388])).
% 0.23/1.35 thf(f388,plain,(
% 0.23/1.35 ~spl6_4 | ~spl6_9),
% 0.23/1.35 inference(avatar_contradiction_clause,[status(thm)],[f387])).
% 0.23/1.35 thf(f387,plain,(
% 0.23/1.35 $false | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(subsumption_resolution,[status(thm)],[f384,f377])).
% 0.23/1.35 thf(f377,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) = $true) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f376])).
% 0.23/1.35 thf(f376,plain,(
% 0.23/1.35 ((~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) != $true) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(beta_eta_normalization,[status(thm)],[f375])).
% 0.23/1.35 thf(f375,plain,(
% 0.23/1.35 ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f337])).
% 0.23/1.35 thf(f337,plain,(
% 0.23/1.35 ($true != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($false = $true) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(superposition,[status(thm)],[f269,f59])).
% 0.23/1.35 thf(f59,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o] : (($true = (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) != $true)) ) | ~spl6_9),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f58])).
% 0.23/1.35 thf(f58,definition,(
% 0.23/1.35 spl6_9 <=> ! [X4 : $i > $o] : (((X4 @ (sK5 @ X4)) != $true) | ($true = (sK1 @ (sK5 @ X4))))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_9])],[avatar_definition])).
% 0.23/1.35 thf(f269,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($false = (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_4),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f268])).
% 0.23/1.35 thf(f268,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (((~ (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) = $true) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_4),
% 0.23/1.35 inference(beta_eta_normalization,[status(thm)],[f261])).
% 0.23/1.35 thf(f261,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($true = ((^[Y0 : $i]: (~ (X7 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_4),
% 0.23/1.35 inference(primitive_instantiation,[status(thm)],[f40])).
% 0.23/1.35 thf(f40,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o] : (((X4 @ (sK5 @ X4)) = $true) | ($true != (sK1 @ (sK5 @ X4)))) ) | ~spl6_4),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f39])).
% 0.23/1.35 thf(f39,definition,(
% 0.23/1.35 spl6_4 <=> ! [X4 : $i > $o] : (((X4 @ (sK5 @ X4)) = $true) | ($true != (sK1 @ (sK5 @ X4))))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_4])],[avatar_definition])).
% 0.23/1.35 thf(f384,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) != $true) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f379])).
% 0.23/1.35 thf(f379,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) != $true) | ($false = $true) | (~spl6_4 | ~spl6_9)),
% 0.23/1.35 inference(superposition,[status(thm)],[f377,f269])).
% 0.23/1.35 thf(f258,plain,(
% 0.23/1.35 ~spl6_1 | spl6_3 | ~spl6_8),
% 0.23/1.35 inference(avatar_contradiction_clause,[status(thm)],[f257])).
% 0.23/1.35 thf(f257,plain,(
% 0.23/1.35 $false | (~spl6_1 | spl6_3 | ~spl6_8)),
% 0.23/1.35 inference(subsumption_resolution,[status(thm)],[f256,f233])).
% 0.23/1.35 thf(f233,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) = $true) | (~spl6_1 | spl6_3 | ~spl6_8)),
% 0.23/1.35 inference(subsumption_resolution,[status(thm)],[f205,f37])).
% 0.23/1.35 thf(f37,plain,(
% 0.23/1.35 ($true != (sK1 @ sK3)) | spl6_3),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f35])).
% 0.23/1.35 thf(f35,definition,(
% 0.23/1.35 spl6_3 <=> ($true = (sK1 @ sK3))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_3])],[avatar_definition])).
% 0.23/1.35 thf(f205,plain,(
% 0.23/1.35 ($true = (sK1 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) = $true) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(duplicate_literal_removal,[status(thm)],[f204])).
% 0.23/1.35 thf(f204,plain,(
% 0.23/1.35 ($true = (sK1 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) = $true) | ($true = (sK1 @ sK3)) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f203])).
% 0.23/1.35 thf(f203,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) = $true) | ($true = (sK1 @ sK3)) | ((~ (sK1 @ sK3)) != $true) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f202])).
% 0.23/1.35 thf(f202,plain,(
% 0.23/1.35 ((~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) != $true) | ($true = (sK1 @ sK3)) | ((~ (sK1 @ sK3)) != $true) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(beta_eta_normalization,[status(thm)],[f201])).
% 0.23/1.35 thf(f201,plain,(
% 0.23/1.35 (((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3) != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true = (sK1 @ sK3)) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f183])).
% 0.23/1.35 thf(f183,plain,(
% 0.23/1.35 ($true = (sK1 @ sK3)) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3) != $true) | ($true != $true) | ($false = $true) | (~spl6_1 | ~spl6_8)),
% 0.23/1.35 inference(superposition,[status(thm)],[f124,f55])).
% 0.23/1.35 thf(f55,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o] : (($true = (sK1 @ (sK5 @ X4))) | ((X4 @ sK3) != $true) | ((X4 @ (sK5 @ X4)) != $true)) ) | ~spl6_8),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f54])).
% 0.23/1.35 thf(f54,definition,(
% 0.23/1.35 spl6_8 <=> ! [X4 : $i > $o] : (((X4 @ sK3) != $true) | ((X4 @ (sK5 @ X4)) != $true) | ($true = (sK1 @ (sK5 @ X4))))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_8])],[avatar_definition])).
% 0.23/1.35 thf(f124,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($false = (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($true = (X7 @ sK3))) ) | ~spl6_1),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f123])).
% 0.23/1.35 thf(f123,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($true != (~ (X7 @ sK3))) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($false = (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_1),
% 0.23/1.35 inference(not_proxy_clausification,[status(thm)],[f122])).
% 0.23/1.35 thf(f122,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ((~ (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) = $true) | ($true != (~ (X7 @ sK3)))) ) | ~spl6_1),
% 0.23/1.35 inference(beta_eta_normalization,[status(thm)],[f118])).
% 0.23/1.35 thf(f118,plain,(
% 0.23/1.35 ( ! [X7 : $i > $o] : (($true != ((^[Y0 : $i]: (~ (X7 @ Y0))) @ sK3)) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ($true = ((^[Y0 : $i]: (~ (X7 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_1),
% 0.23/1.35 inference(primitive_instantiation,[status(thm)],[f29])).
% 0.23/1.35 thf(f29,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o] : (((X4 @ (sK5 @ X4)) = $true) | ((X4 @ sK3) != $true) | ($true != (sK1 @ (sK5 @ X4)))) ) | ~spl6_1),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f28])).
% 0.23/1.35 thf(f28,definition,(
% 0.23/1.35 spl6_1 <=> ! [X4 : $i > $o] : (((X4 @ sK3) != $true) | ((X4 @ (sK5 @ X4)) = $true) | ($true != (sK1 @ (sK5 @ X4))))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_1])],[avatar_definition])).
% 0.23/1.35 thf(f256,plain,(
% 0.23/1.35 ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) != $true) | (~spl6_1 | spl6_3 | ~spl6_8)),
% 0.23/1.35 inference(subsumption_resolution,[status(thm)],[f252,f37])).
% 0.23/1.35 thf(f252,plain,(
% 0.23/1.35 ($true = (sK1 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) != $true) | (~spl6_1 | spl6_3 | ~spl6_8)),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f250])).
% 0.23/1.35 thf(f250,plain,(
% 0.23/1.35 ($true = (sK1 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))) != $true) | ($false = $true) | (~spl6_1 | spl6_3 | ~spl6_8)),
% 0.23/1.35 inference(superposition,[status(thm)],[f233,f124])).
% 0.23/1.35 thf(f114,plain,(
% 0.23/1.35 ~spl6_2),
% 0.23/1.35 inference(avatar_contradiction_clause,[status(thm)],[f113])).
% 0.23/1.35 thf(f113,plain,(
% 0.23/1.35 $false | ~spl6_2),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f112])).
% 0.23/1.35 thf(f112,plain,(
% 0.23/1.35 ($true != $true) | ~spl6_2),
% 0.23/1.35 inference(duplicate_literal_removal,[status(thm)],[f111])).
% 0.23/1.35 thf(f111,plain,(
% 0.23/1.35 ($true != $true) | ($true != $true) | ~spl6_2),
% 0.23/1.35 inference(beta_eta_normalization,[status(thm)],[f99])).
% 0.23/1.35 thf(f99,plain,(
% 0.23/1.35 ($true != ((^[Y0 : $i]: ($true)) @ sK2)) | ($true != ((^[Y0 : $i]: ($true)) @ sK4)) | ~spl6_2),
% 0.23/1.35 inference(primitive_instantiation,[status(thm)],[f90])).
% 0.23/1.35 thf(f90,plain,(
% 0.23/1.35 ( ! [X0 : $i > $o] : (((X0 @ sK4) != $true) | ((X0 @ sK2) != $true)) ) | ~spl6_2),
% 0.23/1.35 inference(trivial_inequality_removal,[status(thm)],[f87])).
% 0.23/1.35 thf(f87,plain,(
% 0.23/1.35 ( ! [X0 : $i > $o] : (((X0 @ sK2) != $true) | ((X0 @ sK4) != $true) | ($true != $true)) ) | ~spl6_2),
% 0.23/1.35 inference(superposition,[status(thm)],[f17,f32])).
% 0.23/1.35 thf(f32,plain,(
% 0.23/1.35 ( ! [X5 : $i > $o] : (((sP0 @ X5 @ sK1 @ sK4) = $true) | ($true != (X5 @ sK2))) ) | ~spl6_2),
% 0.23/1.35 inference(avatar_component_clause,[status(thm)],[f31])).
% 0.23/1.35 thf(f31,definition,(
% 0.23/1.35 spl6_2 <=> ! [X5 : $i > $o] : (((sP0 @ X5 @ sK1 @ sK4) = $true) | ($true != (X5 @ sK2)))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[spl6_2])],[avatar_definition])).
% 0.23/1.35 thf(f17,plain,(
% 0.23/1.35 ( ! [X2 : $i > $o,X0 : $i,X1 : $i > $o] : (((sP0 @ X2 @ X1 @ X0) != $true) | ($true != (X2 @ X0))) )),
% 0.23/1.35 inference(cnf_transformation,[status(thm)],[f11])).
% 0.23/1.35 thf(f11,plain,(
% 0.23/1.35 ! [X0 : $i,X1 : $i > $o,X2 : $i > $o] : ((($true = (X1 @ X0)) & ($true != (X2 @ X0))) | ((sP0 @ X2 @ X1 @ X0) != $true))),
% 0.23/1.35 inference(rectify,[status(thm)],[f10])).
% 0.23/1.35 thf(f10,plain,(
% 0.23/1.35 ! [X2 : $i,X0 : $i > $o,X5 : $i > $o] : ((($true = (X0 @ X2)) & ($true != (X5 @ X2))) | ($true != (sP0 @ X5 @ X0 @ X2)))),
% 0.23/1.35 inference(nnf_transformation,[status(thm)],[f8])).
% 0.23/1.35 thf(f8,plain,(
% 0.23/1.35 ! [X2 : $i,X0 : $i > $o,X5 : $i > $o] : ((($true = (X0 @ X2)) & ($true != (X5 @ X2))) | ~($true = (sP0 @ X5 @ X0 @ X2)))),
% 0.23/1.35 introduced(definition,[new_symbols(naming,[=])],[predicate_definition_introduction])).
% 0.23/1.35 thf(f60,plain,(
% 0.23/1.35 ~spl6_3 | spl6_9 | spl6_2),
% 0.23/1.35 inference(avatar_split_clause,[status(thm)],[f26,f31,f58,f35])).
% 0.23/1.35 thf(f26,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o,X5 : $i > $o] : (($true != (sK1 @ sK3)) | ((sP0 @ X5 @ sK1 @ sK4) = $true) | ((X4 @ (sK5 @ X4)) != $true) | ($true = (sK1 @ (sK5 @ X4))) | ($true != (X5 @ sK2))) )),
% 0.23/1.35 inference(cnf_transformation,[status(thm)],[f16])).
% 0.23/1.35 thf(f16,plain,(
% 0.23/1.35 ! [X4 : $i > $o,X5 : $i > $o] : ((($true != (X5 @ sK2)) & ($true != (X4 @ sK2))) | (($true != (sK1 @ sK3)) & ((X4 @ sK3) != $true)) | ((($true = (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) != $true)) & (($true != (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) = $true))) | ((sP0 @ X5 @ sK1 @ sK4) = $true))),
% 0.23/1.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f13,f15,f14])).
% 0.23/1.35 thf(f14,plain,(
% 0.23/1.35 ? [X0 : $i > $o,X1 : $i,X2 : $i,X3 : $i] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (($true != (X0 @ X2)) & ((X4 @ X2) != $true)) | ? [X6 : $i] : ((((X0 @ X6) = $true) | ((X4 @ X6) != $true)) & (((X0 @ X6) != $true) | ((X4 @ X6) = $true))) | ($true = (sP0 @ X5 @ X0 @ X3))) => ! [X5 : $i > $o,X4 : $i > $o] : ((($true != (X5 @ sK2)) & ($true != (X4 @ sK2))) | (($true != (sK1 @ sK3)) & ((X4 @ sK3) != $true)) | ? [X6 : $i] : ((($true = (sK1 @ X6)) | ((X4 @ X6) != $true)) & (($true != (sK1 @ X6)) | ((X4 @ X6) = $true))) | ((sP0 @ X5 @ sK1 @ sK4) = $true))),
% 0.23/1.35 introduced(definition,[],[choice_axiom])).
% 0.23/1.35 thf(f15,plain,(
% 0.23/1.35 ! [X4 : $i > $o] : (? [X6 : $i] : ((($true = (sK1 @ X6)) | ((X4 @ X6) != $true)) & (($true != (sK1 @ X6)) | ((X4 @ X6) = $true))) => ((($true = (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) != $true)) & (($true != (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) = $true))))),
% 0.23/1.35 introduced(definition,[],[choice_axiom])).
% 0.23/1.35 thf(f13,plain,(
% 0.23/1.35 ? [X0 : $i > $o,X1 : $i,X2 : $i,X3 : $i] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (($true != (X0 @ X2)) & ((X4 @ X2) != $true)) | ? [X6 : $i] : ((((X0 @ X6) = $true) | ((X4 @ X6) != $true)) & (((X0 @ X6) != $true) | ((X4 @ X6) = $true))) | ($true = (sP0 @ X5 @ X0 @ X3)))),
% 0.23/1.35 inference(rectify,[status(thm)],[f12])).
% 0.23/1.35 thf(f12,plain,(
% 0.23/1.35 ? [X0 : $i > $o,X1 : $i,X3 : $i,X2 : $i] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (((X0 @ X3) != $true) & ((X4 @ X3) != $true)) | ? [X6 : $i] : ((((X0 @ X6) = $true) | ((X4 @ X6) != $true)) & (((X0 @ X6) != $true) | ((X4 @ X6) = $true))) | ($true = (sP0 @ X5 @ X0 @ X2)))),
% 0.23/1.35 inference(nnf_transformation,[status(thm)],[f9])).
% 0.23/1.35 thf(f9,plain,(
% 0.23/1.35 ? [X0 : $i > $o,X1 : $i,X3 : $i,X2 : $i] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (((X0 @ X3) != $true) & ((X4 @ X3) != $true)) | ? [X6 : $i] : (((X4 @ X6) = $true) <~> ((X0 @ X6) != $true)) | ($true = (sP0 @ X5 @ X0 @ X2)))),
% 0.23/1.35 inference(definition_folding,[status(thm)],[f7,f8])).
% 0.23/1.35 thf(f7,plain,(
% 0.23/1.35 ? [X0 : $i > $o,X1 : $i,X3 : $i,X2 : $i] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (((X0 @ X3) != $true) & ((X4 @ X3) != $true)) | ? [X6 : $i] : (((X4 @ X6) = $true) <~> ((X0 @ X6) != $true)) | (($true = (X0 @ X2)) & ($true != (X5 @ X2))))),
% 0.23/1.35 inference(ennf_transformation,[status(thm)],[f6])).
% 0.23/1.35 thf(f6,plain,(
% 0.23/1.35 ~! [X0 : $i > $o,X1 : $i,X2 : $i,X3 : $i] : ? [X4 : $i > $o,X5 : $i > $o] : ((($true = (X5 @ X2)) | ($true != (X0 @ X2))) & ! [X6 : $i] : (((X0 @ X6) != $true) <=> ((X4 @ X6) = $true)) & (((X5 @ X1) = $true) | ((X4 @ X1) = $true)) & (((X0 @ X3) = $true) | ((X4 @ X3) = $true)))),
% 0.23/1.35 inference(flattening,[status(thm)],[f5])).
% 0.23/1.35 thf(f5,plain,(
% 0.23/1.35 ~! [X0 : $i > $o,X1 : $i,X2 : $i,X3 : $i] : ? [X4 : $i > $o,X5 : $i > $o] : ((((X0 @ X3) = $true) | ((X4 @ X3) = $true)) & ! [X6 : $i] : (~((X0 @ X6) = $true) <=> ((X4 @ X6) = $true)) & (($true = (X5 @ X2)) | ~($true = (X0 @ X2))) & (((X5 @ X1) = $true) | ((X4 @ X1) = $true)))),
% 0.23/1.35 inference(fool_elimination,[status(thm)],[f4])).
% 0.23/1.35 thf(f4,plain,(
% 0.23/1.35 ~! [X0 : $i > $o,X1 : $i,X2 : $i,X3 : $i] : ? [X4 : $i > $o,X5 : $i > $o] : (((X4 @ X3) | (X0 @ X3)) & ! [X6 : $i] : (~(X0 @ X6) <=> (X4 @ X6)) & ((X5 @ X2) | ~(X0 @ X2)) & ((X4 @ X1) | (X5 @ X1)))),
% 0.23/1.35 inference(rectify,[status(thm)],[f2])).
% 0.23/1.35 thf(f2,negated_conjecture,(
% 0.23/1.35 ~! [X3 : $i > $o,X0 : $i,X2 : $i,X1 : $i] : ? [X5 : $i > $o,X4 : $i > $o] : (((X5 @ X1) | (X3 @ X1)) & ! [X6 : $i] : (~(X3 @ X6) <=> (X5 @ X6)) & ((X4 @ X2) | ~(X3 @ X2)) & ((X5 @ X0) | (X4 @ X0)))),
% 0.23/1.35 inference(negated_conjecture,[status(cth)],[f1])).
% 0.23/1.35 thf(f1,conjecture,(
% 0.23/1.35 ! [X3 : $i > $o,X0 : $i,X2 : $i,X1 : $i] : ? [X5 : $i > $o,X4 : $i > $o] : (((X5 @ X1) | (X3 @ X1)) & ! [X6 : $i] : (~(X3 @ X6) <=> (X5 @ X6)) & ((X4 @ X2) | ~(X3 @ X2)) & ((X5 @ X0) | (X4 @ X0)))),
% 0.23/1.35 file('/export/starexec/sandbox/tmp/tmp.Frpegf8kH1/DTF2THF_7277.p',cTHM125C)).
% 0.23/1.35 thf(f56,plain,(
% 0.23/1.35 spl6_2 | spl6_8),
% 0.23/1.35 inference(avatar_split_clause,[status(thm)],[f24,f54,f31])).
% 0.23/1.35 thf(f24,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o,X5 : $i > $o] : (((X4 @ sK3) != $true) | ($true = (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) != $true) | ((sP0 @ X5 @ sK1 @ sK4) = $true) | ($true != (X5 @ sK2))) )),
% 0.23/1.35 inference(cnf_transformation,[status(thm)],[f16])).
% 0.23/1.35 thf(f41,plain,(
% 0.23/1.35 ~spl6_3 | spl6_4 | spl6_2),
% 0.23/1.35 inference(avatar_split_clause,[status(thm)],[f25,f31,f39,f35])).
% 0.23/1.35 thf(f25,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o,X5 : $i > $o] : (($true != (sK1 @ sK3)) | ((X4 @ (sK5 @ X4)) = $true) | ($true != (sK1 @ (sK5 @ X4))) | ((sP0 @ X5 @ sK1 @ sK4) = $true) | ($true != (X5 @ sK2))) )),
% 0.23/1.35 inference(cnf_transformation,[status(thm)],[f16])).
% 0.23/1.35 thf(f33,plain,(
% 0.23/1.35 spl6_1 | spl6_2),
% 0.23/1.35 inference(avatar_split_clause,[status(thm)],[f23,f31,f28])).
% 0.23/1.35 thf(f23,plain,(
% 0.23/1.35 ( ! [X4 : $i > $o,X5 : $i > $o] : (((sP0 @ X5 @ sK1 @ sK4) = $true) | ((X4 @ sK3) != $true) | ($true != (X5 @ sK2)) | ($true != (sK1 @ (sK5 @ X4))) | ((X4 @ (sK5 @ X4)) = $true)) )),
% 0.23/1.35 inference(cnf_transformation,[status(thm)],[f16])).
% 0.23/1.35 % SZS output end Proof for DTF2THF_7277
% 0.23/1.35 % (7379)------------------------------
% 0.23/1.35 % (7379)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.23/1.35 % (7379)Termination reason: Refutation
% 0.23/1.35
% 0.23/1.35 % (7379)Memory used [KB]: 5756
% 0.23/1.35 % (7379)Time elapsed: 0.022 s
% 0.23/1.35 % (7379)Instructions burned: 32 (million)
% 0.23/1.35 % (7379)------------------------------
% 0.23/1.35 % (7379)------------------------------
% 0.23/1.35 % (7373)Success in time 0.034 s
%------------------------------------------------------------------------------