%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT036-3 : 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 : n015.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.10s 0.37s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 7
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(d2_2,hypothesis,
( ~ 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) ),
file('theBenchmark.p',d2_2) ).
% 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_star_9,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
file('theBenchmark.p',prove_t5_star_9) ).
% FILE RECORD
cnf(a13_star_6,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('theBenchmark.p',a13_star_6) ).
% FILE RECORD
cnf(a13_star_7,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('theBenchmark.p',a13_star_7) ).
% FILE RECORD
cnf(a13_star_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('theBenchmark.p',a13_star_8) ).
% FILE RECORD
cnf(a13_star_5,hypothesis,
environment(sk1),
file('theBenchmark.p',a13_star_5) ).
% CNF SPASS RESOLUTION.
cnf(c_10,plain,
$false,
inference(resolution,[status(thm)],[d2_2,mp_symmetry_of_subpopulations_1,prove_t5_star_9,a13_star_6,a13_star_7,a13_star_8,a13_star_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036-3 : 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.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 12:45:30 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % Input Clauses:
% 0.10/0.37 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.10/0.37 % 2: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.10/0.37 % 3:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater_or_equal(growth_rate(x2,x3),zero)
% 0.10/0.37 % 4:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater(zero,growth_rate(x1,x3))
% 0.10/0.37 % 5:1:0:INP:: -> environment(sk1)
% 0.10/0.37 % 6:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.10/0.37 % 7:1:0:INP:: -> greater_or_equal(growth_rate(first_movers,sk2),zero)
% 0.10/0.37 % 8:1:0:INP:: -> greater(zero,growth_rate(efficient_producers,sk2))
% 0.10/0.37 % 9:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1),outcompetes(first_movers,efficient_producers,x1) ->
% 0.10/0.37
% 0.10/0.37 % Predicates: environment subpopulations greater_or_equal greater outcompetes
% 0.10/0.37 % Fol Constants: zero sk1 first_movers efficient_producers sk2
% 0.10/0.37 % Fol Functions: growth_rate
% 0.10/0.37 % Problem Properties:
% 0.10/0.37 % This is a full first-order problem without equality. The Problem is linear.
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % Reduced Input Axiom Clauses:
% 0.10/0.37 % 1:3:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3) -> subpopulations(x2,x1,x0,x3)
% 0.10/0.37
% 0.10/0.37 % Reduced Input Conjecture Clauses:
% 0.10/0.37 % 2: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.10/0.37 % 3:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater_or_equal(growth_rate(x2,x3),zero)
% 0.10/0.37 % 4:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),outcompetes(x2,x1,x3) -> greater(zero,growth_rate(x1,x3))
% 0.10/0.37 % 5:1:0:INP:: -> environment(sk1)
% 0.10/0.37 % 6:1:0:INP:: -> subpopulations(first_movers,efficient_producers,sk1,sk2)
% 0.10/0.37 % 7:1:0:INP:: -> greater_or_equal(growth_rate(first_movers,sk2),zero)
% 0.10/0.37 % 8:1:0:INP:: -> greater(zero,growth_rate(efficient_producers,sk2))
% 0.10/0.37 % 9:3:2:INP:TopTop: environment(x0),subpopulations(first_movers,efficient_producers,x0,x1),outcompetes(first_movers,efficient_producers,x1) ->
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 25 atoms initially. Used heuristic: lmodel_grow ===
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % SZS status Unsatisfiable
% 0.10/0.37 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % SPASS-SCL-FOL Statistics:
% 0.10/0.37 % Number of learned clauses: 0
% 0.10/0.37 % Number of propagations: 6
% 0.10/0.37 % Number of decisions: 5
% 0.10/0.37 % Number of resolutions: 6
% 0.10/0.37 % Number of condensations: 0
% 0.10/0.37 % Number of sub resolutions: 0
% 0.10/0.37
% 0.10/0.37 % Solver is done. Empty clause found
% 0.10/0.37
% 0.10/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % Needed: 0:00:00.00
% 0.10/0.37
% 0.10/0.37 % ###
% 0.10/0.37 % ### Pagesize: 8192
% 0.10/0.37 % ### Marksize: 0
% 0.10/0.37 % ### Memory demanded: 324 KBytes
% 0.10/0.37 % ### Memory freed: 324 KBytes
% 0.10/0.37 % ### Memory remaining: 0 Bytes
% 0.10/0.37 % ### Pages allocated: 102 Pages
% 0.10/0.37 % ###
%------------------------------------------------------------------------------