TSTP Solution File: SYO179^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYO179^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 : Tue May 21 08:44:50 EDT 2024

% Result   : Theorem 0.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :   11
% Syntax   : Number of formulae    :  173 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :  608 (   0 equ;   0 cnn)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives : 1733 ( 145   ~; 374   |;  66   &;1144   @)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   55 (   0   ^  43   !;  12   ?;  55   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cG: $i > $i > $o ).

thf(decl_23,type,
    cR: $i > $i > $o ).

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

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

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

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

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

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

thf(decl_30,type,
    epred1_0: $o ).

thf(cSIX_THEOREM_B,conjecture,
    ( ( ( ( cR @ cA @ cB )
        | ( cG @ cA @ cB ) )
      & ( ( cR @ cA @ cC )
        | ( cG @ cA @ cC ) )
      & ( ( cR @ cA @ cD )
        | ( cG @ cA @ cD ) )
      & ( ( cR @ cA @ cE )
        | ( cG @ cA @ cE ) )
      & ( ( cR @ cA @ cF )
        | ( cG @ cA @ cF ) )
      & ( ( cR @ cB @ cC )
        | ( cG @ cB @ cC ) )
      & ( ( cR @ cB @ cD )
        | ( cG @ cB @ cD ) )
      & ( ( cR @ cB @ cE )
        | ( cG @ cB @ cE ) )
      & ( ( cR @ cB @ cF )
        | ( cG @ cB @ cF ) )
      & ( ( cR @ cC @ cD )
        | ( cG @ cC @ cD ) )
      & ( ( cR @ cC @ cE )
        | ( cG @ cC @ cE ) )
      & ( ( cR @ cC @ cF )
        | ( cG @ cC @ cF ) )
      & ( ( cR @ cD @ cE )
        | ( cG @ cD @ cE ) )
      & ( ( cR @ cD @ cF )
        | ( cG @ cD @ cF ) )
      & ( ( cR @ cE @ cF )
        | ( cG @ cE @ cF ) ) )
   => ( ? [X1: $i,X2: $i,X3: $i] :
          ( ( cR @ X1 @ X2 )
          & ( cR @ X1 @ X3 )
          & ( cR @ X2 @ X3 ) )
      | ? [X1: $i,X2: $i,X3: $i] :
          ( ( cG @ X1 @ X2 )
          & ( cG @ X1 @ X3 )
          & ( cG @ X2 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSIX_THEOREM_B) ).

thf(c_0_1,plain,
    ( epred1_0
  <=> ( ( ( cR @ cA @ cB )
        | ( cG @ cA @ cB ) )
      & ( ( cR @ cA @ cC )
        | ( cG @ cA @ cC ) )
      & ( ( cR @ cA @ cD )
        | ( cG @ cA @ cD ) )
      & ( ( cR @ cA @ cE )
        | ( cG @ cA @ cE ) )
      & ( ( cR @ cA @ cF )
        | ( cG @ cA @ cF ) )
      & ( ( cR @ cB @ cC )
        | ( cG @ cB @ cC ) )
      & ( ( cR @ cB @ cD )
        | ( cG @ cB @ cD ) )
      & ( ( cR @ cB @ cE )
        | ( cG @ cB @ cE ) )
      & ( ( cR @ cB @ cF )
        | ( cG @ cB @ cF ) )
      & ( ( cR @ cC @ cD )
        | ( cG @ cC @ cD ) )
      & ( ( cR @ cC @ cE )
        | ( cG @ cC @ cE ) )
      & ( ( cR @ cC @ cF )
        | ( cG @ cC @ cF ) )
      & ( ( cR @ cD @ cE )
        | ( cG @ cD @ cE ) )
      & ( ( cR @ cD @ cF )
        | ( cG @ cD @ cF ) )
      & ( ( cR @ cE @ cF )
        | ( cG @ cE @ cF ) ) ) ),
    introduced(definition) ).

thf(c_0_2,plain,
    ( epred1_0
   => ( ( ( cR @ cA @ cB )
        | ( cG @ cA @ cB ) )
      & ( ( cR @ cA @ cC )
        | ( cG @ cA @ cC ) )
      & ( ( cR @ cA @ cD )
        | ( cG @ cA @ cD ) )
      & ( ( cR @ cA @ cE )
        | ( cG @ cA @ cE ) )
      & ( ( cR @ cA @ cF )
        | ( cG @ cA @ cF ) )
      & ( ( cR @ cB @ cC )
        | ( cG @ cB @ cC ) )
      & ( ( cR @ cB @ cD )
        | ( cG @ cB @ cD ) )
      & ( ( cR @ cB @ cE )
        | ( cG @ cB @ cE ) )
      & ( ( cR @ cB @ cF )
        | ( cG @ cB @ cF ) )
      & ( ( cR @ cC @ cD )
        | ( cG @ cC @ cD ) )
      & ( ( cR @ cC @ cE )
        | ( cG @ cC @ cE ) )
      & ( ( cR @ cC @ cF )
        | ( cG @ cC @ cF ) )
      & ( ( cR @ cD @ cE )
        | ( cG @ cD @ cE ) )
      & ( ( cR @ cD @ cF )
        | ( cG @ cD @ cF ) )
      & ( ( cR @ cE @ cF )
        | ( cG @ cE @ cF ) ) ) ),
    inference(split_equiv,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ~ ( epred1_0
     => ( ? [X1: $i,X2: $i,X3: $i] :
            ( ( cR @ X1 @ X2 )
            & ( cR @ X1 @ X3 )
            & ( cR @ X2 @ X3 ) )
        | ? [X1: $i,X2: $i,X3: $i] :
            ( ( cG @ X1 @ X2 )
            & ( cG @ X1 @ X3 )
            & ( cG @ X2 @ X3 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cSIX_THEOREM_B]),c_0_1]) ).

thf(c_0_4,plain,
    ( ( ( cR @ cA @ cB )
      | ( cG @ cA @ cB )
      | ~ epred1_0 )
    & ( ( cR @ cA @ cC )
      | ( cG @ cA @ cC )
      | ~ epred1_0 )
    & ( ( cR @ cA @ cD )
      | ( cG @ cA @ cD )
      | ~ epred1_0 )
    & ( ( cR @ cA @ cE )
      | ( cG @ cA @ cE )
      | ~ epred1_0 )
    & ( ( cR @ cA @ cF )
      | ( cG @ cA @ cF )
      | ~ epred1_0 )
    & ( ( cR @ cB @ cC )
      | ( cG @ cB @ cC )
      | ~ epred1_0 )
    & ( ( cR @ cB @ cD )
      | ( cG @ cB @ cD )
      | ~ epred1_0 )
    & ( ( cR @ cB @ cE )
      | ( cG @ cB @ cE )
      | ~ epred1_0 )
    & ( ( cR @ cB @ cF )
      | ( cG @ cB @ cF )
      | ~ epred1_0 )
    & ( ( cR @ cC @ cD )
      | ( cG @ cC @ cD )
      | ~ epred1_0 )
    & ( ( cR @ cC @ cE )
      | ( cG @ cC @ cE )
      | ~ epred1_0 )
    & ( ( cR @ cC @ cF )
      | ( cG @ cC @ cF )
      | ~ epred1_0 )
    & ( ( cR @ cD @ cE )
      | ( cG @ cD @ cE )
      | ~ epred1_0 )
    & ( ( cR @ cD @ cF )
      | ( cG @ cD @ cF )
      | ~ epred1_0 )
    & ( ( cR @ cE @ cF )
      | ( cG @ cE @ cF )
      | ~ epred1_0 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

thf(c_0_5,negated_conjecture,
    ! [X10: $i,X11: $i,X12: $i,X13: $i,X14: $i,X15: $i] :
      ( epred1_0
      & ( ~ ( cR @ X10 @ X11 )
        | ~ ( cR @ X10 @ X12 )
        | ~ ( cR @ X11 @ X12 ) )
      & ( ~ ( cG @ X13 @ X14 )
        | ~ ( cG @ X13 @ X15 )
        | ~ ( cG @ X14 @ X15 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

thf(c_0_6,plain,
    ( ( cR @ cE @ cF )
    | ( cG @ cE @ cF )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    epred1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ~ ( cR @ X1 @ X2 )
      | ~ ( cR @ X1 @ X3 )
      | ~ ( cR @ X2 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ( ( cR @ cE @ cF )
    | ( cG @ cE @ cF ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

thf(c_0_10,plain,
    ( ( cR @ cD @ cF )
    | ( cG @ cD @ cF )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_11,plain,
    ( ( cR @ cD @ cE )
    | ( cG @ cD @ cE )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ~ ( cR @ X1 @ cF )
      | ~ ( cR @ X1 @ cE ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,plain,
    ( ( cR @ cD @ cF )
    | ( cG @ cD @ cF ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).

thf(c_0_14,plain,
    ( ( cR @ cB @ cF )
    | ( cG @ cB @ cF )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_15,plain,
    ( ( cR @ cD @ cE )
    | ( cG @ cD @ cE ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).

thf(c_0_16,plain,
    ( ( cR @ cB @ cD )
    | ( cG @ cB @ cD )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_17,plain,
    ( ( cR @ cC @ cF )
    | ( cG @ cC @ cF )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_18,plain,
    ( ( cR @ cC @ cD )
    | ( cG @ cC @ cD )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_19,negated_conjecture,
    ( ( cG @ cD @ cF )
    | ( cG @ cE @ cF )
    | ~ ( cR @ cD @ cE ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_20,plain,
    ( ( cR @ cB @ cF )
    | ( cG @ cB @ cF ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).

thf(c_0_21,plain,
    ( ( cR @ cB @ cE )
    | ( cG @ cB @ cE )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_22,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ~ ( cR @ X1 @ cE )
      | ~ ( cR @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_15]) ).

thf(c_0_23,plain,
    ( ( cR @ cB @ cD )
    | ( cG @ cB @ cD ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7])]) ).

thf(c_0_24,plain,
    ( ( cR @ cA @ cF )
    | ( cG @ cA @ cF )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_25,plain,
    ( ( cR @ cA @ cD )
    | ( cG @ cA @ cD )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_26,plain,
    ( ( cR @ cC @ cF )
    | ( cG @ cC @ cF ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_7])]) ).

thf(c_0_27,plain,
    ( ( cR @ cC @ cE )
    | ( cG @ cC @ cE )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_28,plain,
    ( ( cR @ cC @ cD )
    | ( cG @ cC @ cD ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_7])]) ).

thf(c_0_29,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ~ ( cG @ X1 @ X2 )
      | ~ ( cG @ X1 @ X3 )
      | ~ ( cG @ X2 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_30,plain,
    ( ( cG @ cD @ cE )
    | ( cG @ cE @ cF )
    | ( cG @ cD @ cF ) ),
    inference(spm,[status(thm)],[c_0_19,c_0_15]) ).

thf(c_0_31,negated_conjecture,
    ( ( cG @ cB @ cF )
    | ( cG @ cE @ cF )
    | ~ ( cR @ cB @ cE ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_20]) ).

thf(c_0_32,plain,
    ( ( cR @ cB @ cE )
    | ( cG @ cB @ cE ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_7])]) ).

thf(c_0_33,negated_conjecture,
    ( ( cG @ cB @ cD )
    | ( cG @ cD @ cE )
    | ~ ( cR @ cB @ cE ) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_34,plain,
    ( ( cR @ cA @ cF )
    | ( cG @ cA @ cF ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_7])]) ).

thf(c_0_35,plain,
    ( ( cR @ cA @ cE )
    | ( cG @ cA @ cE )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_36,plain,
    ( ( cR @ cA @ cD )
    | ( cG @ cA @ cD ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_7])]) ).

thf(c_0_37,plain,
    ( ( cR @ cB @ cC )
    | ( cG @ cB @ cC )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_38,negated_conjecture,
    ( ( cG @ cC @ cF )
    | ( cG @ cE @ cF )
    | ~ ( cR @ cC @ cE ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_26]) ).

thf(c_0_39,plain,
    ( ( cR @ cC @ cE )
    | ( cG @ cC @ cE ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_7])]) ).

thf(c_0_40,plain,
    ( ( cG @ cC @ cD )
    | ( cG @ cD @ cE )
    | ~ ( cR @ cC @ cE ) ),
    inference(spm,[status(thm)],[c_0_22,c_0_28]) ).

thf(c_0_41,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cD @ cE )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

thf(c_0_42,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cE @ cF )
    | ( cG @ cB @ cF ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

thf(c_0_43,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cB @ cD ) ),
    inference(spm,[status(thm)],[c_0_33,c_0_32]) ).

thf(c_0_44,negated_conjecture,
    ( ( cG @ cA @ cF )
    | ( cG @ cE @ cF )
    | ~ ( cR @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_34]) ).

thf(c_0_45,plain,
    ( ( cR @ cA @ cE )
    | ( cG @ cA @ cE ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_7])]) ).

thf(c_0_46,negated_conjecture,
    ( ( cG @ cA @ cD )
    | ( cG @ cD @ cE )
    | ~ ( cR @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_22,c_0_36]) ).

thf(c_0_47,plain,
    ( ( cR @ cB @ cC )
    | ( cG @ cB @ cC ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_7])]) ).

thf(c_0_48,plain,
    ( ( cR @ cA @ cB )
    | ( cG @ cA @ cB )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_49,plain,
    ( ( cG @ cC @ cE )
    | ( cG @ cE @ cF )
    | ( cG @ cC @ cF ) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

thf(c_0_50,plain,
    ( ( cG @ cC @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cC @ cD ) ),
    inference(spm,[status(thm)],[c_0_40,c_0_39]) ).

thf(c_0_51,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cC @ cE )
      | ~ ( cR @ X1 @ cE )
      | ~ ( cR @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_39]) ).

thf(c_0_52,plain,
    ( ( cR @ cA @ cC )
    | ( cG @ cA @ cC )
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_53,negated_conjecture,
    ( ( cG @ cB @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).

thf(c_0_54,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cE @ cF )
    | ( cG @ cA @ cF ) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

thf(c_0_55,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_46,c_0_45]) ).

thf(c_0_56,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cB @ cC )
      | ~ ( cR @ X1 @ cC )
      | ~ ( cR @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_47]) ).

thf(c_0_57,plain,
    ( ( cR @ cA @ cB )
    | ( cG @ cA @ cB ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_7])]) ).

thf(c_0_58,plain,
    ( ( cG @ cC @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_49]),c_0_50]) ).

thf(c_0_59,negated_conjecture,
    ( ( cG @ cB @ cC )
    | ( cG @ cC @ cE )
    | ~ ( cR @ cB @ cE ) ),
    inference(spm,[status(thm)],[c_0_51,c_0_47]) ).

thf(c_0_60,plain,
    ( ( cR @ cA @ cC )
    | ( cG @ cA @ cC ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_7])]) ).

thf(c_0_61,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cD @ cE )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_53]) ).

thf(c_0_62,negated_conjecture,
    ( ( cG @ cA @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_54]),c_0_55]) ).

thf(c_0_63,plain,
    ( ( cG @ cA @ cB )
    | ( cG @ cB @ cC )
    | ~ ( cR @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

thf(c_0_64,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cD @ cE )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_58]) ).

thf(c_0_65,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cC @ cE )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_49]) ).

thf(c_0_66,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_59,c_0_32]) ).

thf(c_0_67,negated_conjecture,
    ( ( cG @ cA @ cC )
    | ( cG @ cC @ cE )
    | ~ ( cR @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_51,c_0_60]) ).

thf(c_0_68,negated_conjecture,
    ( ( cG @ cD @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

thf(c_0_69,plain,
    ( ( cG @ cA @ cC )
    | ( cG @ cB @ cC )
    | ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_63,c_0_60]) ).

thf(c_0_70,negated_conjecture,
    ( ( cG @ cD @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_64,c_0_53]) ).

thf(c_0_71,negated_conjecture,
    ( ( cG @ cD @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_64,c_0_62]) ).

thf(c_0_72,negated_conjecture,
    ( ( cG @ cB @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_42]),c_0_66]) ).

thf(c_0_73,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_67,c_0_45]) ).

thf(c_0_74,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cB @ cD )
      | ~ ( cR @ X1 @ cD )
      | ~ ( cR @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_23]) ).

thf(c_0_75,plain,
    ( ( cG @ cE @ cF )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]) ).

thf(c_0_76,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cC @ cE )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_72]) ).

thf(c_0_77,negated_conjecture,
    ( ( cG @ cA @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_54]),c_0_73]) ).

thf(c_0_78,negated_conjecture,
    ( ( cG @ cA @ cB )
    | ( cG @ cB @ cD )
    | ~ ( cR @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_74,c_0_57]) ).

thf(c_0_79,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_75]) ).

thf(c_0_80,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cB @ cE )
      | ~ ( cR @ X1 @ cE )
      | ~ ( cR @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_32]) ).

thf(c_0_81,negated_conjecture,
    ( ( cG @ cC @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

thf(c_0_82,plain,
    ( ( cG @ cA @ cD )
    | ( cG @ cB @ cD )
    | ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_78,c_0_36]) ).

thf(c_0_83,negated_conjecture,
    ( ( cG @ cC @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cB @ cD ) ),
    inference(spm,[status(thm)],[c_0_79,c_0_72]) ).

thf(c_0_84,negated_conjecture,
    ( ( cG @ cC @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_79,c_0_77]) ).

thf(c_0_85,negated_conjecture,
    ( ( cG @ cA @ cB )
    | ( cG @ cB @ cE )
    | ~ ( cR @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_80,c_0_57]) ).

thf(c_0_86,plain,
    ( ( cG @ cE @ cF )
    | ( cG @ cC @ cE ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]) ).

thf(c_0_87,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ( cG @ cB @ cE )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_42]) ).

thf(c_0_88,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cB @ cE )
    | ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_85,c_0_45]) ).

thf(c_0_89,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cC @ cD )
      | ~ ( cR @ X1 @ cD )
      | ~ ( cR @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_28]) ).

thf(c_0_90,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cF )
      | ~ ( cR @ X1 @ cF )
      | ~ ( cR @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

thf(c_0_91,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cE @ cF )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_86]) ).

thf(c_0_92,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cB @ cE )
    | ( cG @ cE @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_54]),c_0_88]) ).

thf(c_0_93,negated_conjecture,
    ( ( cG @ cA @ cC )
    | ( cG @ cC @ cD )
    | ~ ( cR @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_89,c_0_60]) ).

thf(c_0_94,plain,
    ( ( cG @ cC @ cD )
    | ( cG @ cD @ cF )
    | ~ ( cR @ cC @ cF ) ),
    inference(spm,[status(thm)],[c_0_90,c_0_28]) ).

thf(c_0_95,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cC @ cF )
      | ~ ( cR @ X1 @ cF )
      | ~ ( cR @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_26]) ).

thf(c_0_96,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_91,c_0_92]) ).

thf(c_0_97,plain,
    ( ( cG @ cA @ cD )
    | ( cG @ cC @ cD )
    | ( cG @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_93,c_0_36]) ).

thf(c_0_98,negated_conjecture,
    ( ( cG @ cE @ cF )
    | ~ ( cG @ cC @ cD ) ),
    inference(spm,[status(thm)],[c_0_79,c_0_86]) ).

thf(c_0_99,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cE @ cF )
    | ~ ( cG @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_79,c_0_92]) ).

thf(c_0_100,plain,
    ( ( cG @ cC @ cF )
    | ( cG @ cD @ cF )
    | ( cG @ cC @ cD ) ),
    inference(spm,[status(thm)],[c_0_94,c_0_26]) ).

thf(c_0_101,negated_conjecture,
    ( ( cG @ cB @ cD )
    | ( cG @ cD @ cF )
    | ~ ( cR @ cB @ cF ) ),
    inference(spm,[status(thm)],[c_0_90,c_0_23]) ).

thf(c_0_102,negated_conjecture,
    ( ( cG @ cB @ cC )
    | ( cG @ cC @ cF )
    | ~ ( cR @ cB @ cF ) ),
    inference(spm,[status(thm)],[c_0_95,c_0_47]) ).

thf(c_0_103,plain,
    ( ( cG @ cE @ cF )
    | ( cG @ cB @ cE ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]) ).

thf(c_0_104,plain,
    ( ( cG @ cB @ cC )
    | ( cG @ cC @ cD )
    | ~ ( cR @ cB @ cD ) ),
    inference(spm,[status(thm)],[c_0_89,c_0_47]) ).

thf(c_0_105,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cF )
      | ( cG @ cC @ cF )
      | ~ ( cG @ X1 @ cD )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_100]) ).

thf(c_0_106,plain,
    ( ( cG @ cB @ cF )
    | ( cG @ cD @ cF )
    | ( cG @ cB @ cD ) ),
    inference(spm,[status(thm)],[c_0_101,c_0_20]) ).

thf(c_0_107,plain,
    ( ( cG @ cB @ cF )
    | ( cG @ cC @ cF )
    | ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_102,c_0_20]) ).

thf(c_0_108,negated_conjecture,
    ( ( cG @ cA @ cD )
    | ( cG @ cD @ cF )
    | ~ ( cR @ cA @ cF ) ),
    inference(spm,[status(thm)],[c_0_90,c_0_36]) ).

thf(c_0_109,negated_conjecture,
    ( ( cG @ cA @ cC )
    | ( cG @ cC @ cF )
    | ~ ( cR @ cA @ cF ) ),
    inference(spm,[status(thm)],[c_0_95,c_0_60]) ).

thf(c_0_110,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ( cG @ cC @ cE )
      | ~ ( cG @ X1 @ cD )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_50]) ).

thf(c_0_111,negated_conjecture,
    ( ( cG @ cE @ cF )
    | ~ ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_91,c_0_103]) ).

thf(c_0_112,plain,
    ( ( cG @ cB @ cD )
    | ( cG @ cC @ cD )
    | ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_104,c_0_23]) ).

thf(c_0_113,negated_conjecture,
    ( ( cG @ cE @ cF )
    | ~ ( cG @ cB @ cD ) ),
    inference(spm,[status(thm)],[c_0_79,c_0_103]) ).

thf(c_0_114,plain,
    ( ( cG @ cB @ cF )
    | ( cG @ cC @ cF )
    | ( cG @ cD @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]) ).

thf(c_0_115,plain,
    ( ( cG @ cA @ cF )
    | ( cG @ cD @ cF )
    | ( cG @ cA @ cD ) ),
    inference(spm,[status(thm)],[c_0_108,c_0_34]) ).

thf(c_0_116,plain,
    ( ( cG @ cA @ cF )
    | ( cG @ cC @ cF )
    | ( cG @ cA @ cC ) ),
    inference(spm,[status(thm)],[c_0_109,c_0_34]) ).

thf(c_0_117,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_43]),c_0_66]) ).

thf(c_0_118,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cB @ cF )
      | ~ ( cR @ X1 @ cF )
      | ~ ( cR @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_20]) ).

thf(c_0_119,plain,
    cG @ cE @ cF,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_98]),c_0_113]) ).

thf(c_0_120,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cF )
      | ( cG @ cC @ cF )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_114]) ).

thf(c_0_121,negated_conjecture,
    ( ( cG @ cA @ cF )
    | ( cG @ cC @ cF )
    | ( cG @ cD @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_115]),c_0_116]) ).

thf(c_0_122,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ( cG @ cC @ cE )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_117]) ).

thf(c_0_123,negated_conjecture,
    ( ( cG @ cA @ cE )
    | ( cG @ cC @ cE )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_55]),c_0_73]) ).

thf(c_0_124,negated_conjecture,
    ( ( cG @ cA @ cB )
    | ( cG @ cB @ cF )
    | ~ ( cR @ cA @ cF ) ),
    inference(spm,[status(thm)],[c_0_118,c_0_57]) ).

thf(c_0_125,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cE ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_119]) ).

thf(c_0_126,negated_conjecture,
    ( ( cG @ cC @ cF )
    | ( cG @ cD @ cF )
    | ~ ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_120,c_0_121]) ).

thf(c_0_127,negated_conjecture,
    ( ( cG @ cC @ cE )
    | ( cG @ cD @ cE )
    | ~ ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_122,c_0_123]) ).

thf(c_0_128,plain,
    ( ( cG @ cA @ cF )
    | ( cG @ cB @ cF )
    | ( cG @ cA @ cB ) ),
    inference(spm,[status(thm)],[c_0_124,c_0_34]) ).

thf(c_0_129,negated_conjecture,
    ( ( cG @ cD @ cF )
    | ( cG @ cC @ cF )
    | ~ ( cG @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_125,c_0_121]) ).

thf(c_0_130,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cA @ cE )
    | ( cG @ cD @ cF )
    | ( cG @ cC @ cF ) ),
    inference(spm,[status(thm)],[c_0_126,c_0_88]) ).

thf(c_0_131,plain,
    ( ( cG @ cD @ cF )
    | ( cG @ cC @ cF )
    | ~ ( cG @ cB @ cE ) ),
    inference(spm,[status(thm)],[c_0_125,c_0_114]) ).

thf(c_0_132,plain,
    ( ( cG @ cB @ cF )
    | ( cG @ cA @ cF )
    | ( cG @ cD @ cE )
    | ( cG @ cC @ cE ) ),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

thf(c_0_133,plain,
    ( ( cG @ cC @ cF )
    | ( cG @ cD @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]) ).

thf(c_0_134,plain,
    ( ( cG @ cC @ cE )
    | ( cG @ cD @ cE )
    | ( cG @ cB @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_132]),c_0_123]) ).

thf(c_0_135,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cC @ cF )
      | ( cG @ cB @ cF )
      | ~ ( cG @ X1 @ cC )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_107]) ).

thf(c_0_136,negated_conjecture,
    ( ( cG @ cD @ cF )
    | ~ ( cG @ cC @ cE ) ),
    inference(spm,[status(thm)],[c_0_125,c_0_133]) ).

thf(c_0_137,negated_conjecture,
    ( ( cG @ cD @ cE )
    | ( cG @ cC @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_134]),c_0_117]) ).

thf(c_0_138,plain,
    ( ( cG @ cA @ cF )
    | ( cG @ cB @ cF )
    | ( cG @ cC @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_116]),c_0_128]) ).

thf(c_0_139,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ( cG @ cB @ cE )
      | ~ ( cG @ X1 @ cD )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_43]) ).

thf(c_0_140,negated_conjecture,
    ( ( cG @ cD @ cE )
    | ( cG @ cD @ cF ) ),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

thf(c_0_141,plain,
    ( ( cG @ cC @ cF )
    | ( cG @ cB @ cF )
    | ~ ( cG @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_125,c_0_138]) ).

thf(c_0_142,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cB @ cE )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_55]),c_0_88]) ).

thf(c_0_143,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_140]) ).

thf(c_0_144,plain,
    ( ( cG @ cD @ cE )
    | ( cG @ cB @ cE )
    | ( cG @ cB @ cF )
    | ( cG @ cC @ cF ) ),
    inference(spm,[status(thm)],[c_0_141,c_0_142]) ).

thf(c_0_145,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cE )
      | ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_137]) ).

thf(c_0_146,negated_conjecture,
    ( ( cG @ cC @ cF )
    | ( cG @ cB @ cE )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_43]) ).

thf(c_0_147,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cF )
      | ( cG @ cB @ cF )
      | ~ ( cG @ X1 @ cD )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_106]) ).

thf(c_0_148,negated_conjecture,
    ( ( cG @ cC @ cF )
    | ( cG @ cD @ cE )
    | ~ ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_145,c_0_146]) ).

thf(c_0_149,plain,
    ( ( cG @ cA @ cF )
    | ( cG @ cB @ cF )
    | ( cG @ cD @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_115]),c_0_128]) ).

thf(c_0_150,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cC @ cE )
      | ( cG @ cB @ cE )
      | ~ ( cG @ X1 @ cC )
      | ~ ( cG @ X1 @ cB ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_66]) ).

thf(c_0_151,plain,
    ( ( cG @ cB @ cF )
    | ( cG @ cD @ cE )
    | ( cG @ cC @ cF ) ),
    inference(spm,[status(thm)],[c_0_148,c_0_107]) ).

thf(c_0_152,plain,
    ( ( cG @ cD @ cF )
    | ( cG @ cB @ cF )
    | ~ ( cG @ cA @ cE ) ),
    inference(spm,[status(thm)],[c_0_125,c_0_149]) ).

thf(c_0_153,plain,
    ( ( cG @ cA @ cE )
    | ( cG @ cB @ cE )
    | ( cG @ cC @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_73]),c_0_88]) ).

thf(c_0_154,negated_conjecture,
    ( ( cG @ cC @ cF )
    | ( cG @ cD @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_151]),c_0_146]) ).

thf(c_0_155,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ cD @ cF )
      | ~ ( cG @ X1 @ cF )
      | ~ ( cG @ X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_133]) ).

thf(c_0_156,plain,
    ( ( cG @ cB @ cE )
    | ( cG @ cB @ cF )
    | ( cG @ cD @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_136]) ).

thf(c_0_157,negated_conjecture,
    cG @ cD @ cE,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_154]),c_0_137]) ).

thf(c_0_158,negated_conjecture,
    ( ( cG @ cB @ cE )
    | ( cG @ cD @ cF )
    | ~ ( cG @ cB @ cC ) ),
    inference(spm,[status(thm)],[c_0_155,c_0_156]) ).

thf(c_0_159,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( cG @ X1 @ cE )
      | ~ ( cG @ X1 @ cD ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_157]) ).

thf(c_0_160,plain,
    ( ( cG @ cD @ cF )
    | ( cG @ cB @ cE ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_66]),c_0_136]) ).

thf(c_0_161,plain,
    ( ( cG @ cD @ cF )
    | ( cG @ cB @ cF ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_106]),c_0_160]) ).

thf(c_0_162,negated_conjecture,
    cG @ cD @ cF,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_161]),c_0_160]) ).

thf(c_0_163,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_162]),c_0_157])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO179^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 10:06:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running higher-order theorem proving
% 0.20/0.47  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/benchmark/theBenchmark.p
% 0.20/0.52  # Version: 3.1.0-ho
% 0.20/0.52  # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.52  # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.52  # new_ho_10 with pid 7285 completed with status 0
% 0.20/0.52  # Result found by new_ho_10
% 0.20/0.52  # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.52  # No SInE strategy applied
% 0.20/0.52  # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52  # Starting new_ho_10 with 901s (1) cores
% 0.20/0.52  # Starting ehoh_best8_lambda with 151s (1) cores
% 0.20/0.52  # Starting ho_unfolding_6 with 151s (1) cores
% 0.20/0.52  # Starting sh4l with 151s (1) cores
% 0.20/0.52  # Starting ehoh_best_nonlift_rwall with 146s (1) cores
% 0.20/0.52  # ehoh_best_nonlift_rwall with pid 7296 completed with status 0
% 0.20/0.52  # Result found by ehoh_best_nonlift_rwall
% 0.20/0.52  # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.52  # No SInE strategy applied
% 0.20/0.52  # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52  # Starting new_ho_10 with 901s (1) cores
% 0.20/0.52  # Starting ehoh_best8_lambda with 151s (1) cores
% 0.20/0.52  # Starting ho_unfolding_6 with 151s (1) cores
% 0.20/0.52  # Starting sh4l with 151s (1) cores
% 0.20/0.52  # Starting ehoh_best_nonlift_rwall with 146s (1) cores
% 0.20/0.52  # Preprocessing time       : 0.001 s
% 0.20/0.52  # Presaturation interreduction done
% 0.20/0.52  
% 0.20/0.52  # Proof found!
% 0.20/0.52  # SZS status Theorem
% 0.20/0.52  # SZS output start CNFRefutation
% See solution above
% 0.20/0.52  # Parsed axioms                        : 9
% 0.20/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.52  # Initial clauses                      : 26
% 0.20/0.52  # Removed in clause preprocessing      : 8
% 0.20/0.52  # Initial clauses in saturation        : 18
% 0.20/0.52  # Processed clauses                    : 475
% 0.20/0.52  # ...of these trivial                  : 0
% 0.20/0.52  # ...subsumed                          : 159
% 0.20/0.52  # ...remaining for further processing  : 316
% 0.20/0.52  # Other redundant clauses eliminated   : 0
% 0.20/0.52  # Clauses deleted for lack of memory   : 0
% 0.20/0.52  # Backward-subsumed                    : 130
% 0.20/0.52  # Backward-rewritten                   : 74
% 0.20/0.52  # Generated clauses                    : 841
% 0.20/0.52  # ...of the previous two non-redundant : 837
% 0.20/0.52  # ...aggressively subsumed             : 0
% 0.20/0.52  # Contextual simplify-reflections      : 37
% 0.20/0.52  # Paramodulations                      : 841
% 0.20/0.52  # Factorizations                       : 0
% 0.20/0.53  # NegExts                              : 0
% 0.20/0.53  # Equation resolutions                 : 0
% 0.20/0.53  # Disequality decompositions           : 0
% 0.20/0.53  # Total rewrite steps                  : 90
% 0.20/0.53  # ...of those cached                   : 86
% 0.20/0.53  # Propositional unsat checks           : 0
% 0.20/0.53  #    Propositional check models        : 0
% 0.20/0.53  #    Propositional check unsatisfiable : 0
% 0.20/0.53  #    Propositional clauses             : 0
% 0.20/0.53  #    Propositional clauses after purity: 0
% 0.20/0.53  #    Propositional unsat core size     : 0
% 0.20/0.53  #    Propositional preprocessing time  : 0.000
% 0.20/0.53  #    Propositional encoding time       : 0.000
% 0.20/0.53  #    Propositional solver time         : 0.000
% 0.20/0.53  #    Success case prop preproc time    : 0.000
% 0.20/0.53  #    Success case prop encoding time   : 0.000
% 0.20/0.53  #    Success case prop solver time     : 0.000
% 0.20/0.53  # Current number of processed clauses  : 94
% 0.20/0.53  #    Positive orientable unit clauses  : 4
% 0.20/0.53  #    Positive unorientable unit clauses: 0
% 0.20/0.53  #    Negative unit clauses             : 2
% 0.20/0.53  #    Non-unit-clauses                  : 88
% 0.20/0.53  # Current number of unprocessed clauses: 323
% 0.20/0.53  # ...number of literals in the above   : 1658
% 0.20/0.53  # Current number of archived formulas  : 0
% 0.20/0.53  # Current number of archived clauses   : 222
% 0.20/0.53  # Clause-clause subsumption calls (NU) : 5990
% 0.20/0.53  # Rec. Clause-clause subsumption calls : 2232
% 0.20/0.53  # Non-unit clause-clause subsumptions  : 321
% 0.20/0.53  # Unit Clause-clause subsumption calls : 152
% 0.20/0.53  # Rewrite failures with RHS unbound    : 0
% 0.20/0.53  # BW rewrite match attempts            : 3
% 0.20/0.53  # BW rewrite match successes           : 3
% 0.20/0.53  # Condensation attempts                : 0
% 0.20/0.53  # Condensation successes               : 0
% 0.20/0.53  # Termbank termtop insertions          : 13960
% 0.20/0.53  # Search garbage collected termcells   : 142
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.039 s
% 0.20/0.53  # System time              : 0.005 s
% 0.20/0.53  # Total time               : 0.044 s
% 0.20/0.53  # Maximum resident set size: 1784 pages
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.183 s
% 0.20/0.53  # System time              : 0.012 s
% 0.20/0.53  # Total time               : 0.195 s
% 0.20/0.53  # Maximum resident set size: 1712 pages
% 0.20/0.53  % E---3.1 exiting
% 0.20/0.53  % E exiting
%------------------------------------------------------------------------------