%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : CSR148^1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/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 08:43:12 AM UTC 2026
% Result : Theorem 1.99s 1.62s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 14 unt; 0 typ; 4 def)
% Number of atoms : 245 ( 51 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 244 ( 43 ~; 33 |; 0 &; 147 @)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 12 usr; 11 con; 0-2 aty)
% ( 5 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 67 ( 6 ^; 53 !; 8 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
num: $tType ).
thf(func_def_1,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(func_def_5,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(func_def_6,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_16,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f74,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f30,f32,f52,f71,f73]) ).
thf(f73,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[status(thm)],[f72]) ).
thf(f72,plain,
( $false
| ~ spl0_3 ),
inference(equality_resolution,[status(thm)],[f48]) ).
thf(f48,plain,
( ! [X0: $i] : ( n2009_THFTYPE_i != X0 )
| ~ spl0_3 ),
inference(avatar_component_clause,[status(thm)],[f47]) ).
thf(f47,definition,
( spl0_3
<=> ! [X0: $i] : ( n2009_THFTYPE_i != X0 ) ),
introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).
thf(f71,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[status(thm)],[f70]) ).
thf(f70,plain,
( $false
| ~ spl0_4 ),
inference(trivial_inequality_removal,[status(thm)],[f67]) ).
thf(f67,plain,
( ( $true = $false )
| ~ spl0_4 ),
inference(superposition,[status(thm)],[f20,f51]) ).
thf(f51,plain,
( ! [X2: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
= $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[status(thm)],[f50]) ).
thf(f50,definition,
( spl0_4
<=> ! [X2: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
= $false ) ),
introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition]) ).
thf(f20,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax) ).
thf(f52,plain,
( spl0_3
| spl0_4
| ~ spl0_1 ),
inference(avatar_split_clause,[status(thm)],[f45,f25,f50,f47]) ).
thf(f25,definition,
( spl0_1
<=> ! [X2: $i] :
( $true
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) ) ),
introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).
thf(f45,plain,
( ! [X2: $i,X0: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
= $false )
| ( n2009_THFTYPE_i != X0 ) )
| ~ spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f44,f26]) ).
thf(f26,plain,
( ! [X2: $i] :
( $true
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[status(thm)],[f25]) ).
thf(f44,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( n2009_THFTYPE_i != X0 )
| ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
= $false ) )
| ~ spl0_1 ),
inference(subsumption_resolution,[status(thm)],[f43,f26]) ).
thf(f43,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( n2009_THFTYPE_i != X0 )
| ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
= $false )
| ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) )
| ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
inference(binary_proxy_clausification,[status(thm)],[f42]) ).
thf(f42,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) ) )
| ( n2009_THFTYPE_i != X0 )
| ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f41]) ).
thf(f41,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) )
@ X2 ) )
| ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( n2009_THFTYPE_i != X0 ) ),
inference(pi_clausification,[status(thm)],[f35]) ).
thf(f35,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) ) )
| ( n2009_THFTYPE_i != X0 ) ),
inference(binary_proxy_clausification,[status(thm)],[f34]) ).
thf(f34,plain,
! [X0: $i,X1: $i] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( n2009_THFTYPE_i != X0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f33]) ).
thf(f33,plain,
! [X0: $i,X1: $i] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( $true != $true )
| ( n2009_THFTYPE_i != X0 ) ),
inference(constrained_superposition,[status(thm)],[f19,f17]) ).
thf(f17,plain,
( $true
= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
thf(f12,plain,
( $true
= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f11]) ).
thf(f11,plain,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ! [X0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ! [X0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax_001) ).
thf(f19,plain,
! [X0: $i,X1: $i] :
( $true
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X1 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
! [X0: $i,X1: $i] :
( $true
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X1 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
inference(ennf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
~ ? [X0: $i,X1: $i] :
( $true
= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X1 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
~ ? [X0: $i,X1: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X1 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ? [X0: $i,X2: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X2 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
? [X0: $i,X2: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ X2 ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',con) ).
thf(f32,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[status(thm)],[f31]) ).
thf(f31,plain,
( $false
| ~ spl0_2 ),
inference(equality_resolution,[status(thm)],[f29]) ).
thf(f29,plain,
( ! [X0: $i,X1: $i] :
( ( lYearFn_THFTYPE_IiiI @ X0 )
!= X1 )
| ~ spl0_2 ),
inference(avatar_component_clause,[status(thm)],[f28]) ).
thf(f28,definition,
( spl0_2
<=> ! [X0: $i,X1: $i] :
( ( lYearFn_THFTYPE_IiiI @ X0 )
!= X1 ) ),
introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).
thf(f30,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[status(thm)],[f23,f28,f25]) ).
thf(f23,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( lYearFn_THFTYPE_IiiI @ X0 )
!= X1 )
| ( $true
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f22]) ).
thf(f22,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) )
| ( $true != $true )
| ( ( lYearFn_THFTYPE_IiiI @ X0 )
!= X1 ) ),
inference(constrained_superposition,[status(thm)],[f19,f21]) ).
thf(f21,plain,
! [X0: $i] :
( $true
= ( holdsDuring_THFTYPE_IiooI @ X0 @ $true ) ),
inference(equality_resolution,[status(thm)],[f18]) ).
thf(f18,plain,
! [X0: $i,X1: $o] :
( ( $true != X1 )
| ( $true
= ( holdsDuring_THFTYPE_IiooI @ X0 @ X1 ) ) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
thf(f16,plain,
! [X0: $i,X1: $o] :
( ( $true != X1 )
| ( $true
= ( holdsDuring_THFTYPE_IiooI @ X0 @ X1 ) ) ),
inference(ennf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: $i,X1: $o] :
( ( $true = X1 )
=> ( $true
= ( holdsDuring_THFTYPE_IiooI @ X0 @ X1 ) ) ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
! [X0: $i,X1: $o] :
( X1
=> ( holdsDuring_THFTYPE_IiooI @ X0 @ X1 ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
! [X2: $i,X1: $o] :
( X1
=> ( holdsDuring_THFTYPE_IiooI @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax_002) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR148^1 : TPTP v9.2.1. Released v4.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Feb 24 05:53:35 EST 2026
% 0.19/0.36 % CPUTime :
% 0.19/0.36 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.29/0.50 ---- Original DTF file ---
% 0.29/0.50 thf(spec,logic,$$dhol).
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 % File : CSR148^1 : TPTP v9.2.1. Released v4.1.0.
% 0.29/0.50 % Domain : Commonsense Reasoning
% 0.29/0.50 % Problem : Is there a year in which Sue liked somebody?
% 0.29/0.50 % Version : Especial > Reduced > Especial.
% 0.29/0.50 % English : What holds that holds at all times. Mary likes Bill. During 2009
% 0.29/0.50 % Sue liked whoever Mary liked. Is there a year in which Sue liked
% 0.29/0.50 % somebody?
% 0.29/0.50
% 0.29/0.50 % Refs : [PS07] Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.29/0.50 % : [BP10] Benzmueller & Pease (2010), Progress in Automating Hig
% 0.29/0.50 % : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.29/0.50 % Source : [Ben10]
% 0.29/0.50 % Names : paar_4.tq_SUMO_local [Ben10]
% 0.29/0.50
% 0.29/0.50 % Status : Theorem
% 0.29/0.50 % Rating : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.00 v5.4.0, 0.25 v5.3.0, 0.50 v5.1.0, 0.75 v5.0.0, 0.50 v4.1.0
% 0.29/0.50 % Syntax : Number of formulae : 12 ( 2 unt; 8 typ; 0 def)
% 0.29/0.50 % Number of atoms : 7 ( 0 equ; 0 cnn)
% 0.29/0.50 % Maximal formula atoms : 3 ( 1 avg)
% 0.29/0.50 % Number of connectives : 18 ( 0 ~; 0 |; 0 &; 16 @)
% 0.29/0.50 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.29/0.50 % Maximal formula depth : 6 ( 5 avg)
% 0.29/0.50 % Number of types : 3 ( 1 usr)
% 0.29/0.50 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.29/0.50 % Number of symbols : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.29/0.50 % Number of variables : 5 ( 0 ^; 3 !; 2 ?; 5 :)
% 0.29/0.50 % SPC : TH0_THM_NEQ_NAR
% 0.29/0.50
% 0.29/0.50 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.29/0.50 % Initally the problem has been hand generated in KIF syntax in
% 0.29/0.50 % SigmaKEE and then automatically translated by Benzmueller's
% 0.29/0.50 % KIF2TH0 translator into THF syntax.
% 0.29/0.50 % : The translation has been applied in two modes: local and SInE.
% 0.29/0.50 % The local mode only translates the local assumptions and the
% 0.29/0.50 % query. The SInE mode additionally translates the SInE-extract
% 0.29/0.50 % of the loaded knowledge base (usually SUMO).
% 0.29/0.50 % : The examples are selected to illustrate the benefits of
% 0.29/0.50 % higher-order reasoning in ontology reasoning.
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 %----The extracted Signature
% 0.29/0.50 thf(numbers,type,
% 0.29/0.50 num: $tType ).
% 0.29/0.50
% 0.29/0.50 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.29/0.50 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.29/0.50
% 0.29/0.50 thf(lBill_THFTYPE_i,type,
% 0.29/0.50 lBill_THFTYPE_i: $i ).
% 0.29/0.50
% 0.29/0.50 thf(lMary_THFTYPE_i,type,
% 0.29/0.50 lMary_THFTYPE_i: $i ).
% 0.29/0.50
% 0.29/0.50 thf(lSue_THFTYPE_i,type,
% 0.29/0.50 lSue_THFTYPE_i: $i ).
% 0.29/0.50
% 0.29/0.50 thf(lYearFn_THFTYPE_IiiI,type,
% 0.29/0.50 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.29/0.50
% 0.29/0.50 thf(likes_THFTYPE_IiioI,type,
% 0.29/0.50 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.29/0.50
% 0.29/0.50 thf(n2009_THFTYPE_i,type,
% 0.29/0.50 n2009_THFTYPE_i: $i ).
% 0.29/0.50
% 0.29/0.50 %----The translated axioms
% 0.29/0.50 thf(ax,axiom,
% 0.29/0.50 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.29/0.50
% 0.29/0.50 thf(ax_001,axiom,
% 0.29/0.50 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.29/0.50 @ ! [X: $i] :
% 0.29/0.50 ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 0.29/0.50 => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.29/0.50
% 0.29/0.50 thf(ax_002,axiom,
% 0.29/0.50 ! [P: $o,Y: $i] :
% 0.29/0.50 ( P
% 0.29/0.50 => ( holdsDuring_THFTYPE_IiooI @ Y @ P ) ) ).
% 0.29/0.50
% 0.29/0.50 %----The translated conjectures
% 0.29/0.50 thf(con,conjecture,
% 0.29/0.50 ? [X: $i,Y: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ Y ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ).
% 0.29/0.50
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 ------------------------
% 1.80/1.58 ---- Embedded in THF ---
% 1.80/1.58 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.80/1.58 %%% Generated on Tue Feb 24 05:53:36 EST 2026
% 1.80/1.58 %%% using '$$dhol' embedding, version 1.3.0.
% 1.80/1.58 %%% Logic specification used:
% 1.80/1.58 %%% thf(spec, logic, $$dhol).
% 1.80/1.58
% 1.80/1.58 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2DTF25296.p
% See solution above
% 1.80/1.58 ------------------------
% 1.80/1.59 ---- Cleaned THF ---
% 1.80/1.59 thf(numbers,type,
% 1.80/1.59 num: $tType ).
% 1.80/1.59
% 1.80/1.59 thf(holdsDuring_THFTYPE_IiooI,type,
% 1.80/1.59 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 1.80/1.59
% 1.80/1.59 thf(lBill_THFTYPE_i,type,
% 1.80/1.59 lBill_THFTYPE_i: $i ).
% 1.80/1.59
% 1.80/1.59 thf(lMary_THFTYPE_i,type,
% 1.80/1.59 lMary_THFTYPE_i: $i ).
% 1.80/1.59
% 1.80/1.59 thf(lSue_THFTYPE_i,type,
% 1.80/1.59 lSue_THFTYPE_i: $i ).
% 1.80/1.59
% 1.80/1.59 thf(lYearFn_THFTYPE_IiiI,type,
% 1.80/1.59 lYearFn_THFTYPE_IiiI: $i > $i ).
% 1.80/1.59
% 1.80/1.59 thf(likes_THFTYPE_IiioI,type,
% 1.80/1.59 likes_THFTYPE_IiioI: $i > $i > $o ).
% 1.80/1.59
% 1.80/1.59 thf(n2009_THFTYPE_i,type,
% 1.80/1.59 n2009_THFTYPE_i: $i ).
% 1.80/1.59
% 1.80/1.59 thf(ax,axiom,
% 1.80/1.59 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 1.80/1.59
% 1.80/1.59 thf(ax_001,axiom,
% 1.80/1.59 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 1.80/1.59 @ ! [X: $i] :
% 1.80/1.59 ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 1.80/1.59 => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 1.80/1.59
% 1.80/1.59 thf(ax_002,axiom,
% 1.80/1.59 ! [P: $o,Y: $i] :
% 1.80/1.59 ( P
% 1.80/1.59 => ( holdsDuring_THFTYPE_IiooI @ Y @ P ) ) ).
% 1.80/1.59
% 1.80/1.59 thf(con,conjecture,
% 1.80/1.59 ? [X: $i,Y: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ Y ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ).
% 1.80/1.59 ------------------------
% 1.99/1.61 % (25394)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_25296 for (2999ds/183Mi)
% 1.99/1.61 % (25396)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_25296 for (2999ds/27Mi)
% 1.99/1.61 % (25400)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_25296 for (2999ds/18Mi)
% 1.99/1.61 % (25399)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_25296 for (2999ds/275Mi)
% 1.99/1.61 % (25397)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_25296 for (2999ds/2Mi)
% 1.99/1.61 % (25395)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_25296 for (2999ds/4Mi)
% 1.99/1.61 % (25398)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_25296 for (2999ds/2Mi)
% 1.99/1.61 % (25399)Refutation not found, incomplete strategy
% 1.99/1.61 % (25399)------------------------------
% 1.99/1.61 % (25399)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.61 % (25399)Termination reason: Refutation not found, incomplete strategy
% 1.99/1.61
% 1.99/1.61
% 1.99/1.61 % (25399)Memory used [KB]: 5500
% 1.99/1.61 % (25399)Time elapsed: 0.002 s
% 1.99/1.61 % (25399)Instructions burned: 1 (million)
% 1.99/1.61 % (25399)------------------------------
% 1.99/1.61 % (25399)------------------------------
% 1.99/1.61 % (25397)Instruction limit reached!
% 1.99/1.61 % (25397)------------------------------
% 1.99/1.61 % (25397)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.61 % (25397)Termination reason: Unknown
% 1.99/1.61 % (25397)Termination phase: Saturation
% 1.99/1.61
% 1.99/1.61 % (25398)Instruction limit reached!
% 1.99/1.61 % (25398)------------------------------
% 1.99/1.61 % (25398)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.61 % (25397)Memory used [KB]: 5500
% 1.99/1.61 % (25397)Time elapsed: 0.003 s
% 1.99/1.61 % (25397)Instructions burned: 2 (million)
% 1.99/1.61 % (25397)------------------------------
% 1.99/1.61 % (25397)------------------------------
% 1.99/1.61 % (25398)Termination reason: Unknown
% 1.99/1.61 % (25398)Termination phase: Saturation
% 1.99/1.61
% 1.99/1.61 % (25398)Memory used [KB]: 895
% 1.99/1.61 % (25398)Time elapsed: 0.002 s
% 1.99/1.61 % (25398)Instructions burned: 2 (million)
% 1.99/1.61 % (25398)------------------------------
% 1.99/1.61 % (25398)------------------------------
% 1.99/1.61 % (25396)Refutation not found, incomplete strategy
% 1.99/1.61 % (25396)------------------------------
% 1.99/1.61 % (25396)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.61 % (25396)Termination reason: Refutation not found, incomplete strategy
% 1.99/1.61
% 1.99/1.61
% 1.99/1.61 % (25396)Memory used [KB]: 5500
% 1.99/1.61 % (25396)Time elapsed: 0.003 s
% 1.99/1.61 % (25396)Instructions burned: 2 (million)
% 1.99/1.61 % (25396)------------------------------
% 1.99/1.61 % (25396)------------------------------
% 1.99/1.61 % (25394)First to succeed.
% 1.99/1.61 % (25395)Instruction limit reached!
% 1.99/1.61 % (25395)------------------------------
% 1.99/1.61 % (25395)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.61 % (25395)Termination reason: Unknown
% 1.99/1.61 % (25395)Termination phase: Saturation
% 1.99/1.61
% 1.99/1.61 % (25395)Memory used [KB]: 5500
% 1.99/1.61 % (25395)Time elapsed: 0.005 s
% 1.99/1.61 % (25395)Instructions burned: 5 (million)
% 1.99/1.61 % (25395)------------------------------
% 1.99/1.61 % (25395)------------------------------
% 1.99/1.61 % (25400)Also succeeded, but the first one will report.
% 1.99/1.62 % (25394)Refutation found. Thanks to Tanya!
% 1.99/1.62 % SZS status Theorem for DTF2THF_25296
% 1.99/1.62 % SZS output start Proof for DTF2THF_25296
% 1.99/1.62 thf(func_def_0, type, num: $tType).
% 1.99/1.62 thf(func_def_1, type, holdsDuring_THFTYPE_IiooI: $i > $o > $o).
% 1.99/1.62 thf(func_def_5, type, lYearFn_THFTYPE_IiiI: $i > $i).
% 1.99/1.62 thf(func_def_6, type, likes_THFTYPE_IiioI: $i > $i > $o).
% 1.99/1.62 thf(func_def_16, type, ph1: !>[X0: $tType]:(X0)).
% 1.99/1.62 thf(f74,plain,(
% 1.99/1.62 $false),
% 1.99/1.62 inference(avatar_sat_refutation,[status(thm)],[f30,f32,f52,f71,f73])).
% 1.99/1.62 thf(f73,plain,(
% 1.99/1.62 ~spl0_3),
% 1.99/1.62 inference(avatar_contradiction_clause,[status(thm)],[f72])).
% 1.99/1.62 thf(f72,plain,(
% 1.99/1.62 $false | ~spl0_3),
% 1.99/1.62 inference(equality_resolution,[status(thm)],[f48])).
% 1.99/1.62 thf(f48,plain,(
% 1.99/1.62 ( ! [X0 : $i] : ((n2009_THFTYPE_i != X0)) ) | ~spl0_3),
% 1.99/1.62 inference(avatar_component_clause,[status(thm)],[f47])).
% 1.99/1.62 thf(f47,definition,(
% 1.99/1.62 spl0_3 <=> ! [X0 : $i] : (n2009_THFTYPE_i != X0)),
% 1.99/1.62 introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.99/1.62 thf(f71,plain,(
% 1.99/1.62 ~spl0_4),
% 1.99/1.62 inference(avatar_contradiction_clause,[status(thm)],[f70])).
% 1.99/1.62 thf(f70,plain,(
% 1.99/1.62 $false | ~spl0_4),
% 1.99/1.62 inference(trivial_inequality_removal,[status(thm)],[f67])).
% 1.99/1.62 thf(f67,plain,(
% 1.99/1.62 ($true = $false) | ~spl0_4),
% 1.99/1.62 inference(superposition,[status(thm)],[f20,f51])).
% 1.99/1.62 thf(f51,plain,(
% 1.99/1.62 ( ! [X2 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) = $false)) ) | ~spl0_4),
% 1.99/1.62 inference(avatar_component_clause,[status(thm)],[f50])).
% 1.99/1.62 thf(f50,definition,(
% 1.99/1.62 spl0_4 <=> ! [X2 : $i] : ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) = $false)),
% 1.99/1.62 introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition])).
% 1.99/1.62 thf(f20,plain,(
% 1.99/1.62 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.99/1.62 inference(cnf_transformation,[status(thm)],[f8])).
% 1.99/1.62 thf(f8,plain,(
% 1.99/1.62 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.99/1.62 inference(fool_elimination,[status(thm)],[f7])).
% 1.99/1.62 thf(f7,plain,(
% 1.99/1.62 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.99/1.62 inference(rectify,[status(thm)],[f1])).
% 1.99/1.62 thf(f1,axiom,(
% 1.99/1.62 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.99/1.62 file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax)).
% 1.99/1.62 thf(f52,plain,(
% 1.99/1.62 spl0_3 | spl0_4 | ~spl0_1),
% 1.99/1.62 inference(avatar_split_clause,[status(thm)],[f45,f25,f50,f47])).
% 1.99/1.62 thf(f25,definition,(
% 1.99/1.62 spl0_1 <=> ! [X2 : $i] : ($true != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2))),
% 1.99/1.62 introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.99/1.62 thf(f45,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) = $false) | (n2009_THFTYPE_i != X0)) ) | ~spl0_1),
% 1.99/1.62 inference(subsumption_resolution,[status(thm)],[f44,f26])).
% 1.99/1.62 thf(f26,plain,(
% 1.99/1.62 ( ! [X2 : $i] : (($true != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2))) ) | ~spl0_1),
% 1.99/1.62 inference(avatar_component_clause,[status(thm)],[f25])).
% 1.99/1.62 thf(f44,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) | (n2009_THFTYPE_i != X0) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) = $false)) ) | ~spl0_1),
% 1.99/1.62 inference(subsumption_resolution,[status(thm)],[f43,f26])).
% 1.99/1.62 thf(f43,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((n2009_THFTYPE_i != X0) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) = $false) | ($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2)) | ($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) )),
% 1.99/1.62 inference(binary_proxy_clausification,[status(thm)],[f42])).
% 1.99/1.62 thf(f42,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X2) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2))) | (n2009_THFTYPE_i != X0) | ($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1))) )),
% 1.99/1.62 inference(beta_eta_normalization,[status(thm)],[f41])).
% 1.99/1.62 thf(f41,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))) @ X2)) | ($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) | (n2009_THFTYPE_i != X0)) )),
% 1.99/1.62 inference(pi_clausification,[status(thm)],[f35])).
% 1.99/1.62 thf(f35,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $i] : (($true = (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) | ($true = (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))) | (n2009_THFTYPE_i != X0)) )),
% 1.99/1.62 inference(binary_proxy_clausification,[status(thm)],[f34])).
% 1.99/1.62 thf(f34,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0)))) != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) | (n2009_THFTYPE_i != X0)) )),
% 1.99/1.62 inference(trivial_inequality_removal,[status(thm)],[f33])).
% 1.99/1.62 thf(f33,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0)))) != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) | ($true != $true) | (n2009_THFTYPE_i != X0)) )),
% 1.99/1.62 inference(constrained_superposition,[status(thm)],[f19,f17])).
% 1.99/1.62 thf(f17,plain,(
% 1.99/1.62 ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))))),
% 1.99/1.62 inference(cnf_transformation,[status(thm)],[f12])).
% 1.99/1.62 thf(f12,plain,(
% 1.99/1.62 ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))))),
% 1.99/1.62 inference(fool_elimination,[status(thm)],[f11])).
% 1.99/1.62 thf(f11,plain,(
% 1.99/1.62 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ! [X0 : $i] : ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.99/1.62 inference(rectify,[status(thm)],[f2])).
% 1.99/1.62 thf(f2,axiom,(
% 1.99/1.62 (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ! [X0 : $i] : ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.99/1.62 file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax_001)).
% 1.99/1.62 thf(f19,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $i] : (($true != (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X1) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))) )),
% 1.99/1.62 inference(cnf_transformation,[status(thm)],[f15])).
% 1.99/1.62 thf(f15,plain,(
% 1.99/1.62 ! [X0 : $i,X1 : $i] : ($true != (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X1) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.99/1.62 inference(ennf_transformation,[status(thm)],[f14])).
% 1.99/1.62 thf(f14,plain,(
% 1.99/1.62 ~? [X0 : $i,X1 : $i] : ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X1) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.99/1.62 inference(fool_elimination,[status(thm)],[f13])).
% 1.99/1.62 thf(f13,plain,(
% 1.99/1.62 ~? [X0 : $i,X1 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X1) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.99/1.62 inference(rectify,[status(thm)],[f5])).
% 1.99/1.62 thf(f5,negated_conjecture,(
% 1.99/1.62 ~? [X0 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X2) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.99/1.62 inference(negated_conjecture,[status(cth)],[f4])).
% 1.99/1.62 thf(f4,conjecture,(
% 1.99/1.62 ? [X0 : $i,X2 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ X2) @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.99/1.62 file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',con)).
% 1.99/1.62 thf(f32,plain,(
% 1.99/1.62 ~spl0_2),
% 1.99/1.62 inference(avatar_contradiction_clause,[status(thm)],[f31])).
% 1.99/1.62 thf(f31,plain,(
% 1.99/1.62 $false | ~spl0_2),
% 1.99/1.62 inference(equality_resolution,[status(thm)],[f29])).
% 1.99/1.62 thf(f29,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $i] : (((lYearFn_THFTYPE_IiiI @ X0) != X1)) ) | ~spl0_2),
% 1.99/1.62 inference(avatar_component_clause,[status(thm)],[f28])).
% 1.99/1.62 thf(f28,definition,(
% 1.99/1.62 spl0_2 <=> ! [X0 : $i,X1 : $i] : ((lYearFn_THFTYPE_IiiI @ X0) != X1)),
% 1.99/1.62 introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.99/1.62 thf(f30,plain,(
% 1.99/1.62 spl0_1 | spl0_2),
% 1.99/1.62 inference(avatar_split_clause,[status(thm)],[f23,f28,f25])).
% 1.99/1.62 thf(f23,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((lYearFn_THFTYPE_IiiI @ X0) != X1) | ($true != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2))) )),
% 1.99/1.62 inference(trivial_inequality_removal,[status(thm)],[f22])).
% 1.99/1.62 thf(f22,plain,(
% 1.99/1.62 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2)) | ($true != $true) | ((lYearFn_THFTYPE_IiiI @ X0) != X1)) )),
% 1.99/1.62 inference(constrained_superposition,[status(thm)],[f19,f21])).
% 1.99/1.62 thf(f21,plain,(
% 1.99/1.62 ( ! [X0 : $i] : (($true = (holdsDuring_THFTYPE_IiooI @ X0 @ $true))) )),
% 1.99/1.62 inference(equality_resolution,[status(thm)],[f18])).
% 1.99/1.62 thf(f18,plain,(
% 1.99/1.62 ( ! [X0 : $i,X1 : $o] : (($true != X1) | ($true = (holdsDuring_THFTYPE_IiooI @ X0 @ X1))) )),
% 1.99/1.62 inference(cnf_transformation,[status(thm)],[f16])).
% 1.99/1.62 thf(f16,plain,(
% 1.99/1.62 ! [X0 : $i,X1 : $o] : (($true != X1) | ($true = (holdsDuring_THFTYPE_IiooI @ X0 @ X1)))),
% 1.99/1.62 inference(ennf_transformation,[status(thm)],[f10])).
% 1.99/1.62 thf(f10,plain,(
% 1.99/1.62 ! [X0 : $i,X1 : $o] : (($true = X1) => ($true = (holdsDuring_THFTYPE_IiooI @ X0 @ X1)))),
% 1.99/1.62 inference(fool_elimination,[status(thm)],[f9])).
% 1.99/1.62 thf(f9,plain,(
% 1.99/1.62 ! [X0 : $i,X1 : $o] : (X1 => (holdsDuring_THFTYPE_IiooI @ X0 @ X1))),
% 1.99/1.62 inference(rectify,[status(thm)],[f3])).
% 1.99/1.62 thf(f3,axiom,(
% 1.99/1.62 ! [X2 : $i,X1 : $o] : (X1 => (holdsDuring_THFTYPE_IiooI @ X2 @ X1))),
% 1.99/1.62 file('/export/starexec/sandbox/tmp/tmp.BU4LSaOHva/DTF2THF_25296.p',ax_002)).
% 1.99/1.62 % SZS output end Proof for DTF2THF_25296
% 1.99/1.62 % (25394)------------------------------
% 1.99/1.62 % (25394)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.99/1.62 % (25394)Termination reason: Refutation
% 1.99/1.62
% 1.99/1.62 % (25394)Memory used [KB]: 5500
% 1.99/1.62 % (25394)Time elapsed: 0.005 s
% 1.99/1.62 % (25394)Instructions burned: 4 (million)
% 1.99/1.62 % (25394)------------------------------
% 1.99/1.62 % (25394)------------------------------
% 1.99/1.62 % (25393)Success in time 0.016 s
%------------------------------------------------------------------------------