%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV458^1 : TPTP v9.2.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n028.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:41:17 AM UTC 2026
% Result : Theorem 1.64s 1.46s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 104 ( 12 unt; 0 typ; 8 def)
% Number of atoms : 693 ( 131 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 794 ( 89 ~; 142 |; 0 &; 554 @)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 49 ( 49 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 11 con; 0-4 aty)
% Number of variables : 92 ( 0 ^; 84 !; 8 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/UNION':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
sK1: sK0 > $o ).
thf(func_def_11,type,
sK2: sK0 > $o ).
thf(func_def_12,type,
sK3: sK0 > $o ).
thf(func_def_14,type,
sK5:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_16,type,
ph6:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK7: sK0 ).
thf(f1104,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f52,f61,f64,f185,f267,f300,f303,f790,f860,f1005,f1103]) ).
thf(f1103,plain,
( ~ spl4_2
| ~ spl4_4
| spl4_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f1102]) ).
thf(f1102,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f1101]) ).
thf(f1101,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_4
| spl4_5 ),
inference(forward_demodulation,[status(thm)],[f1100,f1057]) ).
thf(f1057,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_4 ),
inference(trivial_inequality_removal,[status(thm)],[f1053]) ).
thf(f1053,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_4 ),
inference(superposition,[status(thm)],[f107,f60]) ).
thf(f60,plain,
( ( $false
= ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[status(thm)],[f58]) ).
thf(f58,definition,
( spl4_4
<=> ( $false
= ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 ) ) ),
introduced(definition,[new_symbols(naming,[spl4_4])],[avatar_definition]) ).
thf(f107,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f98]) ).
thf(f98,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f24,f20]) ).
thf(f20,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/IN_') ).
thf(f24,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f18,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
| ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) )
= ( 'const/sets/IN' @ X0 @ X4 @ X2 ) )
| ( 'const/sets/IN' @ X0 @ X4 @ X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/IN_UNION_') ).
thf(f1100,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_2
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f1099]) ).
thf(f1099,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_2
| spl4_5 ),
inference(forward_demodulation,[status(thm)],[f1092,f944]) ).
thf(f944,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 ) )
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f934]) ).
thf(f934,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 ) )
| ( $true != $true )
| spl4_5 ),
inference(superposition,[status(thm)],[f178,f25]) ).
thf(f25,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f21]) ).
thf(f178,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
!= $true )
| spl4_5 ),
inference(avatar_component_clause,[status(thm)],[f177]) ).
thf(f177,definition,
( spl4_5
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition]) ).
thf(f1092,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_2
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f1079]) ).
thf(f1079,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true )
| ~ spl4_2
| spl4_5 ),
inference(superposition,[status(thm)],[f23,f1036]) ).
thf(f1036,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl4_2
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f1035]) ).
thf(f1035,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ( $false = $true )
| ~ spl4_2
| spl4_5 ),
inference(forward_demodulation,[status(thm)],[f1033,f977]) ).
thf(f977,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 ) )
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f975]) ).
thf(f975,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 ) )
| ( $false = $true )
| spl4_5 ),
inference(superposition,[status(thm)],[f107,f942]) ).
thf(f942,plain,
( ( $false
= ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 @ sK7 ) )
| spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f933]) ).
thf(f933,plain,
( ( $false
= ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 @ sK7 ) )
| ( $true != $true )
| spl4_5 ),
inference(superposition,[status(thm)],[f178,f19]) ).
thf(f19,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f15]) ).
thf(f1033,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[status(thm)],[f1020]) ).
thf(f1020,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ~ spl4_2 ),
inference(superposition,[status(thm)],[f51,f90]) ).
thf(f90,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 ) )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f87]) ).
thf(f87,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true )
| ( $false = $true )
| ( $false
= ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 ) )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true ) ),
inference(superposition,[status(thm)],[f23,f19]) ).
thf(f51,plain,
( ( $true
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[status(thm)],[f49]) ).
thf(f49,definition,
( spl4_2
<=> ( $true
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) ) ),
introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition]) ).
thf(f23,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f22]) ).
thf(f22,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $true
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
| ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f1005,plain,
( ~ spl4_3
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[status(thm)],[f1004]) ).
thf(f1004,plain,
( $false
| ~ spl4_3
| ~ spl4_6 ),
inference(trivial_inequality_removal,[status(thm)],[f1003]) ).
thf(f1003,plain,
( ( $false = $true )
| ~ spl4_3
| ~ spl4_6 ),
inference(backward_demodulation,[status(thm)],[f183,f996]) ).
thf(f996,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f992]) ).
thf(f992,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ( $false = $true )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f24,f913]) ).
thf(f913,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f907]) ).
thf(f907,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ( $false = $true )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f56,f139]) ).
thf(f139,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f132]) ).
thf(f132,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false = $true )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
= $true ) ),
inference(superposition,[status(thm)],[f20,f25]) ).
thf(f56,plain,
( ( $false
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[status(thm)],[f54]) ).
thf(f54,definition,
( spl4_3
<=> ( $false
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) ) ),
introduced(definition,[new_symbols(naming,[spl4_3])],[avatar_definition]) ).
thf(f183,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_6 ),
inference(avatar_component_clause,[status(thm)],[f181]) ).
thf(f181,definition,
( spl4_6
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_6])],[avatar_definition]) ).
thf(f860,plain,
( ~ spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[status(thm)],[f859]) ).
thf(f859,plain,
( $false
| ~ spl4_4
| ~ spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f858]) ).
thf(f858,plain,
( ( $false = $true )
| ~ spl4_4
| ~ spl4_5 ),
inference(backward_demodulation,[status(thm)],[f179,f857]) ).
thf(f857,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) ) )
| ~ spl4_4 ),
inference(trivial_inequality_removal,[status(thm)],[f852]) ).
thf(f852,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) ) )
| ( $false = $true )
| ~ spl4_4 ),
inference(superposition,[status(thm)],[f139,f60]) ).
thf(f179,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
= $true )
| ~ spl4_5 ),
inference(avatar_component_clause,[status(thm)],[f177]) ).
thf(f790,plain,
( ~ spl4_3
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[status(thm)],[f789]) ).
thf(f789,plain,
( $false
| ~ spl4_3
| ~ spl4_8 ),
inference(trivial_inequality_removal,[status(thm)],[f788]) ).
thf(f788,plain,
( ( $false = $true )
| ~ spl4_3
| ~ spl4_8 ),
inference(backward_demodulation,[status(thm)],[f265,f784]) ).
thf(f784,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f776]) ).
thf(f776,plain,
( ( $false = $true )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 ) )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f25,f366]) ).
thf(f366,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f359]) ).
thf(f359,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) )
| ( $false = $true )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f56,f139]) ).
thf(f265,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true )
| ~ spl4_8 ),
inference(avatar_component_clause,[status(thm)],[f263]) ).
thf(f263,definition,
( spl4_8
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_8])],[avatar_definition]) ).
thf(f303,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f302]) ).
thf(f302,plain,
( $false
| ~ spl4_1
| ~ spl4_4 ),
inference(trivial_inequality_removal,[status(thm)],[f301]) ).
thf(f301,plain,
( ( $false = $true )
| ~ spl4_1
| ~ spl4_4 ),
inference(backward_demodulation,[status(thm)],[f47,f60]) ).
thf(f47,plain,
( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[status(thm)],[f45]) ).
thf(f45,definition,
( spl4_1
<=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition]) ).
thf(f300,plain,
( ~ spl4_3
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[status(thm)],[f299]) ).
thf(f299,plain,
( $false
| ~ spl4_3
| ~ spl4_7 ),
inference(trivial_inequality_removal,[status(thm)],[f298]) ).
thf(f298,plain,
( ( $false = $true )
| ~ spl4_3
| ~ spl4_7 ),
inference(backward_demodulation,[status(thm)],[f261,f297]) ).
thf(f297,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 ) )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f283]) ).
thf(f283,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 ) )
| ( $false = $true )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f107,f56]) ).
thf(f261,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ~ spl4_7 ),
inference(avatar_component_clause,[status(thm)],[f259]) ).
thf(f259,definition,
( spl4_7
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_7])],[avatar_definition]) ).
thf(f267,plain,
( spl4_7
| spl4_8
| ~ spl4_5 ),
inference(avatar_split_clause,[status(thm)],[f252,f177,f263,f259]) ).
thf(f252,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ~ spl4_5 ),
inference(trivial_inequality_removal,[status(thm)],[f246]) ).
thf(f246,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK3 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ( $false = $true )
| ~ spl4_5 ),
inference(superposition,[status(thm)],[f23,f179]) ).
thf(f185,plain,
( spl4_6
| spl4_5
| ~ spl4_1 ),
inference(avatar_split_clause,[status(thm)],[f174,f45,f177,f181]) ).
thf(f174,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
= $true )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[status(thm)],[f172]) ).
thf(f172,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
= $true )
| ( $false = $true )
| ~ spl4_1 ),
inference(superposition,[status(thm)],[f90,f47]) ).
thf(f64,plain,
( ~ spl4_2
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f63]) ).
thf(f63,plain,
( $false
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f62]) ).
thf(f62,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_3 ),
inference(forward_demodulation,[status(thm)],[f51,f56]) ).
thf(f61,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[status(thm)],[f43,f58,f54]) ).
thf(f43,plain,
( ( $false
= ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 ) )
| ( $false
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f41]) ).
thf(f41,plain,
( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 )
!= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) ),
inference(negative_extensionality,[status(thm)],[f17]) ).
thf(f17,plain,
( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) )
!= ( 'const/sets/UNION' @ X0 @ X2 @ ( 'const/sets/UNION' @ X0 @ X1 @ X3 ) ) )
=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) )
!= ( 'const/sets/UNION' @ X0 @ X2 @ ( 'const/sets/UNION' @ X0 @ X1 @ X3 ) ) ),
inference(ennf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) )
= ( 'const/sets/UNION' @ X0 @ X2 @ ( 'const/sets/UNION' @ X0 @ X1 @ X3 ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X2 @ X4 ) )
= ( 'const/sets/UNION' @ X0 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( 'const/sets/UNION' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X2 @ X4 ) )
= ( 'const/sets/UNION' @ X0 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/UNION_ACI_2') ).
thf(f52,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[status(thm)],[f42,f49,f45]) ).
thf(f42,plain,
( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK7 )
= $true )
| ( $true
= ( 'const/sets/UNION' @ sK0 @ sK2 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK3 ) @ sK7 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEV458^1 : TPTP v9.2.1. Released v7.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.33 % Computer : n028.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue Feb 24 12:47:12 EST 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.45 ---- Original DTF file ---
% 0.19/0.45 thf(spec,logic,$$dhol).
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 % File : SEV458^1 : TPTP v9.2.1. Released v7.0.0.
% 0.19/0.45 % Domain : Analysis
% 0.19/0.45 % Problem : UNION_ACI_
% 0.19/0.45 % Version : Especial.
% 0.19/0.45 % English :
% 0.19/0.45
% 0.19/0.45 % Refs : [Kal16] Kalisyk (2016), Email to Geoff Sutcliffe
% 0.19/0.45 % Source : [Kal16]
% 0.19/0.45 % Names : UNION_ACI_2.p [Kal16]
% 0.19/0.45
% 0.19/0.45 % Status : Theorem
% 0.19/0.45 % Rating : 0.33 v8.1.0, 0.25 v7.5.0, 0.00 v7.2.0, 0.25 v7.1.0
% 0.19/0.45 % Syntax : Number of formulae : 6 ( 4 unt; 2 typ; 0 def)
% 0.19/0.45 % Number of atoms : 17 ( 6 equ; 0 cnn)
% 0.19/0.45 % Maximal formula atoms : 1 ( 4 avg)
% 0.19/0.45 % Number of connectives : 35 ( 0 ~; 1 |; 0 &; 34 @)
% 0.19/0.45 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.45 % Maximal formula depth : 5 ( 5 avg)
% 0.19/0.45 % Number of types : 1 ( 0 usr)
% 0.19/0.45 % Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% 0.19/0.45 % Number of symbols : 3 ( 2 usr; 0 con; 2-4 aty)
% 0.19/0.45 % Number of variables : 17 ( 0 ^; 15 !; 0 ?; 17 :)
% 0.19/0.45 % ( 2 !>; 0 ?*; 0 @-; 0 @+)
% 0.19/0.45 % SPC : TH1_THM_EQU_NAR
% 0.19/0.45
% 0.19/0.45 % Comments : Exported from core HOL Light.
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 thf('thf_const_const/sets/UNION',type,
% 0.19/0.45 'const/sets/UNION':
% 0.19/0.45 !>[A: $tType] : ( ( A > $o ) > ( A > $o ) > A > $o ) ).
% 0.19/0.45
% 0.19/0.45 thf('thf_const_const/sets/IN',type,
% 0.19/0.45 'const/sets/IN':
% 0.19/0.45 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 0.19/0.45
% 0.19/0.45 thf('thm/sets/IN_',axiom,
% 0.19/0.45 ! [A: $tType,P: A > $o,A0: A] :
% 0.19/0.45 ( ( 'const/sets/IN' @ A @ A0 @ P )
% 0.19/0.45 = ( P @ A0 ) ) ).
% 0.19/0.45
% 0.19/0.45 thf('thm/sets/IN_UNION_',axiom,
% 0.19/0.45 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 0.19/0.45 ( ( 'const/sets/IN' @ A @ A2 @ ( 'const/sets/UNION' @ A @ A0 @ A1 ) )
% 0.19/0.45 = ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 0.19/0.45 | ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ).
% 0.19/0.45
% 0.19/0.45 thf('thm/sets/EXTENSION_',axiom,
% 0.19/0.45 ! [A: $tType,A0: A > $o,A1: A > $o] :
% 0.19/0.45 ( ( A0 = A1 )
% 0.19/0.45 = ( ! [A2: A] :
% 0.19/0.45 ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 0.19/0.45 = ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ) ).
% 0.19/0.45
% 0.19/0.45 thf('thm/sets/UNION_ACI_2',conjecture,
% 0.19/0.45 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A > $o] :
% 0.19/0.45 ( ( 'const/sets/UNION' @ A @ A1 @ ( 'const/sets/UNION' @ A @ A0 @ A2 ) )
% 0.19/0.45 = ( 'const/sets/UNION' @ A @ A0 @ ( 'const/sets/UNION' @ A @ A1 @ A2 ) ) ) ).
% 0.19/0.45
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 ------------------------
% 1.50/1.26 ---- Embedded in THF ---
% 1.50/1.26 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.26 %%% Generated on Tue Feb 24 12:47:12 EST 2026
% 1.50/1.26 %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.26 %%% Logic specification used:
% 1.50/1.26 %%% thf(spec, logic, $$dhol).
% 1.50/1.26
% 1.50/1.26 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2DTF15054.p
% See solution above
% 1.50/1.26 ------------------------
% 1.50/1.27 ---- Cleaned THF ---
% 1.50/1.28 thf('thf_const_const/sets/UNION',type,
% 1.50/1.28 'const/sets/UNION':
% 1.50/1.28 !>[A: $tType] : ( ( A > $o ) > ( A > $o ) > A > $o ) ).
% 1.50/1.28
% 1.50/1.28 thf('thf_const_const/sets/IN',type,
% 1.50/1.28 'const/sets/IN':
% 1.50/1.28 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 1.50/1.28
% 1.50/1.28 thf('thm/sets/IN_',axiom,
% 1.50/1.28 ! [A: $tType,P: A > $o,A0: A] :
% 1.50/1.28 ( ( 'const/sets/IN' @ A @ A0 @ P )
% 1.50/1.28 = ( P @ A0 ) ) ).
% 1.50/1.28
% 1.50/1.28 thf('thm/sets/IN_UNION_',axiom,
% 1.50/1.28 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 1.50/1.28 ( ( 'const/sets/IN' @ A @ A2 @ ( 'const/sets/UNION' @ A @ A0 @ A1 ) )
% 1.50/1.28 = ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 1.50/1.28 | ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ).
% 1.50/1.28
% 1.50/1.28 thf('thm/sets/EXTENSION_',axiom,
% 1.50/1.28 ! [A: $tType,A0: A > $o,A1: A > $o] :
% 1.50/1.28 ( ( A0 = A1 )
% 1.50/1.28 = ( ! [A2: A] :
% 1.50/1.28 ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 1.50/1.28 = ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ) ).
% 1.50/1.28
% 1.50/1.28 thf('thm/sets/UNION_ACI_2',conjecture,
% 1.50/1.28 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A > $o] :
% 1.50/1.28 ( ( 'const/sets/UNION' @ A @ A1 @ ( 'const/sets/UNION' @ A @ A0 @ A2 ) )
% 1.50/1.28 = ( 'const/sets/UNION' @ A @ A0 @ ( 'const/sets/UNION' @ A @ A1 @ A2 ) ) ) ).
% 1.50/1.28 ------------------------
% 1.50/1.29 % (15174)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_15054 for (3000ds/18Mi)
% 1.50/1.29 % (15174)Instruction limit reached!
% 1.50/1.29 % (15174)------------------------------
% 1.50/1.29 % (15174)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.50/1.29 % (15174)Termination reason: Unknown
% 1.50/1.29 % (15174)Termination phase: Saturation
% 1.50/1.29
% 1.50/1.29 % (15174)Memory used [KB]: 5628
% 1.50/1.29 % (15174)Time elapsed: 0.008 s
% 1.50/1.29 % (15174)Instructions burned: 19 (million)
% 1.50/1.29 % (15174)------------------------------
% 1.50/1.29 % (15174)------------------------------
% 1.50/1.30 % (15168)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_15054 for (3000ds/183Mi)
% 1.50/1.30 % (15170)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_15054 for (3000ds/27Mi)
% 1.50/1.30 % (15169)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_15054 for (3000ds/4Mi)
% 1.50/1.30 % (15172)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_15054 for (3000ds/2Mi)
% 1.50/1.30 % (15171)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_15054 for (3000ds/2Mi)
% 1.50/1.30 % (15173)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_15054 for (3000ds/275Mi)
% 1.64/1.30 % (15171)Instruction limit reached!
% 1.64/1.30 % (15171)------------------------------
% 1.64/1.30 % (15171)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (15171)Termination reason: Unknown
% 1.64/1.30 % (15171)Termination phase: Property scanning
% 1.64/1.30
% 1.64/1.30 % (15171)Memory used [KB]: 895
% 1.64/1.30 % (15171)Time elapsed: 0.003 s
% 1.64/1.30 % (15171)Instructions burned: 2 (million)
% 1.64/1.30 % (15171)------------------------------
% 1.64/1.30 % (15171)------------------------------
% 1.64/1.30 % Exception at run slice level
% 1.64/1.30 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.30 % (15169)Instruction limit reached!
% 1.64/1.30 % (15169)------------------------------
% 1.64/1.30 % (15169)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (15169)Termination reason: Unknown
% 1.64/1.30 % (15169)Termination phase: Saturation
% 1.64/1.30
% 1.64/1.30 % (15169)Memory used [KB]: 5500
% 1.64/1.30 % (15169)Time elapsed: 0.005 s
% 1.64/1.30 % (15169)Instructions burned: 5 (million)
% 1.64/1.30 % (15169)------------------------------
% 1.64/1.30 % (15169)------------------------------
% 1.64/1.30 % (15173)Refutation not found, incomplete strategy
% 1.64/1.30 % (15173)------------------------------
% 1.64/1.30 % (15173)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.30 % (15173)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.30
% 1.64/1.30
% 1.64/1.30 % (15173)Memory used [KB]: 5500
% 1.64/1.30 % (15173)Time elapsed: 0.005 s
% 1.64/1.30 % (15173)Instructions burned: 4 (million)
% 1.64/1.30 % (15173)------------------------------
% 1.64/1.30 % (15173)------------------------------
% 1.64/1.31 % (15175)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/3Mi)
% 1.64/1.31 % (15170)Instruction limit reached!
% 1.64/1.31 % (15170)------------------------------
% 1.64/1.31 % (15170)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.31 % (15170)Termination reason: Unknown
% 1.64/1.31 % (15170)Termination phase: Saturation
% 1.64/1.31
% 1.64/1.31 % (15170)Memory used [KB]: 5628
% 1.64/1.31 % (15170)Time elapsed: 0.020 s
% 1.64/1.31 % (15170)Instructions burned: 28 (million)
% 1.64/1.31 % (15170)------------------------------
% 1.64/1.31 % (15170)------------------------------
% 1.64/1.31 % (15176)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_15054 for (2999ds/37Mi)
% 1.64/1.31 % (15175)Instruction limit reached!
% 1.64/1.31 % (15175)------------------------------
% 1.64/1.31 % (15175)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.31 % (15177)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_15054 for (2999ds/15Mi)
% 1.64/1.31 % (15175)Termination reason: Unknown
% 1.64/1.31 % (15175)Termination phase: Saturation
% 1.64/1.31
% 1.64/1.31 % (15175)Memory used [KB]: 5500
% 1.64/1.31 % (15175)Time elapsed: 0.004 s
% 1.64/1.31 % (15175)Instructions burned: 3 (million)
% 1.64/1.31 % (15175)------------------------------
% 1.64/1.31 % (15175)------------------------------
% 1.64/1.32 % Exception at run slice level
% 1.64/1.32 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.32 % (15178)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_15054 for (2999ds/3Mi)
% 1.64/1.32 % (15179)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_15054 for (2999ds/1041Mi)
% 1.64/1.32 % (15177)Refutation not found, incomplete strategy
% 1.64/1.32 % (15177)------------------------------
% 1.64/1.32 % (15177)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (15177)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.32
% 1.64/1.32
% 1.64/1.32 % (15177)Memory used [KB]: 5500
% 1.64/1.32 % (15177)Time elapsed: 0.005 s
% 1.64/1.32 % (15177)Instructions burned: 4 (million)
% 1.64/1.32 % (15177)------------------------------
% 1.64/1.32 % (15177)------------------------------
% 1.64/1.32 % (15178)Instruction limit reached!
% 1.64/1.32 % (15178)------------------------------
% 1.64/1.32 % (15178)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.32 % (15178)Termination reason: Unknown
% 1.64/1.32 % (15178)Termination phase: Saturation
% 1.64/1.32
% 1.64/1.32 % (15178)Memory used [KB]: 5500
% 1.64/1.32 % (15178)Time elapsed: 0.004 s
% 1.64/1.32 % (15178)Instructions burned: 3 (million)
% 1.64/1.32 % (15178)------------------------------
% 1.64/1.32 % (15178)------------------------------
% 1.64/1.32 % Exception at run slice level
% 1.64/1.32 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.33 % (15180)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/7Mi)
% 1.64/1.33 % (15180)Instruction limit reached!
% 1.64/1.33 % (15180)------------------------------
% 1.64/1.33 % (15180)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.33 % (15180)Termination reason: Unknown
% 1.64/1.33 % (15180)Termination phase: Saturation
% 1.64/1.33
% 1.64/1.33 % (15180)Memory used [KB]: 1023
% 1.64/1.33 % (15180)Time elapsed: 0.005 s
% 1.64/1.33 % (15180)Instructions burned: 8 (million)
% 1.64/1.33 % (15180)------------------------------
% 1.64/1.33 % (15180)------------------------------
% 1.64/1.33 % (15182)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_15054 for (2999ds/3Mi)
% 1.64/1.33 % (15181)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/16Mi)
% 1.64/1.33 % (15182)Instruction limit reached!
% 1.64/1.33 % (15182)------------------------------
% 1.64/1.33 % (15182)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.33 % (15182)Termination reason: Unknown
% 1.64/1.33 % (15182)Termination phase: Saturation
% 1.64/1.33
% 1.64/1.33 % (15182)Memory used [KB]: 895
% 1.64/1.33 % (15182)Time elapsed: 0.003 s
% 1.64/1.33 % (15182)Instructions burned: 3 (million)
% 1.64/1.33 % (15182)------------------------------
% 1.64/1.33 % (15182)------------------------------
% 1.64/1.34 % (15183)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_15054 for (2999ds/3Mi)
% 1.64/1.34 % (15184)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/7Mi)
% 1.64/1.34 % (15185)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/3Mi)
% 1.64/1.34 % Exception at run slice level
% 1.64/1.34 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.34 % (15183)Instruction limit reached!
% 1.64/1.34 % (15183)------------------------------
% 1.64/1.34 % (15183)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.34 % (15183)Termination reason: Unknown
% 1.64/1.34 % (15183)Termination phase: Saturation
% 1.64/1.34
% 1.64/1.34 % (15183)Memory used [KB]: 1023
% 1.64/1.34 % (15183)Time elapsed: 0.004 s
% 1.64/1.34 % (15183)Instructions burned: 3 (million)
% 1.64/1.34 % (15183)------------------------------
% 1.64/1.34 % (15183)------------------------------
% 1.64/1.34 % (15184)Instruction limit reached!
% 1.64/1.34 % (15184)------------------------------
% 1.64/1.34 % (15184)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.34 % (15184)Termination reason: Unknown
% 1.64/1.34 % (15184)Termination phase: Saturation
% 1.64/1.34
% 1.64/1.34 % (15184)Memory used [KB]: 5500
% 1.64/1.34 % (15184)Time elapsed: 0.007 s
% 1.64/1.34 % (15184)Instructions burned: 8 (million)
% 1.64/1.34 % (15184)------------------------------
% 1.64/1.34 % (15184)------------------------------
% 1.64/1.34 % (15181)Instruction limit reached!
% 1.64/1.34 % (15181)------------------------------
% 1.64/1.34 % (15181)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.34 % (15181)Termination reason: Unknown
% 1.64/1.34 % (15181)Termination phase: Saturation
% 1.64/1.34
% 1.64/1.34 % (15181)Memory used [KB]: 5756
% 1.64/1.34 % (15181)Time elapsed: 0.011 s
% 1.64/1.34 % (15181)Instructions burned: 17 (million)
% 1.64/1.34 % (15181)------------------------------
% 1.64/1.34 % (15181)------------------------------
% 1.64/1.34 % (15186)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/4Mi)
% 1.64/1.34 % (15186)Instruction limit reached!
% 1.64/1.34 % (15186)------------------------------
% 1.64/1.34 % (15186)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.34 % (15186)Termination reason: Unknown
% 1.64/1.34 % (15186)Termination phase: Saturation
% 1.64/1.34
% 1.64/1.34 % (15186)Memory used [KB]: 5500
% 1.64/1.34 % (15186)Time elapsed: 0.003 s
% 1.64/1.34 % (15186)Instructions burned: 4 (million)
% 1.64/1.34 % (15186)------------------------------
% 1.64/1.34 % (15186)------------------------------
% 1.64/1.34 % (15187)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/18Mi)
% 1.64/1.35 % (15168)Instruction limit reached!
% 1.64/1.35 % (15168)------------------------------
% 1.64/1.35 % (15168)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.35 % (15168)Termination reason: Unknown
% 1.64/1.35 % (15168)Termination phase: Saturation
% 1.64/1.35
% 1.64/1.35 % (15168)Memory used [KB]: 6396
% 1.64/1.35 % (15168)Time elapsed: 0.056 s
% 1.64/1.35 % (15168)Instructions burned: 183 (million)
% 1.64/1.35 % (15168)------------------------------
% 1.64/1.35 % (15168)------------------------------
% 1.64/1.35 % (15187)Instruction limit reached!
% 1.64/1.35 % (15187)------------------------------
% 1.64/1.35 % (15187)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.35 % (15187)Termination reason: Unknown
% 1.64/1.35 % (15187)Termination phase: Saturation
% 1.64/1.35
% 1.64/1.35 % (15187)Memory used [KB]: 5500
% 1.64/1.35 % (15187)Time elapsed: 0.008 s
% 1.64/1.35 % (15187)Instructions burned: 18 (million)
% 1.64/1.35 % (15187)------------------------------
% 1.64/1.35 % (15187)------------------------------
% 1.64/1.35 % (15190)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_15054 for (2999ds/902Mi)
% 1.64/1.35 % (15192)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/5Mi)
% 1.64/1.35 % Exception at run slice level
% 1.64/1.35 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.35 % (15190)Refutation not found, incomplete strategy
% 1.64/1.35 % (15190)------------------------------
% 1.64/1.35 % (15190)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.35 % (15190)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.35
% 1.64/1.35
% 1.64/1.35 % (15190)Memory used [KB]: 5500
% 1.64/1.35 % (15190)Time elapsed: 0.003 s
% 1.64/1.35 % (15190)Instructions burned: 3 (million)
% 1.64/1.35 % (15190)------------------------------
% 1.64/1.35 % (15190)------------------------------
% 1.64/1.36 % (15188)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/710Mi)
% 1.64/1.36 % (15189)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/6Mi)
% 1.64/1.36 % (15193)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_15054 for (2999ds/6Mi)
% 1.64/1.36 % (15191)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_15054 for (2999ds/21Mi)
% 1.64/1.36 % Exception at run slice level
% 1.64/1.36 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.36 % (15189)Instruction limit reached!
% 1.64/1.36 % (15189)------------------------------
% 1.64/1.36 % (15189)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.36 % (15189)Termination reason: Unknown
% 1.64/1.36 % (15189)Termination phase: Saturation
% 1.64/1.36
% 1.64/1.36 % (15189)Memory used [KB]: 5500
% 1.64/1.36 % (15189)Time elapsed: 0.006 s
% 1.64/1.36 % (15189)Instructions burned: 6 (million)
% 1.64/1.36 % (15189)------------------------------
% 1.64/1.36 % (15189)------------------------------
% 1.64/1.36 % (15194)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/377Mi)
% 1.64/1.36 % (15195)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_15054 for (2999ds/779Mi)
% 1.64/1.36 % Exception at run slice level
% 1.64/1.36 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.37 % (15196)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_15054 for (2999ds/19Mi)
% 1.64/1.37 % Exception at run slice level
% 1.64/1.37 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.37 % (15197)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/879Mi)
% 1.64/1.37 % (15198)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/17Mi)
% 1.64/1.37 % (15191)Instruction limit reached!
% 1.64/1.37 % (15191)------------------------------
% 1.64/1.37 % (15191)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.37 % (15191)Termination reason: Unknown
% 1.64/1.37 % (15191)Termination phase: Saturation
% 1.64/1.37
% 1.64/1.37 % (15191)Memory used [KB]: 5628
% 1.64/1.37 % (15191)Time elapsed: 0.017 s
% 1.64/1.37 % (15191)Instructions burned: 21 (million)
% 1.64/1.37 % (15191)------------------------------
% 1.64/1.37 % (15191)------------------------------
% 1.64/1.37 % (15199)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/3Mi)
% 1.64/1.38 % (15200)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/30Mi)
% 1.64/1.38 % (15199)Instruction limit reached!
% 1.64/1.38 % (15199)------------------------------
% 1.64/1.38 % (15199)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.38 % (15199)Termination reason: Unknown
% 1.64/1.38 % (15199)Termination phase: Saturation
% 1.64/1.38
% 1.64/1.38 % (15199)Memory used [KB]: 1023
% 1.64/1.38 % (15199)Time elapsed: 0.003 s
% 1.64/1.38 % (15199)Instructions burned: 4 (million)
% 1.64/1.38 % (15199)------------------------------
% 1.64/1.38 % (15199)------------------------------
% 1.64/1.38 % (15198)Instruction limit reached!
% 1.64/1.38 % (15198)------------------------------
% 1.64/1.38 % (15198)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.38 % (15198)Termination reason: Unknown
% 1.64/1.38 % (15198)Termination phase: Saturation
% 1.64/1.38
% 1.64/1.38 % (15198)Memory used [KB]: 5628
% 1.64/1.38 % (15198)Time elapsed: 0.008 s
% 1.64/1.38 % (15198)Instructions burned: 17 (million)
% 1.64/1.38 % (15198)------------------------------
% 1.64/1.38 % (15198)------------------------------
% 1.64/1.39 % (15202)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/100Mi)
% 1.64/1.39 % (15200)Instruction limit reached!
% 1.64/1.39 % (15200)------------------------------
% 1.64/1.39 % (15200)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.39 % (15200)Termination reason: Unknown
% 1.64/1.39 % (15200)Termination phase: Saturation
% 1.64/1.39
% 1.64/1.39 % (15200)Memory used [KB]: 5628
% 1.64/1.39 % (15200)Time elapsed: 0.013 s
% 1.64/1.39 % (15200)Instructions burned: 32 (million)
% 1.64/1.39 % (15200)------------------------------
% 1.64/1.39 % (15200)------------------------------
% 1.64/1.39 % (15203)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/3Mi)
% 1.64/1.39 % Exception at run slice level
% 1.64/1.39 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.39 % (15201)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_15054 for (2999ds/127Mi)
% 1.64/1.40 % (15204)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/20Mi)
% 1.64/1.40 % (15205)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/86Mi)
% 1.64/1.40 % (15204)Instruction limit reached!
% 1.64/1.40 % (15204)------------------------------
% 1.64/1.40 % (15204)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.40 % (15204)Termination reason: Unknown
% 1.64/1.40 % (15204)Termination phase: Saturation
% 1.64/1.40
% 1.64/1.40 % (15204)Memory used [KB]: 5628
% 1.64/1.40 % (15204)Time elapsed: 0.009 s
% 1.64/1.40 % (15204)Instructions burned: 21 (million)
% 1.64/1.40 % (15204)------------------------------
% 1.64/1.40 % (15204)------------------------------
% 1.64/1.42 % (15206)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/107Mi)
% 1.64/1.42 % (15202)Instruction limit reached!
% 1.64/1.42 % (15202)------------------------------
% 1.64/1.42 % (15202)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.42 % (15202)Termination reason: Unknown
% 1.64/1.42 % (15202)Termination phase: Saturation
% 1.64/1.42
% 1.64/1.42 % (15202)Memory used [KB]: 5756
% 1.64/1.42 % (15202)Time elapsed: 0.032 s
% 1.64/1.42 % (15202)Instructions burned: 102 (million)
% 1.64/1.42 % (15202)------------------------------
% 1.64/1.42 % (15202)------------------------------
% 1.64/1.43 % (15207)lrs+2_1:1024_cnfonf=lazy_gen:fe=off:hud=15:plsq=on:plsqc=1:plsqr=32,1:i=39:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/39Mi)
% 1.64/1.43 % Exception at run slice level
% 1.64/1.43 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.43 % (15205)Instruction limit reached!
% 1.64/1.43 % (15205)------------------------------
% 1.64/1.43 % (15205)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.43 % (15205)Termination reason: Unknown
% 1.64/1.43 % (15205)Termination phase: Saturation
% 1.64/1.43
% 1.64/1.43 % (15205)Memory used [KB]: 5884
% 1.64/1.43 % (15205)Time elapsed: 0.032 s
% 1.64/1.43 % (15205)Instructions burned: 87 (million)
% 1.64/1.43 % (15205)------------------------------
% 1.64/1.43 % (15205)------------------------------
% 1.64/1.44 % (15208)dis+10_1:1_cnfonf=lazy_not_gen:fsr=off:kws=precedence:nwc=5.0:s2a=on:ss=axioms:st=1.5:i=448:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/448Mi)
% 1.64/1.44 % Exception at run slice level
% 1.64/1.44 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.44 % (15209)lrs+10_1:512_au=on:fde=unused:lma=on:nm=32:plsq=on:plsqc=1:plsqr=16121663,131072:sfv=off:sp=const_max:ss=axioms:st=3.0:tgt=full:i=46:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/46Mi)
% 1.64/1.44 % (15201)Instruction limit reached!
% 1.64/1.44 % (15201)------------------------------
% 1.64/1.44 % (15201)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.44 % (15201)Termination reason: Unknown
% 1.64/1.44 % (15201)Termination phase: Saturation
% 1.64/1.44
% 1.64/1.44 % (15201)Memory used [KB]: 6012
% 1.64/1.44 % (15201)Time elapsed: 0.054 s
% 1.64/1.44 % (15201)Instructions burned: 127 (million)
% 1.64/1.44 % (15201)------------------------------
% 1.64/1.44 % (15201)------------------------------
% 1.64/1.45 % (15210)lrs+10_1:10_au=on:av=off:cbe=off:cnfonf=lazy_pi_sigma_gen:ntd=on:plsq=on:plsqc=1:plsqr=32,1:i=98:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/98Mi)
% 1.64/1.45 % Exception at run slice level
% 1.64/1.45 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 1.64/1.45 % (15206)Instruction limit reached!
% 1.64/1.45 % (15206)------------------------------
% 1.64/1.45 % (15206)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.45 % (15206)Termination reason: Unknown
% 1.64/1.45 % (15206)Termination phase: Saturation
% 1.64/1.45
% 1.64/1.45 % (15206)Memory used [KB]: 5756
% 1.64/1.45 % (15206)Time elapsed: 0.038 s
% 1.64/1.45 % (15206)Instructions burned: 109 (million)
% 1.64/1.45 % (15206)------------------------------
% 1.64/1.45 % (15206)------------------------------
% 1.64/1.45 % (15211)ott+1002_1:1_apa=on:au=on:bd=off:cnfonf=off:fd=off:sos=on:sp=weighted_frequency:i=507:si=on:rtra=on_0 on DTF2THF_15054 for (2998ds/507Mi)
% 1.64/1.46 % (15211)Refutation not found, incomplete strategy
% 1.64/1.46 % (15211)------------------------------
% 1.64/1.46 % (15211)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.46 % (15211)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.46
% 1.64/1.46
% 1.64/1.46 % (15211)Memory used [KB]: 5500
% 1.64/1.46 % (15211)Time elapsed: 0.003 s
% 1.64/1.46 % (15211)Instructions burned: 3 (million)
% 1.64/1.46 % (15211)------------------------------
% 1.64/1.46 % (15211)------------------------------
% 1.64/1.46 % (15197)First to succeed.
% 1.64/1.46 % (15209)Instruction limit reached!
% 1.64/1.46 % (15209)------------------------------
% 1.64/1.46 % (15209)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.46 % (15209)Termination reason: Unknown
% 1.64/1.46 % (15209)Termination phase: Saturation
% 1.64/1.46
% 1.64/1.46 % (15209)Memory used [KB]: 5628
% 1.64/1.46 % (15209)Time elapsed: 0.018 s
% 1.64/1.46 % (15209)Instructions burned: 48 (million)
% 1.64/1.46 % (15209)------------------------------
% 1.64/1.46 % (15209)------------------------------
% 1.64/1.46 % (15197)Refutation found. Thanks to Tanya!
% 1.64/1.46 % SZS status Theorem for DTF2THF_15054
% 1.64/1.46 % SZS output start Proof for DTF2THF_15054
% 1.64/1.46 thf(type_def_6, type, sK0: $tType).
% 1.64/1.46 thf(func_def_0, type, 'const/sets/UNION': !>[X0: $tType]:((X0 > $o) > (X0 > $o) > X0 > $o)).
% 1.64/1.46 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:(X0 > (X0 > $o) > $o)).
% 1.64/1.46 thf(func_def_10, type, sK1: sK0 > $o).
% 1.64/1.46 thf(func_def_11, type, sK2: sK0 > $o).
% 1.64/1.46 thf(func_def_12, type, sK3: sK0 > $o).
% 1.64/1.46 thf(func_def_14, type, sK5: !>[X0: $tType]:((X0 > $o) > (X0 > $o) > X0)).
% 1.64/1.46 thf(func_def_16, type, ph6: !>[X0: $tType]:(X0)).
% 1.64/1.46 thf(func_def_17, type, sK7: sK0).
% 1.64/1.46 thf(f1104,plain,(
% 1.64/1.46 $false),
% 1.64/1.46 inference(avatar_sat_refutation,[status(thm)],[f52,f61,f64,f185,f267,f300,f303,f790,f860,f1005,f1103])).
% 1.64/1.46 thf(f1103,plain,(
% 1.64/1.46 ~spl4_2 | ~spl4_4 | spl4_5),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f1102])).
% 1.64/1.46 thf(f1102,plain,(
% 1.64/1.46 $false | (~spl4_2 | ~spl4_4 | spl4_5)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1101])).
% 1.64/1.46 thf(f1101,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_2 | ~spl4_4 | spl4_5)),
% 1.64/1.46 inference(forward_demodulation,[status(thm)],[f1100,f1057])).
% 1.64/1.46 thf(f1057,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ~spl4_4),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1053])).
% 1.64/1.46 thf(f1053,plain,(
% 1.64/1.46 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ~spl4_4),
% 1.64/1.46 inference(superposition,[status(thm)],[f107,f60])).
% 1.64/1.46 thf(f60,plain,(
% 1.64/1.46 ($false = ('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7)) | ~spl4_4),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f58])).
% 1.64/1.46 thf(f58,definition,(
% 1.64/1.46 spl4_4 <=> ($false = ('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7))),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_4])],[avatar_definition])).
% 1.64/1.46 thf(f107,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/UNION' @ X0 @ X2 @ X3 @ X1) = $true) | ($false = ('const/sets/IN' @ X0 @ X1 @ X2))) )),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f98])).
% 1.64/1.46 thf(f98,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/UNION' @ X0 @ X2 @ X3 @ X1) = $true) | ($false = ('const/sets/IN' @ X0 @ X1 @ X2)) | ($false = $true)) )),
% 1.64/1.46 inference(superposition,[status(thm)],[f24,f20])).
% 1.64/1.46 thf(f20,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = $false) | ((X1 @ X2) = $true)) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.64/1.46 thf(f15,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = (X1 @ X2))) )),
% 1.64/1.46 inference(cnf_transformation,[status(thm)],[f1])).
% 1.64/1.46 thf(f1,axiom,(
% 1.64/1.46 ! [X0 : $tType,X1 : X0 > $o,X2 : X0] : (('const/sets/IN' @ X0 @ X2 @ X1) = (X1 @ X2))),
% 1.64/1.46 file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/IN_')).
% 1.64/1.46 thf(f24,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = $true) | ($false = ('const/sets/IN' @ X0 @ X3 @ X1))) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f21])).
% 1.64/1.46 thf(f21,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = $true) | ($false = (('const/sets/IN' @ X0 @ X3 @ X2) | ('const/sets/IN' @ X0 @ X3 @ X1)))) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.64/1.46 thf(f18,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = (('const/sets/IN' @ X0 @ X3 @ X2) | ('const/sets/IN' @ X0 @ X3 @ X1)))) )),
% 1.64/1.46 inference(cnf_transformation,[status(thm)],[f8])).
% 1.64/1.46 thf(f8,plain,(
% 1.64/1.46 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = (('const/sets/IN' @ X0 @ X3 @ X2) | ('const/sets/IN' @ X0 @ X3 @ X1)))),
% 1.64/1.46 inference(fool_elimination,[status(thm)],[f7])).
% 1.64/1.46 thf(f7,plain,(
% 1.64/1.46 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = ('const/sets/IN' @ X0 @ X3 @ X1) | ('const/sets/IN' @ X0 @ X3 @ X2))),
% 1.64/1.46 inference(rectify,[status(thm)],[f2])).
% 1.64/1.46 thf(f2,axiom,(
% 1.64/1.46 ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0] : (('const/sets/IN' @ X0 @ X4 @ ('const/sets/UNION' @ X0 @ X2 @ X3)) = ('const/sets/IN' @ X0 @ X4 @ X2) | ('const/sets/IN' @ X0 @ X4 @ X3))),
% 1.64/1.46 file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/IN_UNION_')).
% 1.64/1.46 thf(f1100,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1099])).
% 1.64/1.46 thf(f1099,plain,(
% 1.64/1.46 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(forward_demodulation,[status(thm)],[f1092,f944])).
% 1.64/1.46 thf(f944,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK3)) | spl4_5),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f934])).
% 1.64/1.46 thf(f934,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK3)) | ($true != $true) | spl4_5),
% 1.64/1.46 inference(superposition,[status(thm)],[f178,f25])).
% 1.64/1.46 thf(f25,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)) = $true) | ($false = ('const/sets/IN' @ X0 @ X3 @ X2))) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f21])).
% 1.64/1.46 thf(f178,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) != $true) | spl4_5),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f177])).
% 1.64/1.46 thf(f177,definition,(
% 1.64/1.46 spl4_5 <=> (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) = $true)),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition])).
% 1.64/1.46 thf(f1092,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1079])).
% 1.64/1.46 thf(f1079,plain,(
% 1.64/1.46 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(superposition,[status(thm)],[f23,f1036])).
% 1.64/1.46 thf(f1036,plain,(
% 1.64/1.46 ($true = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1035])).
% 1.64/1.46 thf(f1035,plain,(
% 1.64/1.46 ($true = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ($false = $true) | (~spl4_2 | spl4_5)),
% 1.64/1.46 inference(forward_demodulation,[status(thm)],[f1033,f977])).
% 1.64/1.46 thf(f977,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK2)) | spl4_5),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f975])).
% 1.64/1.46 thf(f975,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK2)) | ($false = $true) | spl4_5),
% 1.64/1.46 inference(superposition,[status(thm)],[f107,f942])).
% 1.64/1.46 thf(f942,plain,(
% 1.64/1.46 ($false = ('const/sets/UNION' @ sK0 @ sK2 @ sK3 @ sK7)) | spl4_5),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f933])).
% 1.64/1.46 thf(f933,plain,(
% 1.64/1.46 ($false = ('const/sets/UNION' @ sK0 @ sK2 @ sK3 @ sK7)) | ($true != $true) | spl4_5),
% 1.64/1.46 inference(superposition,[status(thm)],[f178,f19])).
% 1.64/1.46 thf(f19,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = $true) | ((X1 @ X2) = $false)) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.64/1.46 thf(f1033,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ($true = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ~spl4_2),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1020])).
% 1.64/1.46 thf(f1020,plain,(
% 1.64/1.46 ($true = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ~spl4_2),
% 1.64/1.46 inference(superposition,[status(thm)],[f51,f90])).
% 1.64/1.46 thf(f90,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : (($false = ('const/sets/UNION' @ X0 @ X2 @ X3 @ X1)) | (('const/sets/IN' @ X0 @ X1 @ X3) = $true) | (('const/sets/IN' @ X0 @ X1 @ X2) = $true)) )),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f87])).
% 1.64/1.46 thf(f87,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/IN' @ X0 @ X1 @ X2) = $true) | ($false = $true) | ($false = ('const/sets/UNION' @ X0 @ X2 @ X3 @ X1)) | (('const/sets/IN' @ X0 @ X1 @ X3) = $true)) )),
% 1.64/1.46 inference(superposition,[status(thm)],[f23,f19])).
% 1.64/1.46 thf(f51,plain,(
% 1.64/1.46 ($true = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7)) | ~spl4_2),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f49])).
% 1.64/1.46 thf(f49,definition,(
% 1.64/1.46 spl4_2 <=> ($true = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7))),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition])).
% 1.64/1.46 thf(f23,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : (($false = ('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2))) | (('const/sets/IN' @ X0 @ X3 @ X1) = $true) | (('const/sets/IN' @ X0 @ X3 @ X2) = $true)) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f22])).
% 1.64/1.46 thf(f22,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : (($true = (('const/sets/IN' @ X0 @ X3 @ X2) | ('const/sets/IN' @ X0 @ X3 @ X1))) | ($false = ('const/sets/IN' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X1 @ X2)))) )),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.64/1.46 thf(f1005,plain,(
% 1.64/1.46 ~spl4_3 | ~spl4_6),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f1004])).
% 1.64/1.46 thf(f1004,plain,(
% 1.64/1.46 $false | (~spl4_3 | ~spl4_6)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f1003])).
% 1.64/1.46 thf(f1003,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_3 | ~spl4_6)),
% 1.64/1.46 inference(backward_demodulation,[status(thm)],[f183,f996])).
% 1.64/1.46 thf(f996,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ~spl4_3),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f992])).
% 1.64/1.46 thf(f992,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ($false = $true) | ~spl4_3),
% 1.64/1.46 inference(superposition,[status(thm)],[f24,f913])).
% 1.64/1.46 thf(f913,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ~spl4_3),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f907])).
% 1.64/1.46 thf(f907,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ($false = $true) | ~spl4_3),
% 1.64/1.46 inference(superposition,[status(thm)],[f56,f139])).
% 1.64/1.46 thf(f139,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/UNION' @ X0 @ X2 @ X3 @ X1) = $true) | ($false = ('const/sets/IN' @ X0 @ X1 @ X3))) )),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f132])).
% 1.64/1.46 thf(f132,plain,(
% 1.64/1.46 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : (($false = $true) | ($false = ('const/sets/IN' @ X0 @ X1 @ X3)) | (('const/sets/UNION' @ X0 @ X2 @ X3 @ X1) = $true)) )),
% 1.64/1.46 inference(superposition,[status(thm)],[f20,f25])).
% 1.64/1.46 thf(f56,plain,(
% 1.64/1.46 ($false = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7)) | ~spl4_3),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f54])).
% 1.64/1.46 thf(f54,definition,(
% 1.64/1.46 spl4_3 <=> ($false = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7))),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_3])],[avatar_definition])).
% 1.64/1.46 thf(f183,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | ~spl4_6),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f181])).
% 1.64/1.46 thf(f181,definition,(
% 1.64/1.46 spl4_6 <=> (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true)),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_6])],[avatar_definition])).
% 1.64/1.46 thf(f860,plain,(
% 1.64/1.46 ~spl4_4 | ~spl4_5),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f859])).
% 1.64/1.46 thf(f859,plain,(
% 1.64/1.46 $false | (~spl4_4 | ~spl4_5)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f858])).
% 1.64/1.46 thf(f858,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_4 | ~spl4_5)),
% 1.64/1.46 inference(backward_demodulation,[status(thm)],[f179,f857])).
% 1.64/1.46 thf(f857,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3))) | ~spl4_4),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f852])).
% 1.64/1.46 thf(f852,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3))) | ($false = $true) | ~spl4_4),
% 1.64/1.46 inference(superposition,[status(thm)],[f139,f60])).
% 1.64/1.46 thf(f179,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) = $true) | ~spl4_5),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f177])).
% 1.64/1.46 thf(f790,plain,(
% 1.64/1.46 ~spl4_3 | ~spl4_8),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f789])).
% 1.64/1.46 thf(f789,plain,(
% 1.64/1.46 $false | (~spl4_3 | ~spl4_8)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f788])).
% 1.64/1.46 thf(f788,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_3 | ~spl4_8)),
% 1.64/1.46 inference(backward_demodulation,[status(thm)],[f265,f784])).
% 1.64/1.46 thf(f784,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK3)) | ~spl4_3),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f776])).
% 1.64/1.46 thf(f776,plain,(
% 1.64/1.46 ($false = $true) | ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK3)) | ~spl4_3),
% 1.64/1.46 inference(superposition,[status(thm)],[f25,f366])).
% 1.64/1.46 thf(f366,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ~spl4_3),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f359])).
% 1.64/1.46 thf(f359,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3))) | ($false = $true) | ~spl4_3),
% 1.64/1.46 inference(superposition,[status(thm)],[f56,f139])).
% 1.64/1.46 thf(f265,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true) | ~spl4_8),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f263])).
% 1.64/1.46 thf(f263,definition,(
% 1.64/1.46 spl4_8 <=> (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true)),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_8])],[avatar_definition])).
% 1.64/1.46 thf(f303,plain,(
% 1.64/1.46 ~spl4_1 | ~spl4_4),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f302])).
% 1.64/1.46 thf(f302,plain,(
% 1.64/1.46 $false | (~spl4_1 | ~spl4_4)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f301])).
% 1.64/1.46 thf(f301,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_1 | ~spl4_4)),
% 1.64/1.46 inference(backward_demodulation,[status(thm)],[f47,f60])).
% 1.64/1.46 thf(f47,plain,(
% 1.64/1.46 (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7) = $true) | ~spl4_1),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f45])).
% 1.64/1.46 thf(f45,definition,(
% 1.64/1.46 spl4_1 <=> (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7) = $true)),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition])).
% 1.64/1.46 thf(f300,plain,(
% 1.64/1.46 ~spl4_3 | ~spl4_7),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f299])).
% 1.64/1.46 thf(f299,plain,(
% 1.64/1.46 $false | (~spl4_3 | ~spl4_7)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f298])).
% 1.64/1.46 thf(f298,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_3 | ~spl4_7)),
% 1.64/1.46 inference(backward_demodulation,[status(thm)],[f261,f297])).
% 1.64/1.46 thf(f297,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK2)) | ~spl4_3),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f283])).
% 1.64/1.46 thf(f283,plain,(
% 1.64/1.46 ($false = ('const/sets/IN' @ sK0 @ sK7 @ sK2)) | ($false = $true) | ~spl4_3),
% 1.64/1.46 inference(superposition,[status(thm)],[f107,f56])).
% 1.64/1.46 thf(f261,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ~spl4_7),
% 1.64/1.46 inference(avatar_component_clause,[status(thm)],[f259])).
% 1.64/1.46 thf(f259,definition,(
% 1.64/1.46 spl4_7 <=> (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true)),
% 1.64/1.46 introduced(definition,[new_symbols(naming,[spl4_7])],[avatar_definition])).
% 1.64/1.46 thf(f267,plain,(
% 1.64/1.46 spl4_7 | spl4_8 | ~spl4_5),
% 1.64/1.46 inference(avatar_split_clause,[status(thm)],[f252,f177,f263,f259])).
% 1.64/1.46 thf(f252,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ~spl4_5),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f246])).
% 1.64/1.46 thf(f246,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK3) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ($false = $true) | ~spl4_5),
% 1.64/1.46 inference(superposition,[status(thm)],[f23,f179])).
% 1.64/1.46 thf(f185,plain,(
% 1.64/1.46 spl4_6 | spl4_5 | ~spl4_1),
% 1.64/1.46 inference(avatar_split_clause,[status(thm)],[f174,f45,f177,f181])).
% 1.64/1.46 thf(f174,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) = $true) | ~spl4_1),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f172])).
% 1.64/1.46 thf(f172,plain,(
% 1.64/1.46 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) = $true) | ($false = $true) | ~spl4_1),
% 1.64/1.46 inference(superposition,[status(thm)],[f90,f47])).
% 1.64/1.46 thf(f64,plain,(
% 1.64/1.46 ~spl4_2 | ~spl4_3),
% 1.64/1.46 inference(avatar_contradiction_clause,[status(thm)],[f63])).
% 1.64/1.46 thf(f63,plain,(
% 1.64/1.46 $false | (~spl4_2 | ~spl4_3)),
% 1.64/1.46 inference(trivial_inequality_removal,[status(thm)],[f62])).
% 1.64/1.46 thf(f62,plain,(
% 1.64/1.46 ($false = $true) | (~spl4_2 | ~spl4_3)),
% 1.64/1.46 inference(forward_demodulation,[status(thm)],[f51,f56])).
% 1.64/1.46 thf(f61,plain,(
% 1.64/1.46 spl4_3 | spl4_4),
% 1.64/1.46 inference(avatar_split_clause,[status(thm)],[f43,f58,f54])).
% 1.64/1.46 thf(f43,plain,(
% 1.64/1.46 ($false = ('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7)) | ($false = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7))),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f41])).
% 1.64/1.46 thf(f41,plain,(
% 1.64/1.46 (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7) != ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7))),
% 1.64/1.46 inference(negative_extensionality,[status(thm)],[f17])).
% 1.64/1.46 thf(f17,plain,(
% 1.64/1.46 (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) != ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3)))),
% 1.64/1.46 inference(cnf_transformation,[status(thm)],[f14])).
% 1.64/1.46 thf(f14,plain,(
% 1.64/1.46 (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) != ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3)))),
% 1.64/1.46 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f12,f13])).
% 1.64/1.46 thf(f13,plain,(
% 1.64/1.46 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0 > $o] : (('const/sets/UNION' @ X0 @ X1 @ ('const/sets/UNION' @ X0 @ X2 @ X3)) != ('const/sets/UNION' @ X0 @ X2 @ ('const/sets/UNION' @ X0 @ X1 @ X3))) => (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3)) != ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3)))),
% 1.64/1.46 introduced(definition,[],[choice_axiom])).
% 1.64/1.46 thf(f12,plain,(
% 1.64/1.46 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0 > $o] : (('const/sets/UNION' @ X0 @ X1 @ ('const/sets/UNION' @ X0 @ X2 @ X3)) != ('const/sets/UNION' @ X0 @ X2 @ ('const/sets/UNION' @ X0 @ X1 @ X3)))),
% 1.64/1.46 inference(ennf_transformation,[status(thm)],[f11])).
% 1.64/1.46 thf(f11,plain,(
% 1.64/1.46 ~! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0 > $o] : (('const/sets/UNION' @ X0 @ X1 @ ('const/sets/UNION' @ X0 @ X2 @ X3)) = ('const/sets/UNION' @ X0 @ X2 @ ('const/sets/UNION' @ X0 @ X1 @ X3)))),
% 1.64/1.46 inference(rectify,[status(thm)],[f5])).
% 1.64/1.46 thf(f5,negated_conjecture,(
% 1.64/1.46 ~! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0 > $o] : (('const/sets/UNION' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X2 @ X4)) = ('const/sets/UNION' @ X0 @ X2 @ ('const/sets/UNION' @ X0 @ X3 @ X4)))),
% 1.64/1.46 inference(negated_conjecture,[status(cth)],[f4])).
% 1.64/1.46 thf(f4,conjecture,(
% 1.64/1.46 ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0 > $o] : (('const/sets/UNION' @ X0 @ X3 @ ('const/sets/UNION' @ X0 @ X2 @ X4)) = ('const/sets/UNION' @ X0 @ X2 @ ('const/sets/UNION' @ X0 @ X3 @ X4)))),
% 1.64/1.46 file('/export/starexec/sandbox2/tmp/tmp.e8aoEzwz23/DTF2THF_15054.p','thm/sets/UNION_ACI_2')).
% 1.64/1.46 thf(f52,plain,(
% 1.64/1.46 spl4_1 | spl4_2),
% 1.64/1.46 inference(avatar_split_clause,[status(thm)],[f42,f49,f45])).
% 1.64/1.46 thf(f42,plain,(
% 1.64/1.46 (('const/sets/UNION' @ sK0 @ sK1 @ ('const/sets/UNION' @ sK0 @ sK2 @ sK3) @ sK7) = $true) | ($true = ('const/sets/UNION' @ sK0 @ sK2 @ ('const/sets/UNION' @ sK0 @ sK1 @ sK3) @ sK7))),
% 1.64/1.46 inference(binary_proxy_clausification,[status(thm)],[f41])).
% 1.64/1.46 % SZS output end Proof for DTF2THF_15054
% 1.64/1.46 % (15197)------------------------------
% 1.64/1.46 % (15197)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.46 % (15197)Termination reason: Refutation
% 1.64/1.46
% 1.64/1.46 % (15197)Memory used [KB]: 5884
% 1.64/1.46 % (15197)Time elapsed: 0.089 s
% 1.64/1.46 % (15197)Instructions burned: 285 (million)
% 1.64/1.46 % (15197)------------------------------
% 1.64/1.46 % (15197)------------------------------
% 1.64/1.46 % (15167)Success in time 0.167 s
%------------------------------------------------------------------------------