%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT027+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n031.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:19 AM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
environment(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9)]) ).
cnf(g1,plain,
stable(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9)]) ).
cnf(g2,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| in_environment(sK2,appear(efficient_producers,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_EP_in_stable_environments)]) ).
cnf(g3,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| greater(sK1(sK2),appear(efficient_producers,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10)]) ).
cnf(g4,plain,
( ~ greater(sK1(sK2),appear(efficient_producers,sK2))
| ~ contracts_from(sK1(sK2),first_movers) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l9)]) ).
cnf(g5,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ in_environment(sK2,sK1(sK2))
| ~ greater(zero,growth_rate(first_movers,sK0(sK2,sK1(sK2))))
| contracts_from(sK1(sK2),first_movers) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from)]) ).
cnf(g6,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ in_environment(sK2,sK1(sK2))
| greater(cardinality_at_time(first_movers,sK0(sK2,sK1(sK2))),zero)
| contracts_from(sK1(sK2),first_movers) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from)]) ).
cnf(g7,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ in_environment(sK2,sK1(sK2))
| greater_or_equal(sK0(sK2,sK1(sK2)),sK1(sK2))
| contracts_from(sK1(sK2),first_movers) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_contracts_from)]) ).
cnf(g8,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ in_environment(sK2,appear(efficient_producers,sK2))
| ~ greater(sK1(sK2),appear(efficient_producers,sK2))
| in_environment(sK2,sK1(sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_long_stable_environments)]) ).
cnf(g9,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ greater_or_equal(sK0(sK2,sK1(sK2)),sK1(sK2))
| ~ subpopulations(first_movers,efficient_producers,sK2,sK0(sK2,sK1(sK2)))
| greater(zero,growth_rate(first_movers,sK0(sK2,sK1(sK2)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l10)]) ).
cnf(g10,plain,
( ~ environment(sK2)
| ~ in_environment(sK2,sK0(sK2,sK1(sK2)))
| ~ greater(cardinality_at_time(first_movers,sK0(sK2,sK1(sK2))),zero)
| ~ greater(cardinality_at_time(efficient_producers,sK0(sK2,sK1(sK2))),zero)
| subpopulations(first_movers,efficient_producers,sK2,sK0(sK2,sK1(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep)]) ).
cnf(g11,plain,
sPE(appear(efficient_producers,sK2),appear(efficient_producers,sK2)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ greater_or_equal(sK0(sK2,sK1(sK2)),sK1(sK2))
| sPE(sK0(sK2,sK1(sK2)),sK1(sK2))
| greater(sK0(sK2,sK1(sK2)),sK1(sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g13,plain,
( ~ environment(sK2)
| ~ in_environment(sK2,sK0(sK2,sK1(sK2)))
| ~ greater_or_equal(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2))
| greater(cardinality_at_time(efficient_producers,sK0(sK2,sK1(sK2))),zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6)]) ).
cnf(g14,plain,
( ~ greater(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2))
| greater_or_equal(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g15,plain,
( ~ greater(sK0(sK2,sK1(sK2)),sK1(sK2))
| ~ greater(sK1(sK2),appear(efficient_producers,sK2))
| greater(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity)]) ).
cnf(g16,plain,
( ~ sPE(sK0(sK2,sK1(sK2)),sK1(sK2))
| sPE(sK1(sK2),sK0(sK2,sK1(sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ environment(sK2)
| ~ stable(sK2)
| ~ in_environment(sK2,appear(efficient_producers,sK2))
| ~ greater(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2))
| in_environment(sK2,sK0(sK2,sK1(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_long_stable_environments)]) ).
cnf(g18,plain,
( ~ sPE(sK1(sK2),sK0(sK2,sK1(sK2)))
| ~ sPE(appear(efficient_producers,sK2),appear(efficient_producers,sK2))
| ~ greater(sK1(sK2),appear(efficient_producers,sK2))
| greater(sK0(sK2,sK1(sK2)),appear(efficient_producers,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT027+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.10/0.35 % Computer : n031.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:16:11 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.14/0.45 % symbols: 18
% 0.14/0.45 % clauses: 31
% 0.14/0.45 % start clauses: 3
% 0.14/0.45 % iterative deepening steps: 290
% 0.14/0.45 % maximum path limit: 4
% 0.14/0.45 % literal attempts: 200920
% 0.14/0.45 % depth failures: 145032
% 0.14/0.45 % regularity failures: 3610
% 0.14/0.45 % tautology failures: 7634
% 0.14/0.45 % reductions: 2426
% 0.14/0.45 % extensions: 197663
% 0.14/0.45 % SAT variables: 7953
% 0.14/0.45 % SAT clauses: 11718
% 0.14/0.45 % WalkSAT solutions: 11717
% 0.14/0.45 % CDCL solutions: 0
% 0.14/0.45 % SZS status Theorem for theBenchmark
% 0.14/0.45 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------