%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT031-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 : n002.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:31 PM UTC 2026
% Result : Satisfiable 1.25s 1.72s
% Output : Saturation 1.25s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_greater_or_equal_27,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_27) ).
cnf(mp_FM_not_precede_first_25,axiom,
( greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_FM_not_precede_first_25) ).
cnf(prove_l13_32,negated_conjecture,
environment(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l13_32) ).
cnf(prove_l13_34,negated_conjecture,
appear(an_organisation,sk2) != appear(first_movers,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l13_34) ).
cnf(a9_30,hypothesis,
( X2 = efficient_producers
| X2 = first_movers
| ~ environment(X1)
| ~ subpopulation(X2,X1,X3)
| ~ greater(cardinality_at_time(X2,X3),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a9_30) ).
cnf(mp_number_mean_non_empty_22,axiom,
( greater(cardinality_at_time(sk1(X2,X1),X2),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_number_mean_non_empty_22) ).
cnf(mp_greater_transitivity_26,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity_26) ).
cnf(mp_number_mean_non_empty_21,axiom,
( subpopulation(sk1(X2,X1),X1,X2)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_number_mean_non_empty_21) ).
cnf(mp_positive_number_when_appear_20,axiom,
( greater(number_of_organizations(e,appear(an_organisation,X1)),zero)
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_number_when_appear_20) ).
cnf(a13_31,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_31) ).
cnf(mp_greater_or_equal_29,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_29) ).
cnf(mp_no_FM_before_appearance_24,axiom,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(first_movers,X1),X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_no_FM_before_appearance_24) ).
cnf(mp_no_EP_before_appearance_23,axiom,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_no_EP_before_appearance_23) ).
cnf(mp_greater_or_equal_28,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_28) ).
cnf(prove_l13_33,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l13_33) ).
cnf(c_0_15,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
mp_greater_or_equal_27,
[final] ).
cnf(c_0_16,axiom,
( greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
mp_FM_not_precede_first_25,
[final] ).
cnf(c_0_17,plain,
( appear(an_organisation,X1) = appear(first_movers,X1)
| greater(appear(first_movers,X1),appear(an_organisation,X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_18,negated_conjecture,
environment(sk2),
prove_l13_32,
[final] ).
cnf(c_0_19,negated_conjecture,
appear(an_organisation,sk2) != appear(first_movers,sk2),
prove_l13_34,
[final] ).
cnf(c_0_20,hypothesis,
( X2 = efficient_producers
| X2 = first_movers
| ~ environment(X1)
| ~ subpopulation(X2,X1,X3)
| ~ greater(cardinality_at_time(X2,X3),zero) ),
a9_30,
[final] ).
cnf(c_0_21,axiom,
( greater(cardinality_at_time(sk1(X2,X1),X2),zero)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
mp_number_mean_non_empty_22,
[final] ).
cnf(c_0_22,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
mp_greater_transitivity_26,
[final] ).
cnf(c_0_23,negated_conjecture,
greater(appear(first_movers,sk2),appear(an_organisation,sk2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[final] ).
cnf(c_0_24,hypothesis,
( sk1(X1,X2) = first_movers
| sk1(X1,X2) = efficient_producers
| ~ subpopulation(sk1(X1,X2),X3,X1)
| ~ greater(number_of_organizations(X2,X1),zero)
| ~ environment(X3)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
( subpopulation(sk1(X2,X1),X1,X2)
| ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero) ),
mp_number_mean_non_empty_21,
[final] ).
cnf(c_0_26,negated_conjecture,
( greater(X1,appear(an_organisation,sk2))
| ~ greater(X1,appear(first_movers,sk2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
cnf(c_0_27,hypothesis,
( sk1(X1,X2) = efficient_producers
| sk1(X1,X2) = first_movers
| ~ greater(number_of_organizations(X2,X1),zero)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[final] ).
cnf(c_0_28,axiom,
( greater(number_of_organizations(e,appear(an_organisation,X1)),zero)
| ~ environment(X1) ),
mp_positive_number_when_appear_20,
[final] ).
cnf(c_0_29,hypothesis,
( greater(appear(efficient_producers,e),appear(first_movers,X1))
| ~ environment(X1) ),
a13_31,
[final] ).
cnf(c_0_30,negated_conjecture,
( greater(X1,appear(an_organisation,sk2))
| ~ greater(X2,appear(first_movers,sk2))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]),
[final] ).
cnf(c_0_31,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
mp_greater_or_equal_29 ).
cnf(c_0_32,hypothesis,
( sk1(appear(an_organisation,X1),e) = first_movers
| sk1(appear(an_organisation,X1),e) = efficient_producers
| ~ environment(e)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_33,plain,
( greater(X1,zero)
| ~ greater(X1,cardinality_at_time(sk1(X2,X3),X2))
| ~ greater(number_of_organizations(X3,X2),zero)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]),
[final] ).
cnf(c_0_34,plain,
( greater(X1,zero)
| ~ greater(X1,number_of_organizations(e,appear(an_organisation,X2)))
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]),
[final] ).
cnf(c_0_35,hypothesis,
( greater(X1,appear(first_movers,X2))
| ~ greater(X1,appear(efficient_producers,e))
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]),
[final] ).
cnf(c_0_36,hypothesis,
( greater(X1,appear(an_organisation,sk2))
| ~ greater(X1,appear(efficient_producers,e)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_18])]),
[final] ).
cnf(c_0_37,axiom,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(first_movers,X1),X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero) ),
mp_no_FM_before_appearance_24,
[final] ).
cnf(c_0_38,axiom,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
mp_no_EP_before_appearance_23,
[final] ).
cnf(c_0_39,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
mp_greater_or_equal_28,
[final] ).
cnf(c_0_40,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_41,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)),
prove_l13_33,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT031-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.16/0.33 % Computer : n002.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:28:01 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Satisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start Saturation
% See solution above
% 1.25/1.72 % Total time : 1.374s
%------------------------------------------------------------------------------