%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT028-1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 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:20:07 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 17 ( 4 unt; 4 nHn; 17 RR)
% Number of literals : 59 ( 0 equ; 42 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(l11_9,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater_or_equal(X1,sk3(X0))
| greater(zero,growth_rate(first_movers,X1)) ),
file('theBenchmark.p',l11_9) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_1,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| greater(sk2(X0),appear(efficient_producers,X0)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_1) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_5,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ~ greater(zero,growth_rate(first_movers,sk1(X1,X0)))
| greater(sk2(X0),appear(efficient_producers,X0)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_5) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_2,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| greater_or_equal(sk1(X1,X0),X1)
| greater(sk2(X0),appear(efficient_producers,X0)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_2) ).
% FILE RECORD
cnf(l11_7,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,sk3(X0)) ),
file('theBenchmark.p',l11_7) ).
% FILE RECORD
cnf(prove_l10_11,negated_conjecture,
stable(sk4),
file('theBenchmark.p',prove_l10_11) ).
% FILE RECORD
cnf(prove_l10_10,negated_conjecture,
environment(sk4),
file('theBenchmark.p',prove_l10_10) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_3,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,sk2(X0))
| subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| greater(zero,growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_3) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_6,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ~ greater(zero,growth_rate(first_movers,sk1(X1,X0)))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,sk2(X0))
| greater(zero,growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_6) ).
% FILE RECORD
cnf(mp_first_movers_negative_growth_4,axiom,
( ~ environment(X0)
| ~ stable(X0)
| ~ in_environment(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,sk2(X0))
| greater_or_equal(sk1(X1,X0),X1)
| greater(zero,growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_first_movers_negative_growth_4) ).
% FILE RECORD
cnf(prove_l10_12,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,sk4,sk5(X0)) ),
file('theBenchmark.p',prove_l10_12) ).
% FILE RECORD
cnf(prove_l10_14,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X0))) ),
file('theBenchmark.p',prove_l10_14) ).
% FILE RECORD
cnf(prove_l10_13,negated_conjecture,
( ~ greater(X0,appear(efficient_producers,sk4))
| greater_or_equal(sk5(X0),X0) ),
file('theBenchmark.p',prove_l10_13) ).
% CNF SPASS RESOLUTION.
cnf(c_22,plain,
( ~ environment(sk4)
| ~ stable(sk4)
| ~ greater(sk2(sk4),appear(efficient_producers,sk4)) ),
inference(resolution,[status(thm)],[l11_9,mp_first_movers_negative_growth_3,mp_first_movers_negative_growth_6,mp_first_movers_negative_growth_4,l11_7,prove_l10_12,prove_l10_14,prove_l10_13]) ).
% CNF SPASS RESOLUTION.
cnf(c_23,plain,
( ~ stable(sk4)
| ~ greater(sk2(sk4),appear(efficient_producers,sk4)) ),
inference(resolution,[status(thm)],[prove_l10_10,c_22]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
~ greater(sk2(sk4),appear(efficient_producers,sk4)),
inference(resolution,[status(thm)],[prove_l10_11,c_23]) ).
% CNF SPASS RESOLUTION.
cnf(c_26,plain,
$false,
inference(resolution,[status(thm)],[l11_9,mp_first_movers_negative_growth_1,mp_first_movers_negative_growth_5,mp_first_movers_negative_growth_2,l11_7,c_24,prove_l10_10,prove_l10_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT028-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 12:10:39 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35
% 0.09/0.35 % Input Clauses:
% 0.09/0.35 % 1:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 2:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1) -> greater_or_equal(sk1(x1,x0),x1),greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 3:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35 % 4:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> greater_or_equal(sk1(x1,x0),x1),greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35 % 5:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1),greater(zero,growth_rate(first_movers,sk1(x1,x0))) -> greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 6:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),greater(zero,growth_rate(first_movers,sk1(x1,x0))),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35 % 7:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk3(x0))
% 0.09/0.35 % 8:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk3(x0)) -> greater(growth_rate(efficient_producers,x1),zero)
% 0.09/0.35 % 9:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk3(x0)) -> greater(zero,growth_rate(first_movers,x1))
% 0.09/0.35 % 10:1:0:INP:: -> environment(sk4)
% 0.09/0.35 % 11:1:0:INP:: -> stable(sk4)
% 0.09/0.35 % 12:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)) -> subpopulations(first_movers,efficient_producers,sk4,sk5(x0))
% 0.09/0.35 % 13:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)) -> greater_or_equal(sk5(x0),x0)
% 0.09/0.35 % 14:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)),greater(zero,growth_rate(first_movers,sk5(x0))) ->
% 0.09/0.35
% 0.09/0.35 % Predicates: environment stable in_environment subpopulations greater greater_or_equal
% 0.09/0.35 % Fol Constants: first_movers efficient_producers zero sk4
% 0.09/0.35 % Fol Functions: sk1 sk2 appear growth_rate sk3 sk5
% 0.09/0.35 % Problem Properties:
% 0.09/0.35 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.09/0.35
% 0.09/0.35
% 0.09/0.35 % Reduced Input Axiom Clauses:
% 0.09/0.35 % 1:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 2:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1) -> greater_or_equal(sk1(x1,x0),x1),greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 3:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35 % 4:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> greater_or_equal(sk1(x1,x0),x1),greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35 % 5:5:2:INP:TopTop: environment(x0),stable(x0),in_environment(x0,x1),greater(zero,growth_rate(first_movers,sk1(x1,x0))) -> greater(sk2(x0),appear(efficient_producers,x0))
% 0.09/0.35 % 6:7:3:INP:TopTopTop: environment(x0),stable(x0),in_environment(x0,x1),greater(zero,growth_rate(first_movers,sk1(x1,x0))),subpopulations(first_movers,efficient_producers,x0,x2),greater_or_equal(x2,sk2(x0)) -> greater(zero,growth_rate(first_movers,x2))
% 0.09/0.35
% 0.09/0.35 % Reduced Input Conjecture Clauses:
% 0.09/0.35 % 7:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk3(x0))
% 0.09/0.35 % 8:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk3(x0)) -> greater(growth_rate(efficient_producers,x1),zero)
% 0.09/0.35 % 9:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk3(x0)) -> greater(zero,growth_rate(first_movers,x1))
% 0.14/0.36 % 10:1:0:INP:: -> environment(sk4)
% 0.14/0.36 % 11:1:0:INP:: -> stable(sk4)
% 0.14/0.36 % 12:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)) -> subpopulations(first_movers,efficient_producers,sk4,sk5(x0))
% 0.14/0.36 % 13:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)) -> greater_or_equal(sk5(x0),x0)
% 0.14/0.36 % 14:2:1:INP:Top: greater(x0,appear(efficient_producers,sk4)),greater(zero,growth_rate(first_movers,sk5(x0))) ->
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 43 atoms initially. Used heuristic: lmodel_grow ===
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % SZS status Unsatisfiable
% 0.14/0.36 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.36
% 0.14/0.36 % SPASS-SCL-FOL Statistics:
% 0.14/0.36 % Number of learned clauses: 5
% 0.14/0.36 % Number of propagations: 49
% 0.14/0.36 % Number of decisions: 58
% 0.14/0.36 % Number of resolutions: 24
% 0.14/0.36 % Number of condensations: 1
% 0.14/0.36 % Number of sub resolutions: 6
% 0.14/0.36
% 0.14/0.36 % Solver is done. Empty clause found
% 0.14/0.36
% 0.14/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % Needed: 0:00:00.01
% 0.14/0.36
% 0.14/0.36 % ###
% 0.14/0.36 % ### Pagesize: 8192
% 0.14/0.36 % ### Marksize: 0
% 0.14/0.36 % ### Memory demanded: 645 KBytes
% 0.14/0.36 % ### Memory freed: 645 KBytes
% 0.14/0.36 % ### Memory remaining: 0 Bytes
% 0.14/0.36 % ### Pages allocated: 160 Pages
% 0.14/0.36 % ###
%------------------------------------------------------------------------------