%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET607^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n015.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:31:53 AM UTC 2026
% Result : Theorem 1.47s 1.29s
% Output : Refutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 12 unt; 0 typ; 4 def)
% Number of atoms : 214 ( 56 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 251 ( 47 ~; 65 |; 19 &; 115 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 20 ^; 8 !; 4 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_9,type,
sK0: a > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_12,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK4: a ).
thf(f67,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f28,f47,f54,f62,f66]) ).
thf(f66,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[status(thm)],[f65]) ).
thf(f65,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(trivial_inequality_removal,[status(thm)],[f64]) ).
thf(f64,plain,
( ( $true = $false )
| ~ spl2_1
| ~ spl2_4 ),
inference(backward_demodulation,[status(thm)],[f23,f45]) ).
thf(f45,plain,
( ( ( sK0 @ sK4 )
= $false )
| ~ spl2_4 ),
inference(avatar_component_clause,[status(thm)],[f43]) ).
thf(f43,definition,
( spl2_4
<=> ( ( sK0 @ sK4 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl2_4])],[avatar_definition]) ).
thf(f23,plain,
( ( ( sK0 @ sK4 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[status(thm)],[f21]) ).
thf(f21,definition,
( spl2_1
<=> ( ( sK0 @ sK4 )
= $true ) ),
introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition]) ).
thf(f62,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[status(thm)],[f61]) ).
thf(f61,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[status(thm)],[f58]) ).
thf(f58,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_3 ),
inference(superposition,[status(thm)],[f27,f33]) ).
thf(f33,plain,
( ( ( sK1 @ sK4 )
= $false )
| ~ spl2_3 ),
inference(avatar_component_clause,[status(thm)],[f31]) ).
thf(f31,definition,
( spl2_3
<=> ( ( sK1 @ sK4 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition]) ).
thf(f27,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[status(thm)],[f25]) ).
thf(f25,definition,
( spl2_2
<=> ( $true
= ( sK1 @ sK4 ) ) ),
introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition]) ).
thf(f54,plain,
( spl2_2
| spl2_4 ),
inference(avatar_split_clause,[status(thm)],[f53,f43,f25]) ).
thf(f53,plain,
( ( ( sK0 @ sK4 )
= $false )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(not_proxy_clausification,[status(thm)],[f52]) ).
thf(f52,plain,
( ( ( sK0 @ sK4 )
= $false )
| ( ( ~ ( sK1 @ sK4 ) )
= $false ) ),
inference(duplicate_literal_removal,[status(thm)],[f51]) ).
thf(f51,plain,
( ( ( sK0 @ sK4 )
= $false )
| ( ( ~ ( sK1 @ sK4 ) )
= $false )
| ( ( sK0 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f48]) ).
thf(f48,plain,
( ( ( sK0 @ sK4 )
= $false )
| ( ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f35]) ).
thf(f35,plain,
( ( $false
= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) )
| ( ( sK0 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $false )
| ( $false
= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
!= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK4 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) )
@ sK4 ) ),
inference(negative_extensionality,[status(thm)],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( ( sK0 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( ( X0 @ Y0 )
& ~ ( X1 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( X1 @ X2 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.C4UQJvnxcm/DTF2THF_16945.p',cBOOL_PROP_79_pme) ).
thf(f47,plain,
spl2_3,
inference(avatar_split_clause,[status(thm)],[f39,f31]) ).
thf(f39,plain,
( ( sK1 @ sK4 )
= $false ),
inference(duplicate_literal_removal,[status(thm)],[f38]) ).
thf(f38,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f36]) ).
thf(f36,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f13]) ).
thf(f28,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[status(thm)],[f19,f25,f21]) ).
thf(f19,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
= $true ) ),
inference(duplicate_literal_removal,[status(thm)],[f18]) ).
thf(f18,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( sK0 @ sK4 )
= $true )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f16]) ).
thf(f16,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) )
= $true )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(duplicate_literal_removal,[status(thm)],[f15]) ).
thf(f15,plain,
( ( ( sK0 @ sK4 )
= $true )
| ( $true
= ( sK1 @ sK4 ) )
| ( ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) )
= $true )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f14]) ).
thf(f14,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ( ( sK0 @ sK4 )
= $true )
| ( $true
= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f12]) ).
thf(f12,plain,
( ( ( ( sK1 @ sK4 )
| ( sK0 @ sK4 ) )
= $true )
| ( $true
= ( ( sK1 @ sK4 )
| ( ( sK0 @ sK4 )
& ~ ( sK1 @ sK4 ) ) ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET607^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.34 % Computer : n015.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Tue Feb 24 12:00:01 EST 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.31/0.46 ---- Original DTF file ---
% 0.31/0.46 thf(spec,logic,$$dhol).
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 % File : SET607^5 : TPTP v9.2.1. Released v4.0.0.
% 0.31/0.46 % Domain : Set Theory
% 0.31/0.46 % Problem : TPS problem BOOL-PROP-79
% 0.31/0.46 % Version : Especial.
% 0.31/0.46 % English : Trybulec's 79th Boolean property of sets
% 0.31/0.46
% 0.31/0.46 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.31/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.31/0.46 % Source : [Bro09]
% 0.31/0.46 % Names : tps_0206 [Bro09]
% 0.31/0.46 % : BOOL-PROP-79 [TPS]
% 0.31/0.46
% 0.31/0.46 % Status : Theorem
% 0.31/0.46 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.31/0.46 % Syntax : Number of formulae : 2 ( 1 unt; 1 typ; 0 def)
% 0.31/0.46 % Number of atoms : 1 ( 1 equ; 0 cnn)
% 0.31/0.46 % Maximal formula atoms : 1 ( 1 avg)
% 0.31/0.46 % Number of connectives : 9 ( 1 ~; 2 |; 1 &; 5 @)
% 0.31/0.46 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.31/0.46 % Maximal formula depth : 3 ( 3 avg)
% 0.31/0.46 % Number of types : 2 ( 1 usr)
% 0.31/0.46 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.31/0.46 % Number of symbols : 1 ( 0 usr; 0 con; 2-2 aty)
% 0.31/0.46 % Number of variables : 4 ( 2 ^; 2 !; 0 ?; 4 :)
% 0.31/0.46 % SPC : TH0_THM_EQU_NAR
% 0.31/0.46
% 0.31/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.31/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.31/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.31/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.31/0.46 % : Polymorphic definitions expanded.
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 thf(a_type,type,
% 0.31/0.46 a: $tType ).
% 0.31/0.46
% 0.31/0.46 thf(cBOOL_PROP_79_pme,conjecture,
% 0.31/0.46 ! [X: a > $o,Y: a > $o] :
% 0.31/0.46 ( ( ^ [Xz: a] :
% 0.31/0.46 ( ( X @ Xz )
% 0.31/0.46 | ( ( Y @ Xz )
% 0.31/0.46 & ~ ( X @ Xz ) ) ) )
% 0.31/0.46 = ( ^ [Xz: a] :
% 0.31/0.46 ( ( X @ Xz )
% 0.31/0.46 | ( Y @ Xz ) ) ) ) ).
% 0.31/0.46
% 0.31/0.46 %------------------------------------------------------------------------------
% 0.31/0.46 ------------------------
% 1.47/1.25 ---- Embedded in THF ---
% 1.47/1.25 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.47/1.25 %%% Generated on Tue Feb 24 12:00:02 EST 2026
% 1.47/1.25 %%% using '$$dhol' embedding, version 1.3.0.
% 1.47/1.25 %%% Logic specification used:
% 1.47/1.25 %%% thf(spec, logic, $$dhol).
% 1.47/1.25
% 1.47/1.25 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.C4UQJvnxcm/DTF2DTF16945.p
% See solution above
% 1.47/1.25 ------------------------
% 1.47/1.26 ---- Cleaned THF ---
% 1.47/1.26 thf(a_type,type,
% 1.47/1.26 a: $tType ).
% 1.47/1.26
% 1.47/1.26 thf(cBOOL_PROP_79_pme,conjecture,
% 1.47/1.26 ! [X: a > $o,Y: a > $o] :
% 1.47/1.26 ( ( ^ [Xz: a] :
% 1.47/1.26 ( ( X @ Xz )
% 1.47/1.26 | ( ( Y @ Xz )
% 1.47/1.26 & ~ ( X @ Xz ) ) ) )
% 1.47/1.26 = ( ^ [Xz: a] :
% 1.47/1.26 ( ( X @ Xz )
% 1.47/1.26 | ( Y @ Xz ) ) ) ) ).
% 1.47/1.26 ------------------------
% 1.47/1.27 % (17106)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_16945 for (2999ds/2Mi)
% 1.47/1.28 % (17106)Instruction limit reached!
% 1.47/1.28 % (17106)------------------------------
% 1.47/1.28 % (17106)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.28 % (17106)Termination reason: Unknown
% 1.47/1.28 % (17106)Termination phase: Saturation
% 1.47/1.28
% 1.47/1.28 % (17106)Memory used [KB]: 5500
% 1.47/1.28 % (17106)Time elapsed: 0.002 s
% 1.47/1.28 % (17106)Instructions burned: 2 (million)
% 1.47/1.28 % (17106)------------------------------
% 1.47/1.28 % (17106)------------------------------
% 1.47/1.28 % (17104)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_16945 for (2999ds/27Mi)
% 1.47/1.28 % (17103)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_16945 for (2999ds/4Mi)
% 1.47/1.28 % (17102)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16945 for (2999ds/183Mi)
% 1.47/1.28 % (17105)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_16945 for (2999ds/2Mi)
% 1.47/1.28 % (17107)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_16945 for (2999ds/275Mi)
% 1.47/1.28 % (17108)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_16945 for (2999ds/18Mi)
% 1.47/1.28 % (17103)First to succeed.
% 1.47/1.28 % (17105)Instruction limit reached!
% 1.47/1.28 % (17105)------------------------------
% 1.47/1.28 % (17105)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.28 % (17105)Termination reason: Unknown
% 1.47/1.28 % (17105)Termination phase: Saturation
% 1.47/1.28
% 1.47/1.28 % (17105)Memory used [KB]: 5500
% 1.47/1.28 % (17105)Time elapsed: 0.004 s
% 1.47/1.28 % (17105)Instructions burned: 2 (million)
% 1.47/1.28 % (17105)------------------------------
% 1.47/1.28 % (17105)------------------------------
% 1.47/1.28 % (17109)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_16945 for (2999ds/3Mi)
% 1.47/1.29 % (17109)Refutation not found, incomplete strategy
% 1.47/1.29 % (17109)------------------------------
% 1.47/1.29 % (17109)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.29 % (17109)Termination reason: Refutation not found, incomplete strategy
% 1.47/1.29
% 1.47/1.29
% 1.47/1.29 % (17109)Memory used [KB]: 5500
% 1.47/1.29 % (17109)Time elapsed: 0.001 s
% 1.47/1.29 % (17109)Instructions burned: 1 (million)
% 1.47/1.29 % (17109)------------------------------
% 1.47/1.29 % (17109)------------------------------
% 1.47/1.29 % (17102)Also succeeded, but the first one will report.
% 1.47/1.29 % (17103)Refutation found. Thanks to Tanya!
% 1.47/1.29 % SZS status Theorem for DTF2THF_16945
% 1.47/1.29 % SZS output start Proof for DTF2THF_16945
% 1.47/1.29 thf(type_def_5, type, a: $tType).
% 1.47/1.29 thf(func_def_0, type, a: $tType).
% 1.47/1.29 thf(func_def_9, type, sK0: a > $o).
% 1.47/1.29 thf(func_def_10, type, sK1: a > $o).
% 1.47/1.29 thf(func_def_12, type, ph3: !>[X0: $tType]:(X0)).
% 1.47/1.29 thf(func_def_13, type, sK4: a).
% 1.47/1.29 thf(f67,plain,(
% 1.47/1.29 $false),
% 1.47/1.29 inference(avatar_sat_refutation,[status(thm)],[f28,f47,f54,f62,f66])).
% 1.47/1.29 thf(f66,plain,(
% 1.47/1.29 ~spl2_1 | ~spl2_4),
% 1.47/1.29 inference(avatar_contradiction_clause,[status(thm)],[f65])).
% 1.47/1.29 thf(f65,plain,(
% 1.47/1.29 $false | (~spl2_1 | ~spl2_4)),
% 1.47/1.29 inference(trivial_inequality_removal,[status(thm)],[f64])).
% 1.47/1.29 thf(f64,plain,(
% 1.47/1.29 ($true = $false) | (~spl2_1 | ~spl2_4)),
% 1.47/1.29 inference(backward_demodulation,[status(thm)],[f23,f45])).
% 1.47/1.29 thf(f45,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $false) | ~spl2_4),
% 1.47/1.29 inference(avatar_component_clause,[status(thm)],[f43])).
% 1.47/1.29 thf(f43,definition,(
% 1.47/1.29 spl2_4 <=> ((sK0 @ sK4) = $false)),
% 1.47/1.29 introduced(definition,[new_symbols(naming,[spl2_4])],[avatar_definition])).
% 1.47/1.29 thf(f23,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $true) | ~spl2_1),
% 1.47/1.29 inference(avatar_component_clause,[status(thm)],[f21])).
% 1.47/1.29 thf(f21,definition,(
% 1.47/1.29 spl2_1 <=> ((sK0 @ sK4) = $true)),
% 1.47/1.29 introduced(definition,[new_symbols(naming,[spl2_1])],[avatar_definition])).
% 1.47/1.29 thf(f62,plain,(
% 1.47/1.29 ~spl2_2 | ~spl2_3),
% 1.47/1.29 inference(avatar_contradiction_clause,[status(thm)],[f61])).
% 1.47/1.29 thf(f61,plain,(
% 1.47/1.29 $false | (~spl2_2 | ~spl2_3)),
% 1.47/1.29 inference(trivial_inequality_removal,[status(thm)],[f58])).
% 1.47/1.29 thf(f58,plain,(
% 1.47/1.29 ($true = $false) | (~spl2_2 | ~spl2_3)),
% 1.47/1.29 inference(superposition,[status(thm)],[f27,f33])).
% 1.47/1.29 thf(f33,plain,(
% 1.47/1.29 ((sK1 @ sK4) = $false) | ~spl2_3),
% 1.47/1.29 inference(avatar_component_clause,[status(thm)],[f31])).
% 1.47/1.29 thf(f31,definition,(
% 1.47/1.29 spl2_3 <=> ((sK1 @ sK4) = $false)),
% 1.47/1.29 introduced(definition,[new_symbols(naming,[spl2_3])],[avatar_definition])).
% 1.47/1.29 thf(f27,plain,(
% 1.47/1.29 ($true = (sK1 @ sK4)) | ~spl2_2),
% 1.47/1.29 inference(avatar_component_clause,[status(thm)],[f25])).
% 1.47/1.29 thf(f25,definition,(
% 1.47/1.29 spl2_2 <=> ($true = (sK1 @ sK4))),
% 1.47/1.29 introduced(definition,[new_symbols(naming,[spl2_2])],[avatar_definition])).
% 1.47/1.29 thf(f54,plain,(
% 1.47/1.29 spl2_2 | spl2_4),
% 1.47/1.29 inference(avatar_split_clause,[status(thm)],[f53,f43,f25])).
% 1.47/1.29 thf(f53,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $false) | ($true = (sK1 @ sK4))),
% 1.47/1.29 inference(not_proxy_clausification,[status(thm)],[f52])).
% 1.47/1.29 thf(f52,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $false) | ((~ (sK1 @ sK4)) = $false)),
% 1.47/1.29 inference(duplicate_literal_removal,[status(thm)],[f51])).
% 1.47/1.29 thf(f51,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $false) | ((~ (sK1 @ sK4)) = $false) | ((sK0 @ sK4) = $false)),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f48])).
% 1.47/1.29 thf(f48,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $false) | (((sK0 @ sK4) & (~ (sK1 @ sK4))) = $false)),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f35])).
% 1.47/1.29 thf(f35,plain,(
% 1.47/1.29 ($false = ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4))))) | ((sK0 @ sK4) = $false)),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.47/1.29 thf(f13,plain,(
% 1.47/1.29 (((sK1 @ sK4) | (sK0 @ sK4)) = $false) | ($false = ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4)))))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.47/1.29 thf(f11,plain,(
% 1.47/1.29 (((sK1 @ sK4) | (sK0 @ sK4)) != ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4)))))),
% 1.47/1.29 inference(beta_eta_normalization,[status(thm)],[f10])).
% 1.47/1.29 thf(f10,plain,(
% 1.47/1.29 (((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) @ sK4) != ((^[Y0 : a]: ((sK1 @ Y0) | ((sK0 @ Y0) & (~ (sK1 @ Y0))))) @ sK4))),
% 1.47/1.29 inference(negative_extensionality,[status(thm)],[f9])).
% 1.47/1.29 thf(f9,plain,(
% 1.47/1.29 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ((sK1 @ Y0) | ((sK0 @ Y0) & (~ (sK1 @ Y0))))))),
% 1.47/1.29 inference(cnf_transformation,[status(thm)],[f8])).
% 1.47/1.29 thf(f8,plain,(
% 1.47/1.29 ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ((sK1 @ Y0) | ((sK0 @ Y0) & (~ (sK1 @ Y0))))))),
% 1.47/1.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 1.47/1.29 thf(f7,plain,(
% 1.47/1.29 ? [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ((X1 @ Y0) | ((X0 @ Y0) & (~ (X1 @ Y0))))) != (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0)))) => ((^[Y0 : a]: ((sK1 @ Y0) | (sK0 @ Y0))) != (^[Y0 : a]: ((sK1 @ Y0) | ((sK0 @ Y0) & (~ (sK1 @ Y0))))))),
% 1.47/1.29 introduced(definition,[],[choice_axiom])).
% 1.47/1.29 thf(f6,plain,(
% 1.47/1.29 ? [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ((X1 @ Y0) | ((X0 @ Y0) & (~ (X1 @ Y0))))) != (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))),
% 1.47/1.29 inference(ennf_transformation,[status(thm)],[f5])).
% 1.47/1.29 thf(f5,plain,(
% 1.47/1.29 ~! [X0 : a > $o,X1 : a > $o] : ((^[Y0 : a]: ((X1 @ Y0) | ((X0 @ Y0) & (~ (X1 @ Y0))))) = (^[Y0 : a]: ((X1 @ Y0) | (X0 @ Y0))))),
% 1.47/1.29 inference(fool_elimination,[status(thm)],[f4])).
% 1.47/1.29 thf(f4,plain,(
% 1.47/1.29 ~! [X0 : a > $o,X1 : a > $o] : ((^[X2 : a] : ((~(X1 @ X2) & (X0 @ X2)) | (X1 @ X2))) = (^[X3 : a] : ((X0 @ X3) | (X1 @ X3))))),
% 1.47/1.29 inference(rectify,[status(thm)],[f2])).
% 1.47/1.29 thf(f2,negated_conjecture,(
% 1.47/1.29 ~! [X1 : a > $o,X0 : a > $o] : ((^[X2 : a] : ((~(X0 @ X2) & (X1 @ X2)) | (X0 @ X2))) = (^[X2 : a] : ((X1 @ X2) | (X0 @ X2))))),
% 1.47/1.29 inference(negated_conjecture,[status(cth)],[f1])).
% 1.47/1.29 thf(f1,conjecture,(
% 1.47/1.29 ! [X1 : a > $o,X0 : a > $o] : ((^[X2 : a] : ((~(X0 @ X2) & (X1 @ X2)) | (X0 @ X2))) = (^[X2 : a] : ((X1 @ X2) | (X0 @ X2))))),
% 1.47/1.29 file('/export/starexec/sandbox2/tmp/tmp.C4UQJvnxcm/DTF2THF_16945.p',cBOOL_PROP_79_pme)).
% 1.47/1.29 thf(f47,plain,(
% 1.47/1.29 spl2_3),
% 1.47/1.29 inference(avatar_split_clause,[status(thm)],[f39,f31])).
% 1.47/1.29 thf(f39,plain,(
% 1.47/1.29 ((sK1 @ sK4) = $false)),
% 1.47/1.29 inference(duplicate_literal_removal,[status(thm)],[f38])).
% 1.47/1.29 thf(f38,plain,(
% 1.47/1.29 ((sK1 @ sK4) = $false) | ((sK1 @ sK4) = $false)),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f36])).
% 1.47/1.29 thf(f36,plain,(
% 1.47/1.29 ((sK1 @ sK4) = $false) | ($false = ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4)))))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.47/1.29 thf(f28,plain,(
% 1.47/1.29 spl2_1 | spl2_2),
% 1.47/1.29 inference(avatar_split_clause,[status(thm)],[f19,f25,f21])).
% 1.47/1.29 thf(f19,plain,(
% 1.47/1.29 ($true = (sK1 @ sK4)) | ((sK0 @ sK4) = $true)),
% 1.47/1.29 inference(duplicate_literal_removal,[status(thm)],[f18])).
% 1.47/1.29 thf(f18,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $true) | ((sK0 @ sK4) = $true) | ($true = (sK1 @ sK4))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f16])).
% 1.47/1.29 thf(f16,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $true) | (((sK0 @ sK4) & (~ (sK1 @ sK4))) = $true) | ($true = (sK1 @ sK4))),
% 1.47/1.29 inference(duplicate_literal_removal,[status(thm)],[f15])).
% 1.47/1.29 thf(f15,plain,(
% 1.47/1.29 ((sK0 @ sK4) = $true) | ($true = (sK1 @ sK4)) | (((sK0 @ sK4) & (~ (sK1 @ sK4))) = $true) | ($true = (sK1 @ sK4))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.47/1.29 thf(f14,plain,(
% 1.47/1.29 ($true = (sK1 @ sK4)) | ((sK0 @ sK4) = $true) | ($true = ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4)))))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.47/1.29 thf(f12,plain,(
% 1.47/1.29 (((sK1 @ sK4) | (sK0 @ sK4)) = $true) | ($true = ((sK1 @ sK4) | ((sK0 @ sK4) & (~ (sK1 @ sK4)))))),
% 1.47/1.29 inference(binary_proxy_clausification,[status(thm)],[f11])).
% 1.47/1.29 % SZS output end Proof for DTF2THF_16945
% 1.47/1.29 % (17103)------------------------------
% 1.47/1.29 % (17103)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.47/1.29 % (17103)Termination reason: Refutation
% 1.47/1.29
% 1.47/1.29 % (17103)Memory used [KB]: 5500
% 1.47/1.29 % (17103)Time elapsed: 0.006 s
% 1.47/1.29 % (17103)Instructions burned: 3 (million)
% 1.47/1.29 % (17103)------------------------------
% 1.47/1.29 % (17103)------------------------------
% 1.47/1.29 % (17101)Success in time 0.014 s
%------------------------------------------------------------------------------