%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT032-2 : 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 : n012.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:08 AM UTC 2026
% Result : Unsatisfiable 0.04s 0.30s
% Output : Proof 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 8
% Syntax : Number of clauses : 9 ( 3 unt; 0 nHn; 9 RR)
% Number of literals : 21 ( 0 equ; 13 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 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 : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(l1_3,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater_or_equal(X1,sk1(X0))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
file('theBenchmark.p',l1_3) ).
% FILE RECORD
cnf(mp1_high_growth_rates_1,axiom,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| ~ greater(growth_rate(X2,X3),growth_rate(X1,X3))
| selection_favors(X2,X1,X3) ),
file('theBenchmark.p',mp1_high_growth_rates_1) ).
% FILE RECORD
cnf(prove_t1_6,negated_conjecture,
( ~ in_environment(sk2,X0)
| subpopulations(first_movers,efficient_producers,sk2,sk3(X0)) ),
file('theBenchmark.p',prove_t1_6) ).
% FILE RECORD
cnf(prove_t1_8,negated_conjecture,
( ~ in_environment(sk2,X0)
| ~ selection_favors(efficient_producers,first_movers,sk3(X0)) ),
file('theBenchmark.p',prove_t1_8) ).
% FILE RECORD
cnf(prove_t1_7,negated_conjecture,
( ~ in_environment(sk2,X0)
| greater_or_equal(sk3(X0),X0) ),
file('theBenchmark.p',prove_t1_7) ).
% FILE RECORD
cnf(l1_2,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,sk1(X0)) ),
file('theBenchmark.p',l1_2) ).
% FILE RECORD
cnf(prove_t1_4,negated_conjecture,
environment(sk2),
file('theBenchmark.p',prove_t1_4) ).
% FILE RECORD
cnf(prove_t1_5,negated_conjecture,
stable(sk2),
file('theBenchmark.p',prove_t1_5) ).
% CNF SPASS RESOLUTION.
cnf(c_9,plain,
$false,
inference(resolution,[status(thm)],[l1_3,mp1_high_growth_rates_1,prove_t1_6,prove_t1_8,prove_t1_7,l1_2,prove_t1_4,prove_t1_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT032-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.02 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 7 12:23:26 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30
% 0.04/0.30 % Input Clauses:
% 0.04/0.30 % 1:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(growth_rate(x2,x3),growth_rate(x1,x3)) -> selection_favors(x2,x1,x3)
% 0.04/0.30 % 2:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk1(x0))
% 0.04/0.30 % 3:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk1(x0)) -> greater(growth_rate(efficient_producers,x1),growth_rate(first_movers,x1))
% 0.04/0.30 % 4:1:0:INP:: -> environment(sk2)
% 0.04/0.30 % 5:1:0:INP:: -> stable(sk2)
% 0.04/0.30 % 6:2:1:INP:Top: in_environment(sk2,x0) -> subpopulations(first_movers,efficient_producers,sk2,sk3(x0))
% 0.04/0.30 % 7:2:1:INP:Top: in_environment(sk2,x0) -> greater_or_equal(sk3(x0),x0)
% 0.04/0.30 % 8:2:1:INP:Top: in_environment(sk2,x0),selection_favors(efficient_producers,first_movers,sk3(x0)) ->
% 0.04/0.30
% 0.04/0.30 % Predicates: environment subpopulations greater selection_favors stable in_environment greater_or_equal
% 0.04/0.30 % Fol Constants: first_movers efficient_producers sk2
% 0.04/0.30 % Fol Functions: growth_rate sk1 sk3
% 0.04/0.30 % Problem Properties:
% 0.04/0.30 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.04/0.30
% 0.04/0.30
% 0.04/0.30 % Reduced Input Axiom Clauses:
% 0.04/0.30 % 1:4:4:INP:TopTopTopTop: environment(x0),subpopulations(x1,x2,x0,x3),greater(growth_rate(x2,x3),growth_rate(x1,x3)) -> selection_favors(x2,x1,x3)
% 0.04/0.30
% 0.04/0.30 % Reduced Input Conjecture Clauses:
% 0.04/0.30 % 2:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk1(x0))
% 0.04/0.30 % 3:5:2:INP:TopTop: environment(x0),stable(x0),subpopulations(first_movers,efficient_producers,x0,x1),greater_or_equal(x1,sk1(x0)) -> greater(growth_rate(efficient_producers,x1),growth_rate(first_movers,x1))
% 0.04/0.30 % 4:1:0:INP:: -> environment(sk2)
% 0.04/0.30 % 5:1:0:INP:: -> stable(sk2)
% 0.04/0.30 % 6:2:1:INP:Top: in_environment(sk2,x0) -> subpopulations(first_movers,efficient_producers,sk2,sk3(x0))
% 0.04/0.30 % 7:2:1:INP:Top: in_environment(sk2,x0) -> greater_or_equal(sk3(x0),x0)
% 0.04/0.30 % 8:2:1:INP:Top: in_environment(sk2,x0),selection_favors(efficient_producers,first_movers,sk3(x0)) ->
% 0.04/0.30
% 0.04/0.30
% 0.04/0.30 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 20 atoms initially. Used heuristic: lmodel_grow ===
% 0.04/0.30
% 0.04/0.30
% 0.04/0.30
% 0.04/0.30 % SZS status Unsatisfiable
% 0.04/0.30 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30
% 0.04/0.30 % SPASS-SCL-FOL Statistics:
% 0.04/0.30 % Number of learned clauses: 0
% 0.04/0.30 % Number of propagations: 12
% 0.04/0.30 % Number of decisions: 9
% 0.04/0.30 % Number of resolutions: 7
% 0.04/0.30 % Number of condensations: 0
% 0.04/0.30 % Number of sub resolutions: 0
% 0.04/0.30
% 0.04/0.30 % Solver is done. Empty clause found
% 0.04/0.30
% 0.04/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.04/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.04/0.30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.04/0.30
% 0.04/0.30
% 0.04/0.30 % Needed: 0:00:00.00
% 0.04/0.30
% 0.04/0.30 % ###
% 0.04/0.30 % ### Pagesize: 8192
% 0.04/0.30 % ### Marksize: 0
% 0.04/0.30 % ### Memory demanded: 364 KBytes
% 0.04/0.30 % ### Memory freed: 364 KBytes
% 0.04/0.30 % ### Memory remaining: 0 Bytes
% 0.04/0.30 % ### Pages allocated: 108 Pages
% 0.04/0.30 % ###
%------------------------------------------------------------------------------