%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT040-2 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:19:54 AM UTC 2026
% Result : Satisfiable 0.21s 0.48s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 57ERROR: Could not build tree for root 58ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(58,plain,
( ~ environment(u)
| greater(appear(efficient_producers,u),end_time(u))
| in_environment(u,critical_point(u))
| selection_favors(first_movers,efficient_producers,end_time(u)) ),
inference(mrr,[status(thm)],[57,8]),
[iquote('0:MRR:57.1,8.1')] ).
cnf(55,plain,
( ~ environment(u)
| ~ in_environment(u,v)
| ~ in_environment(u,critical_point(u))
| ~ greater(critical_point(u),v)
| greater(appear(efficient_producers,u),v)
| selection_favors(first_movers,efficient_producers,v) ),
inference(res,[status(thm),theory(equality)],[14,16]),
[iquote('0:Res:14.1,16.2')] ).
cnf(49,plain,
( ~ environment(u)
| ~ in_environment(u,v)
| ~ greater(critical_point(u),v)
| greater(appear(efficient_producers,u),v)
| in_environment(u,critical_point(u))
| selection_favors(first_movers,efficient_producers,end_time(u)) ),
inference(res,[status(thm),theory(equality)],[14,11]),
[iquote('0:Res:14.1,11.1')] ).
cnf(52,plain,
( ~ observational_period(u)
| selection_favors(efficient_producers,first_movers,u)
| greater(appear(efficient_producers,u),sk1(u))
| equal(appear(efficient_producers,u),sk1(u))
| greater(sk1(u),appear(efficient_producers,u)) ),
inference(res,[status(thm),theory(equality)],[22,43]),
[iquote('0:Res:22.1,43.0')] ).
cnf(16,axiom,
( ~ environment(u)
| ~ in_environment(u,critical_point(u))
| ~ greater_or_equal(v,appear(efficient_producers,u))
| ~ greater(critical_point(u),v)
| selection_favors(first_movers,efficient_producers,v) ),
file('MGT040-2.p',unknown),
[] ).
cnf(50,plain,
( ~ environment(u)
| ~ in_environment(u,sk2)
| ~ in_environment(u,critical_point(u))
| ~ greater(critical_point(u),sk2)
| greater(appear(efficient_producers,u),sk2) ),
inference(res,[status(thm),theory(equality)],[14,31]),
[iquote('0:Res:14.1,31.2')] ).
cnf(15,axiom,
( ~ environment(u)
| ~ in_environment(u,v)
| ~ greater_or_equal(v,appear(first_movers,u))
| ~ greater(appear(efficient_producers,u),v)
| selection_favors(first_movers,efficient_producers,v) ),
file('MGT040-2.p',unknown),
[] ).
cnf(54,plain,
selection_favors(efficient_producers,first_movers,sk2),
inference(spt,[],[53]),
[iquote('2:Spt:53.0')] ).
cnf(51,plain,
( ~ environment(u)
| greater(appear(efficient_producers,u),end_time(u))
| equal(appear(efficient_producers,u),end_time(u))
| greater(end_time(u),appear(efficient_producers,u)) ),
inference(res,[status(thm),theory(equality)],[8,43]),
[iquote('0:Res:8.1,43.0')] ).
cnf(43,plain,
( ~ in_environment(u,v)
| greater(appear(efficient_producers,u),v)
| equal(v,appear(efficient_producers,u))
| greater(v,appear(efficient_producers,u)) ),
inference(res,[status(thm),theory(equality)],[14,13]),
[iquote('0:Res:14.1,13.0')] ).
cnf(31,plain,
( ~ environment(u)
| ~ in_environment(u,critical_point(u))
| ~ greater_or_equal(sk2,appear(efficient_producers,u))
| ~ greater(critical_point(u),sk2) ),
inference(res,[status(thm),theory(equality)],[16,20]),
[iquote('0:Res:16.4,20.0')] ).
cnf(11,axiom,
( ~ environment(u)
| ~ greater_or_equal(v,appear(efficient_producers,u))
| ~ greater(critical_point(u),v)
| in_environment(u,critical_point(u))
| selection_favors(first_movers,efficient_producers,end_time(u)) ),
file('MGT040-2.p',unknown),
[] ).
cnf(32,plain,
( ~ environment(u)
| ~ in_environment(u,sk2)
| ~ greater_or_equal(sk2,appear(first_movers,u))
| ~ greater(appear(efficient_producers,u),sk2) ),
inference(res,[status(thm),theory(equality)],[15,20]),
[iquote('0:Res:15.4,20.0')] ).
cnf(41,plain,
( ~ environment(u)
| empty(u)
| equal(appear(an_organisation,u),end_time(u))
| greater(end_time(u),appear(an_organisation,u)) ),
inference(res,[status(thm),theory(equality)],[10,13]),
[iquote('0:Res:10.2,13.0')] ).
cnf(42,plain,
( ~ observational_period(end_time(sk1(u)))
| ~ observational_period(u)
| environment(sk1(end_time(sk1(u))))
| selection_favors(efficient_producers,first_movers,u) ),
inference(res,[status(thm),theory(equality)],[21,23]),
[iquote('0:Res:21.2,23.1')] ).
cnf(44,plain,
( ~ environment(u)
| ~ empty(end_time(u))
| ~ environment(end_time(u))
| ~ observational_period(u)
| extreme(u) ),
inference(res,[status(thm),theory(equality)],[8,5]),
[iquote('0:Res:8.1,5.3')] ).
cnf(4,axiom,
( ~ environment(u)
| ~ rapid_change(v)
| ~ observational_period(v)
| ~ in_environment(v,u)
| ~ in_environment(u,critical_point(u)) ),
file('MGT040-2.p',unknown),
[] ).
cnf(48,plain,
( ~ empty(sk1(u))
| ~ observational_period(u)
| selection_favors(efficient_producers,first_movers,u)
| extreme(u) ),
inference(mrr,[status(thm)],[47,21]),
[iquote('0:MRR:47.1,21.1')] ).
cnf(5,axiom,
( ~ empty(u)
| ~ environment(u)
| ~ observational_period(v)
| ~ in_environment(v,u)
| extreme(v) ),
file('MGT040-2.p',unknown),
[] ).
cnf(14,axiom,
( ~ in_environment(u,v)
| greater_or_equal(v,appear(efficient_producers,u))
| greater(appear(efficient_producers,u),v) ),
file('MGT040-2.p',unknown),
[] ).
cnf(23,plain,
( ~ observational_period(u)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(u)))
| selection_favors(efficient_producers,first_movers,u) ),
inference(mrr,[status(thm)],[3,6,7]),
[iquote('0:MRR:3.1,3.2,6.0,7.0')] ).
cnf(9,axiom,
( ~ environment(u)
| in_environment(u,critical_point(u))
| greater(critical_point(u),end_time(u)) ),
file('MGT040-2.p',unknown),
[] ).
cnf(34,plain,
( ~ environment(u)
| ~ in_environment(u,critical_point(u))
| ~ in_environment(sk2,u) ),
inference(mrr,[status(thm)],[24,17]),
[iquote('0:MRR:24.0,17.0')] ).
cnf(10,axiom,
( ~ environment(u)
| empty(u)
| greater_or_equal(end_time(u),appear(an_organisation,u)) ),
file('MGT040-2.p',unknown),
[] ).
cnf(36,plain,
( ~ environment(sk2)
| ~ empty(end_time(sk2))
| ~ environment(end_time(sk2)) ),
inference(res,[status(thm),theory(equality)],[8,33]),
[iquote('0:Res:8.1,33.2')] ).
cnf(22,plain,
( ~ observational_period(u)
| in_environment(u,sk1(u))
| selection_favors(efficient_producers,first_movers,u) ),
inference(mrr,[status(thm)],[2,6,7]),
[iquote('0:MRR:2.1,2.2,6.0,7.0')] ).
cnf(13,axiom,
( ~ greater_or_equal(u,v)
| equal(u,v)
| greater(u,v) ),
file('MGT040-2.p',unknown),
[] ).
cnf(33,plain,
( ~ empty(u)
| ~ environment(u)
| ~ in_environment(sk2,u) ),
inference(mrr,[status(thm)],[29,19]),
[iquote('0:MRR:29.3,19.0')] ).
cnf(21,plain,
( ~ observational_period(u)
| environment(sk1(u))
| selection_favors(efficient_producers,first_movers,u) ),
inference(mrr,[status(thm)],[1,6,7]),
[iquote('0:MRR:1.1,1.2,6.0,7.0')] ).
cnf(8,axiom,
( ~ environment(u)
| in_environment(u,end_time(u)) ),
file('MGT040-2.p',unknown),
[] ).
cnf(35,plain,
environment(sk1(sk2)),
inference(spt,[],[28]),
[iquote('1:Spt:28.0')] ).
cnf(20,axiom,
~ selection_favors(first_movers,efficient_producers,sk2),
file('MGT040-2.p',unknown),
[] ).
cnf(19,axiom,
~ extreme(sk2),
file('MGT040-2.p',unknown),
[] ).
cnf(17,axiom,
observational_period(sk2),
file('MGT040-2.p',unknown),
[] ).
cnf(6,axiom,
propagation_strategy(first_movers),
file('MGT040-2.p',unknown),
[] ).
cnf(7,axiom,
propagation_strategy(efficient_producers),
file('MGT040-2.p',unknown),
[] ).
cnf(18,axiom,
rapid_change(sk2),
file('MGT040-2.p',unknown),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT040-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.03 % Command : run_spass %d %s
% 0.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 13:03:42 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.21/0.48
% 0.21/0.48 SPASS V 3.9
% 0.21/0.48 SPASS beiseite: Completion found.
% 0.21/0.48 % SZS status CounterSatisfiable
% 0.21/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 SPASS derived 28 clauses, backtracked 0 clauses, performed 2 splits and kept 43 clauses.
% 0.21/0.48 SPASS allocated 75658 KBytes.
% 0.21/0.48 SPASS spent 0:00:00.11 on the problem.
% 0.21/0.48 0:00:00.06 for the input.
% 0.21/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.48 0:00:00.00 for inferences.
% 0.21/0.48 0:00:00.00 for the backtracking.
% 0.21/0.48 0:00:00.00 for the reduction.
% 0.21/0.48
% 0.21/0.48
% 0.21/0.48 The saturated set of worked-off clauses is :
% 0.21/0.48 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------