%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : MGT032-2 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n017.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 : Tue Sep 8 06:18:43 AM UTC 2026
% Result : Unsatisfiable 0.33s 0.62s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 9 unt; 0 nHn; 21 RR)
% Number of literals : 43 ( 0 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% 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 : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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,plain,
( ~ environment(X3)
| ~ stable(X3)
| in_environment(X3,sk1(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_2) ).
cnf(c0,plain,
( ~ environment(sk2)
| in_environment(sk2,sk1(sk2)) ),
inference(resolution,[status(thm)],[l1_2,prove_t1_5]) ).
cnf(c1,plain,
in_environment(sk2,sk1(sk2)),
inference(resolution,[status(thm)],[c0,prove_t1_4]) ).
cnf(prove_t1_8,negated_conjecture,
( ~ in_environment(sk2,X8)
| ~ selection_favors(efficient_producers,first_movers,sk3(X8)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_8) ).
cnf(prove_t1_6,negated_conjecture,
( ~ in_environment(sk2,X9)
| subpopulations(first_movers,efficient_producers,sk2,sk3(X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_6) ).
cnf(c3,plain,
subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))),
inference(resolution,[status(thm)],[prove_t1_6,c1]) ).
cnf(mp1_high_growth_rates_1,axiom,
( ~ environment(X5)
| ~ subpopulations(X6,X4,X5,X7)
| ~ greater(growth_rate(X4,X7),growth_rate(X6,X7))
| selection_favors(X4,X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1_high_growth_rates_1) ).
cnf(prove_t1_7,negated_conjecture,
( ~ in_environment(sk2,X2)
| greater_or_equal(sk3(X2),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t1_7) ).
cnf(c2,plain,
greater_or_equal(sk3(sk1(sk2)),sk1(sk2)),
inference(resolution,[status(thm)],[c1,prove_t1_7]) ).
cnf(l1_3,plain,
( ~ environment(X10)
| ~ stable(X10)
| ~ subpopulations(first_movers,efficient_producers,X10,X11)
| ~ greater_or_equal(X11,sk1(X10))
| greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_3) ).
cnf(c4,plain,
( ~ environment(sk2)
| ~ stable(sk2)
| ~ greater_or_equal(sk3(sk1(sk2)),sk1(sk2))
| greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) ),
inference(resolution,[status(thm)],[l1_3,c3]) ).
cnf(c5,plain,
( ~ environment(sk2)
| ~ stable(sk2)
| greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) ),
inference(resolution,[status(thm)],[c4,c2]) ).
cnf(c6,plain,
( ~ environment(sk2)
| greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) ),
inference(resolution,[status(thm)],[c5,prove_t1_5]) ).
cnf(c7,plain,
greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))),
inference(resolution,[status(thm)],[c6,prove_t1_4]) ).
cnf(c8,plain,
( ~ environment(X12)
| ~ subpopulations(first_movers,efficient_producers,X12,sk3(sk1(sk2)))
| selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))) ),
inference(resolution,[status(thm)],[c7,mp1_high_growth_rates_1]) ).
cnf(c9,plain,
( ~ environment(sk2)
| selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))) ),
inference(resolution,[status(thm)],[c8,c3]) ).
cnf(c10,plain,
selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))),
inference(resolution,[status(thm)],[c9,prove_t1_4]) ).
cnf(c11,plain,
~ in_environment(sk2,sk1(sk2)),
inference(resolution,[status(thm)],[c10,prove_t1_8]) ).
cnf(c12,plain,
$false,
inference(resolution,[status(thm)],[c11,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT032-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.08/0.36 % Computer : n017.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 7 12:18:09 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.13/0.42 (re.compile("\."), Token.FullStop),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.13/0.42 (re.compile("\("), Token.OpenPar),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.13/0.42 (re.compile("\)"), Token.ClosePar),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.13/0.42 (re.compile("\["), Token.OpenSquare),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.13/0.42 (re.compile("\]"), Token.CloseSquare),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.13/0.42 (re.compile("~\|"), Token.Nor),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.13/0.42 (re.compile("\|"), Token.Or),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.13/0.42 (re.compile("\?"), Token.Existential),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.13/0.42 (re.compile("\s+"), Token.WhiteSpace),
% 0.13/0.42 /export/starexec/sandbox/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.13/0.43 (re.compile("\$[_a-z0-9_A-Z]*"), Token.DefFunctor),
% 0.23/0.50 /export/starexec/sandbox/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.50 """
% 0.23/0.50 /export/starexec/sandbox/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.23/0.50 """
% 0.33/0.60 /export/starexec/sandbox/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.33/0.60 """
% 0.33/0.62 % Version: 1.5
% 0.33/0.62 % SZS status Unsatisfiable
% 0.33/0.62 % SZS output start CNFRefutation
% See solution above
% 0.33/0.62
% 0.33/0.62 % Initial clauses : 8
% 0.33/0.62 % Processed clauses : 20
% 0.33/0.62 % Factors computed : 0
% 0.33/0.62 % Resolvents computed: 13
% 0.33/0.62 % Tautologies deleted: 0
% 0.33/0.62 % Forward subsumed : 0
% 0.33/0.62 % Backward subsumed : 6
% 0.33/0.62 % -------- CPU Time ---------
% 0.33/0.62 % User time : 0.229 s
% 0.33/0.62 % System time : 0.029 s
% 0.33/0.62 % Total time : 0.258 s
%------------------------------------------------------------------------------