%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT039-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 : Thu Sep 24 08:50:42 AM UTC 2026
% Result : Unsatisfiable 218.55s 218.89s
% Output : Proof 219.37s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp3_favoured_trategy_20,axiom,
( selection_favors(efficient_producers,first_movers,A)
| environment(sk1(A))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(A) ),
file('theBenchmark.p',mp3_favoured_trategy_20) ).
cnf(mp3_favoured_trategy_21,axiom,
( selection_favors(efficient_producers,first_movers,A)
| in_environment(A,sk1(A))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(A) ),
file('theBenchmark.p',mp3_favoured_trategy_21) ).
cnf(mp3_favoured_trategy_22,axiom,
( selection_favors(efficient_producers,first_movers,A)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(A)))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(A) ),
file('theBenchmark.p',mp3_favoured_trategy_22) ).
cnf(mp4_critical_point_23,axiom,
( in_environment(B,sk2(B,A))
| ~ in_environment(A,B)
| ~ environment(B)
| ~ slow_change(A)
| ~ observational_period(A) ),
file('theBenchmark.p',mp4_critical_point_23) ).
cnf(mp4_critical_point_24,axiom,
( greater(sk2(B,A),critical_point(B))
| ~ in_environment(A,B)
| ~ environment(B)
| ~ slow_change(A)
| ~ observational_period(A) ),
file('theBenchmark.p',mp4_critical_point_24) ).
cnf(mp_organizational_sets1_25,axiom,
propagation_strategy(first_movers),
file('theBenchmark.p',mp_organizational_sets1_25) ).
cnf(mp_organizational_sets2_26,axiom,
propagation_strategy(efficient_producers),
file('theBenchmark.p',mp_organizational_sets2_26) ).
cnf(mp_time_in_environment_27,axiom,
( in_environment(A,B)
| ~ greater_or_equal(end_time(A),B)
| ~ greater_or_equal(B,start_time(A))
| ~ environment(A) ),
file('theBenchmark.p',mp_time_in_environment_27) ).
cnf(mp_environment_end_point_28,axiom,
( greater_or_equal(end_time(A),B)
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',mp_environment_end_point_28) ).
cnf(mp_time_of_critical_point_29,axiom,
( greater_or_equal(critical_point(A),start_time(A))
| ~ environment(A) ),
file('theBenchmark.p',mp_time_of_critical_point_29) ).
cnf(mp_greater_transitivity_30,axiom,
( greater(A,C)
| ~ greater(B,C)
| ~ greater(A,B) ),
file('theBenchmark.p',mp_greater_transitivity_30) ).
cnf(mp_greater_or_equal_31,axiom,
( A = B
| greater(A,B)
| ~ greater_or_equal(A,B) ),
file('theBenchmark.p',mp_greater_or_equal_31) ).
cnf(mp_greater_or_equal_32,axiom,
( greater_or_equal(A,B)
| ~ greater(A,B) ),
file('theBenchmark.p',mp_greater_or_equal_32) ).
cnf(mp_greater_or_equal_33,axiom,
( greater_or_equal(A,B)
| A != B ),
file('theBenchmark.p',mp_greater_or_equal_33) ).
cnf(mp_beginning_and_ending_34,axiom,
( greater_or_equal(end_time(A),B)
| greater(B,end_time(A))
| ~ greater(B,start_time(A))
| ~ environment(A) ),
file('theBenchmark.p',mp_beginning_and_ending_34) ).
cnf(l8_35,hypothesis,
( selection_favors(efficient_producers,first_movers,B)
| ~ greater(B,critical_point(A))
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',l8_35) ).
cnf(prove_t8_36,negated_conjecture,
observational_period(sk3),
file('theBenchmark.p',prove_t8_36) ).
cnf(prove_t8_37,negated_conjecture,
slow_change(sk3),
file('theBenchmark.p',prove_t8_37) ).
cnf(prove_t8_38,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk3),
file('theBenchmark.p',prove_t8_38) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sk1(Eq_x_0) = sk1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( end_time(Eq_x_0) = end_time(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sk2(Eq_x_0,Eq_x_1) = sk2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( critical_point(Eq_x_0) = critical_point(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( start_time(Eq_x_0) = start_time(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_9,axiom,
( observational_period(Eq_y_0)
| ~ observational_period(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,axiom,
( propagation_strategy(Eq_y_0)
| ~ propagation_strategy(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_11,axiom,
( environment(Eq_y_0)
| ~ environment(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_12,axiom,
( selection_favors(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ selection_favors(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_13,axiom,
( in_environment(Eq_y_0,Eq_y_1)
| ~ in_environment(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_14,axiom,
( slow_change(Eq_y_0)
| ~ slow_change(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_15,axiom,
( greater(Eq_y_0,Eq_y_1)
| ~ greater(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_16,axiom,
( greater_or_equal(Eq_y_0,Eq_y_1)
| ~ greater_or_equal(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT039-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.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 : Sat Sep 19 16:16:55 UTC 2026
% 0.08/0.35 % CPUTime :
% 218.55/218.89 % SZS status Unsatisfiable for theBenchmark
% 218.55/218.89 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------