TSTP Solution File: MGT009+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 00:39:55 EDT 2024

% Result   : Theorem 0.23s 0.54s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (  13 unt;   0 def)
%            Number of atoms       :  174 (   0 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  230 (  90   ~;  87   |;  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   :  109 (   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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).

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/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).

fof(mp5,axiom,
    ! [X1,X2] :
      ( organization(X1,X2)
     => ? [X3] : inertia(X1,X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).

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,
    ! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
      ( ~ organization(X22,X29)
      | ~ organization(X23,X30)
      | ~ class(X22,X24,X29)
      | ~ class(X23,X24,X30)
      | ~ size(X22,X25,X29)
      | ~ size(X23,X26,X30)
      | ~ inertia(X22,X27,X29)
      | ~ inertia(X23,X28,X30)
      | ~ greater(X26,X25)
      | greater(X28,X27) ),
    inference(fof_nnf,[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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

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

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

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

fof(c_0_10,hypothesis,
    ! [X14,X15,X16,X17,X18,X19,X20,X21] :
      ( ( ~ greater(X19,X18)
        | greater(X21,X20)
        | ~ organization(X14,X16)
        | ~ organization(X15,X17)
        | ~ reorganization_free(X14,X16,X16)
        | ~ reorganization_free(X15,X17,X17)
        | ~ reproducibility(X14,X18,X16)
        | ~ reproducibility(X15,X19,X17)
        | ~ inertia(X14,X20,X16)
        | ~ inertia(X15,X21,X17) )
      & ( ~ greater(X21,X20)
        | greater(X19,X18)
        | ~ organization(X14,X16)
        | ~ organization(X15,X17)
        | ~ reorganization_free(X14,X16,X16)
        | ~ reorganization_free(X15,X17,X17)
        | ~ reproducibility(X14,X18,X16)
        | ~ reproducibility(X15,X19,X17)
        | ~ inertia(X14,X20,X16)
        | ~ inertia(X15,X21,X17) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a3_FOL])])])]) ).

cnf(c_0_11,negated_conjecture,
    ( greater(X1,X2)
    | ~ size(X3,X4,X5)
    | ~ class(esk2_0,X6,esk9_0)
    | ~ class(X3,X6,X5)
    | ~ greater(esk7_0,X4)
    | ~ inertia(esk2_0,X1,esk9_0)
    | ~ inertia(X3,X2,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_12,negated_conjecture,
    class(esk2_0,esk3_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_13,plain,
    ! [X40,X41] :
      ( ~ organization(X40,X41)
      | inertia(X40,esk10_2(X40,X41),X41) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).

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

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

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

cnf(c_0_17,negated_conjecture,
    ( greater(X1,X2)
    | ~ size(X3,X4,X5)
    | ~ class(X3,esk3_0,X5)
    | ~ greater(esk7_0,X4)
    | ~ inertia(esk2_0,X1,esk9_0)
    | ~ inertia(X3,X2,X5)
    | ~ organization(X3,X5) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_19,negated_conjecture,
    ( greater(esk5_0,X1)
    | ~ greater(X2,X3)
    | ~ reproducibility(X4,X1,X5)
    | ~ reorganization_free(X4,X5,X5)
    | ~ inertia(esk2_0,X2,esk9_0)
    | ~ inertia(X4,X3,X5)
    | ~ organization(X4,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9])]) ).

cnf(c_0_20,negated_conjecture,
    ( greater(esk10_2(esk2_0,esk9_0),X1)
    | ~ size(X2,X3,X4)
    | ~ class(X2,esk3_0,X4)
    | ~ greater(esk7_0,X3)
    | ~ inertia(X2,X1,X4)
    | ~ organization(X2,X4) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9])]) ).

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

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

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

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

cnf(c_0_25,negated_conjecture,
    ( greater(esk5_0,X1)
    | ~ greater(esk10_2(esk2_0,esk9_0),X2)
    | ~ 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_19,c_0_18]),c_0_9])]) ).

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

cnf(c_0_27,negated_conjecture,
    ( greater(esk5_0,X1)
    | ~ reproducibility(X2,X1,X3)
    | ~ reorganization_free(X2,X3,X3)
    | ~ inertia(esk1_0,X4,esk8_0)
    | ~ inertia(X2,X4,X3)
    | ~ organization(X2,X3) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ( greater(esk5_0,X1)
    | ~ reproducibility(X2,X1,X3)
    | ~ reorganization_free(X2,X3,X3)
    | ~ inertia(X2,esk10_2(esk1_0,esk8_0),X3)
    | ~ organization(X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_24])]) ).

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

cnf(c_0_30,negated_conjecture,
    ( greater(esk5_0,X1)
    | ~ reproducibility(esk1_0,X1,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]),c_0_24])]) ).

cnf(c_0_31,negated_conjecture,
    reproducibility(esk1_0,esk4_0,esk8_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.04/0.14  % Problem    : MGT009+1 : TPTP v8.2.0. Released v2.0.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n020.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Sun May 19 00:01:23 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.23/0.52  Running first-order model finding
% 0.23/0.52  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.54  # Version: 3.1.0
% 0.23/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54  # Starting sh5l with 300s (1) cores
% 0.23/0.54  # new_bool_3 with pid 23112 completed with status 0
% 0.23/0.54  # Result found by new_bool_3
% 0.23/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.23/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54  # SAT001_MinMin_p005000_rr_RG with pid 23120 completed with status 0
% 0.23/0.54  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.23/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54  # Preprocessing time       : 0.001 s
% 0.23/0.54  # Presaturation interreduction done
% 0.23/0.54  
% 0.23/0.54  # Proof found!
% 0.23/0.54  # SZS status Theorem
% 0.23/0.54  # SZS output start CNFRefutation
% See solution above
% 0.23/0.54  # Parsed axioms                        : 4
% 0.23/0.54  # Removed by relevancy pruning/SinE    : 0
% 0.23/0.54  # Initial clauses                      : 16
% 0.23/0.54  # Removed in clause preprocessing      : 0
% 0.23/0.54  # Initial clauses in saturation        : 16
% 0.23/0.54  # Processed clauses                    : 53
% 0.23/0.54  # ...of these trivial                  : 0
% 0.23/0.54  # ...subsumed                          : 1
% 0.23/0.54  # ...remaining for further processing  : 52
% 0.23/0.54  # Other redundant clauses eliminated   : 0
% 0.23/0.54  # Clauses deleted for lack of memory   : 0
% 0.23/0.54  # Backward-subsumed                    : 0
% 0.23/0.54  # Backward-rewritten                   : 0
% 0.23/0.54  # Generated clauses                    : 26
% 0.23/0.54  # ...of the previous two non-redundant : 24
% 0.23/0.54  # ...aggressively subsumed             : 0
% 0.23/0.54  # Contextual simplify-reflections      : 0
% 0.23/0.54  # Paramodulations                      : 26
% 0.23/0.54  # Factorizations                       : 0
% 0.23/0.54  # NegExts                              : 0
% 0.23/0.54  # Equation resolutions                 : 0
% 0.23/0.54  # Disequality decompositions           : 0
% 0.23/0.54  # Total rewrite steps                  : 30
% 0.23/0.54  # ...of those cached                   : 23
% 0.23/0.54  # Propositional unsat checks           : 0
% 0.23/0.54  #    Propositional check models        : 0
% 0.23/0.54  #    Propositional check unsatisfiable : 0
% 0.23/0.54  #    Propositional clauses             : 0
% 0.23/0.54  #    Propositional clauses after purity: 0
% 0.23/0.54  #    Propositional unsat core size     : 0
% 0.23/0.54  #    Propositional preprocessing time  : 0.000
% 0.23/0.54  #    Propositional encoding time       : 0.000
% 0.23/0.54  #    Propositional solver time         : 0.000
% 0.23/0.54  #    Success case prop preproc time    : 0.000
% 0.23/0.54  #    Success case prop encoding time   : 0.000
% 0.23/0.54  #    Success case prop solver time     : 0.000
% 0.23/0.54  # Current number of processed clauses  : 36
% 0.23/0.54  #    Positive orientable unit clauses  : 11
% 0.23/0.54  #    Positive unorientable unit clauses: 0
% 0.23/0.54  #    Negative unit clauses             : 1
% 0.23/0.54  #    Non-unit-clauses                  : 24
% 0.23/0.54  # Current number of unprocessed clauses: 3
% 0.23/0.54  # ...number of literals in the above   : 20
% 0.23/0.54  # Current number of archived formulas  : 0
% 0.23/0.54  # Current number of archived clauses   : 16
% 0.23/0.54  # Clause-clause subsumption calls (NU) : 284
% 0.23/0.54  # Rec. Clause-clause subsumption calls : 11
% 0.23/0.54  # Non-unit clause-clause subsumptions  : 0
% 0.23/0.54  # Unit Clause-clause subsumption calls : 0
% 0.23/0.54  # Rewrite failures with RHS unbound    : 0
% 0.23/0.54  # BW rewrite match attempts            : 0
% 0.23/0.54  # BW rewrite match successes           : 0
% 0.23/0.54  # Condensation attempts                : 0
% 0.23/0.54  # Condensation successes               : 0
% 0.23/0.54  # Termbank termtop insertions          : 2365
% 0.23/0.54  # Search garbage collected termcells   : 376
% 0.23/0.54  
% 0.23/0.54  # -------------------------------------------------
% 0.23/0.54  # User time                : 0.009 s
% 0.23/0.54  # System time              : 0.001 s
% 0.23/0.54  # Total time               : 0.010 s
% 0.23/0.54  # Maximum resident set size: 1724 pages
% 0.23/0.54  
% 0.23/0.54  # -------------------------------------------------
% 0.23/0.54  # User time                : 0.009 s
% 0.23/0.54  # System time              : 0.005 s
% 0.23/0.54  # Total time               : 0.013 s
% 0.23/0.54  # Maximum resident set size: 1696 pages
% 0.23/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------