%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT039+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n001.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:22 AM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
observational_period(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8)]) ).
cnf(g1,plain,
slow_change(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8)]) ).
cnf(g2,plain,
~ selection_favors(efficient_producers,first_movers,sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t8)]) ).
cnf(g3,plain,
( ~ observational_period(sK2)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| in_environment(sK2,sK0(sK2))
| selection_favors(efficient_producers,first_movers,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy)]) ).
cnf(g4,plain,
( ~ observational_period(sK2)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| environment(sK0(sK2))
| selection_favors(efficient_producers,first_movers,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy)]) ).
cnf(g5,plain,
( ~ observational_period(sK2)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_favoured_trategy)]) ).
cnf(g6,plain,
propagation_strategy(first_movers),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets1)]) ).
cnf(g7,plain,
propagation_strategy(efficient_producers),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_organizational_sets2)]) ).
cnf(g8,plain,
( ~ observational_period(sK2)
| ~ environment(sK0(sK2))
| ~ in_environment(sK2,sK0(sK2))
| ~ slow_change(sK2)
| greater(sK1(sK2,sK0(sK2)),critical_point(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point)]) ).
cnf(g9,plain,
( ~ observational_period(sK2)
| ~ environment(sK0(sK2))
| ~ in_environment(sK2,sK0(sK2))
| ~ slow_change(sK2)
| in_environment(sK0(sK2),sK1(sK2,sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_critical_point)]) ).
cnf(g10,plain,
( ~ environment(sK0(sK2))
| ~ in_environment(sK0(sK2),sK1(sK2,sK0(sK2)))
| ~ greater(sK1(sK2,sK0(sK2)),critical_point(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,sK1(sK2,sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8)]) ).
cnf(g11,plain,
( ~ environment(sK0(sK2))
| ~ in_environment(sK0(sK2),sK1(sK2,sK0(sK2)))
| greater_or_equal(end_time(sK0(sK2)),sK1(sK2,sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_end_point)]) ).
cnf(g12,plain,
( ~ environment(sK0(sK2))
| greater_or_equal(critical_point(sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_of_critical_point)]) ).
cnf(g13,plain,
sPE(efficient_producers,efficient_producers),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(first_movers,first_movers),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(end_time(sK0(sK2)),end_time(sK0(sK2))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ greater_or_equal(end_time(sK0(sK2)),sK1(sK2,sK0(sK2)))
| sPE(end_time(sK0(sK2)),sK1(sK2,sK0(sK2)))
| greater(end_time(sK0(sK2)),sK1(sK2,sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g17,plain,
( ~ greater_or_equal(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| sPE(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| greater(critical_point(sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g18,plain,
sPE(sK1(sK2,sK0(sK2)),sK1(sK2,sK0(sK2))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ environment(sK0(sK2))
| ~ in_environment(sK0(sK2),end_time(sK0(sK2)))
| ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8)]) ).
cnf(g20,plain,
( ~ environment(sK0(sK2))
| ~ greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2)))
| ~ greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2)))
| in_environment(sK0(sK2),end_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_in_environment)]) ).
cnf(g21,plain,
( ~ greater(end_time(sK0(sK2)),sK1(sK2,sK0(sK2)))
| ~ greater(sK1(sK2,sK0(sK2)),critical_point(sK0(sK2)))
| greater(end_time(sK0(sK2)),critical_point(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity)]) ).
cnf(g22,plain,
( ~ sPE(sK1(sK2,sK0(sK2)),sK1(sK2,sK0(sK2)))
| ~ sPE(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| ~ greater(sK1(sK2,sK0(sK2)),critical_point(sK0(sK2)))
| greater(sK1(sK2,sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ greater(end_time(sK0(sK2)),start_time(sK0(sK2)))
| greater_or_equal(end_time(sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g24,plain,
( ~ sPE(end_time(sK0(sK2)),end_time(sK0(sK2)))
| greater_or_equal(end_time(sK0(sK2)),end_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal)]) ).
cnf(g25,plain,
( ~ sPE(efficient_producers,efficient_producers)
| ~ sPE(first_movers,first_movers)
| ~ sPE(sK1(sK2,sK0(sK2)),end_time(sK0(sK2)))
| ~ selection_favors(efficient_producers,first_movers,sK1(sK2,sK0(sK2)))
| selection_favors(efficient_producers,first_movers,end_time(sK0(sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(end_time(sK0(sK2)),sK1(sK2,sK0(sK2)))
| sPE(sK1(sK2,sK0(sK2)),end_time(sK0(sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ greater(end_time(sK0(sK2)),critical_point(sK0(sK2)))
| ~ greater(critical_point(sK0(sK2)),start_time(sK0(sK2)))
| greater(end_time(sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity)]) ).
cnf(g28,plain,
( ~ greater(end_time(sK0(sK2)),sK1(sK2,sK0(sK2)))
| ~ greater(sK1(sK2,sK0(sK2)),start_time(sK0(sK2)))
| greater(end_time(sK0(sK2)),start_time(sK0(sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT039+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 12:58:22 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.43 % symbols: 18
% 0.13/0.43 % clauses: 35
% 0.13/0.43 % start clauses: 3
% 0.13/0.43 % iterative deepening steps: 218
% 0.13/0.43 % maximum path limit: 4
% 0.13/0.43 % literal attempts: 157854
% 0.13/0.43 % depth failures: 99502
% 0.13/0.43 % regularity failures: 6436
% 0.13/0.43 % tautology failures: 6669
% 0.13/0.43 % reductions: 2988
% 0.13/0.43 % extensions: 154260
% 0.13/0.43 % SAT variables: 3695
% 0.13/0.43 % SAT clauses: 6997
% 0.13/0.43 % WalkSAT solutions: 6995
% 0.13/0.43 % CDCL solutions: 1
% 0.13/0.43 % SZS status Theorem for theBenchmark
% 0.13/0.43 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------