%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT020-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n005.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 : 300s
% DateTime : Tue May 5 04:47:08 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 8 unt; 9 nHn; 35 RR)
% Number of literals : 102 ( 8 equ; 63 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_times_in_order_28,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater(X3,X2)
| ~ in_environment(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_times_in_order_28) ).
cnf(mp_initial_time_27,axiom,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_initial_time_27) ).
cnf(mp_greater_or_equal_30,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_30) ).
cnf(mp_earliest_time_point_24,axiom,
( greater_or_equal(X2,initial_FM_EP(X1))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point_24) ).
cnf(mp_positive_function_difference_25,axiom,
( decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| ~ environment(X1)
| ~ greater_or_equal(X2,X3)
| ~ greater_or_equal(X4,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_function_difference_25) ).
cnf(a8_31,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a8_31) ).
cnf(mp_time_point_occurs_26,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occurs_26) ).
cnf(prove_l2_34,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_34) ).
cnf(prove_l2_33,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_33) ).
cnf(prove_l2_35,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_35) ).
cnf(l3_22,axiom,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_22) ).
cnf(mp_earliest_time_point_23,axiom,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point_23) ).
cnf(c_0_12,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater(X3,X2)
| ~ in_environment(X1,X3) ),
mp_times_in_order_28 ).
cnf(c_0_13,axiom,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
mp_initial_time_27 ).
cnf(c_0_14,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
mp_greater_or_equal_30 ).
cnf(c_0_15,axiom,
( greater_or_equal(X2,initial_FM_EP(X1))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_earliest_time_point_24 ).
cnf(c_0_16,axiom,
( decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| ~ environment(X1)
| ~ greater_or_equal(X2,X3)
| ~ greater_or_equal(X4,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) ),
mp_positive_function_difference_25 ).
cnf(c_0_17,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
a8_31 ).
cnf(c_0_18,plain,
( in_environment(X1,initial_FM_EP(X1))
| ~ greater(X2,initial_FM_EP(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( X1 = initial_FM_EP(X2)
| greater(X1,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_time_point_occurs_26 ).
cnf(c_0_21,hypothesis,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ greater_or_equal(X2,initial_FM_EP(X3))
| ~ greater_or_equal(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ environment(X4)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_l2_34 ).
cnf(c_0_23,negated_conjecture,
environment(sk1),
prove_l2_33 ).
cnf(c_0_24,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
prove_l2_35 ).
cnf(c_0_25,plain,
( X1 = initial_FM_EP(X2)
| in_environment(X2,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| ~ greater_or_equal(sk2,X1)
| ~ environment(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_27,axiom,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
l3_22 ).
cnf(c_0_28,axiom,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1)) ),
mp_earliest_time_point_23 ).
cnf(c_0_29,negated_conjecture,
( initial_FM_EP(sk1) = sk2
| in_environment(sk1,initial_FM_EP(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
( ~ greater_or_equal(sk2,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( initial_FM_EP(sk1) = sk2
| subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( initial_FM_EP(sk1) = sk2
| ~ greater_or_equal(sk2,initial_FM_EP(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23])]) ).
cnf(c_0_33,negated_conjecture,
initial_FM_EP(sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_15]),c_0_22]),c_0_23])]) ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_33]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT020-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n005.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:26:45 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------