TSTP Solution File: MGT026+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT026+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
environment(sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l8)]) ).
cnf(g1,plain,
in_environment(sK0,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l8)]) ).
cnf(g2,plain,
greater(sK1,critical_point(sK0)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l8)]) ).
cnf(g3,plain,
~ selection_favors(efficient_producers,first_movers,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l8)]) ).
cnf(g4,plain,
( ~ environment(sK0)
| greater_or_equal(critical_point(sK0),appear(efficient_producers,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_critical_point_after_EP)]) ).
cnf(g5,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,sK1)
| subpopulation(efficient_producers,sK0,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations)]) ).
cnf(g6,plain,
( ~ environment(sK0)
| ~ greater(cardinality_at_time(first_movers,sK1),zero)
| ~ greater(cardinality_at_time(efficient_producers,sK1),zero)
| ~ in_environment(sK0,sK1)
| subpopulations(first_movers,efficient_producers,sK0,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep)]) ).
cnf(g7,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,sK1)
| greater_or_equal(cardinality_at_time(first_movers,sK1),zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_exist)]) ).
cnf(g8,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,sK1)
| subpopulation(first_movers,sK0,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations)]) ).
cnf(g9,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,sK1)
| ~ greater_or_equal(sK1,appear(efficient_producers,sK0))
| greater(cardinality_at_time(efficient_producers,sK1),zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6)]) ).
cnf(g10,plain,
( ~ sPE(critical_point(sK0),critical_point(sK0))
| ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| ~ greater(sK1,critical_point(sK0))
| greater(growth_rate(efficient_producers,sK1),growth_rate(first_movers,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1)]) ).
cnf(g11,plain,
( ~ sPE(cardinality_at_time(first_movers,sK1),zero)
| ~ environment(sK0)
| ~ greater(cardinality_at_time(efficient_producers,sK1),zero)
| ~ subpopulation(efficient_producers,sK0,sK1)
| ~ subpopulation(first_movers,sK0,sK1)
| selection_favors(efficient_producers,first_movers,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp2_favour_members)]) ).
cnf(g12,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| ~ greater(growth_rate(efficient_producers,sK1),growth_rate(first_movers,sK1))
| selection_favors(efficient_producers,first_movers,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp1_high_growth_rates)]) ).
cnf(g13,plain,
( ~ greater_or_equal(critical_point(sK0),appear(efficient_producers,sK0))
| sPE(critical_point(sK0),appear(efficient_producers,sK0))
| greater(critical_point(sK0),appear(efficient_producers,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g14,plain,
sPE(critical_point(sK0),critical_point(sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ greater_or_equal(cardinality_at_time(first_movers,sK1),zero)
| sPE(cardinality_at_time(first_movers,sK1),zero)
| greater(cardinality_at_time(first_movers,sK1),zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g16,plain,
( ~ greater(sK1,appear(efficient_producers,sK0))
| greater_or_equal(sK1,appear(efficient_producers,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g17,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ greater(sK1,critical_point(sK0))
| ~ greater(critical_point(sK0),appear(efficient_producers,sK0))
| greater(sK1,appear(efficient_producers,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity)]) ).
cnf(g19,plain,
( ~ sPE(sK1,sK1)
| ~ sPE(critical_point(sK0),appear(efficient_producers,sK0))
| ~ greater(sK1,critical_point(sK0))
| greater(sK1,appear(efficient_producers,sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT026+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n025.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 12:50:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % symbols: 18
% 0.13/0.35 % clauses: 32
% 0.13/0.35 % start clauses: 4
% 0.13/0.35 % iterative deepening steps: 91
% 0.13/0.35 % maximum path limit: 3
% 0.13/0.35 % literal attempts: 18966
% 0.13/0.35 % depth failures: 12698
% 0.13/0.35 % regularity failures: 450
% 0.13/0.35 % tautology failures: 665
% 0.13/0.35 % reductions: 556
% 0.13/0.35 % extensions: 18152
% 0.13/0.35 % SAT variables: 2399
% 0.13/0.35 % SAT clauses: 3296
% 0.13/0.35 % WalkSAT solutions: 3295
% 0.13/0.35 % CDCL solutions: 0
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------