TSTP Solution File: MGT009+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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:30 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :  169 (   0 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  220 (  85   ~;  82   |;  47   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :  105 (   0 sgn  56   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t9_FOL,conjecture,
    ! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
      ( ( organization(X1,X5)
        & organization(X4,X6)
        & reorganization_free(X1,X5,X5)
        & reorganization_free(X4,X6,X6)
        & class(X1,X11,X5)
        & class(X4,X11,X6)
        & reproducibility(X1,X7,X5)
        & reproducibility(X4,X8,X6)
        & size(X1,X12,X5)
        & size(X4,X13,X6)
        & greater(X13,X12) )
     => greater(X8,X7) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_FOL) ).

fof(a5_FOL,hypothesis,
    ! [X1,X4,X11,X12,X13,X9,X10,X5,X6] :
      ( ( organization(X1,X5)
        & organization(X4,X6)
        & class(X1,X11,X5)
        & class(X4,X11,X6)
        & size(X1,X12,X5)
        & size(X4,X13,X6)
        & inertia(X1,X9,X5)
        & inertia(X4,X10,X6)
        & greater(X13,X12) )
     => greater(X10,X9) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a5_FOL) ).

fof(mp5,axiom,
    ! [X1,X2] :
      ( organization(X1,X2)
     => ? [X3] : inertia(X1,X3,X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp5) ).

fof(a3_FOL,hypothesis,
    ! [X1,X4,X5,X6,X7,X8,X9,X10] :
      ( ( organization(X1,X5)
        & organization(X4,X6)
        & reorganization_free(X1,X5,X5)
        & reorganization_free(X4,X6,X6)
        & reproducibility(X1,X7,X5)
        & reproducibility(X4,X8,X6)
        & inertia(X1,X9,X5)
        & inertia(X4,X10,X6) )
     => ( greater(X8,X7)
      <=> greater(X10,X9) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a3_FOL) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
        ( ( organization(X1,X5)
          & organization(X4,X6)
          & reorganization_free(X1,X5,X5)
          & reorganization_free(X4,X6,X6)
          & class(X1,X11,X5)
          & class(X4,X11,X6)
          & reproducibility(X1,X7,X5)
          & reproducibility(X4,X8,X6)
          & size(X1,X12,X5)
          & size(X4,X13,X6)
          & greater(X13,X12) )
       => greater(X8,X7) ),
    inference(assume_negation,[status(cth)],[t9_FOL]) ).

fof(c_0_5,hypothesis,
    ! [X14,X15,X16,X17,X18,X19,X20,X21,X22] :
      ( ~ organization(X14,X21)
      | ~ organization(X15,X22)
      | ~ class(X14,X16,X21)
      | ~ class(X15,X16,X22)
      | ~ size(X14,X17,X21)
      | ~ size(X15,X18,X22)
      | ~ inertia(X14,X19,X21)
      | ~ inertia(X15,X20,X22)
      | ~ greater(X18,X17)
      | greater(X20,X19) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])])])]) ).

fof(c_0_6,negated_conjecture,
    ( organization(esk1_0,esk8_0)
    & organization(esk2_0,esk9_0)
    & reorganization_free(esk1_0,esk8_0,esk8_0)
    & reorganization_free(esk2_0,esk9_0,esk9_0)
    & class(esk1_0,esk3_0,esk8_0)
    & class(esk2_0,esk3_0,esk9_0)
    & reproducibility(esk1_0,esk4_0,esk8_0)
    & reproducibility(esk2_0,esk5_0,esk9_0)
    & size(esk1_0,esk6_0,esk8_0)
    & size(esk2_0,esk7_0,esk9_0)
    & greater(esk7_0,esk6_0)
    & ~ greater(esk5_0,esk4_0) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_7,hypothesis,
    ( greater(X1,X2)
    | ~ greater(X3,X4)
    | ~ inertia(X5,X1,X6)
    | ~ inertia(X7,X2,X8)
    | ~ size(X5,X3,X6)
    | ~ size(X7,X4,X8)
    | ~ class(X5,X9,X6)
    | ~ class(X7,X9,X8)
    | ~ organization(X5,X6)
    | ~ organization(X7,X8) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    size(esk1_0,esk6_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    organization(esk1_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( greater(X1,X2)
    | ~ size(X3,X4,X5)
    | ~ class(esk1_0,X6,esk8_0)
    | ~ class(X3,X6,X5)
    | ~ greater(X4,esk6_0)
    | ~ inertia(esk1_0,X2,esk8_0)
    | ~ inertia(X3,X1,X5)
    | ~ organization(X3,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

cnf(c_0_11,negated_conjecture,
    class(esk1_0,esk3_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_12,plain,
    ! [X4,X5] :
      ( ~ organization(X4,X5)
      | inertia(X4,esk10_2(X4,X5),X5) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])])]) ).

fof(c_0_13,hypothesis,
    ! [X11,X12,X13,X14,X15,X16,X17,X18] :
      ( ( ~ greater(X16,X15)
        | greater(X18,X17)
        | ~ organization(X11,X13)
        | ~ organization(X12,X14)
        | ~ reorganization_free(X11,X13,X13)
        | ~ reorganization_free(X12,X14,X14)
        | ~ reproducibility(X11,X15,X13)
        | ~ reproducibility(X12,X16,X14)
        | ~ inertia(X11,X17,X13)
        | ~ inertia(X12,X18,X14) )
      & ( ~ greater(X18,X17)
        | greater(X16,X15)
        | ~ organization(X11,X13)
        | ~ organization(X12,X14)
        | ~ reorganization_free(X11,X13,X13)
        | ~ reorganization_free(X12,X14,X14)
        | ~ reproducibility(X11,X15,X13)
        | ~ reproducibility(X12,X16,X14)
        | ~ inertia(X11,X17,X13)
        | ~ inertia(X12,X18,X14) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a3_FOL])])]) ).

cnf(c_0_14,negated_conjecture,
    ( greater(X1,X2)
    | ~ size(X3,X4,X5)
    | ~ class(X3,esk3_0,X5)
    | ~ greater(X4,esk6_0)
    | ~ inertia(esk1_0,X2,esk8_0)
    | ~ inertia(X3,X1,X5)
    | ~ organization(X3,X5) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( inertia(X1,esk10_2(X1,X2),X2)
    | ~ organization(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,hypothesis,
    ( greater(X7,X8)
    | ~ inertia(X1,X2,X3)
    | ~ inertia(X4,X5,X6)
    | ~ reproducibility(X1,X7,X3)
    | ~ reproducibility(X4,X8,X6)
    | ~ reorganization_free(X1,X3,X3)
    | ~ reorganization_free(X4,X6,X6)
    | ~ organization(X1,X3)
    | ~ organization(X4,X6)
    | ~ greater(X2,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    reproducibility(esk1_0,esk4_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,negated_conjecture,
    reorganization_free(esk1_0,esk8_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,negated_conjecture,
    ( greater(X1,esk10_2(esk1_0,esk8_0))
    | ~ size(X2,X3,X4)
    | ~ class(X2,esk3_0,X4)
    | ~ greater(X3,esk6_0)
    | ~ inertia(X2,X1,X4)
    | ~ organization(X2,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]) ).

cnf(c_0_20,negated_conjecture,
    size(esk2_0,esk7_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_21,negated_conjecture,
    class(esk2_0,esk3_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_22,negated_conjecture,
    greater(esk7_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_23,negated_conjecture,
    organization(esk2_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_24,negated_conjecture,
    ( greater(X1,esk4_0)
    | ~ greater(X2,X3)
    | ~ reproducibility(X4,X1,X5)
    | ~ reorganization_free(X4,X5,X5)
    | ~ inertia(esk1_0,X3,esk8_0)
    | ~ inertia(X4,X2,X5)
    | ~ organization(X4,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_9])]) ).

cnf(c_0_25,negated_conjecture,
    ( greater(X1,esk10_2(esk1_0,esk8_0))
    | ~ inertia(esk2_0,X1,esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).

cnf(c_0_26,negated_conjecture,
    ( greater(X1,esk4_0)
    | ~ greater(X2,esk10_2(esk1_0,esk8_0))
    | ~ reproducibility(X3,X1,X4)
    | ~ reorganization_free(X3,X4,X4)
    | ~ inertia(X3,X2,X4)
    | ~ organization(X3,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_9])]) ).

cnf(c_0_27,negated_conjecture,
    greater(esk10_2(esk2_0,esk9_0),esk10_2(esk1_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_23])]) ).

cnf(c_0_28,negated_conjecture,
    ( greater(X1,esk4_0)
    | ~ reproducibility(X2,X1,X3)
    | ~ reorganization_free(X2,X3,X3)
    | ~ inertia(X2,esk10_2(esk2_0,esk9_0),X3)
    | ~ organization(X2,X3) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,negated_conjecture,
    reorganization_free(esk2_0,esk9_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_30,negated_conjecture,
    ( greater(X1,esk4_0)
    | ~ reproducibility(esk2_0,X1,esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_29]),c_0_23])]) ).

cnf(c_0_31,negated_conjecture,
    reproducibility(esk2_0,esk5_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_32,negated_conjecture,
    ~ greater(esk5_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun  9 09:45:27 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.015 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 34
% 0.23/1.41  # Proof object clause steps            : 25
% 0.23/1.41  # Proof object formula steps           : 9
% 0.23/1.41  # Proof object conjectures             : 25
% 0.23/1.41  # Proof object clause conjectures      : 22
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 15
% 0.23/1.41  # Proof object initial formulas used   : 4
% 0.23/1.41  # Proof object generating inferences   : 10
% 0.23/1.41  # Proof object simplifying inferences  : 19
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 4
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 16
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 16
% 0.23/1.41  # Processed clauses                    : 47
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 1
% 0.23/1.41  # ...remaining for further processing  : 46
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 38
% 0.23/1.41  # ...of the previous two non-trivial   : 35
% 0.23/1.41  # Contextual simplify-reflections      : 1
% 0.23/1.41  # Paramodulations                      : 38
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 46
% 0.23/1.41  #    Positive orientable unit clauses  : 12
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 1
% 0.23/1.41  #    Non-unit-clauses                  : 33
% 0.23/1.41  # Current number of unprocessed clauses: 4
% 0.23/1.41  # ...number of literals in the above   : 11
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 321
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 18
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 2
% 0.23/1.41  # Unit Clause-clause subsumption calls : 1
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 2534
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.016 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.019 s
% 0.23/1.41  # Maximum resident set size: 2956 pages
%------------------------------------------------------------------------------