%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT040+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% 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:19:54 AM UTC 2026
% Result : CounterSatisfiable 0.08s 0.38s
% Output : Saturation 0.08s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 45ERROR: Could not build tree for root 46ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(43,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)],[11,17]),
[iquote('0:Res:11.1,17.2')] ).
cnf(46,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)],[45,7]),
[iquote('0:MRR:45.1,7.1')] ).
cnf(40,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)],[11,19]),
[iquote('0:Res:11.1,19.1')] ).
cnf(17,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(18,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(41,plain,
( ~ environment(u)
| ~ in_environment(u,skc1)
| ~ in_environment(u,critical_point(u))
| ~ greater(critical_point(u),skc1)
| greater(appear(efficient_producers,u),skc1) ),
inference(res,[status(thm),theory(equality)],[11,31]),
[iquote('0:Res:11.1,31.2')] ).
cnf(42,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)],[7,38]),
[iquote('0:Res:7.1,38.0')] ).
cnf(38,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)],[11,8]),
[iquote('0:Res:11.1,8.0')] ).
cnf(31,plain,
( ~ environment(u)
| ~ in_environment(u,critical_point(u))
| ~ greater_or_equal(skc1,appear(efficient_producers,u))
| ~ greater(critical_point(u),skc1) ),
inference(res,[status(thm),theory(equality)],[17,6]),
[iquote('0:Res:17.4,6.0')] ).
cnf(19,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(30,plain,
( ~ environment(u)
| ~ in_environment(u,skc1)
| ~ greater_or_equal(skc1,appear(first_movers,u))
| ~ greater(appear(efficient_producers,u),skc1) ),
inference(res,[status(thm),theory(equality)],[18,6]),
[iquote('0:Res:18.4,6.0')] ).
cnf(15,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(37,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)],[9,8]),
[iquote('0:Res:9.2,8.0')] ).
cnf(39,plain,
( ~ environment(u)
| ~ empty(end_time(u))
| ~ environment(end_time(u))
| ~ observational_period(u)
| extreme(u) ),
inference(res,[status(thm),theory(equality)],[7,12]),
[iquote('0:Res:7.1,12.3')] ).
cnf(12,axiom,
( ~ empty(u)
| ~ environment(u)
| ~ observational_period(v)
| ~ in_environment(v,u)
| extreme(v) ),
file('MGT040+2.p',unknown),
[] ).
cnf(11,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(10,axiom,
( ~ environment(u)
| in_environment(u,critical_point(u))
| greater(critical_point(u),end_time(u)) ),
file('MGT040+2.p',unknown),
[] ).
cnf(33,plain,
( ~ environment(u)
| ~ in_environment(u,critical_point(u))
| ~ in_environment(skc1,u) ),
inference(mrr,[status(thm)],[23,1]),
[iquote('0:MRR:23.0,1.0')] ).
cnf(36,plain,
( ~ environment(skc1)
| ~ empty(end_time(skc1))
| ~ environment(end_time(skc1)) ),
inference(res,[status(thm),theory(equality)],[7,32]),
[iquote('0:Res:7.1,32.2')] ).
cnf(9,axiom,
( ~ environment(u)
| empty(u)
| greater_or_equal(end_time(u),appear(an_organisation,u)) ),
file('MGT040+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ greater_or_equal(u,v)
| equal(u,v)
| greater(u,v) ),
file('MGT040+2.p',unknown),
[] ).
cnf(32,plain,
( ~ empty(u)
| ~ environment(u)
| ~ in_environment(skc1,u) ),
inference(mrr,[status(thm)],[28,5]),
[iquote('0:MRR:28.3,5.0')] ).
cnf(7,axiom,
( ~ environment(u)
| in_environment(u,end_time(u)) ),
file('MGT040+2.p',unknown),
[] ).
cnf(6,axiom,
~ selection_favors(first_movers,efficient_producers,skc1),
file('MGT040+2.p',unknown),
[] ).
cnf(5,axiom,
~ extreme(skc1),
file('MGT040+2.p',unknown),
[] ).
cnf(1,axiom,
observational_period(skc1),
file('MGT040+2.p',unknown),
[] ).
cnf(2,axiom,
rapid_change(skc1),
file('MGT040+2.p',unknown),
[] ).
cnf(3,axiom,
propagation_strategy(first_movers),
file('MGT040+2.p',unknown),
[] ).
cnf(35,plain,
selection_favors(efficient_producers,first_movers,skc1),
inference(spt,[],[27]),
[iquote('2:Spt:27.1')] ).
cnf(4,axiom,
propagation_strategy(efficient_producers),
file('MGT040+2.p',unknown),
[] ).
cnf(34,plain,
( ~ observational_period(u)
| selection_favors(efficient_producers,first_movers,u) ),
inference(spt,[],[20]),
[iquote('1:Spt:20.0,20.2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT040+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.02 % Command : run_spass %d %s
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Mon Sep 7 12:59:41 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.08/0.38
% 0.08/0.38 SPASS V 3.9
% 0.08/0.38 SPASS beiseite: Completion found.
% 0.08/0.38 % SZS status CounterSatisfiable
% 0.08/0.38 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.38 SPASS derived 20 clauses, backtracked 0 clauses, performed 2 splits and kept 37 clauses.
% 0.08/0.38 SPASS allocated 97684 KBytes.
% 0.08/0.38 SPASS spent 0:00:00.08 on the problem.
% 0.08/0.38 0:00:00.03 for the input.
% 0.08/0.38 0:00:00.02 for the FLOTTER CNF translation.
% 0.08/0.38 0:00:00.00 for inferences.
% 0.08/0.38 0:00:00.00 for the backtracking.
% 0.08/0.38 0:00:00.00 for the reduction.
% 0.08/0.38
% 0.08/0.38
% 0.08/0.38 The saturated set of worked-off clauses is :
% 0.08/0.38 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------