%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : CSR152^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 : n017.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:15 AM UTC 2026
% Result : Theorem 1.56s 1.38s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 214 ( 34 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 159 ( 11 ~; 9 |; 0 &; 125 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 7 con; 0-2 aty)
% ( 5 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 12 ( 6 ^; 6 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
num: $tType ).
thf(func_def_1,type,
knows_THFTYPE_IiooI: $i > $o > $o ).
thf(func_def_6,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_16,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f57,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f55,f22]) ).
thf(f22,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ),
inference(trivial_inequality_removal,[status(thm)],[f21]) ).
thf(f21,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[status(thm)],[f18,f20]) ).
thf(f20,plain,
( $true
= ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
inference(boolean_simplification,[status(thm)],[f19]) ).
thf(f19,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[status(thm)],[f7]) ).
thf(f7,plain,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax) ).
thf(f18,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f15]) ).
thf(f15,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
!= $true ),
inference(flattening,[status(thm)],[f10]) ).
thf(f10,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
!= $true ),
inference(fool_elimination,[status(thm)],[f9]) ).
thf(f9,plain,
~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,negated_conjecture,
~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f4,conjecture,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',con) ).
thf(f55,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(trivial_inequality_removal,[status(thm)],[f51]) ).
thf(f51,plain,
( ( $false = $true )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
inference(superposition,[status(thm)],[f17,f34]) ).
thf(f34,plain,
! [X1: $i] :
( ( $false
= ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
= $true ) ),
inference(subsumption_resolution,[status(thm)],[f33,f22]) ).
thf(f33,plain,
! [X1: $i] :
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
| ( $false
= ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f32]) ).
thf(f32,plain,
! [X1: $i] :
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
| ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
= $true ) ),
inference(beta_eta_normalization,[status(thm)],[f31]) ).
thf(f31,plain,
! [X1: $i] :
( ( ( ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) )
@ X1 )
= $true )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
inference(pi_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[status(thm)],[f24]) ).
thf(f24,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) ) ),
inference(trivial_inequality_removal,[status(thm)],[f23]) ).
thf(f23,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0 ) ) ) )
| ( $true != $true ) ),
inference(constrained_superposition,[status(thm)],[f18,f16]) ).
thf(f16,plain,
( $true
= ( knows_THFTYPE_IiooI @ lChris_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
= ( knows_THFTYPE_IiooI @ lChris_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,
( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
@ ! [X0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,axiom,
( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
@ ! [X0: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax_002) ).
thf(f17,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[status(thm)],[f14]) ).
thf(f14,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[status(thm)],[f13]) ).
thf(f13,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax_001) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : CSR152^1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.10 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.30 % Computer : n017.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Feb 24 05:53:41 EST 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.40 ---- Original DTF file ---
% 0.17/0.40 thf(spec,logic,$$dhol).
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 % File : CSR152^1 : TPTP v9.2.1. Released v4.1.0.
% 0.17/0.40 % Domain : Commonsense Reasoning
% 0.17/0.40 % Problem : Does Chris know that Sue likes Bill?
% 0.17/0.40 % Version : Especial > Reduced > Especial.
% 0.17/0.40 % English : Everybody knows that Chris is equal to Chris. Mary likes Bill.
% 0.17/0.40 % Chris knows that Sue likes whoever Mary likes. Does Chris know
% 0.17/0.40 % that Sue likes Bill?
% 0.17/0.40
% 0.17/0.40 % Refs : [PS07] Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.17/0.40 % : [BP10] Benzmueller & Pease (2010), Progress in Automating Hig
% 0.17/0.40 % : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.17/0.40 % Source : [Ben10]
% 0.17/0.40 % Names : paar_8.tq_SUMO_local [Ben10]
% 0.17/0.40
% 0.17/0.40 % Status : Theorem
% 0.17/0.40 % 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.57 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.40 v5.3.0, 0.60 v4.1.0
% 0.17/0.40 % Syntax : Number of formulae : 11 ( 1 unt; 7 typ; 0 def)
% 0.17/0.40 % Number of atoms : 8 ( 1 equ; 0 cnn)
% 0.17/0.40 % Maximal formula atoms : 3 ( 2 avg)
% 0.17/0.40 % Number of connectives : 15 ( 0 ~; 0 |; 0 &; 14 @)
% 0.17/0.40 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.17/0.40 % Maximal formula depth : 6 ( 4 avg)
% 0.17/0.40 % Number of types : 3 ( 1 usr)
% 0.17/0.40 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.17/0.40 % Number of symbols : 7 ( 6 usr; 4 con; 0-2 aty)
% 0.17/0.40 % Number of variables : 1 ( 0 ^; 1 !; 0 ?; 1 :)
% 0.17/0.40 % SPC : TH0_THM_EQU_NAR
% 0.17/0.40
% 0.17/0.40 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.17/0.40 % Initally the problem has been hand generated in KIF syntax in
% 0.17/0.40 % SigmaKEE and then automatically translated by Benzmueller's
% 0.17/0.40 % KIF2TH0 translator into THF syntax.
% 0.17/0.40 % : The translation has been applied in two modes: local and SInE.
% 0.17/0.40 % The local mode only translates the local assumptions and the
% 0.17/0.40 % query. The SInE mode additionally translates the SInE-extract
% 0.17/0.40 % of the loaded knowledge base (usually SUMO).
% 0.17/0.40 % : The examples are selected to illustrate the benefits of
% 0.17/0.40 % higher-order reasoning in ontology reasoning.
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 %----The extracted Signature
% 0.17/0.40 thf(numbers,type,
% 0.17/0.40 num: $tType ).
% 0.17/0.40
% 0.17/0.40 thf(knows_THFTYPE_IiooI,type,
% 0.17/0.40 knows_THFTYPE_IiooI: $i > $o > $o ).
% 0.17/0.40
% 0.17/0.40 thf(lBill_THFTYPE_i,type,
% 0.17/0.40 lBill_THFTYPE_i: $i ).
% 0.17/0.40
% 0.17/0.40 thf(lChris_THFTYPE_i,type,
% 0.17/0.40 lChris_THFTYPE_i: $i ).
% 0.17/0.40
% 0.17/0.40 thf(lMary_THFTYPE_i,type,
% 0.17/0.40 lMary_THFTYPE_i: $i ).
% 0.17/0.40
% 0.17/0.40 thf(lSue_THFTYPE_i,type,
% 0.17/0.40 lSue_THFTYPE_i: $i ).
% 0.17/0.40
% 0.17/0.40 thf(likes_THFTYPE_IiioI,type,
% 0.17/0.40 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.17/0.40
% 0.17/0.40 %----The translated axioms
% 0.17/0.40 thf(ax,axiom,
% 0.17/0.40 knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ) ).
% 0.17/0.40
% 0.17/0.40 thf(ax_001,axiom,
% 0.17/0.40 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.17/0.40
% 0.17/0.40 thf(ax_002,axiom,
% 0.17/0.40 ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
% 0.17/0.40 @ ! [X: $i] :
% 0.17/0.40 ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 0.17/0.40 => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.17/0.40
% 0.17/0.40 %----The translated conjectures
% 0.17/0.40 thf(con,conjecture,
% 0.17/0.40 knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ).
% 0.17/0.40
% 0.17/0.40 %------------------------------------------------------------------------------
% 0.17/0.40 ------------------------
% 1.56/1.35 ---- Embedded in THF ---
% 1.56/1.35 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.56/1.35 %%% Generated on Tue Feb 24 05:53:41 EST 2026
% 1.56/1.35 %%% using '$$dhol' embedding, version 1.3.0.
% 1.56/1.35 %%% Logic specification used:
% 1.56/1.35 %%% thf(spec, logic, $$dhol).
% 1.56/1.35
% 1.56/1.35 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2DTF10192.p
% See solution above
% 1.56/1.35 ------------------------
% 1.56/1.36 ---- Cleaned THF ---
% 1.56/1.36 thf(numbers,type,
% 1.56/1.36 num: $tType ).
% 1.56/1.36
% 1.56/1.36 thf(knows_THFTYPE_IiooI,type,
% 1.56/1.36 knows_THFTYPE_IiooI: $i > $o > $o ).
% 1.56/1.36
% 1.56/1.36 thf(lBill_THFTYPE_i,type,
% 1.56/1.36 lBill_THFTYPE_i: $i ).
% 1.56/1.36
% 1.56/1.36 thf(lChris_THFTYPE_i,type,
% 1.56/1.36 lChris_THFTYPE_i: $i ).
% 1.56/1.36
% 1.56/1.36 thf(lMary_THFTYPE_i,type,
% 1.56/1.36 lMary_THFTYPE_i: $i ).
% 1.56/1.36
% 1.56/1.36 thf(lSue_THFTYPE_i,type,
% 1.56/1.36 lSue_THFTYPE_i: $i ).
% 1.56/1.36
% 1.56/1.36 thf(likes_THFTYPE_IiioI,type,
% 1.56/1.36 likes_THFTYPE_IiioI: $i > $i > $o ).
% 1.56/1.36
% 1.56/1.36 thf(ax,axiom,
% 1.56/1.36 knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ) ).
% 1.56/1.36
% 1.56/1.36 thf(ax_001,axiom,
% 1.56/1.36 likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 1.56/1.36
% 1.56/1.36 thf(ax_002,axiom,
% 1.56/1.36 ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
% 1.56/1.36 @ ! [X: $i] :
% 1.56/1.36 ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 1.56/1.36 => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 1.56/1.36
% 1.56/1.36 thf(con,conjecture,
% 1.56/1.36 knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ).
% 1.56/1.36 ------------------------
% 1.56/1.38 % (10294)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_10192 for (2999ds/2Mi)
% 1.56/1.38 % (10293)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_10192 for (2999ds/2Mi)
% 1.56/1.38 % (10296)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_10192 for (2999ds/18Mi)
% 1.56/1.38 % (10291)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_10192 for (2999ds/4Mi)
% 1.56/1.38 % (10295)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_10192 for (2999ds/275Mi)
% 1.56/1.38 % (10290)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_10192 for (2999ds/183Mi)
% 1.56/1.38 % (10292)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_10192 for (2999ds/27Mi)
% 1.56/1.38 % (10295)Refutation not found, incomplete strategy
% 1.56/1.38 % (10295)------------------------------
% 1.56/1.38 % (10295)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10295)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.38
% 1.56/1.38
% 1.56/1.38 % (10295)Memory used [KB]: 5500
% 1.56/1.38 % (10295)Time elapsed: 0.003 s
% 1.56/1.38 % (10295)Instructions burned: 1 (million)
% 1.56/1.38 % (10295)------------------------------
% 1.56/1.38 % (10295)------------------------------
% 1.56/1.38 % (10293)Refutation not found, incomplete strategy
% 1.56/1.38 % (10293)------------------------------
% 1.56/1.38 % (10293)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10293)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.38
% 1.56/1.38
% 1.56/1.38 % (10293)Memory used [KB]: 5500
% 1.56/1.38 % (10293)Time elapsed: 0.004 s
% 1.56/1.38 % (10293)Instructions burned: 1 (million)
% 1.56/1.38 % (10293)------------------------------
% 1.56/1.38 % (10293)------------------------------
% 1.56/1.38 % (10294)Refutation not found, incomplete strategy
% 1.56/1.38 % (10294)------------------------------
% 1.56/1.38 % (10294)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10294)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.38
% 1.56/1.38
% 1.56/1.38 % (10292)Refutation not found, incomplete strategy
% 1.56/1.38 % (10292)------------------------------
% 1.56/1.38 % (10292)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10294)Memory used [KB]: 5500
% 1.56/1.38 % (10294)Time elapsed: 0.004 s
% 1.56/1.38 % (10294)Instructions burned: 1 (million)
% 1.56/1.38 % (10294)------------------------------
% 1.56/1.38 % (10294)------------------------------
% 1.56/1.38 % (10292)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.38
% 1.56/1.38
% 1.56/1.38 % (10292)Memory used [KB]: 5500
% 1.56/1.38 % (10292)Time elapsed: 0.003 s
% 1.56/1.38 % (10292)Instructions burned: 2 (million)
% 1.56/1.38 % (10292)------------------------------
% 1.56/1.38 % (10292)------------------------------
% 1.56/1.38 % (10291)Refutation not found, incomplete strategy
% 1.56/1.38 % (10291)------------------------------
% 1.56/1.38 % (10291)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10291)Termination reason: Refutation not found, incomplete strategy
% 1.56/1.38
% 1.56/1.38
% 1.56/1.38 % (10291)Memory used [KB]: 5500
% 1.56/1.38 % (10291)Time elapsed: 0.004 s
% 1.56/1.38 % (10291)Instructions burned: 2 (million)
% 1.56/1.38 % (10291)------------------------------
% 1.56/1.38 % (10291)------------------------------
% 1.56/1.38 % (10290)First to succeed.
% 1.56/1.38 % (10296)Also succeeded, but the first one will report.
% 1.56/1.38 % (10290)Refutation found. Thanks to Tanya!
% 1.56/1.38 % SZS status Theorem for DTF2THF_10192
% 1.56/1.38 % SZS output start Proof for DTF2THF_10192
% 1.56/1.38 thf(func_def_0, type, num: $tType).
% 1.56/1.38 thf(func_def_1, type, knows_THFTYPE_IiooI: $i > $o > $o).
% 1.56/1.38 thf(func_def_6, type, likes_THFTYPE_IiioI: $i > $i > $o).
% 1.56/1.38 thf(func_def_16, type, ph1: !>[X0: $tType]:(X0)).
% 1.56/1.38 thf(f57,plain,(
% 1.56/1.38 $false),
% 1.56/1.38 inference(subsumption_resolution,[status(thm)],[f55,f22])).
% 1.56/1.38 thf(f22,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) != $true)),
% 1.56/1.38 inference(trivial_inequality_removal,[status(thm)],[f21])).
% 1.56/1.38 thf(f21,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) != $true) | ($true != $true)),
% 1.56/1.38 inference(constrained_superposition,[status(thm)],[f18,f20])).
% 1.56/1.38 thf(f20,plain,(
% 1.56/1.38 ($true = (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true))),
% 1.56/1.38 inference(boolean_simplification,[status(thm)],[f19])).
% 1.56/1.38 thf(f19,plain,(
% 1.56/1.38 ((knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (lChris_THFTYPE_i = lChris_THFTYPE_i)) = $true)),
% 1.56/1.38 inference(cnf_transformation,[status(thm)],[f8])).
% 1.56/1.38 thf(f8,plain,(
% 1.56/1.38 ((knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (lChris_THFTYPE_i = lChris_THFTYPE_i)) = $true)),
% 1.56/1.38 inference(fool_elimination,[status(thm)],[f7])).
% 1.56/1.38 thf(f7,plain,(
% 1.56/1.38 (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (lChris_THFTYPE_i = lChris_THFTYPE_i))),
% 1.56/1.38 inference(rectify,[status(thm)],[f1])).
% 1.56/1.38 thf(f1,axiom,(
% 1.56/1.38 (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (lChris_THFTYPE_i = lChris_THFTYPE_i))),
% 1.56/1.38 file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax)).
% 1.56/1.38 thf(f18,plain,(
% 1.56/1.38 ((knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) != $true)),
% 1.56/1.38 inference(cnf_transformation,[status(thm)],[f15])).
% 1.56/1.38 thf(f15,plain,(
% 1.56/1.38 ((knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) != $true)),
% 1.56/1.38 inference(flattening,[status(thm)],[f10])).
% 1.56/1.38 thf(f10,plain,(
% 1.56/1.38 ~((knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true)),
% 1.56/1.38 inference(fool_elimination,[status(thm)],[f9])).
% 1.56/1.38 thf(f9,plain,(
% 1.56/1.38 ~(knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))),
% 1.56/1.38 inference(rectify,[status(thm)],[f5])).
% 1.56/1.38 thf(f5,negated_conjecture,(
% 1.56/1.38 ~(knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))),
% 1.56/1.38 inference(negated_conjecture,[status(cth)],[f4])).
% 1.56/1.38 thf(f4,conjecture,(
% 1.56/1.38 (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))),
% 1.56/1.38 file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',con)).
% 1.56/1.38 thf(f55,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.56/1.38 inference(trivial_inequality_removal,[status(thm)],[f51])).
% 1.56/1.38 thf(f51,plain,(
% 1.56/1.38 ($false = $true) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.56/1.38 inference(superposition,[status(thm)],[f17,f34])).
% 1.56/1.38 thf(f34,plain,(
% 1.56/1.38 ( ! [X1 : $i] : (($false = (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1)) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1) = $true)) )),
% 1.56/1.38 inference(subsumption_resolution,[status(thm)],[f33,f22])).
% 1.56/1.38 thf(f33,plain,(
% 1.56/1.38 ( ! [X1 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true) | ($false = (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1)) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1) = $true)) )),
% 1.56/1.38 inference(binary_proxy_clausification,[status(thm)],[f32])).
% 1.56/1.38 thf(f32,plain,(
% 1.56/1.38 ( ! [X1 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true) | (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1)) = $true)) )),
% 1.56/1.38 inference(beta_eta_normalization,[status(thm)],[f31])).
% 1.56/1.38 thf(f31,plain,(
% 1.56/1.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))) @ X1) = $true) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true)) )),
% 1.56/1.38 inference(pi_clausification,[status(thm)],[f25])).
% 1.56/1.38 thf(f25,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0)))) = $true)),
% 1.56/1.38 inference(binary_proxy_clausification,[status(thm)],[f24])).
% 1.56/1.38 thf(f24,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) != (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0)))))),
% 1.56/1.38 inference(trivial_inequality_removal,[status(thm)],[f23])).
% 1.56/1.38 thf(f23,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) != (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))) | ($true != $true)),
% 1.56/1.38 inference(constrained_superposition,[status(thm)],[f18,f16])).
% 1.56/1.38 thf(f16,plain,(
% 1.56/1.38 ($true = (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))))),
% 1.56/1.38 inference(cnf_transformation,[status(thm)],[f12])).
% 1.56/1.38 thf(f12,plain,(
% 1.56/1.38 ($true = (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ (!! @ $i @ (^[Y0 : $i]: ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ Y0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ Y0))))))),
% 1.56/1.38 inference(fool_elimination,[status(thm)],[f11])).
% 1.56/1.38 thf(f11,plain,(
% 1.56/1.38 (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ! [X0 : $i] : ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.56/1.38 inference(rectify,[status(thm)],[f3])).
% 1.56/1.38 thf(f3,axiom,(
% 1.56/1.38 (knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ! [X0 : $i] : ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) => (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0)))),
% 1.56/1.38 file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax_002)).
% 1.56/1.38 thf(f17,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.56/1.38 inference(cnf_transformation,[status(thm)],[f14])).
% 1.56/1.38 thf(f14,plain,(
% 1.56/1.38 ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.56/1.38 inference(fool_elimination,[status(thm)],[f13])).
% 1.56/1.38 thf(f13,plain,(
% 1.56/1.38 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.56/1.38 inference(rectify,[status(thm)],[f2])).
% 1.56/1.38 thf(f2,axiom,(
% 1.56/1.38 (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)),
% 1.56/1.38 file('/export/starexec/sandbox/tmp/tmp.PMewQAOKoh/DTF2THF_10192.p',ax_001)).
% 1.56/1.38 % SZS output end Proof for DTF2THF_10192
% 1.56/1.38 % (10290)------------------------------
% 1.56/1.38 % (10290)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.56/1.38 % (10290)Termination reason: Refutation
% 1.56/1.38
% 1.56/1.38 % (10290)Memory used [KB]: 5500
% 1.56/1.38 % (10290)Time elapsed: 0.005 s
% 1.56/1.38 % (10290)Instructions burned: 4 (million)
% 1.56/1.38 % (10290)------------------------------
% 1.56/1.38 % (10290)------------------------------
% 1.56/1.38 % (10289)Success in time 0.016 s
%------------------------------------------------------------------------------