%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : CSR139^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 : n018.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:07 AM UTC 2026
% Result : Theorem 1.68s 1.44s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 163 ( 48 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 122 ( 30 ~; 14 |; 8 &; 70 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 14 ^; 20 !; 12 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
num: $tType ).
thf(func_def_7,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_8,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_15,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f162,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[f161]) ).
thf(f161,plain,
$false = $true,
inference(boolean_simplification,[status(thm)],[f154]) ).
thf(f154,plain,
( ( ~ $true ) = $true ),
inference(superposition,[status(thm)],[f42,f151]) ).
thf(f151,plain,
! [X2: $i,X1: $i] :
( ( likes_THFTYPE_IiioI @ X1 @ X2 )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f150]) ).
thf(f150,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] : $true
@ X2 )
= ( likes_THFTYPE_IiioI @ X1 @ X2 ) ),
inference(argument_congruence,[status(thm)],[f146]) ).
thf(f146,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ X1 )
= ( ^ [Y0: $i] : $true ) ),
inference(beta_eta_normalization,[status(thm)],[f143]) ).
thf(f143,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ X1 )
= ( ^ [Y0: $i,Y1: $i] : $true
@ X1 ) ),
inference(argument_congruence,[status(thm)],[f105]) ).
thf(f105,plain,
( likes_THFTYPE_IiioI
= ( ^ [Y0: $i,Y1: $i] : $true ) ),
inference(forward_demodulation,[status(thm)],[f81,f88]) ).
thf(f88,plain,
likes_THFTYPE_IiioI = parent_THFTYPE_IiioI,
inference(trivial_inequality_removal,[status(thm)],[f77]) ).
thf(f77,plain,
( ( $true != $true )
| ( likes_THFTYPE_IiioI = parent_THFTYPE_IiioI ) ),
inference(superposition,[status(thm)],[f56,f37]) ).
thf(f37,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[status(thm)],[f31]) ).
thf(f31,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[status(thm)],[f30]) ).
thf(f30,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_002) ).
thf(f56,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( parent_THFTYPE_IiioI = X0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f50]) ).
thf(f50,plain,
! [X0: $i > $i > $o] :
( ( $true != $true )
| ( parent_THFTYPE_IiioI = X0 )
| ( $true
!= ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(superposition,[status(thm)],[f44,f39]) ).
thf(f39,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(fool_elimination,[status(thm)],[f14]) ).
thf(f14,plain,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i,
inference(rectify,[status(thm)],[f9]) ).
thf(f9,axiom,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_008) ).
thf(f44,plain,
! [X2: $i > $i > $o,X0: $i,X1: $i > $i > $o] :
( ( ( X2 @ X0 @ lAnna_THFTYPE_i )
!= $true )
| ( X1 = X2 )
| ( ( X1 @ X0 @ lBill_THFTYPE_i )
!= $true ) ),
inference(equality_proxy_clausification,[status(thm)],[f43]) ).
thf(f43,plain,
! [X2: $i > $i > $o,X0: $i,X1: $i > $i > $o] :
( ( ( X1 @ X0 @ lBill_THFTYPE_i )
!= $true )
| ( $true
= ( X1 = X2 ) )
| ( ( X2 @ X0 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f41]) ).
thf(f41,plain,
! [X2: $i > $i > $o,X0: $i,X1: $i > $i > $o] :
( ( ( X2 @ X0 @ lAnna_THFTYPE_i )
!= $true )
| ( ( X1 @ X0 @ lBill_THFTYPE_i )
!= $true )
| ( ( X1 != X2 )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f36]) ).
thf(f36,plain,
! [X0: $i,X1: $i > $i > $o,X2: $i > $i > $o] :
( ( ( X1 @ X0 @ lBill_THFTYPE_i )
!= $true )
| ( ( X1 != X2 )
!= $true )
| ( ( X2 @ X0 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[status(thm)],[f29]) ).
thf(f29,plain,
~ ? [X0: $i,X1: $i > $i > $o,X2: $i > $i > $o] :
( ( ( X1 @ X0 @ lBill_THFTYPE_i )
= $true )
& ( ( X1 != X2 )
= $true )
& ( ( X2 @ X0 @ lAnna_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[status(thm)],[f28]) ).
thf(f28,plain,
~ ? [X0: $i,X1: $i > $i > $o,X2: $i > $i > $o] :
( ( X1 != X2 )
& ( X1 @ X0 @ lBill_THFTYPE_i )
& ( X2 @ X0 @ lAnna_THFTYPE_i ) ),
inference(rectify,[status(thm)],[f12]) ).
thf(f12,negated_conjecture,
~ ? [X2: $i,X1: $i > $i > $o,X0: $i > $i > $o] :
( ( X0 != X1 )
& ( X1 @ X2 @ lBill_THFTYPE_i )
& ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
thf(f11,conjecture,
? [X2: $i,X1: $i > $i > $o,X0: $i > $i > $o] :
( ( X0 != X1 )
& ( X1 @ X2 @ lBill_THFTYPE_i )
& ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',con) ).
thf(f81,plain,
( parent_THFTYPE_IiioI
= ( ^ [Y0: $i,Y1: $i] : $true ) ),
inference(trivial_inequality_removal,[status(thm)],[f80]) ).
thf(f80,plain,
( ( $true != $true )
| ( parent_THFTYPE_IiioI
= ( ^ [Y0: $i,Y1: $i] : $true ) ) ),
inference(beta_eta_normalization,[status(thm)],[f74]) ).
thf(f74,plain,
( ( parent_THFTYPE_IiioI
= ( ^ [Y0: $i,Y1: $i] : $true ) )
| ( ( ^ [Y0: $i,Y1: $i] : $true
@ lMary_THFTYPE_i
@ lBill_THFTYPE_i )
!= $true ) ),
inference(primitive_instantiation,[status(thm)],[f56]) ).
thf(f42,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[status(thm)],[f24]) ).
thf(f24,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_001) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR139^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 : n018.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:51:16 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.30/0.48 ---- Original DTF file ---
% 0.30/0.48 thf(spec,logic,$$dhol).
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 % File : CSR139^1 : TPTP v9.2.1. Released v4.1.0.
% 0.30/0.48 % Domain : Commonsense Reasoning
% 0.30/0.48 % Problem : Different feelings from people to Bill and Anna
% 0.30/0.48 % Version : Especial.
% 0.30/0.48 % English : Do there exists different relations ?R and ?Q so that ?R holds
% 0.30/0.48 % between a person ?Y and Bill and ?Q between ?Y and Anna.
% 0.30/0.48
% 0.30/0.48 % Refs : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.30/0.48 % Source : [Ben10]
% 0.30/0.48 % Names : rv_5.tq_SUMO_local [Ben10]
% 0.30/0.48
% 0.30/0.48 % Status : Theorem
% 0.30/0.48 % Rating : 0.11 v9.1.0, 0.12 v9.0.0, 0.10 v8.2.0, 0.23 v8.1.0, 0.18 v7.5.0, 0.14 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.14 v6.1.0, 0.57 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.0.0, 0.60 v4.1.0
% 0.30/0.48 % Syntax : Number of formulae : 20 ( 7 unt; 9 typ; 0 def)
% 0.30/0.48 % Number of atoms : 15 ( 1 equ; 4 cnn)
% 0.30/0.48 % Maximal formula atoms : 2 ( 1 avg)
% 0.30/0.48 % Number of connectives : 34 ( 4 ~; 0 |; 2 &; 28 @)
% 0.30/0.48 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.30/0.48 % Maximal formula depth : 8 ( 4 avg)
% 0.30/0.48 % Number of types : 3 ( 1 usr)
% 0.30/0.48 % Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% 0.30/0.48 % Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% 0.30/0.48 % Number of variables : 3 ( 0 ^; 0 !; 3 ?; 3 :)
% 0.30/0.48 % SPC : TH0_THM_EQU_NAR
% 0.30/0.48
% 0.30/0.48 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.30/0.48 % Initally the problem has been hand generated in KIF syntax in
% 0.30/0.48 % SigmaKEE and then automatically translated by Benzmueller's
% 0.30/0.48 % KIF2TH0 translator into THF syntax.
% 0.30/0.48 % : The translation has been applied in two modes: local and SInE.
% 0.30/0.48 % The local mode only translates the local assumptions and the
% 0.30/0.48 % query. The SInE mode additionally translates the SInE-extract
% 0.30/0.48 % of the loaded knowledge base (usually SUMO).
% 0.30/0.48 % : The examples are selected to illustrate the benefits of
% 0.30/0.48 % higher-order reasoning in ontology reasoning.
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 %----The extracted signature
% 0.30/0.48 thf(numbers,type,
% 0.30/0.48 num: $tType ).
% 0.30/0.48
% 0.30/0.48 thf(lAnna_THFTYPE_i,type,
% 0.30/0.48 lAnna_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(lBen_THFTYPE_i,type,
% 0.30/0.48 lBen_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(lBill_THFTYPE_i,type,
% 0.30/0.48 lBill_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(lBob_THFTYPE_i,type,
% 0.30/0.48 lBob_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(lMary_THFTYPE_i,type,
% 0.30/0.48 lMary_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(lSue_THFTYPE_i,type,
% 0.30/0.48 lSue_THFTYPE_i: $i ).
% 0.30/0.48
% 0.30/0.48 thf(likes_THFTYPE_IiioI,type,
% 0.30/0.48 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.30/0.48
% 0.30/0.48 thf(parent_THFTYPE_IiioI,type,
% 0.30/0.48 parent_THFTYPE_IiioI: $i > $i > $o ).
% 0.30/0.48
% 0.30/0.48 %----The translated axioms
% 0.30/0.48 thf(ax,axiom,
% 0.30/0.48 likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_001,axiom,
% 0.30/0.48 (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ).
% 0.30/0.48
% 0.30/0.48 thf(ax_002,axiom,
% 0.30/0.48 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_003,axiom,
% 0.30/0.48 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_004,axiom,
% 0.30/0.48 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_005,axiom,
% 0.30/0.48 (~) @ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i ) ).
% 0.30/0.48
% 0.30/0.48 thf(ax_006,axiom,
% 0.30/0.48 likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_007,axiom,
% 0.30/0.48 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_008,axiom,
% 0.30/0.48 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.30/0.48
% 0.30/0.48 thf(ax_009,axiom,
% 0.30/0.48 (~) @ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ).
% 0.30/0.48
% 0.30/0.48 %----The translated conjecture
% 0.30/0.48 thf(con,conjecture,
% 0.30/0.48 ? [Q: $i > $i > $o,R: $i > $i > $o,Y: $i] :
% 0.30/0.48 ( ( R @ Y @ lBill_THFTYPE_i )
% 0.30/0.48 & ( Q @ Y @ lAnna_THFTYPE_i )
% 0.30/0.48 & ( (~) @ ( R = Q ) ) ) ).
% 0.30/0.48
% 0.30/0.48 %------------------------------------------------------------------------------
% 0.30/0.48 ------------------------
% 1.68/1.40 ---- Embedded in THF ---
% 1.68/1.40 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.68/1.40 %%% Generated on Tue Feb 24 05:51:17 EST 2026
% 1.68/1.40 %%% using '$$dhol' embedding, version 1.3.0.
% 1.68/1.40 %%% Logic specification used:
% 1.68/1.40 %%% thf(spec, logic, $$dhol).
% 1.68/1.40
% 1.68/1.40 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2DTF16606.p
% See solution above
% 1.68/1.40 ------------------------
% 1.68/1.41 ---- Cleaned THF ---
% 1.68/1.41 thf(numbers,type,
% 1.68/1.41 num: $tType ).
% 1.68/1.41
% 1.68/1.41 thf(lAnna_THFTYPE_i,type,
% 1.68/1.41 lAnna_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(lBen_THFTYPE_i,type,
% 1.68/1.41 lBen_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(lBill_THFTYPE_i,type,
% 1.68/1.41 lBill_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(lBob_THFTYPE_i,type,
% 1.68/1.41 lBob_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(lMary_THFTYPE_i,type,
% 1.68/1.41 lMary_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(lSue_THFTYPE_i,type,
% 1.68/1.41 lSue_THFTYPE_i: $i ).
% 1.68/1.41
% 1.68/1.41 thf(likes_THFTYPE_IiioI,type,
% 1.68/1.41 likes_THFTYPE_IiioI: $i > $i > $o ).
% 1.68/1.41
% 1.68/1.41 thf(parent_THFTYPE_IiioI,type,
% 1.68/1.41 parent_THFTYPE_IiioI: $i > $i > $o ).
% 1.68/1.41
% 1.68/1.41 thf(ax,axiom,
% 1.68/1.41 likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_001,axiom,
% 1.68/1.41 (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ).
% 1.68/1.41
% 1.68/1.41 thf(ax_002,axiom,
% 1.68/1.41 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_003,axiom,
% 1.68/1.41 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_004,axiom,
% 1.68/1.41 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_005,axiom,
% 1.68/1.41 (~) @ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i ) ).
% 1.68/1.41
% 1.68/1.41 thf(ax_006,axiom,
% 1.68/1.41 likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_007,axiom,
% 1.68/1.41 parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_008,axiom,
% 1.68/1.41 parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i ).
% 1.68/1.41
% 1.68/1.41 thf(ax_009,axiom,
% 1.68/1.41 (~) @ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ).
% 1.68/1.41
% 1.68/1.41 thf(con,conjecture,
% 1.68/1.41 ? [Q: $i > $i > $o,R: $i > $i > $o,Y: $i] :
% 1.68/1.41 ( ( R @ Y @ lBill_THFTYPE_i )
% 1.68/1.41 & ( Q @ Y @ lAnna_THFTYPE_i )
% 1.68/1.41 & ( (~) @ ( R = Q ) ) ) ).
% 1.68/1.41 ------------------------
% 1.68/1.43 % (16703)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_16606 for (2999ds/183Mi)
% 1.68/1.43 % (16706)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_16606 for (2999ds/2Mi)
% 1.68/1.43 % (16704)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_16606 for (2999ds/4Mi)
% 1.68/1.43 % (16705)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_16606 for (2999ds/27Mi)
% 1.68/1.43 % (16707)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_16606 for (2999ds/2Mi)
% 1.68/1.43 % (16708)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_16606 for (2999ds/275Mi)
% 1.68/1.43 % (16709)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_16606 for (2999ds/18Mi)
% 1.68/1.43 % (16706)Instruction limit reached!
% 1.68/1.43 % (16706)------------------------------
% 1.68/1.43 % (16706)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.43 % (16706)Termination reason: Unknown
% 1.68/1.43 % (16707)Instruction limit reached!
% 1.68/1.43 % (16707)------------------------------
% 1.68/1.43 % (16707)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.43 % (16706)Termination phase: Saturation
% 1.68/1.43
% 1.68/1.43 % (16706)Memory used [KB]: 5500
% 1.68/1.43 % (16706)Time elapsed: 0.003 s
% 1.68/1.43 % (16706)Instructions burned: 2 (million)
% 1.68/1.43 % (16706)------------------------------
% 1.68/1.43 % (16706)------------------------------
% 1.68/1.43 % (16707)Termination reason: Unknown
% 1.68/1.43 % (16707)Termination phase: Saturation
% 1.68/1.43
% 1.68/1.43 % (16707)Memory used [KB]: 5500
% 1.68/1.43 % (16707)Time elapsed: 0.003 s
% 1.68/1.43 % (16707)Instructions burned: 3 (million)
% 1.68/1.43 % (16707)------------------------------
% 1.68/1.43 % (16707)------------------------------
% 1.68/1.43 % (16704)Instruction limit reached!
% 1.68/1.43 % (16704)------------------------------
% 1.68/1.43 % (16704)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.43 % (16704)Termination reason: Unknown
% 1.68/1.43 % (16704)Termination phase: Saturation
% 1.68/1.43
% 1.68/1.43 % (16704)Memory used [KB]: 5500
% 1.68/1.43 % (16704)Time elapsed: 0.004 s
% 1.68/1.43 % (16704)Instructions burned: 4 (million)
% 1.68/1.43 % (16704)------------------------------
% 1.68/1.43 % (16704)------------------------------
% 1.68/1.44 % (16708)First to succeed.
% 1.68/1.44 % (16705)Refutation not found, incomplete strategy
% 1.68/1.44 % (16705)------------------------------
% 1.68/1.44 % (16705)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.44 % (16705)Termination reason: Refutation not found, incomplete strategy
% 1.68/1.44
% 1.68/1.44
% 1.68/1.44 % (16705)Memory used [KB]: 5500
% 1.68/1.44 % (16705)Time elapsed: 0.009 s
% 1.68/1.44 % (16705)Instructions burned: 13 (million)
% 1.68/1.44 % (16705)------------------------------
% 1.68/1.44 % (16705)------------------------------
% 1.68/1.44 % (16708)Refutation found. Thanks to Tanya!
% 1.68/1.44 % SZS status Theorem for DTF2THF_16606
% 1.68/1.44 % SZS output start Proof for DTF2THF_16606
% 1.68/1.44 thf(func_def_0, type, num: $tType).
% 1.68/1.44 thf(func_def_7, type, likes_THFTYPE_IiioI: $i > $i > $o).
% 1.68/1.44 thf(func_def_8, type, parent_THFTYPE_IiioI: $i > $i > $o).
% 1.68/1.44 thf(func_def_15, type, ph1: !>[X0: $tType]:(X0)).
% 1.68/1.44 thf(f162,plain,(
% 1.68/1.44 $false),
% 1.68/1.44 inference(trivial_inequality_removal,[status(thm)],[f161])).
% 1.68/1.44 thf(f161,plain,(
% 1.68/1.44 ($false = $true)),
% 1.68/1.44 inference(boolean_simplification,[status(thm)],[f154])).
% 1.68/1.44 thf(f154,plain,(
% 1.68/1.44 ((~ $true) = $true)),
% 1.68/1.44 inference(superposition,[status(thm)],[f42,f151])).
% 1.68/1.44 thf(f151,plain,(
% 1.68/1.44 ( ! [X2 : $i,X1 : $i] : (((likes_THFTYPE_IiioI @ X1 @ X2) = $true)) )),
% 1.68/1.44 inference(beta_eta_normalization,[status(thm)],[f150])).
% 1.68/1.44 thf(f150,plain,(
% 1.68/1.44 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ($true)) @ X2) = (likes_THFTYPE_IiioI @ X1 @ X2))) )),
% 1.68/1.44 inference(argument_congruence,[status(thm)],[f146])).
% 1.68/1.44 thf(f146,plain,(
% 1.68/1.44 ( ! [X1 : $i] : (((likes_THFTYPE_IiioI @ X1) = (^[Y0 : $i]: ($true)))) )),
% 1.68/1.44 inference(beta_eta_normalization,[status(thm)],[f143])).
% 1.68/1.44 thf(f143,plain,(
% 1.68/1.44 ( ! [X1 : $i] : (((likes_THFTYPE_IiioI @ X1) = ((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ X1))) )),
% 1.68/1.44 inference(argument_congruence,[status(thm)],[f105])).
% 1.68/1.44 thf(f105,plain,(
% 1.68/1.44 (likes_THFTYPE_IiioI = (^[Y0 : $i]: ((^[Y1 : $i]: ($true)))))),
% 1.68/1.44 inference(forward_demodulation,[status(thm)],[f81,f88])).
% 1.68/1.44 thf(f88,plain,(
% 1.68/1.44 (likes_THFTYPE_IiioI = parent_THFTYPE_IiioI)),
% 1.68/1.44 inference(trivial_inequality_removal,[status(thm)],[f77])).
% 1.68/1.44 thf(f77,plain,(
% 1.68/1.44 ($true != $true) | (likes_THFTYPE_IiioI = parent_THFTYPE_IiioI)),
% 1.68/1.44 inference(superposition,[status(thm)],[f56,f37])).
% 1.68/1.44 thf(f37,plain,(
% 1.68/1.44 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.68/1.44 inference(cnf_transformation,[status(thm)],[f31])).
% 1.68/1.44 thf(f31,plain,(
% 1.68/1.44 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.68/1.44 inference(fool_elimination,[status(thm)],[f30])).
% 1.68/1.44 thf(f30,plain,(
% 1.68/1.44 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.68/1.44 inference(rectify,[status(thm)],[f3])).
% 1.68/1.44 thf(f3,axiom,(
% 1.68/1.44 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.68/1.44 file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_002)).
% 1.68/1.44 thf(f56,plain,(
% 1.68/1.44 ( ! [X0 : $i > $i > $o] : (($true != (X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (parent_THFTYPE_IiioI = X0)) )),
% 1.68/1.44 inference(trivial_inequality_removal,[status(thm)],[f50])).
% 1.68/1.44 thf(f50,plain,(
% 1.68/1.44 ( ! [X0 : $i > $i > $o] : (($true != $true) | (parent_THFTYPE_IiioI = X0) | ($true != (X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i))) )),
% 1.68/1.44 inference(superposition,[status(thm)],[f44,f39])).
% 1.68/1.44 thf(f39,plain,(
% 1.68/1.44 ((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i) = $true)),
% 1.68/1.44 inference(cnf_transformation,[status(thm)],[f15])).
% 1.68/1.44 thf(f15,plain,(
% 1.68/1.44 ((parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i) = $true)),
% 1.68/1.44 inference(fool_elimination,[status(thm)],[f14])).
% 1.68/1.44 thf(f14,plain,(
% 1.68/1.44 (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)),
% 1.68/1.44 inference(rectify,[status(thm)],[f9])).
% 1.68/1.44 thf(f9,axiom,(
% 1.68/1.44 (parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i)),
% 1.68/1.44 file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_008)).
% 1.68/1.44 thf(f44,plain,(
% 1.68/1.44 ( ! [X2 : $i > $i > $o,X0 : $i,X1 : $i > $i > $o] : (((X2 @ X0 @ lAnna_THFTYPE_i) != $true) | (X1 = X2) | ((X1 @ X0 @ lBill_THFTYPE_i) != $true)) )),
% 1.68/1.44 inference(equality_proxy_clausification,[status(thm)],[f43])).
% 1.68/1.44 thf(f43,plain,(
% 1.68/1.44 ( ! [X2 : $i > $i > $o,X0 : $i,X1 : $i > $i > $o] : (((X1 @ X0 @ lBill_THFTYPE_i) != $true) | ($true = (X1 = X2)) | ((X2 @ X0 @ lAnna_THFTYPE_i) != $true)) )),
% 1.68/1.44 inference(not_proxy_clausification,[status(thm)],[f41])).
% 1.68/1.44 thf(f41,plain,(
% 1.68/1.44 ( ! [X2 : $i > $i > $o,X0 : $i,X1 : $i > $i > $o] : (((X2 @ X0 @ lAnna_THFTYPE_i) != $true) | ((X1 @ X0 @ lBill_THFTYPE_i) != $true) | ((~ (X1 = X2)) != $true)) )),
% 1.68/1.44 inference(cnf_transformation,[status(thm)],[f36])).
% 1.68/1.44 thf(f36,plain,(
% 1.68/1.44 ! [X0 : $i,X1 : $i > $i > $o,X2 : $i > $i > $o] : (((X1 @ X0 @ lBill_THFTYPE_i) != $true) | ((~ (X1 = X2)) != $true) | ((X2 @ X0 @ lAnna_THFTYPE_i) != $true))),
% 1.68/1.44 inference(ennf_transformation,[status(thm)],[f29])).
% 1.68/1.44 thf(f29,plain,(
% 1.68/1.44 ~? [X0 : $i,X1 : $i > $i > $o,X2 : $i > $i > $o] : (((X1 @ X0 @ lBill_THFTYPE_i) = $true) & ((~ (X1 = X2)) = $true) & ((X2 @ X0 @ lAnna_THFTYPE_i) = $true))),
% 1.68/1.44 inference(fool_elimination,[status(thm)],[f28])).
% 1.68/1.44 thf(f28,plain,(
% 1.68/1.44 ~? [X0 : $i,X1 : $i > $i > $o,X2 : $i > $i > $o] : ((~ (X1 = X2)) & (X1 @ X0 @ lBill_THFTYPE_i) & (X2 @ X0 @ lAnna_THFTYPE_i))),
% 1.68/1.44 inference(rectify,[status(thm)],[f12])).
% 1.68/1.44 thf(f12,negated_conjecture,(
% 1.68/1.44 ~? [X2 : $i,X1 : $i > $i > $o,X0 : $i > $i > $o] : ((~ (X0 = X1)) & (X1 @ X2 @ lBill_THFTYPE_i) & (X0 @ X2 @ lAnna_THFTYPE_i))),
% 1.68/1.44 inference(negated_conjecture,[status(cth)],[f11])).
% 1.68/1.44 thf(f11,conjecture,(
% 1.68/1.44 ? [X2 : $i,X1 : $i > $i > $o,X0 : $i > $i > $o] : ((~ (X0 = X1)) & (X1 @ X2 @ lBill_THFTYPE_i) & (X0 @ X2 @ lAnna_THFTYPE_i))),
% 1.68/1.44 file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',con)).
% 1.68/1.44 thf(f81,plain,(
% 1.68/1.44 (parent_THFTYPE_IiioI = (^[Y0 : $i]: ((^[Y1 : $i]: ($true)))))),
% 1.68/1.44 inference(trivial_inequality_removal,[status(thm)],[f80])).
% 1.68/1.44 thf(f80,plain,(
% 1.68/1.44 ($true != $true) | (parent_THFTYPE_IiioI = (^[Y0 : $i]: ((^[Y1 : $i]: ($true)))))),
% 1.68/1.44 inference(beta_eta_normalization,[status(thm)],[f74])).
% 1.68/1.44 thf(f74,plain,(
% 1.68/1.44 (parent_THFTYPE_IiioI = (^[Y0 : $i]: ((^[Y1 : $i]: ($true))))) | (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ lMary_THFTYPE_i @ lBill_THFTYPE_i) != $true)),
% 1.68/1.44 inference(primitive_instantiation,[status(thm)],[f56])).
% 1.68/1.44 thf(f42,plain,(
% 1.68/1.44 ((~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i)) = $true)),
% 1.68/1.44 inference(cnf_transformation,[status(thm)],[f25])).
% 1.68/1.44 thf(f25,plain,(
% 1.68/1.44 ((~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i)) = $true)),
% 1.68/1.44 inference(fool_elimination,[status(thm)],[f24])).
% 1.68/1.44 thf(f24,plain,(
% 1.68/1.44 (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i))),
% 1.68/1.44 inference(rectify,[status(thm)],[f2])).
% 1.68/1.44 thf(f2,axiom,(
% 1.68/1.44 (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i))),
% 1.68/1.44 file('/export/starexec/sandbox/tmp/tmp.RcS1H2SaOu/DTF2THF_16606.p',ax_001)).
% 1.68/1.44 % SZS output end Proof for DTF2THF_16606
% 1.68/1.44 % (16708)------------------------------
% 1.68/1.44 % (16708)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.44 % (16708)Termination reason: Refutation
% 1.68/1.44
% 1.68/1.44 % (16708)Memory used [KB]: 5500
% 1.68/1.44 % (16708)Time elapsed: 0.009 s
% 1.68/1.44 % (16708)Instructions burned: 11 (million)
% 1.68/1.44 % (16708)------------------------------
% 1.68/1.44 % (16708)------------------------------
% 1.68/1.44 % (16702)Success in time 0.023 s
%------------------------------------------------------------------------------