%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV460^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 : n001.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.69s 1.50s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 110 ( 14 unt; 0 typ; 7 def)
% Number of atoms : 695 ( 171 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 888 ( 96 ~; 139 |; 12 &; 633 @)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 63 ( 63 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 11 con; 0-4 aty)
% Number of variables : 168 ( 0 ^; 160 !; 8 ?; 168 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INTER':
!>[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_2,type,
'const/sets/DELETE':
!>[X0: $tType] : ( ( X0 > $o ) > X0 > X0 > $o ) ).
thf(func_def_12,type,
sK1: sK0 > $o ).
thf(func_def_13,type,
sK2: sK0 > $o ).
thf(func_def_14,type,
sK3: sK0 ).
thf(func_def_16,type,
sK5:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_17,type,
ph6:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
sK7: sK0 ).
thf(f892,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f64,f73,f403,f406,f419,f433,f458,f888,f891]) ).
thf(f891,plain,
( ~ spl4_1
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[status(thm)],[f890]) ).
thf(f890,plain,
( $false
| ~ spl4_1
| ~ spl4_8 ),
inference(trivial_inequality_removal,[status(thm)],[f889]) ).
thf(f889,plain,
( ( $false = $true )
| ~ spl4_1
| ~ spl4_8 ),
inference(backward_demodulation,[status(thm)],[f880,f456]) ).
thf(f456,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ~ spl4_8 ),
inference(avatar_component_clause,[status(thm)],[f454]) ).
thf(f454,definition,
( spl4_8
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl4_8])],[avatar_definition]) ).
thf(f880,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[status(thm)],[f861]) ).
thf(f861,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ( $false = $true )
| ~ spl4_1 ),
inference(superposition,[status(thm)],[f508,f49]) ).
thf(f49,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f47]) ).
thf(f47,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false ) ),
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/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ 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/INTER' @ X0 @ X2 @ X3 ) )
= ( 'const/sets/IN' @ X0 @ X4 @ X2 ) )
& ( 'const/sets/IN' @ X0 @ X4 @ X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_INTER_') ).
thf(f508,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) )
= $true )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[status(thm)],[f502]) ).
thf(f502,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) )
= $true )
| ( $false = $true )
| ~ spl4_1 ),
inference(superposition,[status(thm)],[f59,f304]) ).
thf(f304,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f288]) ).
thf(f288,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f42,f51]) ).
thf(f51,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f20,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.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_') ).
thf(f42,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f37]) ).
thf(f37,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( ( X2 != X3 )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f19,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( X2 != X3 )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) )
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( X2 != X3 )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) )
= ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) ) ),
inference(fool_elimination,[status(thm)],[f12]) ).
thf(f12,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( 'const/sets/IN' @ X0 @ X2 @ X1 ) )
& ( X2 != X3 ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X0: $tType,X2: X0 > $o,X3: X0,X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X4 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
& ( X3 != X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_DELETE_') ).
thf(f59,plain,
( ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[status(thm)],[f57]) ).
thf(f57,definition,
( spl4_1
<=> ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition]) ).
thf(f888,plain,
( ~ spl4_1
| spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[status(thm)],[f887]) ).
thf(f887,plain,
( $false
| ~ spl4_1
| spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[status(thm)],[f886]) ).
thf(f886,plain,
( ( $false = $true )
| ~ spl4_1
| spl4_5
| ~ spl4_7 ),
inference(forward_demodulation,[status(thm)],[f875,f475]) ).
thf(f475,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| spl4_5
| ~ spl4_7 ),
inference(subsumption_resolution,[status(thm)],[f470,f409]) ).
thf(f409,plain,
( ( sK7 != sK3 )
| spl4_5 ),
inference(avatar_component_clause,[status(thm)],[f408]) ).
thf(f408,definition,
( spl4_5
<=> ( sK7 = sK3 ) ),
introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition]) ).
thf(f470,plain,
( ( sK7 = sK3 )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_7 ),
inference(trivial_inequality_removal,[status(thm)],[f462]) ).
thf(f462,plain,
( ( sK7 = sK3 )
| ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_7 ),
inference(superposition,[status(thm)],[f452,f41]) ).
thf(f41,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( X2 = X3 ) ),
inference(equality_proxy_clausification,[status(thm)],[f40]) ).
thf(f40,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X2 = X3 )
= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f39]) ).
thf(f39,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X2 != X3 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f38]) ).
thf(f38,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( ( X2 != X3 )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f19]) ).
thf(f452,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $false )
| ~ spl4_7 ),
inference(avatar_component_clause,[status(thm)],[f450]) ).
thf(f450,definition,
( spl4_7
<=> ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl4_7])],[avatar_definition]) ).
thf(f875,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[status(thm)],[f868]) ).
thf(f868,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ( $false = $true )
| ~ spl4_1 ),
inference(superposition,[status(thm)],[f48,f508]) ).
thf(f48,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( $true
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f47]) ).
thf(f458,plain,
( spl4_8
| spl4_7
| ~ spl4_4 ),
inference(avatar_split_clause,[status(thm)],[f446,f70,f450,f454]) ).
thf(f70,definition,
( spl4_4
<=> ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 ) ) ),
introduced(definition,[new_symbols(naming,[spl4_4])],[avatar_definition]) ).
thf(f446,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $false )
| ~ spl4_4 ),
inference(trivial_inequality_removal,[status(thm)],[f444]) ).
thf(f444,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $false )
| ~ spl4_4 ),
inference(superposition,[status(thm)],[f98,f72]) ).
thf(f72,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[status(thm)],[f70]) ).
thf(f98,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $false ) ),
inference(trivial_inequality_removal,[status(thm)],[f95]) ).
thf(f95,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false = $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $false )
| ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false ) ),
inference(superposition,[status(thm)],[f50,f52]) ).
thf(f52,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f20]) ).
thf(f50,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $false )
| ( $false
= ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f46]) ).
thf(f46,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f18]) ).
thf(f433,plain,
( ~ spl4_5
| ~ spl4_1 ),
inference(avatar_split_clause,[status(thm)],[f429,f57,f408]) ).
thf(f429,plain,
( ( sK7 != sK3 )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[status(thm)],[f426]) ).
thf(f426,plain,
( ( sK7 != sK3 )
| ( $false = $true )
| ~ spl4_1 ),
inference(superposition,[status(thm)],[f105,f59]) ).
thf(f105,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( X1 != X3 ) ),
inference(trivial_inequality_removal,[status(thm)],[f99]) ).
thf(f99,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( X1 != X3 )
| ( $false = $true )
| ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $false ) ),
inference(superposition,[status(thm)],[f45,f51]) ).
thf(f45,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( X2 != X3 ) ),
inference(equality_proxy_clausification,[status(thm)],[f44]) ).
thf(f44,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( X2 = X3 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false ) ),
inference(not_proxy_clausification,[status(thm)],[f43]) ).
thf(f43,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( X2 != X3 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f37]) ).
thf(f419,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f418]) ).
thf(f418,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(trivial_inequality_removal,[status(thm)],[f417]) ).
thf(f417,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_4 ),
inference(backward_demodulation,[status(thm)],[f63,f72]) ).
thf(f63,plain,
( ( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 )
= $true )
| ~ spl4_2 ),
inference(avatar_component_clause,[status(thm)],[f61]) ).
thf(f61,definition,
( spl4_2
<=> ( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition]) ).
thf(f406,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f405]) ).
thf(f405,plain,
( $false
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f404]) ).
thf(f404,plain,
( ( $false = $true )
| ~ spl4_1
| ~ spl4_3 ),
inference(forward_demodulation,[status(thm)],[f59,f68]) ).
thf(f68,plain,
( ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $false )
| ~ spl4_3 ),
inference(avatar_component_clause,[status(thm)],[f66]) ).
thf(f66,definition,
( spl4_3
<=> ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl4_3])],[avatar_definition]) ).
thf(f403,plain,
( ~ spl4_2
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f402]) ).
thf(f402,plain,
( $false
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f401]) ).
thf(f401,plain,
( ( $false = $true )
| ~ spl4_2
| ~ spl4_3 ),
inference(backward_demodulation,[status(thm)],[f177,f400]) ).
thf(f400,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f399]) ).
thf(f399,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ~ spl4_2
| ~ spl4_3 ),
inference(forward_demodulation,[status(thm)],[f393,f300]) ).
thf(f300,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[status(thm)],[f295]) ).
thf(f295,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $true )
| ~ spl4_2 ),
inference(superposition,[status(thm)],[f150,f42]) ).
thf(f150,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $true )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[status(thm)],[f146]) ).
thf(f146,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) )
= $true )
| ( $false = $true )
| ~ spl4_2 ),
inference(superposition,[status(thm)],[f63,f114]) ).
thf(f114,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f106]) ).
thf(f106,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false = $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $false ) ),
inference(superposition,[status(thm)],[f48,f51]) ).
thf(f393,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f390]) ).
thf(f390,plain,
( ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK1 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $false )
| ~ spl4_2
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f50,f284]) ).
thf(f284,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) )
= $false )
| ~ spl4_2
| ~ spl4_3 ),
inference(subsumption_resolution,[status(thm)],[f283,f201]) ).
thf(f201,plain,
( ( sK7 != sK3 )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[status(thm)],[f196]) ).
thf(f196,plain,
( ( sK7 != sK3 )
| ( $false = $true )
| ~ spl4_2 ),
inference(superposition,[status(thm)],[f150,f45]) ).
thf(f283,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) )
= $false )
| ( sK7 = sK3 )
| ~ spl4_3 ),
inference(trivial_inequality_removal,[status(thm)],[f277]) ).
thf(f277,plain,
( ( sK7 = sK3 )
| ( $false = $true )
| ( ( 'const/sets/IN' @ sK0 @ sK7 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) )
= $false )
| ~ spl4_3 ),
inference(superposition,[status(thm)],[f68,f269]) ).
thf(f269,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( X1 = X3 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[status(thm)],[f264]) ).
thf(f264,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 )
= $true )
| ( $false = $true )
| ( X1 = X3 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= $false ) ),
inference(superposition,[status(thm)],[f52,f41]) ).
thf(f177,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ~ spl4_2 ),
inference(trivial_inequality_removal,[status(thm)],[f171]) ).
thf(f171,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK7 @ sK2 )
= $true )
| ( $false = $true )
| ~ spl4_2 ),
inference(superposition,[status(thm)],[f130,f63]) ).
thf(f130,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f120]) ).
thf(f120,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 )
= $false )
| ( $false = $true ) ),
inference(superposition,[status(thm)],[f49,f51]) ).
thf(f73,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[status(thm)],[f55,f70,f66]) ).
thf(f55,plain,
( ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $false )
| ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f53]) ).
thf(f53,plain,
( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
!= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 ) ),
inference(negative_extensionality,[status(thm)],[f22]) ).
thf(f22,plain,
( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
thf(f17,plain,
( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f16]) ).
thf(f16,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 )
!= ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 ) )
=> ( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f15,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 )
!= ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 ) ),
inference(ennf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 )
= ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 ) ),
inference(rectify,[status(thm)],[f6]) ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X4 ) @ X3 )
= ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) @ X4 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f5,conjecture,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X4: X0] :
( ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X2 @ X4 ) @ X3 )
= ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/DELETE_INTER_') ).
thf(f64,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[status(thm)],[f54,f61,f57]) ).
thf(f54,plain,
( ( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK7 )
= $true )
| ( ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK7 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV460^1 : TPTP v9.2.1. Released v7.0.0.
% 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n001.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 12:48:05 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.29/0.47 ---- Original DTF file ---
% 0.29/0.47 thf(spec,logic,$$dhol).
% 0.29/0.47 %------------------------------------------------------------------------------
% 0.29/0.47 % File : SEV460^1 : TPTP v9.2.1. Released v7.0.0.
% 0.29/0.47 % Domain : Analysis
% 0.29/0.47 % Problem : DELETE_INTER
% 0.29/0.47 % Version : Especial.
% 0.29/0.47 % English :
% 0.29/0.47
% 0.29/0.47 % Refs : [Kal16] Kalisyk (2016), Email to Geoff Sutcliffe
% 0.29/0.47 % Source : [Kal16]
% 0.29/0.47 % Names : DELETE_INTER_.p [Kal16]
% 0.29/0.47
% 0.29/0.47 % Status : Theorem
% 0.29/0.47 % Rating : 0.33 v8.1.0, 0.25 v7.5.0, 0.00 v7.2.0, 0.25 v7.1.0
% 0.29/0.47 % Syntax : Number of formulae : 8 ( 5 unt; 3 typ; 0 def)
% 0.29/0.47 % Number of atoms : 22 ( 8 equ; 0 cnn)
% 0.29/0.47 % Maximal formula atoms : 1 ( 4 avg)
% 0.29/0.47 % Number of connectives : 46 ( 1 ~; 0 |; 2 &; 43 @)
% 0.29/0.47 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.29/0.47 % Maximal formula depth : 5 ( 5 avg)
% 0.29/0.47 % Number of types : 1 ( 0 usr)
% 0.29/0.47 % Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% 0.29/0.47 % Number of symbols : 4 ( 3 usr; 0 con; 2-4 aty)
% 0.29/0.47 % Number of variables : 22 ( 0 ^; 19 !; 0 ?; 22 :)
% 0.29/0.47 % ( 3 !>; 0 ?*; 0 @-; 0 @+)
% 0.29/0.47 % SPC : TH1_THM_EQU_NAR
% 0.29/0.47
% 0.29/0.47 % Comments : Exported from core HOL Light.
% 0.29/0.47 %------------------------------------------------------------------------------
% 0.29/0.47 thf('thf_const_const/sets/INTER',type,
% 0.29/0.47 'const/sets/INTER':
% 0.29/0.47 !>[A: $tType] : ( ( A > $o ) > ( A > $o ) > A > $o ) ).
% 0.29/0.47
% 0.29/0.47 thf('thf_const_const/sets/IN',type,
% 0.29/0.47 'const/sets/IN':
% 0.29/0.47 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 0.29/0.47
% 0.29/0.47 thf('thf_const_const/sets/DELETE',type,
% 0.29/0.47 'const/sets/DELETE':
% 0.29/0.47 !>[A: $tType] : ( ( A > $o ) > A > A > $o ) ).
% 0.29/0.47
% 0.29/0.47 thf('thm/sets/IN_',axiom,
% 0.29/0.47 ! [A: $tType,P: A > $o,A0: A] :
% 0.29/0.47 ( ( 'const/sets/IN' @ A @ A0 @ P )
% 0.29/0.47 = ( P @ A0 ) ) ).
% 0.29/0.47
% 0.29/0.47 thf('thm/sets/IN_INTER_',axiom,
% 0.29/0.47 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 0.29/0.47 ( ( 'const/sets/IN' @ A @ A2 @ ( 'const/sets/INTER' @ A @ A0 @ A1 ) )
% 0.29/0.47 = ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 0.29/0.47 & ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ).
% 0.29/0.47
% 0.29/0.47 thf('thm/sets/IN_DELETE_',axiom,
% 0.29/0.47 ! [A: $tType,A0: A > $o,A1: A,A2: A] :
% 0.29/0.47 ( ( 'const/sets/IN' @ A @ A1 @ ( 'const/sets/DELETE' @ A @ A0 @ A2 ) )
% 0.29/0.47 = ( ( 'const/sets/IN' @ A @ A1 @ A0 )
% 0.29/0.47 & ( A1 != A2 ) ) ) ).
% 0.29/0.47
% 0.29/0.47 thf('thm/sets/EXTENSION_',axiom,
% 0.29/0.47 ! [A: $tType,A0: A > $o,A1: A > $o] :
% 0.29/0.47 ( ( A0 = A1 )
% 0.29/0.47 = ( ! [A2: A] :
% 0.29/0.47 ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 0.29/0.47 = ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ) ).
% 0.29/0.47
% 0.29/0.47 thf('thm/sets/DELETE_INTER_',conjecture,
% 0.29/0.47 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 0.29/0.47 ( ( 'const/sets/INTER' @ A @ ( 'const/sets/DELETE' @ A @ A0 @ A2 ) @ A1 )
% 0.29/0.47 = ( 'const/sets/DELETE' @ A @ ( 'const/sets/INTER' @ A @ A0 @ A1 ) @ A2 ) ) ).
% 0.29/0.47
% 0.29/0.47 %------------------------------------------------------------------------------
% 0.29/0.47 ------------------------
% 1.50/1.28 ---- Embedded in THF ---
% 1.50/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.28 %%% Generated on Tue Feb 24 12:48:06 EST 2026
% 1.50/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.28 %%% Logic specification used:
% 1.50/1.28 %%% thf(spec, logic, $$dhol).
% 1.50/1.28
% 1.50/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2DTF29856.p
% See solution above
% 1.50/1.28 ------------------------
% 1.50/1.29 ---- Cleaned THF ---
% 1.50/1.29 thf('thf_const_const/sets/INTER',type,
% 1.50/1.29 'const/sets/INTER':
% 1.50/1.29 !>[A: $tType] : ( ( A > $o ) > ( A > $o ) > A > $o ) ).
% 1.50/1.29
% 1.50/1.29 thf('thf_const_const/sets/IN',type,
% 1.50/1.29 'const/sets/IN':
% 1.50/1.29 !>[A: $tType] : ( A > ( A > $o ) > $o ) ).
% 1.50/1.29
% 1.50/1.29 thf('thf_const_const/sets/DELETE',type,
% 1.50/1.29 'const/sets/DELETE':
% 1.50/1.29 !>[A: $tType] : ( ( A > $o ) > A > A > $o ) ).
% 1.50/1.29
% 1.50/1.29 thf('thm/sets/IN_',axiom,
% 1.50/1.29 ! [A: $tType,P: A > $o,A0: A] :
% 1.50/1.29 ( ( 'const/sets/IN' @ A @ A0 @ P )
% 1.50/1.29 = ( P @ A0 ) ) ).
% 1.50/1.29
% 1.50/1.29 thf('thm/sets/IN_INTER_',axiom,
% 1.50/1.29 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 1.50/1.29 ( ( 'const/sets/IN' @ A @ A2 @ ( 'const/sets/INTER' @ A @ A0 @ A1 ) )
% 1.50/1.29 = ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 1.50/1.29 & ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ).
% 1.50/1.29
% 1.50/1.29 thf('thm/sets/IN_DELETE_',axiom,
% 1.50/1.29 ! [A: $tType,A0: A > $o,A1: A,A2: A] :
% 1.50/1.29 ( ( 'const/sets/IN' @ A @ A1 @ ( 'const/sets/DELETE' @ A @ A0 @ A2 ) )
% 1.50/1.29 = ( ( 'const/sets/IN' @ A @ A1 @ A0 )
% 1.50/1.29 & ( A1 != A2 ) ) ) ).
% 1.50/1.29
% 1.50/1.29 thf('thm/sets/EXTENSION_',axiom,
% 1.50/1.29 ! [A: $tType,A0: A > $o,A1: A > $o] :
% 1.50/1.29 ( ( A0 = A1 )
% 1.50/1.29 = ( ! [A2: A] :
% 1.50/1.29 ( ( 'const/sets/IN' @ A @ A2 @ A0 )
% 1.50/1.29 = ( 'const/sets/IN' @ A @ A2 @ A1 ) ) ) ) ).
% 1.50/1.29
% 1.50/1.29 thf('thm/sets/DELETE_INTER_',conjecture,
% 1.50/1.29 ! [A: $tType,A0: A > $o,A1: A > $o,A2: A] :
% 1.50/1.29 ( ( 'const/sets/INTER' @ A @ ( 'const/sets/DELETE' @ A @ A0 @ A2 ) @ A1 )
% 1.50/1.29 = ( 'const/sets/DELETE' @ A @ ( 'const/sets/INTER' @ A @ A0 @ A1 ) @ A2 ) ) ).
% 1.50/1.29 ------------------------
% 1.69/1.31 % (30130)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_29856 for (2999ds/2Mi)
% 1.69/1.31 % Exception at run slice level
% 1.69/1.31 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.69/1.31 % (30128)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_29856 for (2999ds/27Mi)
% 1.69/1.31 % (30126)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/183Mi)
% 1.69/1.31 % (30127)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_29856 for (2999ds/4Mi)
% 1.69/1.31 % (30129)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/2Mi)
% 1.69/1.31 % (30131)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_29856 for (2999ds/275Mi)
% 1.69/1.31 % (30132)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/18Mi)
% 1.69/1.32 % (30129)Instruction limit reached!
% 1.69/1.32 % (30129)------------------------------
% 1.69/1.32 % (30129)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.32 % (30129)Termination reason: Unknown
% 1.69/1.32 % (30129)Termination phase: Saturation
% 1.69/1.32
% 1.69/1.32 % (30129)Memory used [KB]: 5500
% 1.69/1.32 % (30129)Time elapsed: 0.004 s
% 1.69/1.32 % (30129)Instructions burned: 3 (million)
% 1.69/1.32 % (30129)------------------------------
% 1.69/1.32 % (30129)------------------------------
% 1.69/1.32 % (30133)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/3Mi)
% 1.69/1.32 % (30127)Instruction limit reached!
% 1.69/1.32 % (30127)------------------------------
% 1.69/1.32 % (30127)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.32 % (30127)Termination reason: Unknown
% 1.69/1.32 % (30127)Termination phase: Saturation
% 1.69/1.32
% 1.69/1.32 % (30127)Memory used [KB]: 5500
% 1.69/1.32 % (30127)Time elapsed: 0.005 s
% 1.69/1.32 % (30127)Instructions burned: 4 (million)
% 1.69/1.32 % (30127)------------------------------
% 1.69/1.32 % (30127)------------------------------
% 1.69/1.32 % (30128)Instruction limit reached!
% 1.69/1.32 % (30128)------------------------------
% 1.69/1.32 % (30128)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.32 % (30128)Termination reason: Unknown
% 1.69/1.32 % (30128)Termination phase: Saturation
% 1.69/1.32
% 1.69/1.32 % (30128)Memory used [KB]: 5628
% 1.69/1.32 % (30128)Time elapsed: 0.012 s
% 1.69/1.32 % (30128)Instructions burned: 29 (million)
% 1.69/1.32 % (30128)------------------------------
% 1.69/1.32 % (30128)------------------------------
% 1.69/1.32 % (30131)Refutation not found, incomplete strategy
% 1.69/1.32 % (30131)------------------------------
% 1.69/1.32 % (30131)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.32 % (30131)Termination reason: Refutation not found, incomplete strategy
% 1.69/1.32
% 1.69/1.32
% 1.69/1.32 % (30131)Memory used [KB]: 5500
% 1.69/1.32 % (30131)Time elapsed: 0.006 s
% 1.69/1.32 % (30131)Instructions burned: 4 (million)
% 1.69/1.32 % (30131)------------------------------
% 1.69/1.32 % (30131)------------------------------
% 1.69/1.32 % (30133)Instruction limit reached!
% 1.69/1.32 % (30133)------------------------------
% 1.69/1.32 % (30133)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.32 % (30133)Termination reason: Unknown
% 1.69/1.32 % (30133)Termination phase: Saturation
% 1.69/1.32
% 1.69/1.32 % (30133)Memory used [KB]: 5500
% 1.69/1.32 % (30133)Time elapsed: 0.003 s
% 1.69/1.32 % (30133)Instructions burned: 5 (million)
% 1.69/1.32 % (30133)------------------------------
% 1.69/1.32 % (30133)------------------------------
% 1.69/1.33 % (30132)Instruction limit reached!
% 1.69/1.33 % (30132)------------------------------
% 1.69/1.33 % (30132)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.33 % (30132)Termination reason: Unknown
% 1.69/1.33 % (30132)Termination phase: Saturation
% 1.69/1.33
% 1.69/1.33 % (30132)Memory used [KB]: 5628
% 1.69/1.33 % (30132)Time elapsed: 0.014 s
% 1.69/1.33 % (30132)Instructions burned: 18 (million)
% 1.69/1.33 % (30132)------------------------------
% 1.69/1.33 % (30132)------------------------------
% 1.69/1.33 % (30137)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_29856 for (2999ds/1041Mi)
% 1.69/1.33 % Exception at run slice level
% 1.69/1.33 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.69/1.33 % (30135)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_29856 for (2999ds/15Mi)
% 1.69/1.33 % (30135)Refutation not found, incomplete strategy
% 1.69/1.33 % (30135)------------------------------
% 1.69/1.33 % (30135)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.33 % (30135)Termination reason: Refutation not found, incomplete strategy
% 1.69/1.33
% 1.69/1.33
% 1.69/1.33 % (30135)Memory used [KB]: 5500
% 1.69/1.33 % (30135)Time elapsed: 0.003 s
% 1.69/1.33 % (30135)Instructions burned: 4 (million)
% 1.69/1.33 % (30135)------------------------------
% 1.69/1.33 % (30135)------------------------------
% 1.69/1.33 % (30134)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_29856 for (2999ds/37Mi)
% 1.69/1.33 % Exception at run slice level
% 1.69/1.33 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.69/1.34 % (30136)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_29856 for (2999ds/3Mi)
% 1.69/1.34 % (30138)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/7Mi)
% 1.69/1.34 % (30136)Instruction limit reached!
% 1.69/1.34 % (30136)------------------------------
% 1.69/1.34 % (30136)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.34 % (30136)Termination reason: Unknown
% 1.69/1.34 % (30136)Termination phase: Saturation
% 1.69/1.34
% 1.69/1.34 % (30136)Memory used [KB]: 5500
% 1.69/1.34 % (30136)Time elapsed: 0.004 s
% 1.69/1.34 % (30136)Instructions burned: 3 (million)
% 1.69/1.34 % (30136)------------------------------
% 1.69/1.34 % (30136)------------------------------
% 1.69/1.34 % (30140)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_29856 for (2999ds/3Mi)
% 1.69/1.34 % (30140)Instruction limit reached!
% 1.69/1.34 % (30140)------------------------------
% 1.69/1.34 % (30140)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.34 % (30140)Termination reason: Unknown
% 1.69/1.34 % (30140)Termination phase: Twee Goal Transformation
% 1.69/1.34
% 1.69/1.34 % (30140)Memory used [KB]: 895
% 1.69/1.34 % (30140)Time elapsed: 0.002 s
% 1.69/1.34 % (30140)Instructions burned: 3 (million)
% 1.69/1.34 % (30140)------------------------------
% 1.69/1.34 % (30140)------------------------------
% 1.69/1.34 % (30138)Instruction limit reached!
% 1.69/1.34 % (30138)------------------------------
% 1.69/1.34 % (30138)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.34 % (30138)Termination reason: Unknown
% 1.69/1.34 % (30138)Termination phase: Saturation
% 1.69/1.34
% 1.69/1.34 % (30138)Memory used [KB]: 1023
% 1.69/1.34 % (30138)Time elapsed: 0.007 s
% 1.69/1.34 % (30138)Instructions burned: 8 (million)
% 1.69/1.34 % (30138)------------------------------
% 1.69/1.34 % (30138)------------------------------
% 1.69/1.34 % (30141)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_29856 for (2999ds/3Mi)
% 1.69/1.34 % (30139)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/16Mi)
% 1.69/1.34 % (30141)Instruction limit reached!
% 1.69/1.34 % (30141)------------------------------
% 1.69/1.34 % (30141)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.34 % (30141)Termination reason: Unknown
% 1.69/1.34 % (30141)Termination phase: Saturation
% 1.69/1.34
% 1.69/1.34 % (30141)Memory used [KB]: 1023
% 1.69/1.34 % (30141)Time elapsed: 0.003 s
% 1.69/1.34 % (30141)Instructions burned: 3 (million)
% 1.69/1.34 % (30141)------------------------------
% 1.69/1.34 % (30141)------------------------------
% 1.69/1.35 % (30144)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/4Mi)
% 1.69/1.35 % (30144)Instruction limit reached!
% 1.69/1.35 % (30144)------------------------------
% 1.69/1.35 % (30144)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.35 % (30144)Termination reason: Unknown
% 1.69/1.35 % (30144)Termination phase: Saturation
% 1.69/1.35
% 1.69/1.35 % (30144)Memory used [KB]: 5500
% 1.69/1.35 % (30144)Time elapsed: 0.003 s
% 1.69/1.35 % (30144)Instructions burned: 6 (million)
% 1.69/1.35 % (30144)------------------------------
% 1.69/1.35 % (30144)------------------------------
% 1.69/1.35 % (30139)Instruction limit reached!
% 1.69/1.35 % (30139)------------------------------
% 1.69/1.35 % (30139)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.35 % (30139)Termination reason: Unknown
% 1.69/1.35 % (30139)Termination phase: Saturation
% 1.69/1.35
% 1.69/1.35 % (30139)Memory used [KB]: 5628
% 1.69/1.35 % (30139)Time elapsed: 0.009 s
% 1.69/1.35 % (30139)Instructions burned: 16 (million)
% 1.69/1.35 % (30139)------------------------------
% 1.69/1.35 % (30139)------------------------------
% 1.69/1.35 % (30142)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/7Mi)
% 1.69/1.35 % (30146)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/710Mi)
% 1.69/1.35 % (30143)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/3Mi)
% 1.69/1.36 % Exception at run slice level
% 1.69/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.69/1.36 % (30142)Instruction limit reached!
% 1.69/1.36 % (30142)------------------------------
% 1.69/1.36 % (30142)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.36 % (30142)Termination reason: Unknown
% 1.69/1.36 % (30142)Termination phase: Saturation
% 1.69/1.36
% 1.69/1.36 % (30142)Memory used [KB]: 5500
% 1.69/1.36 % (30142)Time elapsed: 0.007 s
% 1.69/1.36 % (30142)Instructions burned: 8 (million)
% 1.69/1.36 % (30142)------------------------------
% 1.69/1.36 % (30142)------------------------------
% 1.69/1.36 % (30145)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/18Mi)
% 1.69/1.36 % (30147)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/6Mi)
% 1.69/1.36 % (30147)Instruction limit reached!
% 1.69/1.36 % (30147)------------------------------
% 1.69/1.36 % (30147)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.36 % (30147)Termination reason: Unknown
% 1.69/1.36 % (30147)Termination phase: Saturation
% 1.69/1.36
% 1.69/1.36 % (30147)Memory used [KB]: 5500
% 1.69/1.36 % (30147)Time elapsed: 0.003 s
% 1.69/1.36 % (30147)Instructions burned: 6 (million)
% 1.69/1.36 % (30147)------------------------------
% 1.69/1.36 % (30147)------------------------------
% 1.69/1.36 % (30148)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_29856 for (2999ds/902Mi)
% 1.69/1.36 % (30148)Refutation not found, incomplete strategy
% 1.69/1.36 % (30148)------------------------------
% 1.69/1.36 % (30148)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.36 % (30148)Termination reason: Refutation not found, incomplete strategy
% 1.69/1.36
% 1.69/1.36
% 1.69/1.36 % (30148)Memory used [KB]: 5500
% 1.69/1.36 % (30148)Time elapsed: 0.002 s
% 1.69/1.36 % (30148)Instructions burned: 3 (million)
% 1.69/1.36 % (30148)------------------------------
% 1.69/1.36 % (30148)------------------------------
% 1.69/1.37 % (30151)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_29856 for (2999ds/6Mi)
% 1.69/1.37 % (30145)Instruction limit reached!
% 1.69/1.37 % (30145)------------------------------
% 1.69/1.37 % (30145)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.37 % (30145)Termination reason: Unknown
% 1.69/1.37 % (30145)Termination phase: Saturation
% 1.69/1.37
% 1.69/1.37 % (30145)Memory used [KB]: 5628
% 1.69/1.37 % (30145)Time elapsed: 0.014 s
% 1.69/1.37 % (30145)Instructions burned: 19 (million)
% 1.69/1.37 % (30145)------------------------------
% 1.69/1.37 % (30145)------------------------------
% 1.69/1.37 % Exception at run slice level
% 1.69/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.69/1.37 % (30152)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/377Mi)
% 1.69/1.37 % (30149)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_29856 for (2999ds/21Mi)
% 1.69/1.37 % (30150)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/5Mi)
% 1.69/1.37 % Exception at run slice level
% 1.69/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.69/1.38 % (30154)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_29856 for (2999ds/19Mi)
% 1.69/1.38 % Exception at run slice level
% 1.69/1.38 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.69/1.39 % (30149)Instruction limit reached!
% 1.69/1.39 % (30149)------------------------------
% 1.69/1.39 % (30149)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.39 % (30149)Termination reason: Unknown
% 1.69/1.39 % (30149)Termination phase: Saturation
% 1.69/1.39
% 1.69/1.39 % (30149)Memory used [KB]: 5628
% 1.69/1.39 % (30149)Time elapsed: 0.016 s
% 1.69/1.39 % (30149)Instructions burned: 21 (million)
% 1.69/1.39 % (30149)------------------------------
% 1.69/1.39 % (30149)------------------------------
% 1.69/1.39 % (30153)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_29856 for (2999ds/779Mi)
% 1.69/1.39 % Exception at run slice level
% 1.69/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.69/1.39 % (30156)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/17Mi)
% 1.69/1.39 % (30155)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/879Mi)
% 1.69/1.40 % (30156)Instruction limit reached!
% 1.69/1.40 % (30156)------------------------------
% 1.69/1.40 % (30156)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.40 % (30156)Termination reason: Unknown
% 1.69/1.40 % (30156)Termination phase: Saturation
% 1.69/1.40
% 1.69/1.40 % (30156)Memory used [KB]: 5628
% 1.69/1.40 % (30156)Time elapsed: 0.007 s
% 1.69/1.40 % (30156)Instructions burned: 17 (million)
% 1.69/1.40 % (30156)------------------------------
% 1.69/1.40 % (30156)------------------------------
% 1.69/1.40 % (30157)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_29856 for (2999ds/3Mi)
% 1.69/1.40 % (30160)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/127Mi)
% 1.69/1.41 % (30158)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/30Mi)
% 1.69/1.41 % (30157)Instruction limit reached!
% 1.69/1.41 % (30157)------------------------------
% 1.69/1.41 % (30157)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.41 % (30157)Termination reason: Unknown
% 1.69/1.41 % (30157)Termination phase: Saturation
% 1.69/1.41
% 1.69/1.41 % (30157)Memory used [KB]: 1023
% 1.69/1.41 % (30157)Time elapsed: 0.004 s
% 1.69/1.41 % (30157)Instructions burned: 3 (million)
% 1.69/1.41 % (30157)------------------------------
% 1.69/1.41 % (30157)------------------------------
% 1.69/1.42 % (30126)Instruction limit reached!
% 1.69/1.42 % (30126)------------------------------
% 1.69/1.42 % (30126)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.42 % (30126)Termination reason: Unknown
% 1.69/1.42 % (30126)Termination phase: Saturation
% 1.69/1.42
% 1.69/1.42 % (30126)Memory used [KB]: 6652
% 1.69/1.42 % (30126)Time elapsed: 0.107 s
% 1.69/1.42 % (30126)Instructions burned: 184 (million)
% 1.69/1.42 % (30126)------------------------------
% 1.69/1.42 % (30126)------------------------------
% 1.69/1.42 % (30158)Instruction limit reached!
% 1.69/1.42 % (30158)------------------------------
% 1.69/1.42 % (30158)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.42 % (30158)Termination reason: Unknown
% 1.69/1.42 % (30158)Termination phase: Saturation
% 1.69/1.42
% 1.69/1.42 % (30158)Memory used [KB]: 5628
% 1.69/1.42 % (30158)Time elapsed: 0.016 s
% 1.69/1.42 % (30158)Instructions burned: 32 (million)
% 1.69/1.42 % (30158)------------------------------
% 1.69/1.42 % (30158)------------------------------
% 1.69/1.42 % (30161)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/100Mi)
% 1.69/1.43 % (30163)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_29856 for (2998ds/20Mi)
% 1.69/1.43 % (30162)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_29856 for (2998ds/3Mi)
% 1.69/1.43 % Exception at run slice level
% 1.69/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.69/1.44 % (30163)Instruction limit reached!
% 1.69/1.44 % (30163)------------------------------
% 1.69/1.44 % (30163)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.44 % (30163)Termination reason: Unknown
% 1.69/1.44 % (30163)Termination phase: Saturation
% 1.69/1.44
% 1.69/1.44 % (30163)Memory used [KB]: 5628
% 1.69/1.44 % (30163)Time elapsed: 0.009 s
% 1.69/1.44 % (30163)Instructions burned: 20 (million)
% 1.69/1.44 % (30163)------------------------------
% 1.69/1.44 % (30163)------------------------------
% 1.69/1.44 % (30164)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_29856 for (2998ds/86Mi)
% 1.69/1.45 % (30160)Instruction limit reached!
% 1.69/1.45 % (30160)------------------------------
% 1.69/1.45 % (30160)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.45 % (30160)Termination reason: Unknown
% 1.69/1.45 % (30160)Termination phase: Saturation
% 1.69/1.45
% 1.69/1.45 % (30160)Memory used [KB]: 6012
% 1.69/1.45 % (30160)Time elapsed: 0.042 s
% 1.69/1.45 % (30160)Instructions burned: 130 (million)
% 1.69/1.45 % (30160)------------------------------
% 1.69/1.45 % (30160)------------------------------
% 1.69/1.45 % (30165)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_29856 for (2998ds/107Mi)
% 1.69/1.46 % (30166)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_29856 for (2998ds/39Mi)
% 1.69/1.46 % Exception at run slice level
% 1.69/1.46 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.69/1.47 % (30167)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_29856 for (2998ds/448Mi)
% 1.69/1.47 % Exception at run slice level
% 1.69/1.47 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.69/1.47 % (30161)Instruction limit reached!
% 1.69/1.47 % (30161)------------------------------
% 1.69/1.47 % (30161)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.47 % (30161)Termination reason: Unknown
% 1.69/1.47 % (30161)Termination phase: Saturation
% 1.69/1.47
% 1.69/1.47 % (30161)Memory used [KB]: 5756
% 1.69/1.47 % (30161)Time elapsed: 0.048 s
% 1.69/1.47 % (30161)Instructions burned: 102 (million)
% 1.69/1.47 % (30161)------------------------------
% 1.69/1.47 % (30161)------------------------------
% 1.69/1.47 % (30164)Instruction limit reached!
% 1.69/1.47 % (30164)------------------------------
% 1.69/1.47 % (30164)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.47 % (30164)Termination reason: Unknown
% 1.69/1.47 % (30164)Termination phase: Saturation
% 1.69/1.47
% 1.69/1.47 % (30164)Memory used [KB]: 6012
% 1.69/1.47 % (30164)Time elapsed: 0.032 s
% 1.69/1.47 % (30164)Instructions burned: 88 (million)
% 1.69/1.47 % (30164)------------------------------
% 1.69/1.47 % (30164)------------------------------
% 1.69/1.47 % (30168)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_29856 for (2998ds/46Mi)
% 1.69/1.48 % (30169)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_29856 for (2998ds/98Mi)
% 1.69/1.48 % Exception at run slice level
% 1.69/1.48 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.69/1.48 % (30170)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_29856 for (2998ds/507Mi)
% 1.69/1.48 % (30165)Instruction limit reached!
% 1.69/1.48 % (30165)------------------------------
% 1.69/1.48 % (30165)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.48 % (30165)Termination reason: Unknown
% 1.69/1.48 % (30165)Termination phase: Saturation
% 1.69/1.48
% 1.69/1.48 % (30165)Memory used [KB]: 5756
% 1.69/1.48 % (30165)Time elapsed: 0.038 s
% 1.69/1.48 % (30165)Instructions burned: 107 (million)
% 1.69/1.48 % (30165)------------------------------
% 1.69/1.48 % (30165)------------------------------
% 1.69/1.49 % (30170)Refutation not found, incomplete strategy
% 1.69/1.49 % (30170)------------------------------
% 1.69/1.49 % (30170)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.49 % (30170)Termination reason: Refutation not found, incomplete strategy
% 1.69/1.49
% 1.69/1.49
% 1.69/1.49 % (30170)Memory used [KB]: 5500
% 1.69/1.49 % (30170)Time elapsed: 0.003 s
% 1.69/1.49 % (30170)Instructions burned: 4 (million)
% 1.69/1.49 % (30170)------------------------------
% 1.69/1.49 % (30170)------------------------------
% 1.69/1.49 % (30171)dis+1010_2:3_amm=off:fd=preordered:ixr=off:nm=0:pe=on:piset=equals:prag=on:sac=on:tgt=ground:i=149:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/149Mi)
% 1.69/1.49 % (30168)Instruction limit reached!
% 1.69/1.49 % (30168)------------------------------
% 1.69/1.49 % (30168)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.49 % (30168)Termination reason: Unknown
% 1.69/1.49 % (30168)Termination phase: Saturation
% 1.69/1.49
% 1.69/1.49 % (30168)Memory used [KB]: 5628
% 1.69/1.49 % (30168)Time elapsed: 0.017 s
% 1.69/1.49 % (30168)Instructions burned: 49 (million)
% 1.69/1.49 % (30168)------------------------------
% 1.69/1.49 % (30168)------------------------------
% 1.69/1.49 % (30172)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/39Mi)
% 1.69/1.50 % (30173)lrs+1004_1:1_cnfonf=lazy_pi_sigma_gen:fe=off:gs=on:hud=10:prag=on:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_29856 for (2998ds/6Mi)
% 1.69/1.50 % (30155)First to succeed.
% 1.69/1.50 % Exception at run slice level
% 1.69/1.50 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.69/1.50 % (30155)Refutation found. Thanks to Tanya!
% 1.69/1.50 % SZS status Theorem for DTF2THF_29856
% 1.69/1.50 % SZS output start Proof for DTF2THF_29856
% 1.69/1.50 thf(type_def_6, type, sK0: $tType).
% 1.69/1.50 thf(func_def_0, type, 'const/sets/INTER': !>[X0: $tType]:((X0 > $o) > (X0 > $o) > X0 > $o)).
% 1.69/1.50 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:(X0 > (X0 > $o) > $o)).
% 1.69/1.50 thf(func_def_2, type, 'const/sets/DELETE': !>[X0: $tType]:((X0 > $o) > X0 > X0 > $o)).
% 1.69/1.50 thf(func_def_12, type, sK1: sK0 > $o).
% 1.69/1.50 thf(func_def_13, type, sK2: sK0 > $o).
% 1.69/1.50 thf(func_def_14, type, sK3: sK0).
% 1.69/1.50 thf(func_def_16, type, sK5: !>[X0: $tType]:((X0 > $o) > (X0 > $o) > X0)).
% 1.69/1.50 thf(func_def_17, type, ph6: !>[X0: $tType]:(X0)).
% 1.69/1.50 thf(func_def_18, type, sK7: sK0).
% 1.69/1.50 thf(f892,plain,(
% 1.69/1.50 $false),
% 1.69/1.50 inference(avatar_sat_refutation,[status(thm)],[f64,f73,f403,f406,f419,f433,f458,f888,f891])).
% 1.69/1.50 thf(f891,plain,(
% 1.69/1.50 ~spl4_1 | ~spl4_8),
% 1.69/1.50 inference(avatar_contradiction_clause,[status(thm)],[f890])).
% 1.69/1.50 thf(f890,plain,(
% 1.69/1.50 $false | (~spl4_1 | ~spl4_8)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f889])).
% 1.69/1.50 thf(f889,plain,(
% 1.69/1.50 ($false = $true) | (~spl4_1 | ~spl4_8)),
% 1.69/1.50 inference(backward_demodulation,[status(thm)],[f880,f456])).
% 1.69/1.50 thf(f456,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | ~spl4_8),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f454])).
% 1.69/1.50 thf(f454,definition,(
% 1.69/1.50 spl4_8 <=> (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_8])],[avatar_definition])).
% 1.69/1.50 thf(f880,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ~spl4_1),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f861])).
% 1.69/1.50 thf(f861,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ($false = $true) | ~spl4_1),
% 1.69/1.50 inference(superposition,[status(thm)],[f508,f49])).
% 1.69/1.50 thf(f49,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = $false) | (('const/sets/IN' @ X0 @ X3 @ X2) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f47])).
% 1.69/1.50 thf(f47,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : (((('const/sets/IN' @ X0 @ X3 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X1)) = $true) | (('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = $false)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.69/1.50 thf(f18,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = (('const/sets/IN' @ X0 @ X3 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X1)))) )),
% 1.69/1.50 inference(cnf_transformation,[status(thm)],[f11])).
% 1.69/1.50 thf(f11,plain,(
% 1.69/1.50 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = (('const/sets/IN' @ X0 @ X3 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X1)))),
% 1.69/1.50 inference(fool_elimination,[status(thm)],[f10])).
% 1.69/1.50 thf(f10,plain,(
% 1.69/1.50 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = ('const/sets/IN' @ X0 @ X3 @ X1) & ('const/sets/IN' @ X0 @ X3 @ X2))),
% 1.69/1.50 inference(rectify,[status(thm)],[f2])).
% 1.69/1.50 thf(f2,axiom,(
% 1.69/1.50 ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0] : (('const/sets/IN' @ X0 @ X4 @ ('const/sets/INTER' @ X0 @ X2 @ X3)) = ('const/sets/IN' @ X0 @ X4 @ X2) & ('const/sets/IN' @ X0 @ X4 @ X3))),
% 1.69/1.50 file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_INTER_')).
% 1.69/1.50 thf(f508,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2)) = $true) | ~spl4_1),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f502])).
% 1.69/1.50 thf(f502,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2)) = $true) | ($false = $true) | ~spl4_1),
% 1.69/1.50 inference(superposition,[status(thm)],[f59,f304])).
% 1.69/1.50 thf(f304,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $false) | (('const/sets/IN' @ X0 @ X1 @ X2) = $true)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f288])).
% 1.69/1.50 thf(f288,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $false) | (('const/sets/IN' @ X0 @ X1 @ X2) = $true) | ($false = $true)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f42,f51])).
% 1.69/1.50 thf(f51,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = $true) | ((X1 @ X2) = $false)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.69/1.50 thf(f20,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = (X1 @ X2))) )),
% 1.69/1.50 inference(cnf_transformation,[status(thm)],[f1])).
% 1.69/1.50 thf(f1,axiom,(
% 1.69/1.50 ! [X0 : $tType,X1 : X0 > $o,X2 : X0] : (('const/sets/IN' @ X0 @ X2 @ X1) = (X1 @ X2))),
% 1.69/1.50 file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_')).
% 1.69/1.50 thf(f42,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $false) | (('const/sets/IN' @ X0 @ X2 @ X1) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f37])).
% 1.69/1.50 thf(f37,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((((~ (X2 = X3)) & ('const/sets/IN' @ X0 @ X2 @ X1)) = $true) | (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $false)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.69/1.50 thf(f19,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((((~ (X2 = X3)) & ('const/sets/IN' @ X0 @ X2 @ X1)) = ('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)))) )),
% 1.69/1.50 inference(cnf_transformation,[status(thm)],[f13])).
% 1.69/1.50 thf(f13,plain,(
% 1.69/1.50 ! [X0 : $tType,X1 : X0 > $o,X2 : X0,X3 : X0] : (((~ (X2 = X3)) & ('const/sets/IN' @ X0 @ X2 @ X1)) = ('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)))),
% 1.69/1.50 inference(fool_elimination,[status(thm)],[f12])).
% 1.69/1.50 thf(f12,plain,(
% 1.69/1.50 ! [X0 : $tType,X1 : X0 > $o,X2 : X0,X3 : X0] : (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = ('const/sets/IN' @ X0 @ X2 @ X1) & (X2 != X3))),
% 1.69/1.50 inference(rectify,[status(thm)],[f3])).
% 1.69/1.50 thf(f3,axiom,(
% 1.69/1.50 ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X4 : X0] : (('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X4)) = ('const/sets/IN' @ X0 @ X3 @ X2) & (X3 != X4))),
% 1.69/1.50 file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/IN_DELETE_')).
% 1.69/1.50 thf(f59,plain,(
% 1.69/1.50 (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $true) | ~spl4_1),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f57])).
% 1.69/1.50 thf(f57,definition,(
% 1.69/1.50 spl4_1 <=> (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $true)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_1])],[avatar_definition])).
% 1.69/1.50 thf(f888,plain,(
% 1.69/1.50 ~spl4_1 | spl4_5 | ~spl4_7),
% 1.69/1.50 inference(avatar_contradiction_clause,[status(thm)],[f887])).
% 1.69/1.50 thf(f887,plain,(
% 1.69/1.50 $false | (~spl4_1 | spl4_5 | ~spl4_7)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f886])).
% 1.69/1.50 thf(f886,plain,(
% 1.69/1.50 ($false = $true) | (~spl4_1 | spl4_5 | ~spl4_7)),
% 1.69/1.50 inference(forward_demodulation,[status(thm)],[f875,f475])).
% 1.69/1.50 thf(f475,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | (spl4_5 | ~spl4_7)),
% 1.69/1.50 inference(subsumption_resolution,[status(thm)],[f470,f409])).
% 1.69/1.50 thf(f409,plain,(
% 1.69/1.50 (sK7 != sK3) | spl4_5),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f408])).
% 1.69/1.50 thf(f408,definition,(
% 1.69/1.50 spl4_5 <=> (sK7 = sK3)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_5])],[avatar_definition])).
% 1.69/1.50 thf(f470,plain,(
% 1.69/1.50 (sK7 = sK3) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ~spl4_7),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f462])).
% 1.69/1.50 thf(f462,plain,(
% 1.69/1.50 (sK7 = sK3) | ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | ~spl4_7),
% 1.69/1.50 inference(superposition,[status(thm)],[f452,f41])).
% 1.69/1.50 thf(f41,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $true) | (('const/sets/IN' @ X0 @ X2 @ X1) = $false) | (X2 = X3)) )),
% 1.69/1.50 inference(equality_proxy_clausification,[status(thm)],[f40])).
% 1.69/1.50 thf(f40,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $true) | (('const/sets/IN' @ X0 @ X2 @ X1) = $false) | ((X2 = X3) = $true)) )),
% 1.69/1.50 inference(not_proxy_clausification,[status(thm)],[f39])).
% 1.69/1.50 thf(f39,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = $false) | ((~ (X2 = X3)) = $false) | (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f38])).
% 1.69/1.50 thf(f38,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((((~ (X2 = X3)) & ('const/sets/IN' @ X0 @ X2 @ X1)) = $false) | (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.69/1.50 thf(f452,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $false) | ~spl4_7),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f450])).
% 1.69/1.50 thf(f450,definition,(
% 1.69/1.50 spl4_7 <=> (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $false)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_7])],[avatar_definition])).
% 1.69/1.50 thf(f875,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | ~spl4_1),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f868])).
% 1.69/1.50 thf(f868,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | ($false = $true) | ~spl4_1),
% 1.69/1.50 inference(superposition,[status(thm)],[f48,f508])).
% 1.69/1.50 thf(f48,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = $false) | ($true = ('const/sets/IN' @ X0 @ X3 @ X1))) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f47])).
% 1.69/1.50 thf(f458,plain,(
% 1.69/1.50 spl4_8 | spl4_7 | ~spl4_4),
% 1.69/1.50 inference(avatar_split_clause,[status(thm)],[f446,f70,f450,f454])).
% 1.69/1.50 thf(f70,definition,(
% 1.69/1.50 spl4_4 <=> ($false = ('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7))),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_4])],[avatar_definition])).
% 1.69/1.50 thf(f446,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $false) | ~spl4_4),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f444])).
% 1.69/1.50 thf(f444,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $false) | ~spl4_4),
% 1.69/1.50 inference(superposition,[status(thm)],[f98,f72])).
% 1.69/1.50 thf(f72,plain,(
% 1.69/1.50 ($false = ('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7)) | ~spl4_4),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f70])).
% 1.69/1.50 thf(f98,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $true) | (('const/sets/IN' @ X0 @ X1 @ X2) = $false) | (('const/sets/IN' @ X0 @ X1 @ X3) = $false)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f95])).
% 1.69/1.50 thf(f95,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : (($false = $true) | (('const/sets/IN' @ X0 @ X1 @ X3) = $false) | (('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $true) | (('const/sets/IN' @ X0 @ X1 @ X2) = $false)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f50,f52])).
% 1.69/1.50 thf(f52,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ X1) = $false) | ((X1 @ X2) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f20])).
% 1.69/1.50 thf(f50,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = $true) | (('const/sets/IN' @ X0 @ X3 @ X2) = $false) | ($false = ('const/sets/IN' @ X0 @ X3 @ X1))) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f46])).
% 1.69/1.50 thf(f46,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0 > $o] : (((('const/sets/IN' @ X0 @ X3 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X1)) = $false) | (('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2)) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f18])).
% 1.69/1.50 thf(f433,plain,(
% 1.69/1.50 ~spl4_5 | ~spl4_1),
% 1.69/1.50 inference(avatar_split_clause,[status(thm)],[f429,f57,f408])).
% 1.69/1.50 thf(f429,plain,(
% 1.69/1.50 (sK7 != sK3) | ~spl4_1),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f426])).
% 1.69/1.50 thf(f426,plain,(
% 1.69/1.50 (sK7 != sK3) | ($false = $true) | ~spl4_1),
% 1.69/1.50 inference(superposition,[status(thm)],[f105,f59])).
% 1.69/1.50 thf(f105,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $false) | (X1 != X3)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f99])).
% 1.69/1.50 thf(f99,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((X1 != X3) | ($false = $true) | (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $false)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f45,f51])).
% 1.69/1.50 thf(f45,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $false) | (X2 != X3)) )),
% 1.69/1.50 inference(equality_proxy_clausification,[status(thm)],[f44])).
% 1.69/1.50 thf(f44,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : (((X2 = X3) = $false) | (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $false)) )),
% 1.69/1.50 inference(not_proxy_clausification,[status(thm)],[f43])).
% 1.69/1.50 thf(f43,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0 > $o] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3)) = $false) | ((~ (X2 = X3)) = $true)) )),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f37])).
% 1.69/1.50 thf(f419,plain,(
% 1.69/1.50 ~spl4_2 | ~spl4_4),
% 1.69/1.50 inference(avatar_contradiction_clause,[status(thm)],[f418])).
% 1.69/1.50 thf(f418,plain,(
% 1.69/1.50 $false | (~spl4_2 | ~spl4_4)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f417])).
% 1.69/1.50 thf(f417,plain,(
% 1.69/1.50 ($false = $true) | (~spl4_2 | ~spl4_4)),
% 1.69/1.50 inference(backward_demodulation,[status(thm)],[f63,f72])).
% 1.69/1.50 thf(f63,plain,(
% 1.69/1.50 (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7) = $true) | ~spl4_2),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f61])).
% 1.69/1.50 thf(f61,definition,(
% 1.69/1.50 spl4_2 <=> (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7) = $true)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_2])],[avatar_definition])).
% 1.69/1.50 thf(f406,plain,(
% 1.69/1.50 ~spl4_1 | ~spl4_3),
% 1.69/1.50 inference(avatar_contradiction_clause,[status(thm)],[f405])).
% 1.69/1.50 thf(f405,plain,(
% 1.69/1.50 $false | (~spl4_1 | ~spl4_3)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f404])).
% 1.69/1.50 thf(f404,plain,(
% 1.69/1.50 ($false = $true) | (~spl4_1 | ~spl4_3)),
% 1.69/1.50 inference(forward_demodulation,[status(thm)],[f59,f68])).
% 1.69/1.50 thf(f68,plain,(
% 1.69/1.50 (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $false) | ~spl4_3),
% 1.69/1.50 inference(avatar_component_clause,[status(thm)],[f66])).
% 1.69/1.50 thf(f66,definition,(
% 1.69/1.50 spl4_3 <=> (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $false)),
% 1.69/1.50 introduced(definition,[new_symbols(naming,[spl4_3])],[avatar_definition])).
% 1.69/1.50 thf(f403,plain,(
% 1.69/1.50 ~spl4_2 | ~spl4_3),
% 1.69/1.50 inference(avatar_contradiction_clause,[status(thm)],[f402])).
% 1.69/1.50 thf(f402,plain,(
% 1.69/1.50 $false | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f401])).
% 1.69/1.50 thf(f401,plain,(
% 1.69/1.50 ($false = $true) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(backward_demodulation,[status(thm)],[f177,f400])).
% 1.69/1.50 thf(f400,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f399])).
% 1.69/1.50 thf(f399,plain,(
% 1.69/1.50 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(forward_demodulation,[status(thm)],[f393,f300])).
% 1.69/1.50 thf(f300,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | ~spl4_2),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f295])).
% 1.69/1.50 thf(f295,plain,(
% 1.69/1.50 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $true) | ~spl4_2),
% 1.69/1.50 inference(superposition,[status(thm)],[f150,f42])).
% 1.69/1.50 thf(f150,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $true) | ~spl4_2),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f146])).
% 1.69/1.50 thf(f146,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3)) = $true) | ($false = $true) | ~spl4_2),
% 1.69/1.50 inference(superposition,[status(thm)],[f63,f114])).
% 1.69/1.50 thf(f114,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $false) | (('const/sets/IN' @ X0 @ X1 @ X2) = $true)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f106])).
% 1.69/1.50 thf(f106,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : (($false = $true) | (('const/sets/IN' @ X0 @ X1 @ X2) = $true) | (('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $false)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f48,f51])).
% 1.69/1.50 thf(f393,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f390])).
% 1.69/1.50 thf(f390,plain,(
% 1.69/1.50 ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ sK1) = $false) | (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $false) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(superposition,[status(thm)],[f50,f284])).
% 1.69/1.50 thf(f284,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2)) = $false) | (~spl4_2 | ~spl4_3)),
% 1.69/1.50 inference(subsumption_resolution,[status(thm)],[f283,f201])).
% 1.69/1.50 thf(f201,plain,(
% 1.69/1.50 (sK7 != sK3) | ~spl4_2),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f196])).
% 1.69/1.50 thf(f196,plain,(
% 1.69/1.50 (sK7 != sK3) | ($false = $true) | ~spl4_2),
% 1.69/1.50 inference(superposition,[status(thm)],[f150,f45])).
% 1.69/1.50 thf(f283,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2)) = $false) | (sK7 = sK3) | ~spl4_3),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f277])).
% 1.69/1.50 thf(f277,plain,(
% 1.69/1.50 (sK7 = sK3) | ($false = $true) | (('const/sets/IN' @ sK0 @ sK7 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2)) = $false) | ~spl4_3),
% 1.69/1.50 inference(superposition,[status(thm)],[f68,f269])).
% 1.69/1.50 thf(f269,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $true) | (X1 = X3) | (('const/sets/IN' @ X0 @ X1 @ X2) = $false)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f264])).
% 1.69/1.50 thf(f264,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0,X1 : X0] : ((('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1) = $true) | ($false = $true) | (X1 = X3) | (('const/sets/IN' @ X0 @ X1 @ X2) = $false)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f52,f41])).
% 1.69/1.50 thf(f177,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ~spl4_2),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f171])).
% 1.69/1.50 thf(f171,plain,(
% 1.69/1.50 (('const/sets/IN' @ sK0 @ sK7 @ sK2) = $true) | ($false = $true) | ~spl4_2),
% 1.69/1.50 inference(superposition,[status(thm)],[f130,f63])).
% 1.69/1.50 thf(f130,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $false) | (('const/sets/IN' @ X0 @ X1 @ X3) = $true)) )),
% 1.69/1.50 inference(trivial_inequality_removal,[status(thm)],[f120])).
% 1.69/1.50 thf(f120,plain,(
% 1.69/1.50 ( ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X1 : X0] : ((('const/sets/IN' @ X0 @ X1 @ X3) = $true) | (('const/sets/INTER' @ X0 @ X2 @ X3 @ X1) = $false) | ($false = $true)) )),
% 1.69/1.50 inference(superposition,[status(thm)],[f49,f51])).
% 1.69/1.50 thf(f73,plain,(
% 1.69/1.50 spl4_3 | spl4_4),
% 1.69/1.50 inference(avatar_split_clause,[status(thm)],[f55,f70,f66])).
% 1.69/1.50 thf(f55,plain,(
% 1.69/1.50 (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $false) | ($false = ('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7))),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f53])).
% 1.69/1.50 thf(f53,plain,(
% 1.69/1.50 (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) != ('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7))),
% 1.69/1.50 inference(negative_extensionality,[status(thm)],[f22])).
% 1.69/1.50 thf(f22,plain,(
% 1.69/1.50 (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2) != ('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3))),
% 1.69/1.50 inference(cnf_transformation,[status(thm)],[f17])).
% 1.69/1.50 thf(f17,plain,(
% 1.69/1.50 (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2) != ('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3))),
% 1.69/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f16])).
% 1.69/1.50 thf(f16,plain,(
% 1.69/1.50 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X1 @ X2) @ X3) != ('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X3) @ X2)) => (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2) != ('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3))),
% 1.69/1.50 introduced(definition,[],[choice_axiom])).
% 1.69/1.50 thf(f15,plain,(
% 1.69/1.50 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X1 @ X2) @ X3) != ('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X3) @ X2))),
% 1.69/1.50 inference(ennf_transformation,[status(thm)],[f14])).
% 1.69/1.50 thf(f14,plain,(
% 1.69/1.50 ~! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o,X3 : X0] : (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X1 @ X2) @ X3) = ('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X3) @ X2))),
% 1.69/1.50 inference(rectify,[status(thm)],[f6])).
% 1.69/1.50 thf(f6,negated_conjecture,(
% 1.69/1.50 ~! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0] : (('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X4) @ X3) = ('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X2 @ X3) @ X4))),
% 1.69/1.50 inference(negated_conjecture,[status(cth)],[f5])).
% 1.69/1.50 thf(f5,conjecture,(
% 1.69/1.50 ! [X0 : $tType,X2 : X0 > $o,X3 : X0 > $o,X4 : X0] : (('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X4) @ X3) = ('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X2 @ X3) @ X4))),
% 1.69/1.50 file('/export/starexec/sandbox2/tmp/tmp.T27wA8uyiY/DTF2THF_29856.p','thm/sets/DELETE_INTER_')).
% 1.69/1.50 thf(f64,plain,(
% 1.69/1.50 spl4_1 | spl4_2),
% 1.69/1.50 inference(avatar_split_clause,[status(thm)],[f54,f61,f57])).
% 1.69/1.50 thf(f54,plain,(
% 1.69/1.50 (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK1 @ sK3) @ sK2 @ sK7) = $true) | (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK1 @ sK2) @ sK3 @ sK7) = $true)),
% 1.69/1.50 inference(binary_proxy_clausification,[status(thm)],[f53])).
% 1.69/1.50 % SZS output end Proof for DTF2THF_29856
% 1.69/1.50 % (30155)------------------------------
% 1.69/1.50 % (30155)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.69/1.50 % (30155)Termination reason: Refutation
% 1.69/1.50
% 1.69/1.50 % (30155)Memory used [KB]: 5884
% 1.69/1.50 % (30155)Time elapsed: 0.129 s
% 1.69/1.50 % (30155)Instructions burned: 258 (million)
% 1.69/1.50 % (30155)------------------------------
% 1.69/1.50 % (30155)------------------------------
% 1.69/1.50 % (30125)Success in time 0.201 s
%------------------------------------------------------------------------------