↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n029.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  : 600s
% DateTime : Sun Jul 17 22:09:29 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   62 (  26 unt;   0 def)
%            Number of atoms       :  361 (  23 equ)
%            Maximal formula atoms :   23 (   5 avg)
%            Number of connectives :  492 ( 193   ~; 202   |;  87   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   35 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  13 con; 0-0 aty)
%            Number of variables   :  182 (   8 sgn  82   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t5_plus_FOL,conjecture,
    ! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X6,X10,X11,X16] :
      ( ( organization(X1,X10)
        & organization(X2,X10)
        & organization(X1,X16)
        & organization(X2,X16)
        & class(X1,X13,X10)
        & class(X2,X13,X10)
        & survival_chance(X1,X7,X10)
        & survival_chance(X2,X7,X10)
        & reorganization(X1,X10,X11)
        & reorganization(X2,X10,X16)
        & reorganization_type(X1,X12,X10)
        & reorganization_type(X2,X12,X10)
        & reorganization_free(X1,X11,X16)
        & survival_chance(X1,X4,X6)
        & survival_chance(X2,X5,X6)
        & complexity(X1,X14,X10)
        & complexity(X2,X15,X10)
        & greater(X15,X14)
        & ( X6 = X16
         => greater(X4,X5) ) )
     => ( X6 = X11
       => ( greater(X4,X5)
          | X4 = X5 ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t5_plus_FOL) ).

fof(a10_FOL,hypothesis,
    ! [X1,X2,X12,X13,X14,X15,X10,X11,X16] :
      ( ( organization(X1,X10)
        & organization(X2,X10)
        & organization(X2,X16)
        & class(X1,X13,X10)
        & class(X2,X13,X10)
        & reorganization(X1,X10,X11)
        & reorganization(X2,X10,X16)
        & reorganization_type(X1,X12,X10)
        & reorganization_type(X2,X12,X10)
        & complexity(X1,X14,X10)
        & complexity(X2,X15,X10)
        & greater(X15,X14) )
     => greater(X16,X11) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',a10_FOL) ).

fof(a11_FOL,hypothesis,
    ! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X10,X11,X16] :
      ( ( organization(X1,X10)
        & organization(X2,X10)
        & organization(X1,X11)
        & organization(X2,X11)
        & class(X1,X13,X10)
        & class(X2,X13,X10)
        & survival_chance(X1,X7,X10)
        & survival_chance(X2,X7,X10)
        & reorganization(X1,X10,X11)
        & reorganization(X2,X10,X16)
        & reorganization_type(X1,X12,X10)
        & reorganization_type(X2,X12,X10)
        & survival_chance(X1,X4,X11)
        & survival_chance(X2,X5,X11)
        & complexity(X1,X14,X10)
        & complexity(X2,X15,X10)
        & greater(X15,X14) )
     => ( greater(X4,X5)
        | X4 = X5 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',a11_FOL) ).

fof(mp13,axiom,
    ! [X1,X6,X8,X9] :
      ( ( organization(X1,X8)
        & organization(X1,X9)
        & greater(X6,X8)
        & greater(X9,X6) )
     => organization(X1,X6) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mp13) ).

fof(mp7,axiom,
    ! [X1,X10,X11] :
      ( reorganization(X1,X10,X11)
     => greater(X11,X10) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mp7) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X6,X10,X11,X16] :
        ( ( organization(X1,X10)
          & organization(X2,X10)
          & organization(X1,X16)
          & organization(X2,X16)
          & class(X1,X13,X10)
          & class(X2,X13,X10)
          & survival_chance(X1,X7,X10)
          & survival_chance(X2,X7,X10)
          & reorganization(X1,X10,X11)
          & reorganization(X2,X10,X16)
          & reorganization_type(X1,X12,X10)
          & reorganization_type(X2,X12,X10)
          & reorganization_free(X1,X11,X16)
          & survival_chance(X1,X4,X6)
          & survival_chance(X2,X5,X6)
          & complexity(X1,X14,X10)
          & complexity(X2,X15,X10)
          & greater(X15,X14)
          & ( X6 = X16
           => greater(X4,X5) ) )
       => ( X6 = X11
         => ( greater(X4,X5)
            | X4 = X5 ) ) ),
    inference(assume_negation,[status(cth)],[t5_plus_FOL]) ).

fof(c_0_6,hypothesis,
    ! [X17,X18,X19,X20,X21,X22,X23,X24,X25] :
      ( ~ organization(X17,X23)
      | ~ organization(X18,X23)
      | ~ organization(X18,X25)
      | ~ class(X17,X20,X23)
      | ~ class(X18,X20,X23)
      | ~ reorganization(X17,X23,X24)
      | ~ reorganization(X18,X23,X25)
      | ~ reorganization_type(X17,X19,X23)
      | ~ reorganization_type(X18,X19,X23)
      | ~ complexity(X17,X21,X23)
      | ~ complexity(X18,X22,X23)
      | ~ greater(X22,X21)
      | greater(X25,X24) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a10_FOL])]) ).

fof(c_0_7,negated_conjecture,
    ( organization(esk1_0,esk11_0)
    & organization(esk2_0,esk11_0)
    & organization(esk1_0,esk13_0)
    & organization(esk2_0,esk13_0)
    & class(esk1_0,esk4_0,esk11_0)
    & class(esk2_0,esk4_0,esk11_0)
    & survival_chance(esk1_0,esk5_0,esk11_0)
    & survival_chance(esk2_0,esk5_0,esk11_0)
    & reorganization(esk1_0,esk11_0,esk12_0)
    & reorganization(esk2_0,esk11_0,esk13_0)
    & reorganization_type(esk1_0,esk3_0,esk11_0)
    & reorganization_type(esk2_0,esk3_0,esk11_0)
    & reorganization_free(esk1_0,esk12_0,esk13_0)
    & survival_chance(esk1_0,esk6_0,esk10_0)
    & survival_chance(esk2_0,esk7_0,esk10_0)
    & complexity(esk1_0,esk8_0,esk11_0)
    & complexity(esk2_0,esk9_0,esk11_0)
    & greater(esk9_0,esk8_0)
    & ( esk10_0 != esk13_0
      | greater(esk6_0,esk7_0) )
    & esk10_0 = esk12_0
    & ~ greater(esk6_0,esk7_0)
    & esk6_0 != esk7_0 ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

cnf(c_0_8,hypothesis,
    ( greater(X1,X2)
    | ~ greater(X3,X4)
    | ~ complexity(X5,X3,X6)
    | ~ complexity(X7,X4,X6)
    | ~ reorganization_type(X5,X8,X6)
    | ~ reorganization_type(X7,X8,X6)
    | ~ reorganization(X5,X6,X1)
    | ~ reorganization(X7,X6,X2)
    | ~ class(X5,X9,X6)
    | ~ class(X7,X9,X6)
    | ~ organization(X5,X1)
    | ~ organization(X5,X6)
    | ~ organization(X7,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    complexity(esk1_0,esk8_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    organization(esk1_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( greater(X1,X2)
    | ~ complexity(X3,X4,esk11_0)
    | ~ reorganization_type(esk1_0,X5,esk11_0)
    | ~ reorganization_type(X3,X5,esk11_0)
    | ~ class(esk1_0,X6,esk11_0)
    | ~ class(X3,X6,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X2)
    | ~ reorganization(X3,esk11_0,X1)
    | ~ organization(X3,esk11_0)
    | ~ organization(X3,X1)
    | ~ greater(X4,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_12,negated_conjecture,
    reorganization_type(esk1_0,esk3_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_13,hypothesis,
    ! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28] :
      ( ~ organization(X17,X26)
      | ~ organization(X18,X26)
      | ~ organization(X17,X27)
      | ~ organization(X18,X27)
      | ~ class(X17,X20,X26)
      | ~ class(X18,X20,X26)
      | ~ survival_chance(X17,X21,X26)
      | ~ survival_chance(X18,X21,X26)
      | ~ reorganization(X17,X26,X27)
      | ~ reorganization(X18,X26,X28)
      | ~ reorganization_type(X17,X19,X26)
      | ~ reorganization_type(X18,X19,X26)
      | ~ survival_chance(X17,X22,X27)
      | ~ survival_chance(X18,X23,X27)
      | ~ complexity(X17,X24,X26)
      | ~ complexity(X18,X25,X26)
      | ~ greater(X25,X24)
      | greater(X22,X23)
      | X22 = X23 ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a11_FOL])])])]) ).

cnf(c_0_14,negated_conjecture,
    ( greater(X1,X2)
    | ~ complexity(X3,X4,esk11_0)
    | ~ reorganization_type(X3,esk3_0,esk11_0)
    | ~ class(esk1_0,X5,esk11_0)
    | ~ class(X3,X5,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X2)
    | ~ reorganization(X3,esk11_0,X1)
    | ~ organization(X3,esk11_0)
    | ~ organization(X3,X1)
    | ~ greater(X4,esk8_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    reorganization_type(esk2_0,esk3_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    organization(esk2_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,hypothesis,
    ( X1 = X2
    | greater(X1,X2)
    | ~ greater(X3,X4)
    | ~ complexity(X5,X3,X6)
    | ~ complexity(X7,X4,X6)
    | ~ survival_chance(X5,X2,X8)
    | ~ survival_chance(X7,X1,X8)
    | ~ reorganization_type(X5,X9,X6)
    | ~ reorganization_type(X7,X9,X6)
    | ~ reorganization(X5,X6,X10)
    | ~ reorganization(X7,X6,X8)
    | ~ survival_chance(X5,X11,X6)
    | ~ survival_chance(X7,X11,X6)
    | ~ class(X5,X12,X6)
    | ~ class(X7,X12,X6)
    | ~ organization(X5,X8)
    | ~ organization(X7,X8)
    | ~ organization(X5,X6)
    | ~ organization(X7,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X10,X11,X12,X13] :
      ( ~ organization(X10,X12)
      | ~ organization(X10,X13)
      | ~ greater(X11,X12)
      | ~ greater(X13,X11)
      | organization(X10,X11) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp13])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( greater(X1,X2)
    | ~ complexity(esk2_0,X3,esk11_0)
    | ~ class(esk1_0,X4,esk11_0)
    | ~ class(esk2_0,X4,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X2)
    | ~ reorganization(esk2_0,esk11_0,X1)
    | ~ organization(esk2_0,X1)
    | ~ greater(X3,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_20,negated_conjecture,
    complexity(esk2_0,esk9_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,negated_conjecture,
    greater(esk9_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_22,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ complexity(X3,X4,esk11_0)
    | ~ reorganization_type(esk1_0,X5,esk11_0)
    | ~ reorganization_type(X3,X5,esk11_0)
    | ~ class(esk1_0,X6,esk11_0)
    | ~ class(X3,X6,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X7)
    | ~ reorganization(X3,esk11_0,X8)
    | ~ organization(esk1_0,X7)
    | ~ organization(X3,esk11_0)
    | ~ organization(X3,X7)
    | ~ survival_chance(esk1_0,X9,esk11_0)
    | ~ survival_chance(esk1_0,X1,X7)
    | ~ survival_chance(X3,X9,esk11_0)
    | ~ survival_chance(X3,X2,X7)
    | ~ greater(X4,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_9]),c_0_10])]) ).

cnf(c_0_23,plain,
    ( organization(X1,X2)
    | ~ greater(X3,X2)
    | ~ greater(X2,X4)
    | ~ organization(X1,X3)
    | ~ organization(X1,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X12,X13,X14] :
      ( ~ reorganization(X12,X13,X14)
      | greater(X14,X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp7])]) ).

cnf(c_0_25,negated_conjecture,
    reorganization(esk1_0,esk11_0,esk12_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_26,negated_conjecture,
    esk10_0 = esk12_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,negated_conjecture,
    ( greater(X1,X2)
    | ~ class(esk1_0,X3,esk11_0)
    | ~ class(esk2_0,X3,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X2)
    | ~ reorganization(esk2_0,esk11_0,X1)
    | ~ organization(esk2_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_28,negated_conjecture,
    class(esk1_0,esk4_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_29,negated_conjecture,
    class(esk2_0,esk4_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_30,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ complexity(X3,X4,esk11_0)
    | ~ reorganization_type(X3,esk3_0,esk11_0)
    | ~ class(esk1_0,X5,esk11_0)
    | ~ class(X3,X5,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X6)
    | ~ reorganization(X3,esk11_0,X7)
    | ~ organization(esk1_0,X6)
    | ~ organization(X3,esk11_0)
    | ~ organization(X3,X6)
    | ~ survival_chance(esk1_0,X8,esk11_0)
    | ~ survival_chance(esk1_0,X1,X6)
    | ~ survival_chance(X3,X8,esk11_0)
    | ~ survival_chance(X3,X2,X6)
    | ~ greater(X4,esk8_0) ),
    inference(spm,[status(thm)],[c_0_22,c_0_12]) ).

cnf(c_0_31,negated_conjecture,
    ( organization(esk1_0,X1)
    | ~ organization(esk1_0,X2)
    | ~ greater(X1,esk11_0)
    | ~ greater(X2,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_10]) ).

cnf(c_0_32,negated_conjecture,
    organization(esk1_0,esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_33,plain,
    ( greater(X1,X2)
    | ~ reorganization(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_34,negated_conjecture,
    reorganization(esk1_0,esk11_0,esk10_0),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    ( greater(X1,X2)
    | ~ reorganization(esk1_0,esk11_0,X2)
    | ~ reorganization(esk2_0,esk11_0,X1)
    | ~ organization(esk2_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_36,negated_conjecture,
    ( organization(esk2_0,X1)
    | ~ organization(esk2_0,X2)
    | ~ greater(X1,esk11_0)
    | ~ greater(X2,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_16]) ).

cnf(c_0_37,negated_conjecture,
    organization(esk2_0,esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_38,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ complexity(esk2_0,X3,esk11_0)
    | ~ class(esk1_0,X4,esk11_0)
    | ~ class(esk2_0,X4,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X5)
    | ~ reorganization(esk2_0,esk11_0,X6)
    | ~ organization(esk1_0,X5)
    | ~ organization(esk2_0,X5)
    | ~ survival_chance(esk1_0,X7,esk11_0)
    | ~ survival_chance(esk2_0,X7,esk11_0)
    | ~ survival_chance(esk1_0,X1,X5)
    | ~ survival_chance(esk2_0,X2,X5)
    | ~ greater(X3,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_16])]) ).

cnf(c_0_39,negated_conjecture,
    ( organization(esk1_0,X1)
    | ~ greater(X1,esk11_0)
    | ~ greater(esk13_0,X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_40,negated_conjecture,
    greater(esk10_0,esk11_0),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_41,negated_conjecture,
    ( greater(X1,esk10_0)
    | ~ reorganization(esk2_0,esk11_0,X1)
    | ~ organization(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_34]) ).

cnf(c_0_42,negated_conjecture,
    reorganization(esk2_0,esk11_0,esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_43,negated_conjecture,
    ( organization(esk2_0,X1)
    | ~ greater(X1,esk11_0)
    | ~ greater(esk13_0,X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_44,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ class(esk1_0,X3,esk11_0)
    | ~ class(esk2_0,X3,esk11_0)
    | ~ reorganization(esk1_0,esk11_0,X4)
    | ~ reorganization(esk2_0,esk11_0,X5)
    | ~ organization(esk1_0,X4)
    | ~ organization(esk2_0,X4)
    | ~ survival_chance(esk1_0,X6,esk11_0)
    | ~ survival_chance(esk2_0,X6,esk11_0)
    | ~ survival_chance(esk1_0,X1,X4)
    | ~ survival_chance(esk2_0,X2,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_20]),c_0_21])]) ).

cnf(c_0_45,negated_conjecture,
    ( organization(esk1_0,esk10_0)
    | ~ greater(esk13_0,esk10_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_46,negated_conjecture,
    greater(esk13_0,esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37])]) ).

cnf(c_0_47,negated_conjecture,
    ( organization(esk2_0,esk10_0)
    | ~ greater(esk13_0,esk10_0) ),
    inference(spm,[status(thm)],[c_0_43,c_0_40]) ).

cnf(c_0_48,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ reorganization(esk1_0,esk11_0,X3)
    | ~ reorganization(esk2_0,esk11_0,X4)
    | ~ organization(esk1_0,X3)
    | ~ organization(esk2_0,X3)
    | ~ survival_chance(esk1_0,X5,esk11_0)
    | ~ survival_chance(esk2_0,X5,esk11_0)
    | ~ survival_chance(esk1_0,X1,X3)
    | ~ survival_chance(esk2_0,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_28]),c_0_29])]) ).

cnf(c_0_49,negated_conjecture,
    organization(esk1_0,esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).

cnf(c_0_50,negated_conjecture,
    organization(esk2_0,esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_46])]) ).

cnf(c_0_51,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ reorganization(esk2_0,esk11_0,X3)
    | ~ survival_chance(esk1_0,X4,esk11_0)
    | ~ survival_chance(esk2_0,X4,esk11_0)
    | ~ survival_chance(esk1_0,X1,esk10_0)
    | ~ survival_chance(esk2_0,X2,esk10_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_49]),c_0_50])]) ).

cnf(c_0_52,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ survival_chance(esk1_0,X3,esk11_0)
    | ~ survival_chance(esk2_0,X3,esk11_0)
    | ~ survival_chance(esk1_0,X1,esk10_0)
    | ~ survival_chance(esk2_0,X2,esk10_0) ),
    inference(spm,[status(thm)],[c_0_51,c_0_42]) ).

cnf(c_0_53,negated_conjecture,
    survival_chance(esk1_0,esk5_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_54,negated_conjecture,
    survival_chance(esk2_0,esk5_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_55,negated_conjecture,
    ( X1 = X2
    | greater(X1,X2)
    | ~ survival_chance(esk1_0,X1,esk10_0)
    | ~ survival_chance(esk2_0,X2,esk10_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).

cnf(c_0_56,negated_conjecture,
    survival_chance(esk1_0,esk6_0,esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_57,negated_conjecture,
    ( esk6_0 = X1
    | greater(esk6_0,X1)
    | ~ survival_chance(esk2_0,X1,esk10_0) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_58,negated_conjecture,
    survival_chance(esk2_0,esk7_0,esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_59,negated_conjecture,
    esk6_0 != esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_60,negated_conjecture,
    ~ greater(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_61,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 09:17:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.22/1.40  # Preprocessing time       : 0.016 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 62
% 0.22/1.40  # Proof object clause steps            : 51
% 0.22/1.40  # Proof object formula steps           : 11
% 0.22/1.40  # Proof object conjectures             : 50
% 0.22/1.40  # Proof object clause conjectures      : 47
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 24
% 0.22/1.40  # Proof object initial formulas used   : 5
% 0.22/1.40  # Proof object generating inferences   : 24
% 0.22/1.40  # Proof object simplifying inferences  : 30
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 13
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.40  # Initial clauses                      : 38
% 0.22/1.40  # Removed in clause preprocessing      : 0
% 0.22/1.40  # Initial clauses in saturation        : 38
% 0.22/1.40  # Processed clauses                    : 815
% 0.22/1.40  # ...of these trivial                  : 0
% 0.22/1.41  # ...subsumed                          : 360
% 0.22/1.41  # ...remaining for further processing  : 455
% 0.22/1.41  # Other redundant clauses eliminated   : 1
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 24
% 0.22/1.41  # Backward-rewritten                   : 28
% 0.22/1.41  # Generated clauses                    : 1401
% 0.22/1.41  # ...of the previous two non-trivial   : 1135
% 0.22/1.41  # Contextual simplify-reflections      : 526
% 0.22/1.41  # Paramodulations                      : 1399
% 0.22/1.41  # Factorizations                       : 1
% 0.22/1.41  # Equation resolutions                 : 1
% 0.22/1.41  # Current number of processed clauses  : 402
% 0.22/1.41  #    Positive orientable unit clauses  : 46
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 23
% 0.22/1.41  #    Non-unit-clauses                  : 333
% 0.22/1.41  # Current number of unprocessed clauses: 274
% 0.22/1.41  # ...number of literals in the above   : 2134
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 52
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 48083
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 10351
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 796
% 0.22/1.41  # Unit Clause-clause subsumption calls : 1614
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 6
% 0.22/1.41  # BW rewrite match successes           : 6
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 47945
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.118 s
% 0.22/1.41  # System time              : 0.003 s
% 0.22/1.41  # Total time               : 0.121 s
% 0.22/1.41  # Maximum resident set size: 4376 pages
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------