↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : CSR133^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 07:46:46 AM UTC 2026

% Result   : Theorem 0.09s 0.23s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   54 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :  169 (  20 equ;   0 cnn)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  487 (  66   ~;  66   |;  28   &; 325   @)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   40 (  40   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   43 (   0   ^;  34   !;   9   ?;  43   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

thf(decl_24,type,
    lAnna_THFTYPE_i: $i ).

thf(decl_25,type,
    lBen_THFTYPE_i: $i ).

thf(decl_26,type,
    lBill_THFTYPE_i: $i ).

thf(decl_27,type,
    lBob_THFTYPE_i: $i ).

thf(decl_28,type,
    lMary_THFTYPE_i: $i ).

thf(decl_29,type,
    lSue_THFTYPE_i: $i ).

thf(decl_30,type,
    lYearFn_THFTYPE_IiiI: $i > $i ).

thf(decl_31,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_32,type,
    n2009_THFTYPE_i: $i ).

thf(decl_33,type,
    parent_THFTYPE_IiioI: $i > $i > $o ).

thf(con,conjecture,
    ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( X2 @ X3 @ lBill_THFTYPE_i )
        & ( X1 @ X3 @ lAnna_THFTYPE_i )
        & ( X2 != X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',con) ).

thf(ax_004,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_004) ).

thf(ax_007,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_007) ).

thf(ax_003,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_003) ).

thf(ax_006,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_006) ).

thf(ax_005,axiom,
    ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
    @ ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_005) ).

thf(ax_008,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p',ax_008) ).

thf(c_0_7,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
        @ ( ( X2 @ X3 @ lBill_THFTYPE_i )
          & ( X1 @ X3 @ lAnna_THFTYPE_i )
          & ( X2 != X1 ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_8,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( ( ~ ( ( X2 @ X3 @ lBill_THFTYPE_i )
              & ( X1 @ X3 @ lAnna_THFTYPE_i )
              & ( X2 != X1 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
        & ( ( ( X2 @ X3 @ lBill_THFTYPE_i )
            & ( X1 @ X3 @ lAnna_THFTYPE_i )
            & ( X2 != X1 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_7])]) ).

thf(c_0_9,axiom,
    ( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_004]) ).

thf(c_0_10,negated_conjecture,
    ! [X7: $i > $i > $o,X8: $i > $i > $o,X9: $i] :
      ( ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X8 @ X9 @ lBill_THFTYPE_i ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X8 @ X9 @ lBill_THFTYPE_i ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X7 @ X9 @ lAnna_THFTYPE_i ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X7 @ X9 @ lAnna_THFTYPE_i ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X8 != X7 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X8 != X7 ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

thf(c_0_11,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o] :
      ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
      | ( X1 != X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,plain,
    ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_14,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
    inference(er,[status(thm)],[c_0_12]) ).

thf(c_0_15,axiom,
    ( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_007]) ).

thf(c_0_16,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
    | ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_17,plain,
    likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_18,plain,
    ( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_15]) ).

thf(c_0_19,axiom,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_003]) ).

thf(c_0_20,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( ( X1 = X2 )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i )
      | ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_21,plain,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

thf(c_0_22,plain,
    ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_23,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_19]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( ( X1 = X2 )
      | ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

thf(c_0_25,plain,
    parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_22,c_0_14]) ).

thf(c_0_26,plain,
    ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

thf(c_0_27,negated_conjecture,
    ! [X1: $i > $i > $o] :
      ( ( X1 = parent_THFTYPE_IiioI )
      | ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

thf(c_0_28,plain,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_26,c_0_14]) ).

thf(c_0_29,axiom,
    ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_006]) ).

thf(c_0_30,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o,X11: $i,X10: $i,X3: $i] :
      ( ( ( X1 @ X10 @ X11 )
      <=> ( X2 @ X10 @ X11 ) )
      | ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
    inference(arg_cong,[status(thm)],[c_0_24]) ).

thf(c_0_31,negated_conjecture,
    likes_THFTYPE_IiioI = parent_THFTYPE_IiioI,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

thf(c_0_32,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_29]) ).

thf(c_0_33,negated_conjecture,
    ! [X9: $i,X1: $i > $i > $o,X2: $i > $i > $o,X3: $i,X6: $i] :
      ( ( X1 @ X3 @ X6 )
      | ~ ( X2 @ X9 @ lAnna_THFTYPE_i )
      | ~ ( X1 @ X9 @ lBill_THFTYPE_i )
      | ~ ( X2 @ X3 @ X6 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_30]) ).

thf(c_0_34,negated_conjecture,
    ! [X14: $i,X15: $i] :
      ( ( likes_THFTYPE_IiioI @ X14 @ X15 )
    <=> ( parent_THFTYPE_IiioI @ X14 @ X15 ) ),
    inference(arg_cong,[status(thm)],[c_0_31]) ).

thf(c_0_35,plain,
    ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

thf(c_0_36,negated_conjecture,
    ! [X6: $i,X3: $i,X1: $i > $i > $o,X9: $i] :
      ( ( X3 = X6 )
      | ~ ( X1 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( X1 @ X6 @ X9 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_33]) ).

thf(c_0_37,negated_conjecture,
    ! [X3: $i,X6: $i] :
      ( ( parent_THFTYPE_IiioI @ X3 @ X6 )
      | ~ ( likes_THFTYPE_IiioI @ X3 @ X6 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_34]) ).

thf(c_0_38,plain,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_35,c_0_14]) ).

thf(c_0_39,plain,
    ( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_005])]) ).

thf(c_0_40,negated_conjecture,
    ! [X3: $i,X6: $i] :
      ( ( lSue_THFTYPE_i = X3 )
      | ~ ( parent_THFTYPE_IiioI @ X3 @ X6 ) ),
    inference(spm,[status(thm)],[c_0_36,c_0_25]) ).

thf(c_0_41,negated_conjecture,
    parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

thf(c_0_42,axiom,
    ( ( ~ ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_008]) ).

thf(c_0_43,plain,
    ( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_39]) ).

thf(c_0_44,negated_conjecture,
    lSue_THFTYPE_i = lMary_THFTYPE_i,
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

thf(c_0_45,plain,
    ( ( ~ ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_42]) ).

thf(c_0_46,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
    | ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

thf(c_0_47,negated_conjecture,
    ! [X3: $i,X6: $i] :
      ( ( lMary_THFTYPE_i = X3 )
      | ~ ( parent_THFTYPE_IiioI @ X3 @ X6 ) ),
    inference(rw,[status(thm)],[c_0_40,c_0_44]) ).

thf(c_0_48,negated_conjecture,
    parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
    inference(spm,[status(thm)],[c_0_37,c_0_17]) ).

thf(c_0_49,plain,
    ( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

thf(c_0_50,plain,
    ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBen_THFTYPE_i ),
    inference(sr,[status(thm)],[c_0_46,c_0_14]) ).

thf(c_0_51,negated_conjecture,
    lBob_THFTYPE_i = lMary_THFTYPE_i,
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

thf(c_0_52,plain,
    parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_49,c_0_14]) ).

thf(c_0_53,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR133^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.15  % Computer : n014.cluster.edu
% 0.09/0.15  % Model    : x86_64 x86_64
% 0.09/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.15  % Memory   : 8046.5625MB
% 0.09/0.15  % OS       : Linux 6.8.0-71-generic
% 0.09/0.15  % CPULimit : 300
% 0.09/0.15  % WCLimit  : 300
% 0.09/0.15  % DateTime : Tue Sep 29 17:55:29 UTC 2026
% 0.09/0.15  % CPUTime  : 
% 0.09/0.15  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  Running higher-order theorem proving
% 0.09/0.21  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.p3lw7t1grv/E---3.1_2996939.p
% 0.09/0.23  % Version: 3.5.1-ho
% 0.09/0.23  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23  % Starting sh5l with 300s (1) cores
% 0.09/0.23  % Starting new_ho_9 with 300s (1) cores
% 0.09/0.23  % Starting ho_unfolding_4 with 300s (1) cores
% 0.09/0.23  % sh5l with pid 2996954 completed with status 0
% 0.09/0.23  % Result found by sh5l
% 0.09/0.23  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23  % Starting sh5l with 300s (1) cores
% 0.09/0.23  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.23  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.23  % Search class: HGHSF-FFSM11-SSSFFSBN
% 0.09/0.23  % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.09/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.23  % SubtermCWHack with pid 2996959 completed with status 10
% 0.09/0.23  % Starting sh5l with 31s (1) cores
% 0.09/0.23  % sh5l with pid 2996965 completed with status 0
% 0.09/0.23  % Result found by sh5l
% 0.09/0.23  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23  % Starting sh5l with 300s (1) cores
% 0.09/0.23  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.23  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.23  % Search class: HGHSF-FFSM11-SSSFFSBN
% 0.09/0.23  % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.09/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.23  % SubtermCWHack with pid 2996959 completed with status 10
% 0.09/0.23  % Starting sh5l with 31s (1) cores
% 0.09/0.23  % Preprocessing time       : 0.001 s
% 0.09/0.23  % Presaturation interreduction done
% 0.09/0.23  
% 0.09/0.23  % Proof found!
% 0.09/0.23  % SZS status Theorem
% 0.09/0.23  % SZS output start CNFRefutation
% See solution above
% 0.09/0.23  % Parsed axioms                        : 23
% 0.09/0.23  % Removed by relevancy pruning/SinE    : 12
% 0.09/0.23  % Initial clauses                      : 28
% 0.09/0.23  % Removed in clause preprocessing      : 3
% 0.09/0.23  % Initial clauses in saturation        : 25
% 0.09/0.23  % Processed clauses                    : 73
% 0.09/0.23  % ...of these trivial                  : 2
% 0.09/0.23  % ...subsumed                          : 11
% 0.09/0.23  % ...remaining for further processing  : 60
% 0.09/0.23  % Other redundant clauses eliminated   : 1
% 0.09/0.23  % Clauses deleted for lack of memory   : 0
% 0.09/0.23  % Backward-subsumed                    : 1
% 0.09/0.23  % Backward-rewritten                   : 21
% 0.09/0.23  % Generated clauses                    : 58
% 0.09/0.23  % ...of the previous two non-redundant : 55
% 0.09/0.23  % ...aggressively subsumed             : 0
% 0.09/0.23  % Contextual simplify-reflections      : 0
% 0.09/0.23  % Paramodulations                      : 31
% 0.09/0.23  % Factorizations                       : 0
% 0.09/0.23  % NegExts                              : 0
% 0.09/0.23  % Equation resolutions                 : 1
% 0.09/0.23  % Disequality decompositions           : 0
% 0.09/0.23  % Total rewrite steps                  : 42
% 0.09/0.23  % ...of those cached                   : 31
% 0.09/0.23  % Propositional unsat checks           : 0
% 0.09/0.23  %    Propositional check models        : 0
% 0.09/0.23  %    Propositional check unsatisfiable : 0
% 0.09/0.23  %    Propositional clauses             : 0
% 0.09/0.23  %    Propositional clauses after purity: 0
% 0.09/0.23  %    Propositional unsat core size     : 0
% 0.09/0.23  %    Propositional preprocessing time  : 0.000
% 0.09/0.23  %    Propositional encoding time       : 0.000
% 0.09/0.23  %    Propositional solver time         : 0.000
% 0.09/0.23  %    Success case prop preproc time    : 0.000
% 0.09/0.23  %    Success case prop encoding time   : 0.000
% 0.09/0.23  %    Success case prop solver time     : 0.000
% 0.09/0.23  % Current number of processed clauses  : 21
% 0.09/0.23  %    Positive orientable unit clauses  : 9
% 0.09/0.23  %    Positive unorientable unit clauses: 0
% 0.09/0.23  %    Negative unit clauses             : 3
% 0.09/0.23  %    Non-unit-clauses                  : 9
% 0.09/0.23  % Current number of unprocessed clauses: 17
% 0.09/0.23  % ...number of literals in the above   : 46
% 0.09/0.23  % Current number of archived formulas  : 0
% 0.09/0.23  % Current number of archived clauses   : 38
% 0.09/0.23  % Clause-clause subsumption calls (NU) : 78
% 0.09/0.23  % Rec. Clause-clause subsumption calls : 63
% 0.09/0.23  % Non-unit clause-clause subsumptions  : 8
% 0.09/0.23  % Unit Clause-clause subsumption calls : 28
% 0.09/0.23  % Rewrite failures with RHS unbound    : 0
% 0.09/0.23  % BW rewrite match attempts            : 5
% 0.09/0.23  % BW rewrite match successes           : 4
% 0.09/0.23  % Condensation attempts                : 73
% 0.09/0.23  % Condensation successes               : 0
% 0.09/0.23  % Termbank termtop insertions          : 3179
% 0.09/0.23  % Search garbage collected termcells   : 145
% 0.09/0.23  
% 0.09/0.23  % -------------------------------------------------
% 0.09/0.23  % User time                : 0.006 s
% 0.09/0.23  % System time              : 0.005 s
% 0.09/0.23  % Total time               : 0.011 s
% 0.09/0.23  % Maximum resident set size: 3644 pages
% 0.09/0.23  
% 0.09/0.23  % -------------------------------------------------
% 0.09/0.23  % User time                : 0.008 s
% 0.09/0.23  % System time              : 0.009 s
% 0.09/0.23  % Total time               : 0.017 s
% 0.09/0.23  % Maximum resident set size: 4608 pages
% 0.09/0.23  % E exiting
%------------------------------------------------------------------------------