↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : CSR121^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:01 AM UTC 2026

% Result   : Theorem 1.58s 1.37s
% Output   : Refutation 1.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : CSR121^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 : n018.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 06:08:01 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.18/0.40  ---- Original DTF file ---
% 0.18/0.40  thf(spec,logic,$$dhol).
% 0.18/0.40  %------------------------------------------------------------------------------
% 0.18/0.40  % File     : CSR121^1 : TPTP v9.2.1. Released v4.1.0.
% 0.18/0.40  % Domain   : Commonsense Reasoning
% 0.18/0.40  % Problem  : Did Mary and Sue like someone in 2009?
% 0.18/0.40  % Version  : Especial.
% 0.18/0.40  % English  : During 2009 Mary liked Bill and Sue liked Bill (formulated via 
% 0.18/0.40  %            de-Morgan rule instead of a simply using and). Does someone exist 
% 0.18/0.40  %            who was liked by Mary and Sue during 2009?
% 0.18/0.40  
% 0.18/0.40  % Refs     : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.18/0.40  % Source   : [Ben10]
% 0.18/0.40  % Names    : ef_3.tq_SUMO_local [Ben10]
% 0.18/0.40  
% 0.18/0.40  % Status   : Theorem
% 0.18/0.40  % 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.3.0, 0.25 v4.1.0
% 0.18/0.40  % Syntax   : Number of formulae    :   10 (   0 unt;   8 typ;   0 def)
% 0.18/0.40  %            Number of atoms       :    9 (   0 equ;   3 cnn)
% 0.18/0.40  %            Maximal formula atoms :    6 (   4 avg)
% 0.18/0.40  %            Number of connectives :   22 (   3   ~;   1   |;   1   &;  17   @)
% 0.18/0.40  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.18/0.40  %            Maximal formula depth :    7 (   7 avg)
% 0.18/0.40  %            Number of types       :    3 (   1 usr)
% 0.18/0.40  %            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
% 0.18/0.40  %            Number of symbols     :    8 (   7 usr;   5 con; 0-2 aty)
% 0.18/0.40  %            Number of variables   :    1 (   0   ^;   0   !;   1   ?;   1   :)
% 0.18/0.40  % SPC      : TH0_THM_NEQ_NAR
% 0.18/0.40  
% 0.18/0.40  % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.18/0.40  %            Initally the problem has been hand generated in KIF syntax in
% 0.18/0.40  %            SigmaKEE and then automatically translated by Benzmueller's
% 0.18/0.40  %            KIF2TH0 translator into THF syntax.
% 0.18/0.40  %          : The translation has been applied in two modes: local and SInE.
% 0.18/0.40  %            The local mode only translates the local assumptions and the
% 0.18/0.40  %            query. The SInE mode additionally translates the SInE-extract
% 0.18/0.40  %            of the loaded knowledge base (usually SUMO).
% 0.18/0.40  %          : The examples are selected to illustrate the benefits of
% 0.18/0.40  %            higher-order reasoning in ontology reasoning.
% 0.18/0.40  %------------------------------------------------------------------------------
% 0.18/0.40  %----The extracted signature
% 0.18/0.40  thf(numbers,type,
% 0.18/0.40      num: $tType ).
% 0.18/0.40  
% 0.18/0.40  thf(holdsDuring_THFTYPE_IiooI,type,
% 0.18/0.40      holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.18/0.40  
% 0.18/0.40  thf(lBill_THFTYPE_i,type,
% 0.18/0.40      lBill_THFTYPE_i: $i ).
% 0.18/0.40  
% 0.18/0.40  thf(lMary_THFTYPE_i,type,
% 0.18/0.40      lMary_THFTYPE_i: $i ).
% 0.18/0.40  
% 0.18/0.40  thf(lSue_THFTYPE_i,type,
% 0.18/0.40      lSue_THFTYPE_i: $i ).
% 0.18/0.40  
% 0.18/0.40  thf(lYearFn_THFTYPE_IiiI,type,
% 0.18/0.40      lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.18/0.40  
% 0.18/0.40  thf(likes_THFTYPE_IiioI,type,
% 0.18/0.40      likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.18/0.40  
% 0.18/0.40  thf(n2009_THFTYPE_i,type,
% 0.18/0.40      n2009_THFTYPE_i: $i ).
% 0.18/0.40  
% 0.18/0.40  %----The translated axioms
% 0.18/0.40  thf(ax,axiom,
% 0.18/0.40      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.18/0.40      @ ( (~)
% 0.18/0.40        @ ( ( (~) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
% 0.18/0.40          | ( (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ) ) ).
% 0.18/0.40  
% 0.18/0.40  %----The translated conjecture
% 0.18/0.40  thf(con,conjecture,
% 0.18/0.40      ? [X: $i] :
% 0.18/0.40        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.18/0.40        @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 0.18/0.40          & ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 0.18/0.40  
% 0.18/0.40  %------------------------------------------------------------------------------
% 0.18/0.40  ------------------------
% 1.58/1.33  ---- Embedded in THF ---
% 1.58/1.34  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.58/1.34  %%% Generated on Tue Feb 24 06:08:01 EST 2026
% 1.58/1.34  %%% using '$$dhol' embedding, version 1.3.0.
% 1.58/1.34  %%% Logic specification used:
% 1.58/1.34  %%% thf(spec, logic, $$dhol).
% 1.58/1.34  
% 1.58/1.34  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.L5LmB1ftHo/DTF2DTF592.p
% 1.58/1.34  thf(numbers, type, num: $tType).
% 1.58/1.34  thf(holdsDuring_THFTYPE_IiooI, type, holdsDuring_THFTYPE_IiooI: ($i > ($o > $o))).
% 1.58/1.34  thf(lBill_THFTYPE_i, type, lBill_THFTYPE_i: $i).
% 1.58/1.34  thf(lMary_THFTYPE_i, type, lMary_THFTYPE_i: $i).
% 1.58/1.34  thf(lSue_THFTYPE_i, type, lSue_THFTYPE_i: $i).
% 1.58/1.34  thf(lYearFn_THFTYPE_IiiI, type, lYearFn_THFTYPE_IiiI: ($i > $i)).
% 1.58/1.34  thf(likes_THFTYPE_IiioI, type, likes_THFTYPE_IiioI: ($i > ($i > $o))).
% 1.58/1.34  thf(n2009_THFTYPE_i, type, n2009_THFTYPE_i: $i).
% 1.58/1.34  thf(ax, axiom, ((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i)) @ ((~) @ (((~) @ ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i) @ lBill_THFTYPE_i)) | ((~) @ ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i) @ lBill_THFTYPE_i)))))).
% 1.58/1.34  thf(con, conjecture, (? [X:$i]: (((holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i)) @ (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i) @ X) & ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i) @ X)))))).
% 1.58/1.34  % SZS output end ListOfTHF for /export/starexec/sandbox/tmp/tmp.L5LmB1ftHo/DTF2DTF592.p
% 1.58/1.34  ------------------------
% 1.58/1.34  ---- Cleaned THF ---
% 1.58/1.34  thf(numbers,type,
% 1.58/1.34      num: $tType ).
% 1.58/1.34  
% 1.58/1.34  thf(holdsDuring_THFTYPE_IiooI,type,
% 1.58/1.34      holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 1.58/1.34  
% 1.58/1.34  thf(lBill_THFTYPE_i,type,
% 1.58/1.34      lBill_THFTYPE_i: $i ).
% 1.58/1.34  
% 1.58/1.34  thf(lMary_THFTYPE_i,type,
% 1.58/1.34      lMary_THFTYPE_i: $i ).
% 1.58/1.34  
% 1.58/1.34  thf(lSue_THFTYPE_i,type,
% 1.58/1.34      lSue_THFTYPE_i: $i ).
% 1.58/1.34  
% 1.58/1.34  thf(lYearFn_THFTYPE_IiiI,type,
% 1.58/1.34      lYearFn_THFTYPE_IiiI: $i > $i ).
% 1.58/1.34  
% 1.58/1.34  thf(likes_THFTYPE_IiioI,type,
% 1.58/1.34      likes_THFTYPE_IiioI: $i > $i > $o ).
% 1.58/1.34  
% 1.58/1.34  thf(n2009_THFTYPE_i,type,
% 1.58/1.34      n2009_THFTYPE_i: $i ).
% 1.58/1.34  
% 1.58/1.34  thf(ax,axiom,
% 1.58/1.34      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 1.58/1.34      @ ( (~)
% 1.58/1.34        @ ( ( (~) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
% 1.58/1.34          | ( (~) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ) ) ).
% 1.58/1.34  
% 1.58/1.34  thf(con,conjecture,
% 1.58/1.34      ? [X: $i] :
% 1.58/1.34        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 1.58/1.34        @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X )
% 1.58/1.34          & ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X ) ) ) ).
% 1.58/1.35  ------------------------
% 1.58/1.36  % (711)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_592 for (2999ds/2Mi)
% 1.58/1.36  % (710)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_592 for (2999ds/27Mi)
% 1.58/1.36  % (716)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_592 for (2999ds/2Mi)
% 1.58/1.36  % (709)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_592 for (2999ds/4Mi)
% 1.58/1.36  % (718)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_592 for (2999ds/18Mi)
% 1.58/1.36  % (708)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_592 for (2999ds/183Mi)
% 1.58/1.37  % (717)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_592 for (2999ds/275Mi)
% 1.58/1.37  % (716)Instruction limit reached!
% 1.58/1.37  % (716)------------------------------
% 1.58/1.37  % (716)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (716)Termination reason: Unknown
% 1.58/1.37  % (716)Termination phase: Saturation
% 1.58/1.37  
% 1.58/1.37  % (716)Memory used [KB]: 5500
% 1.58/1.37  % (716)Time elapsed: 0.003 s
% 1.58/1.37  % (716)Instructions burned: 2 (million)
% 1.58/1.37  % (716)------------------------------
% 1.58/1.37  % (716)------------------------------
% 1.58/1.37  % (711)Refutation not found, incomplete strategy
% 1.58/1.37  % (711)------------------------------
% 1.58/1.37  % (711)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (710)Refutation not found, incomplete strategy
% 1.58/1.37  % (710)------------------------------
% 1.58/1.37  % (710)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (710)Termination reason: Refutation not found, incomplete strategy
% 1.58/1.37  
% 1.58/1.37  
% 1.58/1.37  % (710)Memory used [KB]: 5500
% 1.58/1.37  % (710)Time elapsed: 0.003 s
% 1.58/1.37  % (710)Instructions burned: 1 (million)
% 1.58/1.37  % (710)------------------------------
% 1.58/1.37  % (710)------------------------------
% 1.58/1.37  % (711)Termination reason: Refutation not found, incomplete strategy
% 1.58/1.37  
% 1.58/1.37  
% 1.58/1.37  % (711)Memory used [KB]: 5500
% 1.58/1.37  % (711)Time elapsed: 0.003 s
% 1.58/1.37  % (711)Instructions burned: 1 (million)
% 1.58/1.37  % (711)------------------------------
% 1.58/1.37  % (711)------------------------------
% 1.58/1.37  % (717)Refutation not found, incomplete strategy
% 1.58/1.37  % (717)------------------------------
% 1.58/1.37  % (717)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (717)Termination reason: Refutation not found, incomplete strategy
% 1.58/1.37  
% 1.58/1.37  
% 1.58/1.37  % (717)Memory used [KB]: 5373
% 1.58/1.37  % (717)Time elapsed: 0.002 s
% 1.58/1.37  % (717)Instructions burned: 1 (million)
% 1.58/1.37  % (717)------------------------------
% 1.58/1.37  % (717)------------------------------
% 1.58/1.37  % (718)First to succeed.
% 1.58/1.37  % (709)Instruction limit reached!
% 1.58/1.37  % (709)------------------------------
% 1.58/1.37  % (709)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (709)Termination reason: Unknown
% 1.58/1.37  % (709)Termination phase: Saturation
% 1.58/1.37  
% 1.58/1.37  % (709)Memory used [KB]: 5500
% 1.58/1.37  % (709)Time elapsed: 0.005 s
% 1.58/1.37  % (709)Instructions burned: 4 (million)
% 1.58/1.37  % (709)------------------------------
% 1.58/1.37  % (709)------------------------------
% 1.58/1.37  % (708)Also succeeded, but the first one will report.
% 1.58/1.37  % (718)Refutation found. Thanks to Tanya!
% 1.58/1.37  % SZS status Theorem for DTF2THF_592
% 1.58/1.37  % SZS output start Proof for DTF2THF_592
% 1.58/1.37  thf(func_def_0, type, num: $tType).
% 1.58/1.37  thf(func_def_1, type, holdsDuring_THFTYPE_IiooI: $i > $o > $o).
% 1.58/1.37  thf(func_def_5, type, lYearFn_THFTYPE_IiiI: $i > $i).
% 1.58/1.37  thf(func_def_6, type, likes_THFTYPE_IiioI: $i > $i > $o).
% 1.58/1.37  thf(func_def_15, type, ph1: !>[X0: $tType]:(X0)).
% 1.58/1.37  thf(f56,plain,(
% 1.58/1.37    $false),
% 1.58/1.37    inference(avatar_sat_refutation,[status(thm)],[f49,f55])).
% 1.58/1.37  thf(f55,plain,(
% 1.58/1.37    ~spl0_2),
% 1.58/1.37    inference(avatar_contradiction_clause,[status(thm)],[f54])).
% 1.58/1.37  thf(f54,plain,(
% 1.58/1.37    $false | ~spl0_2),
% 1.58/1.37    inference(trivial_inequality_removal,[status(thm)],[f53])).
% 1.58/1.37  thf(f53,plain,(
% 1.58/1.37    ($true = $false) | ~spl0_2),
% 1.58/1.37    inference(forward_demodulation,[status(thm)],[f43,f51])).
% 1.58/1.37  thf(f51,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false)),
% 1.58/1.37    inference(trivial_inequality_removal,[status(thm)],[f50])).
% 1.58/1.37  thf(f50,plain,(
% 1.58/1.37    ($true = $false) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false)),
% 1.58/1.37    inference(forward_demodulation,[status(thm)],[f22,f35])).
% 1.58/1.37  thf(f35,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.58/1.37    inference(condensation,[status(thm)],[f34])).
% 1.58/1.37  thf(f34,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $true) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $true)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f33])).
% 1.58/1.37  thf(f33,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $false) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $true)) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f31])).
% 1.58/1.37  thf(f31,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (($false = ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $true)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f23])).
% 1.58/1.37  thf(f23,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $true) | ($true = (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.58/1.37  thf(f14,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (($true = ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))) | ($true = (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.58/1.37  thf(f13,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))) != ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0)))) )),
% 1.58/1.37    inference(trivial_inequality_removal,[status(thm)],[f12])).
% 1.58/1.37  thf(f12,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (($true != $true) | ((~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))) != ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0)))) )),
% 1.58/1.37    inference(constrained_superposition,[status(thm)],[f11,f10])).
% 1.58/1.37  thf(f10,plain,(
% 1.58/1.37    ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))))))),
% 1.58/1.37    inference(cnf_transformation,[status(thm)],[f8])).
% 1.58/1.37  thf(f8,plain,(
% 1.58/1.37    ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))))))),
% 1.58/1.37    inference(fool_elimination,[status(thm)],[f7])).
% 1.58/1.37  thf(f7,plain,(
% 1.58/1.37    (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))),
% 1.58/1.37    inference(rectify,[status(thm)],[f1])).
% 1.58/1.37  thf(f1,axiom,(
% 1.58/1.37    (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (~ (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i))))),
% 1.58/1.37    file('/export/starexec/sandbox/tmp/tmp.L5LmB1ftHo/DTF2THF_592.p',ax)).
% 1.58/1.37  thf(f11,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (($true != (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))))) )),
% 1.58/1.37    inference(cnf_transformation,[status(thm)],[f9])).
% 1.58/1.37  thf(f9,plain,(
% 1.58/1.37    ! [X0 : $i] : ($true != (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))))),
% 1.58/1.37    inference(ennf_transformation,[status(thm)],[f6])).
% 1.58/1.37  thf(f6,plain,(
% 1.58/1.37    ~? [X0 : $i] : ($true = (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))))),
% 1.58/1.37    inference(fool_elimination,[status(thm)],[f5])).
% 1.58/1.37  thf(f5,plain,(
% 1.58/1.37    ~? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.58/1.37    inference(rectify,[status(thm)],[f3])).
% 1.58/1.37  thf(f3,negated_conjecture,(
% 1.58/1.37    ~? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.58/1.37    inference(negated_conjecture,[status(cth)],[f2])).
% 1.58/1.37  thf(f2,conjecture,(
% 1.58/1.37    ? [X0 : $i] : (holdsDuring_THFTYPE_IiooI @ (lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i) @ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0))),
% 1.58/1.37    file('/export/starexec/sandbox/tmp/tmp.L5LmB1ftHo/DTF2THF_592.p',con)).
% 1.58/1.37  thf(f22,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $false)),
% 1.58/1.37    inference(duplicate_literal_removal,[status(thm)],[f21])).
% 1.58/1.37  thf(f21,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $false) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false)),
% 1.58/1.37    inference(condensation,[status(thm)],[f20])).
% 1.58/1.37  thf(f20,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $false) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i) = $false) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $false) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f19])).
% 1.58/1.37  thf(f19,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $false) | ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $true) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $false) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $false)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f18])).
% 1.58/1.37  thf(f18,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $false) | ((~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $true) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $false) | ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) = $true)) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.58/1.37  thf(f17,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $false) | ($true = ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $false)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f16])).
% 1.58/1.37  thf(f16,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $false) | ((likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0) = $false) | ($false = (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f15])).
% 1.58/1.37  thf(f15,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (($false = ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) & (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0))) | ($false = (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f13])).
% 1.58/1.37  thf(f43,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true) | ~spl0_2),
% 1.58/1.37    inference(avatar_component_clause,[status(thm)],[f41])).
% 1.58/1.37  thf(f41,definition,(
% 1.58/1.37    spl0_2 <=> ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.58/1.37    introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.58/1.37  thf(f49,plain,(
% 1.58/1.37    spl0_2),
% 1.58/1.37    inference(avatar_split_clause,[status(thm)],[f30,f41])).
% 1.58/1.37  thf(f30,plain,(
% 1.58/1.37    ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true)),
% 1.58/1.37    inference(condensation,[status(thm)],[f29])).
% 1.58/1.37  thf(f29,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i) = $true) | ((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $true)) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f26])).
% 1.58/1.37  thf(f26,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $true) | ((~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)) = $false)) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.58/1.37  thf(f25,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $true) | ($false = ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i))))) )),
% 1.58/1.37    inference(not_proxy_clausification,[status(thm)],[f24])).
% 1.58/1.37  thf(f24,plain,(
% 1.58/1.37    ( ! [X0 : $i] : (((likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0) = $true) | ($true = (~ ((~ (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i)) | (~ (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i)))))) )),
% 1.58/1.37    inference(binary_proxy_clausification,[status(thm)],[f14])).
% 1.58/1.37  % SZS output end Proof for DTF2THF_592
% 1.58/1.37  % (718)------------------------------
% 1.58/1.37  % (718)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.58/1.37  % (718)Termination reason: Refutation
% 1.58/1.37  
% 1.58/1.37  % (718)Memory used [KB]: 5500
% 1.58/1.37  % (718)Time elapsed: 0.005 s
% 1.58/1.37  % (718)Instructions burned: 3 (million)
% 1.58/1.37  % (718)------------------------------
% 1.58/1.37  % (718)------------------------------
% 1.58/1.37  % (706)Success in time 0.019 s
%------------------------------------------------------------------------------