%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT030-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 : 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.03s 0.31s
% Output : Proof 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 24 ( 3 unt; 7 nHn; 24 RR)
% Number of literals : 95 ( 0 equ; 70 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 : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_6,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater(X2,sk2(X0))
| greater_or_equal(sk1(X1,X0),X1)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_6) ).
% FILE RECORD
cnf(prove_l12_16,negated_conjecture,
( ~ in_environment(sk4,X0)
| ~ greater(growth_rate(efficient_producers,sk5(X0)),growth_rate(first_movers,sk5(X0)))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
file('theBenchmark.p',prove_l12_16) ).
% FILE RECORD
cnf(prove_l12_14,negated_conjecture,
( ~ in_environment(sk4,X0)
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| subpopulations(first_movers,efficient_producers,sk4,sk5(X0)) ),
file('theBenchmark.p',prove_l12_14) ).
% FILE RECORD
cnf(prove_l12_15,negated_conjecture,
( ~ in_environment(sk4,X0)
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| greater(sk5(X0),X0) ),
file('theBenchmark.p',prove_l12_15) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_5,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(growth_rate(efficient_producers,sk2(X0)),growth_rate(first_movers,sk2(X0)))
| greater_or_equal(sk1(X1,X0),X1) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_5) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ in_environment(sk4,sk2(X0))
| ~ environment(X0)
| ~ in_environment(X0,X1)
| greater(sk5(sk2(X0)),sk2(X0))
| greater_or_equal(sk1(X1,X0),X1) ),
inference(resolution,[status(thm)],[prove_l12_15,mp_earliest_time_growth_rate_exceeds_5]) ).
% FILE RECORD
cnf(prove_l12_13,negated_conjecture,
stable(sk4),
file('theBenchmark.p',prove_l12_13) ).
% FILE RECORD
cnf(prove_l12_12,negated_conjecture,
environment(sk4),
file('theBenchmark.p',prove_l12_12) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_4,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater(X2,sk2(X0))
| subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_4) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_3,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(growth_rate(efficient_producers,sk2(X0)),growth_rate(first_movers,sk2(X0)))
| subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_3) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_9,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(growth_rate(efficient_producers,sk1(X1,X0)),growth_rate(first_movers,sk1(X1,X0)))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater(X2,sk2(X0))
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_9) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_8,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(growth_rate(efficient_producers,sk1(X1,X0)),growth_rate(first_movers,sk1(X1,X0)))
| ~ greater(growth_rate(efficient_producers,sk2(X0)),growth_rate(first_movers,sk2(X0))) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_8) ).
% FILE RECORD
cnf(l1_11,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ greater_or_equal(X1,sk3(X0))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
file('theBenchmark.p',l1_11) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
( ~ in_environment(sk4,sk2(sk4))
| ~ environment(sk4)
| ~ in_environment(sk4,X0)
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk1(X0,sk4))
| ~ greater_or_equal(sk1(X0,sk4),sk3(X1)) ),
inference(resolution,[status(thm)],[mp_earliest_time_growth_rate_exceeds_9,prove_l12_16,prove_l12_14,prove_l12_15,mp_earliest_time_growth_rate_exceeds_8,l1_11]) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ~ in_environment(sk4,sk2(sk4))
| ~ in_environment(sk4,X0)
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk1(X0,sk4))
| ~ greater_or_equal(sk1(X0,sk4),sk3(X1)) ),
inference(resolution,[status(thm)],[prove_l12_12,c_19]) ).
% CNF SPASS RESOLUTION.
cnf(c_23,plain,
( ~ in_environment(sk4,sk2(sk4))
| ~ in_environment(sk4,X0)
| ~ environment(sk4)
| ~ stable(sk4)
| ~ greater_or_equal(sk1(X0,sk4),sk3(sk4)) ),
inference(resolution,[status(thm)],[mp_earliest_time_growth_rate_exceeds_4,prove_l12_16,prove_l12_14,prove_l12_15,mp_earliest_time_growth_rate_exceeds_3,c_20]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
( ~ in_environment(sk4,sk2(sk4))
| ~ in_environment(sk4,X0)
| ~ stable(sk4)
| ~ greater_or_equal(sk1(X0,sk4),sk3(sk4)) ),
inference(resolution,[status(thm)],[prove_l12_12,c_23]) ).
% CNF SPASS RESOLUTION.
cnf(c_25,plain,
( ~ in_environment(sk4,sk2(sk4))
| ~ in_environment(sk4,X0)
| ~ greater_or_equal(sk1(X0,sk4),sk3(sk4)) ),
inference(resolution,[status(thm)],[prove_l12_13,c_24]) ).
% FILE RECORD
cnf(l1_10,hypothesis,
( ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,sk3(X0)) ),
file('theBenchmark.p',l1_10) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_7,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| ~ greater(growth_rate(efficient_producers,sk1(X1,X0)),growth_rate(first_movers,sk1(X1,X0)))
| in_environment(X0,sk2(X0)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_7) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_1,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| subpopulations(first_movers,efficient_producers,X0,sk1(X1,X0))
| in_environment(X0,sk2(X0)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_1) ).
% FILE RECORD
cnf(mp_earliest_time_growth_rate_exceeds_2,axiom,
( ~ environment(X0)
| ~ in_environment(X0,X1)
| greater_or_equal(sk1(X1,X0),X1)
| in_environment(X0,sk2(X0)) ),
file('theBenchmark.p',mp_earliest_time_growth_rate_exceeds_2) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ environment(X0)
| ~ stable(X0)
| in_environment(X0,sk2(X0)) ),
inference(resolution,[status(thm)],[l1_11,mp_earliest_time_growth_rate_exceeds_7,mp_earliest_time_growth_rate_exceeds_1,mp_earliest_time_growth_rate_exceeds_2,l1_10]) ).
% CNF SPASS RESOLUTION.
cnf(c_28,plain,
$false,
inference(resolution,[status(thm)],[mp_earliest_time_growth_rate_exceeds_6,prove_l12_16,prove_l12_14,c_17,mp_earliest_time_growth_rate_exceeds_5,c_25,l1_10,c_18,prove_l12_12,prove_l12_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT030-1 : 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.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 7 12:19:41 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.31
% 0.03/0.31 % Input Clauses:
% 0.03/0.31 % 1:4:2:INP:TopTop: environment(x0),in_environment(x0,x1) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),in_environment(x0,sk2(x0))
% 0.03/0.31 % 2:4:2:INP:TopTop: environment(x0),in_environment(x0,x1) -> greater_or_equal(sk1(x1,x0),x1),in_environment(x0,sk2(x0))
% 0.03/0.31 % 3:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0))
% 0.03/0.31 % 4:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31 % 5:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) -> greater_or_equal(sk1(x1,x0),x1)
% 0.03/0.31 % 6:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> greater_or_equal(sk1(x1,x0),x1),greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31 % 7:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))) -> in_environment(x0,sk2(x0))
% 0.03/0.31 % 8:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) ->
% 0.03/0.31 % 9:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31 % 10:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk3(x0))
% 0.03/0.31 % 11: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),growth_rate(first_movers,x1))
% 0.03/0.31 % 12:1:0:INP:: -> environment(sk4)
% 0.03/0.31 % 13:1:0:INP:: -> stable(sk4)
% 0.03/0.31 % 14:3:1:INP:Top: in_environment(sk4,x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)),subpopulations(first_movers,efficient_producers,sk4,sk5(x0))
% 0.03/0.31 % 15:3:1:INP:Top: in_environment(sk4,x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)),greater(sk5(x0),x0)
% 0.03/0.31 % 16:3:1:INP:Top: in_environment(sk4,x0),greater(growth_rate(efficient_producers,sk5(x0)),growth_rate(first_movers,sk5(x0))) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0))
% 0.03/0.31
% 0.03/0.31 % Predicates: environment in_environment subpopulations greater_or_equal greater stable
% 0.03/0.31 % Fol Constants: first_movers efficient_producers sk4
% 0.03/0.31 % Fol Functions: sk1 sk2 growth_rate sk3 sk5
% 0.03/0.31 % Problem Properties:
% 0.03/0.31 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.03/0.31
% 0.03/0.31
% 0.03/0.31 % Reduced Input Axiom Clauses:
% 0.03/0.31 % 1:4:2:INP:TopTop: environment(x0),in_environment(x0,x1) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),in_environment(x0,sk2(x0))
% 0.03/0.31 % 2:4:2:INP:TopTop: environment(x0),in_environment(x0,x1) -> greater_or_equal(sk1(x1,x0),x1),in_environment(x0,sk2(x0))
% 0.03/0.31 % 3:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0))
% 0.03/0.31 % 4:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> subpopulations(first_movers,efficient_producers,x0,sk1(x1,x0)),greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31 % 5:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) -> greater_or_equal(sk1(x1,x0),x1)
% 0.03/0.31 % 6:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> greater_or_equal(sk1(x1,x0),x1),greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31 % 7:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))) -> in_environment(x0,sk2(x0))
% 0.03/0.31 % 8:4:2:INP:TopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))),greater(growth_rate(efficient_producers,sk2(x0)),growth_rate(first_movers,sk2(x0))) ->
% 0.03/0.31 % 9:6:3:INP:TopTopTop: environment(x0),in_environment(x0,x1),greater(growth_rate(efficient_producers,sk1(x1,x0)),growth_rate(first_movers,sk1(x1,x0))),subpopulations(first_movers,efficient_producers,x0,x2),greater(x2,sk2(x0)) -> greater(growth_rate(efficient_producers,x2),growth_rate(first_movers,x2))
% 0.03/0.31
% 0.03/0.31 % Reduced Input Conjecture Clauses:
% 0.03/0.31 % 10:3:1:INP:Top: environment(x0),stable(x0) -> in_environment(x0,sk3(x0))
% 0.03/0.31 % 11: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),growth_rate(first_movers,x1))
% 0.03/0.31 % 12:1:0:INP:: -> environment(sk4)
% 0.03/0.31 % 13:1:0:INP:: -> stable(sk4)
% 0.03/0.31 % 14:3:1:INP:Top: in_environment(sk4,x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)),subpopulations(first_movers,efficient_producers,sk4,sk5(x0))
% 0.03/0.31 % 15:3:1:INP:Top: in_environment(sk4,x0) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0)),greater(sk5(x0),x0)
% 0.03/0.31 % 16:3:1:INP:Top: in_environment(sk4,x0),greater(growth_rate(efficient_producers,sk5(x0)),growth_rate(first_movers,sk5(x0))) -> greater(growth_rate(efficient_producers,x0),growth_rate(first_movers,x0))
% 0.03/0.31
% 0.03/0.31
% 0.03/0.31 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 48 atoms initially. Used heuristic: lmodel_grow ===
% 0.03/0.31
% 0.03/0.31
% 0.03/0.31
% 0.03/0.31 % SZS status Unsatisfiable
% 0.03/0.31 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.31
% 0.03/0.31 % SPASS-SCL-FOL Statistics:
% 0.03/0.31 % Number of learned clauses: 6
% 0.03/0.31 % Number of propagations: 51
% 0.03/0.31 % Number of decisions: 70
% 0.03/0.31 % Number of resolutions: 32
% 0.03/0.31 % Number of condensations: 1
% 0.03/0.31 % Number of sub resolutions: 5
% 0.03/0.31
% 0.03/0.31 % Solver is done. Empty clause found
% 0.03/0.31
% 0.03/0.31 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.03/0.31 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.03/0.31
% 0.03/0.31
% 0.03/0.31 % Needed: 0:00:00.01
% 0.03/0.31
% 0.03/0.31 % ###
% 0.03/0.31 % ### Pagesize: 8192
% 0.03/0.31 % ### Marksize: 0
% 0.03/0.31 % ### Memory demanded: 840 KBytes
% 0.03/0.31 % ### Memory freed: 840 KBytes
% 0.03/0.31 % ### Memory remaining: 0 Bytes
% 0.03/0.31 % ### Pages allocated: 192 Pages
% 0.03/0.31 % ###
%------------------------------------------------------------------------------