%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SET200^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Feb 25 09:31:24 AM UTC 2026
% Result : Theorem 1.45s 1.28s
% Output : Refutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 213 ( 81 equ; 0 cnn)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 236 ( 45 ~; 36 |; 32 &; 103 @)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 0 ^; 42 !; 22 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a > $o ).
thf(func_def_8,type,
sK4: a ).
thf(f33,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f25,f28,f32]) ).
thf(f32,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[status(thm)],[f31]) ).
thf(f31,plain,
( $false
| ~ spl5_2 ),
inference(subsumption_resolution,[status(thm)],[f30,f24]) ).
thf(f24,plain,
( ( $true
= ( sK3 @ sK4 ) )
| ~ spl5_2 ),
inference(avatar_component_clause,[status(thm)],[f22]) ).
thf(f22,definition,
( spl5_2
<=> ( $true
= ( sK3 @ sK4 ) ) ),
introduced(definition,[new_symbols(naming,[spl5_2])],[avatar_definition]) ).
thf(f30,plain,
( $true
!= ( sK3 @ sK4 ) ),
inference(trivial_inequality_removal,[status(thm)],[f29]) ).
thf(f29,plain,
( ( $true != $true )
| ( $true
!= ( sK3 @ sK4 ) ) ),
inference(superposition,[status(thm)],[f15,f13]) ).
thf(f13,plain,
! [X5: a] :
( ( ( sK1 @ X5 )
= $true )
| ( $true
!= ( sK3 @ X5 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ( ( $true
= ( sK3 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) )
& ( ( sK1 @ sK4 )
!= $true )
& ( ( sK2 @ sK4 )
!= $true )
& ! [X5: a] :
( ( $true
!= ( sK3 @ X5 ) )
| ( ( sK1 @ X5 )
= $true ) )
& ! [X6: a] :
( ( $true
!= ( sK0 @ X6 ) )
| ( $true
= ( sK2 @ X6 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ? [X4: a] :
( ( ( ( X3 @ X4 )
= $true )
| ( ( X0 @ X4 )
= $true ) )
& ( ( X1 @ X4 )
!= $true )
& ( ( X2 @ X4 )
!= $true ) )
& ! [X5: a] :
( ( $true
!= ( X3 @ X5 ) )
| ( $true
= ( X1 @ X5 ) ) )
& ! [X6: a] :
( ( ( X0 @ X6 )
!= $true )
| ( $true
= ( X2 @ X6 ) ) ) )
=> ( ? [X4: a] :
( ( ( $true
= ( sK3 @ X4 ) )
| ( $true
= ( sK0 @ X4 ) ) )
& ( ( sK1 @ X4 )
!= $true )
& ( $true
!= ( sK2 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( sK3 @ X5 ) )
| ( ( sK1 @ X5 )
= $true ) )
& ! [X6: a] :
( ( $true
!= ( sK0 @ X6 ) )
| ( $true
= ( sK2 @ X6 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f10,plain,
( ? [X4: a] :
( ( ( $true
= ( sK3 @ X4 ) )
| ( $true
= ( sK0 @ X4 ) ) )
& ( ( sK1 @ X4 )
!= $true )
& ( $true
!= ( sK2 @ X4 ) ) )
=> ( ( ( $true
= ( sK3 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) )
& ( ( sK1 @ sK4 )
!= $true )
& ( ( sK2 @ sK4 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ? [X4: a] :
( ( ( ( X3 @ X4 )
= $true )
| ( ( X0 @ X4 )
= $true ) )
& ( ( X1 @ X4 )
!= $true )
& ( ( X2 @ X4 )
!= $true ) )
& ! [X5: a] :
( ( $true
!= ( X3 @ X5 ) )
| ( $true
= ( X1 @ X5 ) ) )
& ! [X6: a] :
( ( ( X0 @ X6 )
!= $true )
| ( $true
= ( X2 @ X6 ) ) ) ),
inference(rectify,[status(thm)],[f7]) ).
thf(f7,plain,
? [X2: a > $o,X3: a > $o,X0: a > $o,X1: a > $o] :
( ? [X6: a] :
( ( ( $true
= ( X1 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
& ( $true
!= ( X3 @ X6 ) )
& ( ( X0 @ X6 )
!= $true ) )
& ! [X5: a] :
( ( $true
!= ( X1 @ X5 ) )
| ( $true
= ( X3 @ X5 ) ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( ( X0 @ X4 )
= $true ) ) ),
inference(flattening,[status(thm)],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X2: a > $o,X3: a > $o,X1: a > $o] :
( ? [X6: a] :
( ( $true
!= ( X3 @ X6 ) )
& ( ( X0 @ X6 )
!= $true )
& ( ( $true
= ( X1 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) ) )
& ! [X5: a] :
( ( $true
!= ( X1 @ X5 ) )
| ( $true
= ( X3 @ X5 ) ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( ( X0 @ X4 )
= $true ) ) ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X2: a > $o,X3: a > $o,X1: a > $o] :
( ( ! [X5: a] :
( ( $true
= ( X1 @ X5 ) )
=> ( $true
= ( X3 @ X5 ) ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
= $true )
=> ( ( X0 @ X4 )
= $true ) ) )
=> ! [X6: a] :
( ( ( $true
= ( X1 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
=> ( ( $true
= ( X3 @ X6 ) )
| ( ( X0 @ X6 )
= $true ) ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X0 @ X4 ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ( X3 @ X5 ) ) )
=> ! [X6: a] :
( ( ( X1 @ X6 )
| ( X2 @ X6 ) )
=> ( ( X0 @ X6 )
| ( X3 @ X6 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
=> ( ( X1 @ X4 )
| ( X3 @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X2: a > $o,X0: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
=> ( ( X1 @ X4 )
| ( X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0F9nr5XtDL/DTF2THF_3821.p',cBOOL_PROP_34_pme) ).
thf(f15,plain,
( ( sK1 @ sK4 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f28,plain,
~ spl5_1,
inference(avatar_split_clause,[status(thm)],[f27,f18]) ).
thf(f18,definition,
( spl5_1
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(naming,[spl5_1])],[avatar_definition]) ).
thf(f27,plain,
( $true
!= ( sK0 @ sK4 ) ),
inference(trivial_inequality_removal,[status(thm)],[f26]) ).
thf(f26,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK4 ) ) ),
inference(superposition,[status(thm)],[f14,f12]) ).
thf(f12,plain,
! [X6: a] :
( ( $true
= ( sK2 @ X6 ) )
| ( $true
!= ( sK0 @ X6 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f14,plain,
( ( sK2 @ sK4 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f25,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[status(thm)],[f16,f22,f18]) ).
thf(f16,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK3 @ sK4 ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET200^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n019.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 11:55:09 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.26/0.46 ---- Original DTF file ---
% 0.26/0.46 thf(spec,logic,$$dhol).
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 % File : SET200^5 : TPTP v9.2.1. Released v4.0.0.
% 0.26/0.46 % Domain : Set Theory
% 0.26/0.46 % Problem : TPS problem BOOL-PROP-34
% 0.26/0.46 % Version : Especial.
% 0.26/0.46 % English : Trybulec's 34th Boolean property of sets
% 0.26/0.46
% 0.26/0.46 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.26/0.46 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.26/0.46 % Source : [Bro09]
% 0.26/0.46 % Names : tps_0154 [Bro09]
% 0.26/0.46 % : BOOL-PROP-34 [TPS]
% 0.26/0.46
% 0.26/0.46 % Status : Theorem
% 0.26/0.46 % Rating : 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.26/0.46 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.26/0.46 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.26/0.46 % Maximal formula atoms : 0 ( 0 avg)
% 0.26/0.46 % Number of connectives : 15 ( 0 ~; 2 |; 1 &; 8 @)
% 0.26/0.46 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.26/0.46 % Maximal formula depth : 10 ( 10 avg)
% 0.26/0.46 % Number of types : 2 ( 1 usr)
% 0.26/0.46 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.26/0.46 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.26/0.46 % Number of variables : 7 ( 0 ^; 7 !; 0 ?; 7 :)
% 0.26/0.46 % SPC : TH0_THM_NEQ_NAR
% 0.26/0.46
% 0.26/0.46 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.26/0.46 % project in the Department of Mathematical Sciences at Carnegie
% 0.26/0.46 % Mellon University. Distributed under the Creative Commons copyleft
% 0.26/0.46 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.26/0.46 % : Polymorphic definitions expanded.
% 0.26/0.46 % :
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 thf(a_type,type,
% 0.26/0.46 a: $tType ).
% 0.26/0.46
% 0.26/0.46 thf(cBOOL_PROP_34_pme,conjecture,
% 0.26/0.46 ! [X: a > $o,Y: a > $o,Z: a > $o,V: a > $o] :
% 0.26/0.46 ( ( ! [Xx: a] :
% 0.26/0.46 ( ( X @ Xx )
% 0.26/0.46 => ( Y @ Xx ) )
% 0.26/0.46 & ! [Xx: a] :
% 0.26/0.46 ( ( Z @ Xx )
% 0.26/0.46 => ( V @ Xx ) ) )
% 0.26/0.46 => ! [Xx: a] :
% 0.26/0.46 ( ( ( X @ Xx )
% 0.26/0.46 | ( Z @ Xx ) )
% 0.26/0.46 => ( ( Y @ Xx )
% 0.26/0.46 | ( V @ Xx ) ) ) ) ).
% 0.26/0.46
% 0.26/0.46 %------------------------------------------------------------------------------
% 0.26/0.46 ------------------------
% 1.45/1.26 ---- Embedded in THF ---
% 1.45/1.26 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.26 %%% Generated on Tue Feb 24 11:55:10 EST 2026
% 1.45/1.26 %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.26 %%% Logic specification used:
% 1.45/1.26 %%% thf(spec, logic, $$dhol).
% 1.45/1.26
% 1.45/1.26 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.0F9nr5XtDL/DTF2DTF3821.p
% See solution above
% 1.45/1.26 ------------------------
% 1.45/1.27 ---- Cleaned THF ---
% 1.45/1.27 thf(a_type,type,
% 1.45/1.27 a: $tType ).
% 1.45/1.27
% 1.45/1.27 thf(cBOOL_PROP_34_pme,conjecture,
% 1.45/1.27 ! [X: a > $o,Y: a > $o,Z: a > $o,V: a > $o] :
% 1.45/1.27 ( ( ! [Xx: a] :
% 1.45/1.27 ( ( X @ Xx )
% 1.45/1.27 => ( Y @ Xx ) )
% 1.45/1.27 & ! [Xx: a] :
% 1.45/1.27 ( ( Z @ Xx )
% 1.45/1.27 => ( V @ Xx ) ) )
% 1.45/1.27 => ! [Xx: a] :
% 1.45/1.27 ( ( ( X @ Xx )
% 1.45/1.27 | ( Z @ Xx ) )
% 1.45/1.27 => ( ( Y @ Xx )
% 1.45/1.27 | ( V @ Xx ) ) ) ) ).
% 1.45/1.27 ------------------------
% 1.45/1.28 % (3929)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_3821 for (2999ds/4Mi)
% 1.45/1.28 % (3928)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_3821 for (2999ds/183Mi)
% 1.45/1.28 % (3928)First to succeed.
% 1.45/1.28 % (3929)Also succeeded, but the first one will report.
% 1.45/1.28 % (3928)Refutation found. Thanks to Tanya!
% 1.45/1.28 % SZS status Theorem for DTF2THF_3821
% 1.45/1.28 % SZS output start Proof for DTF2THF_3821
% 1.45/1.28 thf(type_def_5, type, a: $tType).
% 1.45/1.28 thf(func_def_0, type, a: $tType).
% 1.45/1.28 thf(func_def_4, type, sK0: a > $o).
% 1.45/1.28 thf(func_def_5, type, sK1: a > $o).
% 1.45/1.28 thf(func_def_6, type, sK2: a > $o).
% 1.45/1.28 thf(func_def_7, type, sK3: a > $o).
% 1.45/1.28 thf(func_def_8, type, sK4: a).
% 1.45/1.28 thf(f33,plain,(
% 1.45/1.28 $false),
% 1.45/1.28 inference(avatar_sat_refutation,[status(thm)],[f25,f28,f32])).
% 1.45/1.28 thf(f32,plain,(
% 1.45/1.28 ~spl5_2),
% 1.45/1.28 inference(avatar_contradiction_clause,[status(thm)],[f31])).
% 1.45/1.28 thf(f31,plain,(
% 1.45/1.28 $false | ~spl5_2),
% 1.45/1.28 inference(subsumption_resolution,[status(thm)],[f30,f24])).
% 1.45/1.28 thf(f24,plain,(
% 1.45/1.28 ($true = (sK3 @ sK4)) | ~spl5_2),
% 1.45/1.28 inference(avatar_component_clause,[status(thm)],[f22])).
% 1.45/1.28 thf(f22,definition,(
% 1.45/1.28 spl5_2 <=> ($true = (sK3 @ sK4))),
% 1.45/1.28 introduced(definition,[new_symbols(naming,[spl5_2])],[avatar_definition])).
% 1.45/1.28 thf(f30,plain,(
% 1.45/1.28 ($true != (sK3 @ sK4))),
% 1.45/1.28 inference(trivial_inequality_removal,[status(thm)],[f29])).
% 1.45/1.28 thf(f29,plain,(
% 1.45/1.28 ($true != $true) | ($true != (sK3 @ sK4))),
% 1.45/1.28 inference(superposition,[status(thm)],[f15,f13])).
% 1.45/1.28 thf(f13,plain,(
% 1.45/1.28 ( ! [X5 : a] : (((sK1 @ X5) = $true) | ($true != (sK3 @ X5))) )),
% 1.45/1.28 inference(cnf_transformation,[status(thm)],[f11])).
% 1.45/1.28 thf(f11,plain,(
% 1.45/1.28 ((($true = (sK3 @ sK4)) | ($true = (sK0 @ sK4))) & ((sK1 @ sK4) != $true) & ((sK2 @ sK4) != $true)) & ! [X5 : a] : (($true != (sK3 @ X5)) | ((sK1 @ X5) = $true)) & ! [X6 : a] : (($true != (sK0 @ X6)) | ($true = (sK2 @ X6)))),
% 1.45/1.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f10,f9])).
% 1.45/1.28 thf(f9,plain,(
% 1.45/1.28 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o,X3 : a > $o] : (? [X4 : a] : ((((X3 @ X4) = $true) | ((X0 @ X4) = $true)) & ((X1 @ X4) != $true) & ((X2 @ X4) != $true)) & ! [X5 : a] : (($true != (X3 @ X5)) | ($true = (X1 @ X5))) & ! [X6 : a] : (((X0 @ X6) != $true) | ($true = (X2 @ X6)))) => (? [X4 : a] : ((($true = (sK3 @ X4)) | ($true = (sK0 @ X4))) & ((sK1 @ X4) != $true) & ($true != (sK2 @ X4))) & ! [X5 : a] : (($true != (sK3 @ X5)) | ((sK1 @ X5) = $true)) & ! [X6 : a] : (($true != (sK0 @ X6)) | ($true = (sK2 @ X6))))),
% 1.45/1.28 introduced(definition,[],[choice_axiom])).
% 1.45/1.28 thf(f10,plain,(
% 1.45/1.28 ? [X4 : a] : ((($true = (sK3 @ X4)) | ($true = (sK0 @ X4))) & ((sK1 @ X4) != $true) & ($true != (sK2 @ X4))) => ((($true = (sK3 @ sK4)) | ($true = (sK0 @ sK4))) & ((sK1 @ sK4) != $true) & ((sK2 @ sK4) != $true))),
% 1.45/1.28 introduced(definition,[],[choice_axiom])).
% 1.45/1.28 thf(f8,plain,(
% 1.45/1.28 ? [X0 : a > $o,X1 : a > $o,X2 : a > $o,X3 : a > $o] : (? [X4 : a] : ((((X3 @ X4) = $true) | ((X0 @ X4) = $true)) & ((X1 @ X4) != $true) & ((X2 @ X4) != $true)) & ! [X5 : a] : (($true != (X3 @ X5)) | ($true = (X1 @ X5))) & ! [X6 : a] : (((X0 @ X6) != $true) | ($true = (X2 @ X6))))),
% 1.45/1.28 inference(rectify,[status(thm)],[f7])).
% 1.45/1.28 thf(f7,plain,(
% 1.45/1.28 ? [X2 : a > $o,X3 : a > $o,X0 : a > $o,X1 : a > $o] : (? [X6 : a] : ((($true = (X1 @ X6)) | ($true = (X2 @ X6))) & ($true != (X3 @ X6)) & ((X0 @ X6) != $true)) & ! [X5 : a] : (($true != (X1 @ X5)) | ($true = (X3 @ X5))) & ! [X4 : a] : (((X2 @ X4) != $true) | ((X0 @ X4) = $true)))),
% 1.45/1.29 inference(flattening,[status(thm)],[f6])).
% 1.45/1.29 thf(f6,plain,(
% 1.45/1.29 ? [X0 : a > $o,X2 : a > $o,X3 : a > $o,X1 : a > $o] : (? [X6 : a] : ((($true != (X3 @ X6)) & ((X0 @ X6) != $true)) & (($true = (X1 @ X6)) | ($true = (X2 @ X6)))) & (! [X5 : a] : (($true != (X1 @ X5)) | ($true = (X3 @ X5))) & ! [X4 : a] : (((X2 @ X4) != $true) | ((X0 @ X4) = $true))))),
% 1.45/1.29 inference(ennf_transformation,[status(thm)],[f5])).
% 1.45/1.29 thf(f5,plain,(
% 1.45/1.29 ~! [X0 : a > $o,X2 : a > $o,X3 : a > $o,X1 : a > $o] : ((! [X5 : a] : (($true = (X1 @ X5)) => ($true = (X3 @ X5))) & ! [X4 : a] : (((X2 @ X4) = $true) => ((X0 @ X4) = $true))) => ! [X6 : a] : ((($true = (X1 @ X6)) | ($true = (X2 @ X6))) => (($true = (X3 @ X6)) | ((X0 @ X6) = $true))))),
% 1.45/1.29 inference(fool_elimination,[status(thm)],[f4])).
% 1.45/1.29 thf(f4,plain,(
% 1.45/1.29 ~! [X0 : a > $o,X1 : a > $o,X2 : a > $o,X3 : a > $o] : ((! [X4 : a] : ((X2 @ X4) => (X0 @ X4)) & ! [X5 : a] : ((X1 @ X5) => (X3 @ X5))) => ! [X6 : a] : (((X1 @ X6) | (X2 @ X6)) => ((X0 @ X6) | (X3 @ X6))))),
% 1.45/1.29 inference(rectify,[status(thm)],[f2])).
% 1.45/1.29 thf(f2,negated_conjecture,(
% 1.45/1.29 ~! [X1 : a > $o,X2 : a > $o,X0 : a > $o,X3 : a > $o] : ((! [X4 : a] : ((X0 @ X4) => (X1 @ X4)) & ! [X4 : a] : ((X2 @ X4) => (X3 @ X4))) => ! [X4 : a] : (((X2 @ X4) | (X0 @ X4)) => ((X1 @ X4) | (X3 @ X4))))),
% 1.45/1.29 inference(negated_conjecture,[status(cth)],[f1])).
% 1.45/1.29 thf(f1,conjecture,(
% 1.45/1.29 ! [X1 : a > $o,X2 : a > $o,X0 : a > $o,X3 : a > $o] : ((! [X4 : a] : ((X0 @ X4) => (X1 @ X4)) & ! [X4 : a] : ((X2 @ X4) => (X3 @ X4))) => ! [X4 : a] : (((X2 @ X4) | (X0 @ X4)) => ((X1 @ X4) | (X3 @ X4))))),
% 1.45/1.29 file('/export/starexec/sandbox/tmp/tmp.0F9nr5XtDL/DTF2THF_3821.p',cBOOL_PROP_34_pme)).
% 1.45/1.29 thf(f15,plain,(
% 1.45/1.29 ((sK1 @ sK4) != $true)),
% 1.45/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.45/1.29 thf(f28,plain,(
% 1.45/1.29 ~spl5_1),
% 1.45/1.29 inference(avatar_split_clause,[status(thm)],[f27,f18])).
% 1.45/1.29 thf(f18,definition,(
% 1.45/1.29 spl5_1 <=> ($true = (sK0 @ sK4))),
% 1.45/1.29 introduced(definition,[new_symbols(naming,[spl5_1])],[avatar_definition])).
% 1.45/1.29 thf(f27,plain,(
% 1.45/1.29 ($true != (sK0 @ sK4))),
% 1.45/1.29 inference(trivial_inequality_removal,[status(thm)],[f26])).
% 1.45/1.29 thf(f26,plain,(
% 1.45/1.29 ($true != $true) | ($true != (sK0 @ sK4))),
% 1.45/1.29 inference(superposition,[status(thm)],[f14,f12])).
% 1.45/1.29 thf(f12,plain,(
% 1.45/1.29 ( ! [X6 : a] : (($true = (sK2 @ X6)) | ($true != (sK0 @ X6))) )),
% 1.45/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.45/1.29 thf(f14,plain,(
% 1.45/1.29 ((sK2 @ sK4) != $true)),
% 1.45/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.45/1.29 thf(f25,plain,(
% 1.45/1.29 spl5_1 | spl5_2),
% 1.45/1.29 inference(avatar_split_clause,[status(thm)],[f16,f22,f18])).
% 1.45/1.29 thf(f16,plain,(
% 1.45/1.29 ($true = (sK0 @ sK4)) | ($true = (sK3 @ sK4))),
% 1.45/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.45/1.29 % SZS output end Proof for DTF2THF_3821
% 1.45/1.29 % (3928)------------------------------
% 1.45/1.29 % (3928)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.29 % (3928)Termination reason: Refutation
% 1.45/1.29
% 1.45/1.29 % (3928)Memory used [KB]: 5500
% 1.45/1.29 % (3928)Time elapsed: 0.002 s
% 1.45/1.29 % (3928)Instructions burned: 2 (million)
% 1.45/1.29 % (3928)------------------------------
% 1.45/1.29 % (3928)------------------------------
% 1.45/1.29 % (3927)Success in time 0.003 s
%------------------------------------------------------------------------------