TSTP Solution File: MGT027+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:24:21 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Proof 0.20s
% 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.12 % Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 11:41:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 % symbols: 18
% 0.20/0.44 % clauses: 31
% 0.20/0.44 % start clauses: 3
% 0.20/0.44 % iterative deepening steps: 315
% 0.20/0.44 % maximum path limit: 4
% 0.20/0.44 % literal attempts: 219384
% 0.20/0.44 % depth failures: 158185
% 0.20/0.44 % regularity failures: 3945
% 0.20/0.44 % tautology failures: 8302
% 0.20/0.44 % reductions: 2579
% 0.20/0.44 % extensions: 215938
% 0.20/0.44 % SAT variables: 8202
% 0.20/0.44 % SAT clauses: 12040
% 0.20/0.44 % WalkSAT solutions: 12039
% 0.20/0.44 % CDCL solutions: 0
% 0.20/0.44 % SZS status Theorem for theBenchmark
% 0.20/0.44 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------