TSTP Solution File: MGT036+3 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n025.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:23:26 EDT 2022

% Result   : Theorem 0.17s 0.51s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(a13_star,plain,
    ? [E,T] :
      ( environment(E)
      & subpopulations(first_movers,efficient_producers,E,T)
      & greater_or_equal(growth_rate(first_movers,T),zero)
      & greater(zero,growth_rate(efficient_producers,T)) ),
    input ).

fof(c4,plain,
    ? [X4,X5] :
      ( environment(X4)
      & subpopulations(first_movers,efficient_producers,X4,X5)
      & greater_or_equal(growth_rate(first_movers,X5),zero)
      & greater(zero,growth_rate(efficient_producers,X5)) ),
    inference(variable_rename,status(thm),[a13_star]) ).

fof(c5,plain,
    ( environment(skolem0001)
    & subpopulations(first_movers,efficient_producers,skolem0001,skolem0002)
    & greater_or_equal(growth_rate(first_movers,skolem0002),zero)
    & greater(zero,growth_rate(efficient_producers,skolem0002)) ),
    inference(skolemize,status(esa),[c4]) ).

cnf(c6,plain,
    environment(skolem0001),
    inference(split_conjunct,status(thm),[c5]) ).

cnf(c7,plain,
    subpopulations(first_movers,efficient_producers,skolem0001,skolem0002),
    inference(split_conjunct,status(thm),[c5]) ).

fof(prove_t5_star,conjecture,
    ? [E,T] :
      ( environment(E)
      & subpopulations(first_movers,efficient_producers,E,T)
      & outcompetes(first_movers,efficient_producers,T) ),
    input ).

fof(c0,negated_conjecture,
    ~ ? [E,T] :
        ( environment(E)
        & subpopulations(first_movers,efficient_producers,E,T)
        & outcompetes(first_movers,efficient_producers,T) ),
    inference(assume_negation,status(cth),[prove_t5_star]) ).

fof(c1,negated_conjecture,
    ! [E,T] :
      ( ~ environment(E)
      | ~ subpopulations(first_movers,efficient_producers,E,T)
      | ~ outcompetes(first_movers,efficient_producers,T) ),
    inference(fof_nnf,status(thm),[c0]) ).

fof(c2,negated_conjecture,
    ! [X2,X3] :
      ( ~ environment(X2)
      | ~ subpopulations(first_movers,efficient_producers,X2,X3)
      | ~ outcompetes(first_movers,efficient_producers,X3) ),
    inference(variable_rename,status(thm),[c1]) ).

cnf(c3,negated_conjecture,
    ( ~ environment(X18)
    | ~ subpopulations(first_movers,efficient_producers,X18,X19)
    | ~ outcompetes(first_movers,efficient_producers,X19) ),
    inference(split_conjunct,status(thm),[c2]) ).

cnf(c20,plain,
    ( ~ environment(skolem0001)
    | ~ outcompetes(first_movers,efficient_producers,skolem0002) ),
    inference(resolution,status(thm),[c3,c7]) ).

fof(mp_symmetry_of_subpopulations,axiom,
    ! [E,S1,S2,T] :
      ( ( environment(E)
        & subpopulations(S1,S2,E,T) )
     => subpopulations(S2,S1,E,T) ),
    input ).

fof(c16,axiom,
    ! [E,S1,S2,T] :
      ( ~ environment(E)
      | ~ subpopulations(S1,S2,E,T)
      | subpopulations(S2,S1,E,T) ),
    inference(fof_nnf,status(thm),[mp_symmetry_of_subpopulations]) ).

fof(c17,axiom,
    ! [X10,X11,X12,X13] :
      ( ~ environment(X10)
      | ~ subpopulations(X11,X12,X10,X13)
      | subpopulations(X12,X11,X10,X13) ),
    inference(variable_rename,status(thm),[c16]) ).

cnf(c18,axiom,
    ( ~ environment(X14)
    | ~ subpopulations(X16,X17,X14,X15)
    | subpopulations(X17,X16,X14,X15) ),
    inference(split_conjunct,status(thm),[c17]) ).

cnf(c19,plain,
    ( ~ environment(skolem0001)
    | subpopulations(efficient_producers,first_movers,skolem0001,skolem0002) ),
    inference(resolution,status(thm),[c18,c7]) ).

cnf(c21,plain,
    subpopulations(efficient_producers,first_movers,skolem0001,skolem0002),
    inference(resolution,status(thm),[c19,c6]) ).

cnf(c8,plain,
    greater_or_equal(growth_rate(first_movers,skolem0002),zero),
    inference(split_conjunct,status(thm),[c5]) ).

cnf(c9,plain,
    greater(zero,growth_rate(efficient_producers,skolem0002)),
    inference(split_conjunct,status(thm),[c5]) ).

fof(d2,plain,
    ! [E,S1,S2,T] :
      ( ( environment(E)
        & subpopulations(S1,S2,E,T) )
     => ( ( greater_or_equal(growth_rate(S2,T),zero)
          & greater(zero,growth_rate(S1,T)) )
      <=> outcompetes(S2,S1,T) ) ),
    input ).

fof(c10,plain,
    ! [E,S1,S2,T] :
      ( ~ environment(E)
      | ~ subpopulations(S1,S2,E,T)
      | ( ( ~ greater_or_equal(growth_rate(S2,T),zero)
          | ~ greater(zero,growth_rate(S1,T))
          | outcompetes(S2,S1,T) )
        & ( ~ outcompetes(S2,S1,T)
          | ( greater_or_equal(growth_rate(S2,T),zero)
            & greater(zero,growth_rate(S1,T)) ) ) ) ),
    inference(fof_nnf,status(thm),[d2]) ).

fof(c11,plain,
    ! [X6,X7,X8,X9] :
      ( ~ environment(X6)
      | ~ subpopulations(X7,X8,X6,X9)
      | ( ( ~ greater_or_equal(growth_rate(X8,X9),zero)
          | ~ greater(zero,growth_rate(X7,X9))
          | outcompetes(X8,X7,X9) )
        & ( ~ outcompetes(X8,X7,X9)
          | ( greater_or_equal(growth_rate(X8,X9),zero)
            & greater(zero,growth_rate(X7,X9)) ) ) ) ),
    inference(variable_rename,status(thm),[c10]) ).

fof(c12,plain,
    ! [X6,X7,X8,X9] :
      ( ( ~ environment(X6)
        | ~ subpopulations(X7,X8,X6,X9)
        | ~ greater_or_equal(growth_rate(X8,X9),zero)
        | ~ greater(zero,growth_rate(X7,X9))
        | outcompetes(X8,X7,X9) )
      & ( ~ environment(X6)
        | ~ subpopulations(X7,X8,X6,X9)
        | ~ outcompetes(X8,X7,X9)
        | greater_or_equal(growth_rate(X8,X9),zero) )
      & ( ~ environment(X6)
        | ~ subpopulations(X7,X8,X6,X9)
        | ~ outcompetes(X8,X7,X9)
        | greater(zero,growth_rate(X7,X9)) ) ),
    inference(distribute,status(thm),[c11]) ).

cnf(c13,plain,
    ( ~ environment(X27)
    | ~ subpopulations(X24,X25,X27,X26)
    | ~ greater_or_equal(growth_rate(X25,X26),zero)
    | ~ greater(zero,growth_rate(X24,X26))
    | outcompetes(X25,X24,X26) ),
    inference(split_conjunct,status(thm),[c12]) ).

cnf(c25,plain,
    ( ~ environment(X33)
    | ~ subpopulations(efficient_producers,X32,X33,skolem0002)
    | ~ greater_or_equal(growth_rate(X32,skolem0002),zero)
    | outcompetes(X32,efficient_producers,skolem0002) ),
    inference(resolution,status(thm),[c13,c9]) ).

cnf(c28,plain,
    ( ~ environment(X34)
    | ~ subpopulations(efficient_producers,first_movers,X34,skolem0002)
    | outcompetes(first_movers,efficient_producers,skolem0002) ),
    inference(resolution,status(thm),[c25,c8]) ).

cnf(c29,plain,
    ( ~ environment(skolem0001)
    | outcompetes(first_movers,efficient_producers,skolem0002) ),
    inference(resolution,status(thm),[c28,c21]) ).

cnf(c30,plain,
    outcompetes(first_movers,efficient_producers,skolem0002),
    inference(resolution,status(thm),[c29,c6]) ).

cnf(c31,plain,
    ~ environment(skolem0001),
    inference(resolution,status(thm),[c30,c20]) ).

cnf(c32,plain,
    $false,
    inference(resolution,status(thm),[c31,c6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.32  % Computer : n025.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jun  9 07:44:05 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.17/0.51  # Version:  1.3
% 0.17/0.51  # SZS status Theorem
% 0.17/0.51  # SZS output start CNFRefutation
% See solution above
% 0.17/0.51  
% 0.17/0.51  # Initial clauses    : 9
% 0.17/0.51  # Processed clauses  : 19
% 0.17/0.51  # Factors computed   : 0
% 0.17/0.51  # Resolvents computed: 14
% 0.17/0.51  # Tautologies deleted: 0
% 0.17/0.51  # Forward subsumed   : 3
% 0.17/0.51  # Backward subsumed  : 6
% 0.17/0.51  # -------- CPU Time ---------
% 0.17/0.51  # User time          : 0.170 s
% 0.17/0.51  # System time        : 0.017 s
% 0.17/0.51  # Total time         : 0.187 s
%------------------------------------------------------------------------------