↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:26:56 PM UTC 2026

% Result   : Theorem 0.11s 0.44s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  11 unt;   0 def)
%            Number of atoms       :  133 (  16 equ)
%            Maximal formula atoms :   24 (   3 avg)
%            Number of connectives :  146 (  49   ~;  47   |;  37   &)
%                                         (   4 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(definition_1,axiom,
    ! [X1] :
      ( has_endowment(X1)
    <=> ! [X4] :
          ( ( greater(age(X1,X4),eta)
           => ~ has_immunity(X1,X4) )
          & ( smaller_or_equal(age(X1,X4),eta)
           => has_immunity(X1,X4) )
          & organization(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_1) ).

fof(theorem_6,conjecture,
    ! [X1,X5,X6,X7] :
      ( ( greater(eta,zero)
        & greater(age(X1,X7),eta)
        & smaller_or_equal(age(X1,X6),eta)
        & age(X1,X5) = zero
        & has_endowment(X1)
        & organization(X1) )
     => ( hazard_of_mortality(X1,X6) = hazard_of_mortality(X1,X5)
        & greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6) ).

fof(assumption_3,axiom,
    ! [X1,X5,X4] :
      ( ( ~ has_immunity(X1,X4)
        & has_immunity(X1,X5)
        & organization(X1) )
     => greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_3) ).

fof(definition_smaller_or_equal,axiom,
    ! [X1,X2] :
      ( smaller_or_equal(X1,X2)
    <=> ( X1 = X2
        | smaller(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).

fof(definition_smaller,axiom,
    ! [X1,X2] :
      ( smaller(X1,X2)
    <=> greater(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).

fof(assumption_2,axiom,
    ! [X1,X5,X4] :
      ( ( has_immunity(X1,X4)
        & has_immunity(X1,X5)
        & organization(X1) )
     => hazard_of_mortality(X1,X5) = hazard_of_mortality(X1,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_2) ).

fof(c_0_6,plain,
    ! [X1] :
      ( has_endowment(X1)
    <=> ! [X4] :
          ( ( greater(age(X1,X4),eta)
           => ~ has_immunity(X1,X4) )
          & ( smaller_or_equal(age(X1,X4),eta)
           => has_immunity(X1,X4) )
          & organization(X1) ) ),
    inference(fof_simplification,[status(thm)],[definition_1]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X5,X6,X7] :
        ( ( greater(eta,zero)
          & greater(age(X1,X7),eta)
          & smaller_or_equal(age(X1,X6),eta)
          & age(X1,X5) = zero
          & has_endowment(X1)
          & organization(X1) )
       => ( hazard_of_mortality(X1,X6) = hazard_of_mortality(X1,X5)
          & greater(hazard_of_mortality(X1,X7),hazard_of_mortality(X1,X6)) ) ),
    inference(assume_negation,[status(cth)],[theorem_6]) ).

fof(c_0_8,plain,
    ! [X1,X5,X4] :
      ( ( ~ has_immunity(X1,X4)
        & has_immunity(X1,X5)
        & organization(X1) )
     => greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
    inference(fof_simplification,[status(thm)],[assumption_3]) ).

fof(c_0_9,plain,
    ! [X23,X24,X25,X26] :
      ( ( has_endowment(X26)
        | ~ organization(X26)
        | ~ has_immunity(X26,esk5_1(X26))
        | has_immunity(X26,esk6_1(X26)) )
      & ( has_endowment(X26)
        | ~ organization(X26)
        | ~ has_immunity(X26,esk5_1(X26))
        | greater(age(X26,esk6_1(X26)),eta) )
      & ( has_endowment(X26)
        | ~ organization(X26)
        | smaller_or_equal(age(X26,esk5_1(X26)),eta)
        | has_immunity(X26,esk6_1(X26)) )
      & ( has_endowment(X26)
        | ~ organization(X26)
        | smaller_or_equal(age(X26,esk5_1(X26)),eta)
        | greater(age(X26,esk6_1(X26)),eta) )
      & ( ~ has_endowment(X23)
        | ~ has_immunity(X23,X25)
        | ~ greater(age(X23,X25),eta) )
      & ( ~ has_endowment(X23)
        | has_immunity(X23,X24)
        | ~ smaller_or_equal(age(X23,X24),eta) )
      & ( ~ has_endowment(X23)
        | organization(X23) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])]) ).

fof(c_0_10,negated_conjecture,
    ( ( hazard_of_mortality(esk1_0,esk3_0) != hazard_of_mortality(esk1_0,esk2_0)
      | ~ greater(hazard_of_mortality(esk1_0,esk4_0),hazard_of_mortality(esk1_0,esk3_0)) )
    & greater(eta,zero)
    & greater(age(esk1_0,esk4_0),eta)
    & smaller_or_equal(age(esk1_0,esk3_0),eta)
    & age(esk1_0,esk2_0) = zero
    & has_endowment(esk1_0)
    & organization(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

fof(c_0_11,plain,
    ! [X29,X30] :
      ( ( smaller_or_equal(X29,X30)
        | X29 != X30 )
      & ( smaller_or_equal(X29,X30)
        | ~ smaller(X29,X30) )
      & ( X29 = X30
        | smaller(X29,X30)
        | ~ smaller_or_equal(X29,X30) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])]) ).

fof(c_0_12,plain,
    ! [X31,X32] :
      ( ( smaller(X31,X32)
        | ~ greater(X32,X31) )
      & ( greater(X32,X31)
        | ~ smaller(X31,X32) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])])]) ).

fof(c_0_13,plain,
    ! [X15,X16,X17] :
      ( greater(hazard_of_mortality(X15,X17),hazard_of_mortality(X15,X16))
      | has_immunity(X15,X17)
      | ~ has_immunity(X15,X16)
      | ~ organization(X15) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

cnf(c_0_14,plain,
    ( ~ has_endowment(X1)
    | ~ smaller_or_equal(age(X1,X2),eta)
    | has_immunity(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    smaller_or_equal(age(esk1_0,esk3_0),eta),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    has_endowment(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    ( ~ has_endowment(X1)
    | ~ has_immunity(X1,X2)
    | ~ greater(age(X1,X2),eta) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    greater(age(esk1_0,esk4_0),eta),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    age(esk1_0,esk2_0) = zero,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,plain,
    ( ~ smaller(X1,X2)
    | smaller_or_equal(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,plain,
    ( ~ greater(X1,X2)
    | smaller(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    ( hazard_of_mortality(esk1_0,esk3_0) != hazard_of_mortality(esk1_0,esk2_0)
    | ~ greater(hazard_of_mortality(esk1_0,esk4_0),hazard_of_mortality(esk1_0,esk3_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_24,negated_conjecture,
    has_immunity(esk1_0,esk3_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_25,negated_conjecture,
    organization(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,negated_conjecture,
    ~ has_immunity(esk1_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]) ).

fof(c_0_27,plain,
    ! [X12,X13,X14] :
      ( hazard_of_mortality(X12,X13) = hazard_of_mortality(X12,X14)
      | ~ has_immunity(X12,X14)
      | ~ has_immunity(X12,X13)
      | ~ organization(X12) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_2])])]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ smaller_or_equal(zero,eta)
    | has_immunity(esk1_0,esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_16])]) ).

cnf(c_0_29,plain,
    ( ~ greater(X2,X1)
    | smaller_or_equal(X1,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    greater(eta,zero),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_31,negated_conjecture,
    hazard_of_mortality(esk1_0,esk2_0) != hazard_of_mortality(esk1_0,esk3_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_32,plain,
    ( ~ has_immunity(X1,X3)
    | ~ has_immunity(X1,X2)
    | ~ organization(X1)
    | hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    has_immunity(esk1_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ has_immunity(esk1_0,X1)
    | hazard_of_mortality(esk1_0,X1) != hazard_of_mortality(esk1_0,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_25])]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT057+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n003.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 01:25:32 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox2/solver/bin/eprover --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.11/0.44  % Version: 3.5.1
% 0.11/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44  % Starting sh5l with 300s (1) cores
% 0.11/0.44  % new_bool_3 with pid 3097756 completed with status 0
% 0.11/0.44  % Result found by new_bool_3
% 0.11/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44  % SubtermCWHack with pid 3097763 completed with status 0
% 0.11/0.44  % Result found by SubtermCWHack
% 0.11/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44  % Preprocessing time       : 0.001 s
% 0.11/0.44  
% 0.11/0.44  % Proof found!
% 0.11/0.44  % SZS status Theorem
% 0.11/0.44  % SZS output start CNFRefutation
% See solution above
% 0.11/0.44  % Parsed axioms                        : 10
% 0.11/0.44  % Removed by relevancy pruning/SinE    : 1
% 0.11/0.44  % Initial clauses                      : 24
% 0.11/0.44  % Removed in clause preprocessing      : 0
% 0.11/0.44  % Initial clauses in saturation        : 24
% 0.11/0.44  % Processed clauses                    : 85
% 0.11/0.44  % ...of these trivial                  : 0
% 0.11/0.44  % ...subsumed                          : 24
% 0.11/0.44  % ...remaining for further processing  : 61
% 0.11/0.44  % Other redundant clauses eliminated   : 1
% 0.11/0.44  % Clauses deleted for lack of memory   : 0
% 0.11/0.44  % Backward-subsumed                    : 1
% 0.11/0.44  % Backward-rewritten                   : 1
% 0.11/0.44  % Generated clauses                    : 171
% 0.11/0.44  % ...of the previous two non-redundant : 131
% 0.11/0.44  % ...aggressively subsumed             : 0
% 0.11/0.44  % Contextual simplify-reflections      : 0
% 0.11/0.44  % Paramodulations                      : 167
% 0.11/0.44  % Factorizations                       : 2
% 0.11/0.44  % NegExts                              : 0
% 0.11/0.44  % Equation resolutions                 : 2
% 0.11/0.44  % Disequality decompositions           : 0
% 0.11/0.44  % Total rewrite steps                  : 50
% 0.11/0.44  % ...of those cached                   : 44
% 0.11/0.44  % Propositional unsat checks           : 0
% 0.11/0.44  %    Propositional check models        : 0
% 0.11/0.44  %    Propositional check unsatisfiable : 0
% 0.11/0.44  %    Propositional clauses             : 0
% 0.11/0.44  %    Propositional clauses after purity: 0
% 0.11/0.44  %    Propositional unsat core size     : 0
% 0.11/0.44  %    Propositional preprocessing time  : 0.000
% 0.11/0.44  %    Propositional encoding time       : 0.000
% 0.11/0.44  %    Propositional solver time         : 0.000
% 0.11/0.44  %    Success case prop preproc time    : 0.000
% 0.11/0.44  %    Success case prop encoding time   : 0.000
% 0.11/0.44  %    Success case prop solver time     : 0.000
% 0.11/0.44  % Current number of processed clauses  : 58
% 0.11/0.44  %    Positive orientable unit clauses  : 9
% 0.11/0.44  %    Positive unorientable unit clauses: 0
% 0.11/0.44  %    Negative unit clauses             : 4
% 0.11/0.44  %    Non-unit-clauses                  : 45
% 0.11/0.44  % Current number of unprocessed clauses: 69
% 0.11/0.44  % ...number of literals in the above   : 317
% 0.11/0.44  % Current number of archived formulas  : 0
% 0.11/0.44  % Current number of archived clauses   : 2
% 0.11/0.44  % Clause-clause subsumption calls (NU) : 742
% 0.11/0.44  % Rec. Clause-clause subsumption calls : 569
% 0.11/0.44  % Non-unit clause-clause subsumptions  : 19
% 0.11/0.44  % Unit Clause-clause subsumption calls : 3
% 0.11/0.44  % Rewrite failures with RHS unbound    : 0
% 0.11/0.44  % BW rewrite match attempts            : 2
% 0.11/0.44  % BW rewrite match successes           : 1
% 0.11/0.44  % Condensation attempts                : 0
% 0.11/0.44  % Condensation successes               : 0
% 0.11/0.44  % Termbank termtop insertions          : 3776
% 0.11/0.44  % Search garbage collected termcells   : 384
% 0.11/0.44  
% 0.11/0.44  % -------------------------------------------------
% 0.11/0.44  % User time                : 0.007 s
% 0.11/0.44  % System time              : 0.006 s
% 0.11/0.44  % Total time               : 0.013 s
% 0.11/0.44  % Maximum resident set size: 3592 pages
% 0.11/0.44  
% 0.11/0.44  % -------------------------------------------------
% 0.11/0.44  % User time                : 0.010 s
% 0.11/0.44  % System time              : 0.010 s
% 0.11/0.44  % Total time               : 0.020 s
% 0.11/0.44  % Maximum resident set size: 4864 pages
% 0.11/0.44  % E exiting
%------------------------------------------------------------------------------