TSTP Solution File: MGT020+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n027.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:18 EDT 2022
% Result : Theorem 0.13s 0.34s
% 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_l2)]) ).
cnf(g1,plain,
subpopulations(first_movers,efficient_producers,sK0,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2)]) ).
cnf(g2,plain,
~ greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2)]) ).
cnf(g3,plain,
( ~ environment(sK0)
| greater_or_equal(initial_FM_EP(sK0),start_time(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_initial_time)]) ).
cnf(g4,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| greater_or_equal(sK1,initial_FM_EP(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point)]) ).
cnf(g5,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| ~ decreases(difference(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3)]) ).
cnf(g6,plain,
( ~ environment(sK0)
| greater(disbanding_rate(first_movers,initial_FM_EP(sK0)),disbanding_rate(efficient_producers,initial_FM_EP(sK0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a8)]) ).
cnf(g7,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| in_environment(sK0,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occurs)]) ).
cnf(g8,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,initial_FM_EP(sK0))
| subpopulations(first_movers,efficient_producers,sK0,initial_FM_EP(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point)]) ).
cnf(g9,plain,
( ~ sPE(sK1,sK1)
| ~ sPE(initial_FM_EP(sK0),sK1)
| ~ greater_or_equal(sK1,initial_FM_EP(sK0))
| greater_or_equal(sK1,sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ greater_or_equal(sK1,initial_FM_EP(sK0))
| sPE(sK1,initial_FM_EP(sK0))
| greater(sK1,initial_FM_EP(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g11,plain,
( ~ environment(sK0)
| ~ in_environment(sK0,sK1)
| ~ greater_or_equal(initial_FM_EP(sK0),start_time(sK0))
| ~ greater(sK1,initial_FM_EP(sK0))
| in_environment(sK0,initial_FM_EP(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_times_in_order)]) ).
cnf(g12,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| ~ greater_or_equal(sK1,initial_FM_EP(sK0))
| ~ greater_or_equal(sK1,sK1)
| ~ greater(disbanding_rate(first_movers,initial_FM_EP(sK0)),disbanding_rate(efficient_producers,initial_FM_EP(sK0)))
| decreases(difference(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)))
| greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_function_difference)]) ).
cnf(g13,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,sK1)
| ~ greater_or_equal(initial_FM_EP(sK0),initial_FM_EP(sK0))
| ~ greater_or_equal(sK1,initial_FM_EP(sK0))
| ~ greater(disbanding_rate(first_movers,initial_FM_EP(sK0)),disbanding_rate(efficient_producers,initial_FM_EP(sK0)))
| decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sK0)),disbanding_rate(efficient_producers,initial_FM_EP(sK0))))
| greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_function_difference)]) ).
cnf(g15,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,initial_FM_EP(sK0))
| greater_or_equal(initial_FM_EP(sK0),initial_FM_EP(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point)]) ).
cnf(g16,plain,
( ~ sPE(sK1,initial_FM_EP(sK0))
| sPE(initial_FM_EP(sK0),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ environment(sK0)
| ~ subpopulations(first_movers,efficient_producers,sK0,initial_FM_EP(sK0))
| ~ decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sK0)),disbanding_rate(efficient_producers,initial_FM_EP(sK0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT020+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:43:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % symbols: 16
% 0.13/0.34 % clauses: 27
% 0.13/0.34 % start clauses: 3
% 0.13/0.34 % iterative deepening steps: 61
% 0.13/0.34 % maximum path limit: 2
% 0.13/0.34 % literal attempts: 6071
% 0.13/0.34 % depth failures: 4209
% 0.13/0.34 % regularity failures: 1
% 0.13/0.34 % tautology failures: 242
% 0.13/0.34 % reductions: 365
% 0.13/0.34 % extensions: 5546
% 0.13/0.34 % SAT variables: 725
% 0.13/0.34 % SAT clauses: 851
% 0.13/0.34 % WalkSAT solutions: 848
% 0.13/0.34 % CDCL solutions: 0
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------