%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT019+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n002.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:47 AM UTC 2026
% Result : CounterSatisfiable 0.22s 0.52s
% Output : Saturation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 15ERROR: Could not build tree for root 31ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(31,plain,
( ~ greater_or_equal(skf2(u),skf4(skc3))
| ~ subpopulations(first_movers,efficient_producers,skc3,skf2(u))
| ~ greater_or_equal(disbanding_rate(first_movers,skf2(u)),disbanding_rate(efficient_producers,skf2(u)))
| equal(disbanding_rate(efficient_producers,skf2(u)),disbanding_rate(first_movers,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[20,26]),
[iquote('0:Res:20.2,26.1')] ).
cnf(32,plain,
( ~ in_environment(skc3,u)
| ~ greater_or_equal(skf2(u),skf4(skc3))
| ~ greater_or_equal(disbanding_rate(first_movers,skf2(u)),disbanding_rate(efficient_producers,skf2(u)))
| equal(disbanding_rate(efficient_producers,skf2(u)),disbanding_rate(first_movers,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[30,26]),
[iquote('0:Res:30.2,26.1')] ).
cnf(26,plain,
( ~ greater_or_equal(disbanding_rate(first_movers,skf2(u)),disbanding_rate(efficient_producers,skf2(u)))
| ~ greater_or_equal(founding_rate(efficient_producers,skf2(u)),founding_rate(first_movers,skf2(u)))
| equal(disbanding_rate(efficient_producers,skf2(u)),disbanding_rate(first_movers,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[9,18]),
[iquote('0:Res:9.2,18.1')] ).
cnf(30,plain,
( ~ in_environment(skc3,u)
| ~ greater_or_equal(skf2(u),skf4(skc3))
| greater_or_equal(founding_rate(efficient_producers,skf2(u)),founding_rate(first_movers,skf2(u))) ),
inference(ssi,[status(thm)],[28,2,1]),
[iquote('0:SSi:28.1,28.0,2.0,1.0,2.0,1.0')] ).
cnf(29,plain,
( ~ stable(skc6)
| ~ greater_or_equal(skc5,skf4(skc6))
| greater_or_equal(founding_rate(efficient_producers,skc5),founding_rate(first_movers,skc5)) ),
inference(ssi,[status(thm)],[27,3]),
[iquote('0:SSi:27.1,3.0')] ).
cnf(12,axiom,
( ~ stable(u)
| ~ environment(u)
| ~ greater_or_equal(v,skf4(u))
| ~ subpopulations(first_movers,efficient_producers,u,v)
| greater_or_equal(founding_rate(efficient_producers,v),founding_rate(first_movers,v)) ),
file('MGT019+2.p',unknown),
[] ).
cnf(18,plain,
( ~ greater_or_equal(founding_rate(efficient_producers,skf2(u)),founding_rate(first_movers,skf2(u)))
| ~ greater(disbanding_rate(first_movers,skf2(u)),disbanding_rate(efficient_producers,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[11,7]),
[iquote('0:Res:11.2,7.0')] ).
cnf(11,axiom,
( ~ greater_or_equal(founding_rate(efficient_producers,u),founding_rate(first_movers,u))
| ~ greater(disbanding_rate(first_movers,u),disbanding_rate(efficient_producers,u))
| greater(growth_rate(efficient_producers,u),growth_rate(first_movers,u)) ),
file('MGT019+2.p',unknown),
[] ).
cnf(17,plain,
( ~ greater_or_equal(growth_rate(efficient_producers,skf2(u)),growth_rate(first_movers,skf2(u)))
| equal(growth_rate(efficient_producers,skf2(u)),growth_rate(first_movers,skf2(u))) ),
inference(res,[status(thm),theory(equality)],[9,7]),
[iquote('0:Res:9.1,7.0')] ).
cnf(20,plain,
( ~ greater_or_equal(u,skf4(skc3))
| ~ subpopulations(first_movers,efficient_producers,skc3,u)
| greater_or_equal(founding_rate(efficient_producers,u),founding_rate(first_movers,u)) ),
inference(mrr,[status(thm)],[15,2]),
[iquote('0:MRR:15.0,2.0')] ).
cnf(23,plain,
( ~ greater_or_equal(disbanding_rate(first_movers,skc5),disbanding_rate(efficient_producers,skc5))
| equal(disbanding_rate(efficient_producers,skc5),disbanding_rate(first_movers,skc5)) ),
inference(res,[status(thm),theory(equality)],[9,6]),
[iquote('0:Res:9.2,6.0')] ).
cnf(9,axiom,
( ~ greater_or_equal(u,v)
| equal(u,v)
| greater(u,v) ),
file('MGT019+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ stable(u)
| ~ environment(u)
| in_environment(u,skf4(u)) ),
file('MGT019+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ in_environment(skc3,u)
| subpopulations(first_movers,efficient_producers,skc3,skf2(u)) ),
file('MGT019+2.p',unknown),
[] ).
cnf(7,axiom,
~ greater(growth_rate(efficient_producers,skf2(u)),growth_rate(first_movers,skf2(u))),
file('MGT019+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ in_environment(skc3,u)
| greater_or_equal(skf2(u),u) ),
file('MGT019+2.p',unknown),
[] ).
cnf(6,axiom,
~ greater(disbanding_rate(first_movers,skc5),disbanding_rate(efficient_producers,skc5)),
file('MGT019+2.p',unknown),
[] ).
cnf(4,axiom,
subpopulations(first_movers,efficient_producers,skc6,skc5),
file('MGT019+2.p',unknown),
[] ).
cnf(19,plain,
in_environment(skc3,skf4(skc3)),
inference(mrr,[status(thm)],[14,1]),
[iquote('0:MRR:14.0,1.0')] ).
cnf(1,axiom,
environment(skc3),
file('MGT019+2.p',unknown),
[] ).
cnf(3,axiom,
environment(skc6),
file('MGT019+2.p',unknown),
[] ).
cnf(2,axiom,
stable(skc3),
file('MGT019+2.p',unknown),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT019+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 7 12:01:22 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.22/0.52
% 0.22/0.52 SPASS V 3.9
% 0.22/0.52 SPASS beiseite: Completion found.
% 0.22/0.52 % SZS status CounterSatisfiable
% 0.22/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.52 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.22/0.52 SPASS allocated 97623 KBytes.
% 0.22/0.52 SPASS spent 0:00:00.15 on the problem.
% 0.22/0.52 0:00:00.06 for the input.
% 0.22/0.52 0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.52 0:00:00.00 for inferences.
% 0.22/0.52 0:00:00.00 for the backtracking.
% 0.22/0.52 0:00:00.00 for the reduction.
% 0.22/0.52
% 0.22/0.52
% 0.22/0.52 The saturated set of worked-off clauses is :
% 0.22/0.52 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------