TSTP Solution File: MGT032-2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : MGT032-2 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n011.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 : Thu Aug 31 09:07:48 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   34 (   6 unt;  13 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   77 (  41   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  10   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    environment: $i > $o ).

tff(decl_23,type,
    subpopulations: ( $i * $i * $i * $i ) > $o ).

tff(decl_24,type,
    growth_rate: ( $i * $i ) > $i ).

tff(decl_25,type,
    greater: ( $i * $i ) > $o ).

tff(decl_26,type,
    selection_favors: ( $i * $i * $i ) > $o ).

tff(decl_27,type,
    stable: $i > $o ).

tff(decl_28,type,
    sk1: $i > $i ).

tff(decl_29,type,
    in_environment: ( $i * $i ) > $o ).

tff(decl_30,type,
    first_movers: $i ).

tff(decl_31,type,
    efficient_producers: $i ).

tff(decl_32,type,
    greater_or_equal: ( $i * $i ) > $o ).

tff(decl_33,type,
    sk2: $i ).

tff(decl_34,type,
    sk3: $i > $i ).

cnf(l1_3,hypothesis,
    ( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ greater_or_equal(X2,sk1(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_3) ).

cnf(prove_t1_7,negated_conjecture,
    ( greater_or_equal(sk3(X1),X1)
    | ~ in_environment(sk2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_7) ).

cnf(mp1_high_growth_rates_1,axiom,
    ( selection_favors(X3,X2,X4)
    | ~ environment(X1)
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ greater(growth_rate(X3,X4),growth_rate(X2,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1_high_growth_rates_1) ).

cnf(prove_t1_8,negated_conjecture,
    ( ~ in_environment(sk2,X1)
    | ~ selection_favors(efficient_producers,first_movers,sk3(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_8) ).

cnf(prove_t1_6,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,sk2,sk3(X1))
    | ~ in_environment(sk2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_6) ).

cnf(prove_t1_4,negated_conjecture,
    environment(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_4) ).

cnf(prove_t1_5,negated_conjecture,
    stable(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_5) ).

cnf(l1_2,hypothesis,
    ( in_environment(X1,sk1(X1))
    | ~ environment(X1)
    | ~ stable(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_2) ).

cnf(c_0_8,hypothesis,
    ( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ greater_or_equal(X2,sk1(X1)) ),
    l1_3 ).

cnf(c_0_9,negated_conjecture,
    ( greater_or_equal(sk3(X1),X1)
    | ~ in_environment(sk2,X1) ),
    prove_t1_7 ).

cnf(c_0_10,axiom,
    ( selection_favors(X3,X2,X4)
    | ~ environment(X1)
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ greater(growth_rate(X3,X4),growth_rate(X2,X4)) ),
    mp1_high_growth_rates_1 ).

cnf(c_0_11,negated_conjecture,
    ( greater(growth_rate(efficient_producers,sk3(sk1(X1))),growth_rate(first_movers,sk3(sk1(X1))))
    | ~ in_environment(sk2,sk1(X1))
    | ~ stable(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,sk3(sk1(X1)))
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ in_environment(sk2,X1)
    | ~ selection_favors(efficient_producers,first_movers,sk3(X1)) ),
    prove_t1_8 ).

cnf(c_0_13,negated_conjecture,
    ( ~ in_environment(sk2,sk1(X1))
    | ~ stable(X1)
    | ~ subpopulations(first_movers,efficient_producers,X2,sk3(sk1(X1)))
    | ~ subpopulations(first_movers,efficient_producers,X1,sk3(sk1(X1)))
    | ~ environment(X2)
    | ~ environment(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,sk2,sk3(X1))
    | ~ in_environment(sk2,X1) ),
    prove_t1_6 ).

cnf(c_0_15,negated_conjecture,
    environment(sk2),
    prove_t1_4 ).

cnf(c_0_16,negated_conjecture,
    ( ~ in_environment(sk2,sk1(X1))
    | ~ stable(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,sk3(sk1(X1)))
    | ~ environment(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    stable(sk2),
    prove_t1_5 ).

cnf(c_0_18,negated_conjecture,
    ~ in_environment(sk2,sk1(sk2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_17]),c_0_15])]) ).

cnf(c_0_19,hypothesis,
    ( in_environment(X1,sk1(X1))
    | ~ environment(X1)
    | ~ stable(X1) ),
    l1_2 ).

cnf(c_0_20,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT032-2 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n011.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.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 28 06:19:25 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.004000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.007000 s
%------------------------------------------------------------------------------