%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT036-2 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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:09 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of clauses : 15 ( 5 unt; 0 nHn; 14 RR)
% Number of literals : 39 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(mp_growth_rate_relationships_3,axiom,
( ~ greater(zero,growth_rate(X0,X1))
| environment(X2) ),
file('theBenchmark.p',mp_growth_rate_relationships_3) ).
% FILE RECORD
cnf(a13_11,hypothesis,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(resilience(X2),resilience(X3))
| ~ greater(zero,growth_rate(X2,X1))
| greater(zero,growth_rate(X3,X1)) ),
file('theBenchmark.p',a13_11) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ in_environment(X0,X1)
| ~ greater(resilience(X2),resilience(X3))
| ~ greater(zero,growth_rate(X2,X1))
| greater(zero,growth_rate(X3,X1)) ),
inference(resolution,[status(thm)],[mp_growth_rate_relationships_3,a13_11]) ).
% FILE RECORD
cnf(d2_9,hypothesis,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X2,X1,X3)
| greater(zero,growth_rate(X1,X3)) ),
file('theBenchmark.p',d2_9) ).
% FILE RECORD
cnf(mp_time_point_occur_2,axiom,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| in_environment(X0,X1) ),
file('theBenchmark.p',mp_time_point_occur_2) ).
% FILE RECORD
cnf(mp_growth_rate_relationships_5,axiom,
( ~ greater_or_equal(growth_rate(X0,X1),zero)
| ~ greater(zero,growth_rate(X0,X1)) ),
file('theBenchmark.p',mp_growth_rate_relationships_5) ).
% FILE RECORD
cnf(d2_8,hypothesis,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ outcompetes(X2,X1,X3)
| greater_or_equal(growth_rate(X2,X3),zero) ),
file('theBenchmark.p',d2_8) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ~ greater(zero,growth_rate(X0,X1))
| ~ environment(X2)
| ~ subpopulations(X3,X0,X2,X1)
| ~ outcompetes(X0,X3,X1) ),
inference(resolution,[status(thm)],[mp_growth_rate_relationships_5,d2_8]) ).
% CNF SPASS RESOLUTION.
cnf(c_21,plain,
( ~ greater(zero,growth_rate(X0,X1))
| ~ subpopulations(X2,X0,X3,X1)
| ~ outcompetes(X0,X2,X1) ),
inference(resolution,[status(thm)],[mp_growth_rate_relationships_3,c_20]) ).
% FILE RECORD
cnf(mp_symmetry_of_subpopulations_1,axiom,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| subpopulations(X2,X1,X0,X3) ),
file('theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
% FILE RECORD
cnf(prove_t5_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('theBenchmark.p',prove_t5_13) ).
% FILE RECORD
cnf(a2_10,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('theBenchmark.p',a2_10) ).
% FILE RECORD
cnf(prove_t5_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('theBenchmark.p',prove_t5_14) ).
% FILE RECORD
cnf(prove_t5_12,negated_conjecture,
environment(sk1),
file('theBenchmark.p',prove_t5_12) ).
% CNF SPASS RESOLUTION.
cnf(c_22,plain,
$false,
inference(resolution,[status(thm)],[c_17,d2_9,mp_time_point_occur_2,c_21,mp_symmetry_of_subpopulations_1,prove_t5_13,a2_10,prove_t5_14,prove_t5_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT036-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 12:41:46 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37
% 0.09/0.37 % Input Clauses:
% 0.09/0.37 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.09/0.37 % 2:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1) -> in_environment(x0,x1)
% 0.09/0.37 % 3:2:3:INP:TopTopTop: greater(zero,growth_rate(x0,x1)) -> environment(x2)
% 0.09/0.37 % 4:2:4:INP:TopTopTopTop: greater(zero,growth_rate(x0,x1)) -> subpopulations(x0,x2,x3,x1)
% 0.09/0.37 % 5:2:2:INP:TopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x0,x1)) ->
% 0.09/0.37 % 6:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> greater(zero,growth_rate(x1,x3)),greater_or_equal(growth_rate(x1,x3),zero)
% 0.09/0.37 % 7:5:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater_or_equal(growth_rate(x2,x3),zero),greater(zero,growth_rate(x1,x3)) -> outcompetes(x2,x1,x3)
% 0.09/0.37 % 8:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater_or_equal(growth_rate(x2,x3),zero)
% 0.09/0.37 % 9:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater(zero,growth_rate(x1,x3))
% 0.09/0.37 % 10:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.09/0.37 % 11:5:4:INP:TopTopTopTop: environment(x0),in_environment(x0,x1),greater(resilience(x2),resilience(x3)),greater(zero,growth_rate(x2,x1)) -> greater(zero,growth_rate(x3,x1))
% 0.09/0.37 % 12:1:0:INP:: -> environment(sk1)
% 0.09/0.37 % 13:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.09/0.37 % 14:1:0:INP:: -> outcompetes(first_movers,efficient_producers,sk2)
% 0.09/0.37
% 0.09/0.37 % Predicates: environment subpopulations in_environment greater greater_or_equal outcompetes
% 0.09/0.37 % Fol Constants: first_movers efficient_producers zero sk1 sk2
% 0.09/0.37 % Fol Functions: growth_rate resilience
% 0.09/0.37 % Problem Properties:
% 0.09/0.37 % This is a full first-order problem without equality. The Problem is linear.
% 0.09/0.37
% 0.09/0.37
% 0.09/0.37 % Reduced Input Axiom Clauses:
% 0.09/0.37 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.09/0.37 % 2:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1) -> in_environment(x0,x1)
% 0.09/0.37 % 3:2:3:INP:TopTopTop: greater(zero,growth_rate(x0,x1)) -> environment(x2)
% 0.09/0.37 % 4:2:4:INP:TopTopTopTop: greater(zero,growth_rate(x0,x1)) -> subpopulations(x0,x2,x3,x1)
% 0.09/0.37 % 5:2:2:INP:TopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x0,x1)) ->
% 0.09/0.37 % 6:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> greater(zero,growth_rate(x1,x3)),greater_or_equal(growth_rate(x1,x3),zero)
% 0.09/0.37
% 0.09/0.37 % Reduced Input Conjecture Clauses:
% 0.09/0.37 % 16:3:3:[3.1,7.0,4.1,15.1]:TopTopTop: greater_or_equal(growth_rate(x0,x1),zero),greater(zero,growth_rate(x2,x1)) -> outcompetes(x0,x2,x1)
% 0.09/0.37 % 8:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater_or_equal(growth_rate(x2,x3),zero)
% 0.09/0.37 % 9:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater(zero,growth_rate(x1,x3))
% 0.09/0.37 % 10:1:0:INP:: -> greater(resilience(efficient_producers),resilience(first_movers))
% 0.09/0.37 % 17:4:4:[3.1,11.0]:TopTopTopTop: in_environment(x0,x1),greater(resilience(x2),resilience(x3)),greater(zero,growth_rate(x2,x1)) -> greater(zero,growth_rate(x3,x1))
% 0.09/0.37 % 12:1:0:INP:: -> environment(sk1)
% 0.09/0.37 % 13:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.09/0.37 % 14:1:0:INP:: -> outcompetes(first_movers,efficient_producers,sk2)
% 0.09/0.37
% 0.09/0.37
% 0.09/0.37 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 25 atoms initially. Used heuristic: lmodel_grow ===
% 0.09/0.37
% 0.09/0.37
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable
% 0.09/0.37 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37
% 0.09/0.37 % SPASS-SCL-FOL Statistics:
% 0.09/0.37 % Number of learned clauses: 3
% 0.09/0.37 % Number of propagations: 15
% 0.09/0.37 % Number of decisions: 6
% 0.09/0.37 % Number of resolutions: 11
% 0.09/0.37 % Number of condensations: 0
% 0.09/0.37 % Number of sub resolutions: 4
% 0.09/0.37
% 0.09/0.37 % Solver is done. Empty clause found
% 0.09/0.37
% 0.09/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.09/0.37
% 0.09/0.37
% 0.09/0.37 % Needed: 0:00:00.00
% 0.09/0.37
% 0.09/0.37 % ###
% 0.09/0.37 % ### Pagesize: 8192
% 0.09/0.37 % ### Marksize: 0
% 0.09/0.37 % ### Memory demanded: 398 KBytes
% 0.09/0.37 % ### Memory freed: 398 KBytes
% 0.09/0.37 % ### Memory remaining: 0 Bytes
% 0.09/0.37 % ### Pages allocated: 119 Pages
% 0.09/0.37 % ###
%------------------------------------------------------------------------------