%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT053+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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:45 AM UTC 2026
% Result : Theorem 0.15s 5.40s
% Output : Proof 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(definition_smaller_or_equal,axiom,
! [X,Y] :
( smaller_or_equal(X,Y)
<=> ( X = Y
| smaller(X,Y) ) ),
file('MGT001+0.ax',definition_smaller_or_equal) ).
fof(definition_greater_or_equal,axiom,
! [X,Y] :
( greater_or_equal(X,Y)
<=> ( X = Y
| greater(X,Y) ) ),
file('MGT001+0.ax',definition_greater_or_equal) ).
fof(definition_smaller,axiom,
! [X,Y] :
( smaller(X,Y)
<=> greater(Y,X) ),
file('MGT001+0.ax',definition_smaller) ).
fof(meaning_postulate_greater_strict,axiom,
! [X,Y] :
~ ( greater(Y,X)
& greater(X,Y) ),
file('MGT001+0.ax',meaning_postulate_greater_strict) ).
fof(meaning_postulate_greater_transitive,axiom,
! [X,Y,Z] :
( ( greater(Y,Z)
& greater(X,Y) )
=> greater(X,Z) ),
file('MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(meaning_postulate_greater_comparable,axiom,
! [X,Y] :
( greater(X,Y)
| X = Y
| smaller(X,Y) ),
file('MGT001+0.ax',meaning_postulate_greater_comparable) ).
fof(definition_2,axiom,
! [X,T0,T] :
( dissimilar(X,T0,T)
<=> ( ~ ( is_aligned(X,T0)
<=> is_aligned(X,T) )
& organization(X) ) ),
file('theBenchmark.p',definition_2) ).
fof(lemma_7,conjecture,
! [X,T1,T2] :
( dissimilar(X,T1,T2)
<=> dissimilar(X,T2,T1) ),
file('theBenchmark.p',lemma_7) ).
fof(f_1_1,plain,
! [X,Y] :
( ( smaller_or_equal(X,Y)
| ( X != Y
& ~ smaller(X,Y) ) )
& ( X = Y
| smaller(X,Y)
| ~ smaller_or_equal(X,Y) ) ),
inference(fof_nnf,[status(thm)],[definition_smaller_or_equal]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ( smaller_or_equal(U_1,U_0)
| ( U_1 != U_0
& ~ smaller(U_1,U_0) ) )
& ( U_1 = U_0
| smaller(U_1,U_0)
| ~ smaller_or_equal(U_1,U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_5,U_3] :
( smaller_or_equal(U_5,U_3)
| ( U_5 != U_3
& ~ smaller(U_5,U_3) ) )
& ! [U_4,U_2] :
( U_4 = U_2
| smaller(U_4,U_2)
| ~ smaller_or_equal(U_4,U_2) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( U_4 = U_2
| smaller(U_4,U_2)
| ~ smaller_or_equal(U_4,U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
( ~ smaller(U_5,U_3)
| smaller_or_equal(U_5,U_3) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_6,plain,
( U_5 != U_3
| smaller_or_equal(U_5,U_3) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [X,Y] :
( ( greater_or_equal(X,Y)
| ( X != Y
& ~ greater(X,Y) ) )
& ( X = Y
| greater(X,Y)
| ~ greater_or_equal(X,Y) ) ),
inference(fof_nnf,[status(thm)],[definition_greater_or_equal]) ).
fof(f_2_2,plain,
! [U_7,U_6] :
( ( greater_or_equal(U_7,U_6)
| ( U_7 != U_6
& ~ greater(U_7,U_6) ) )
& ( U_7 = U_6
| greater(U_7,U_6)
| ~ greater_or_equal(U_7,U_6) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_11,U_9] :
( greater_or_equal(U_11,U_9)
| ( U_11 != U_9
& ~ greater(U_11,U_9) ) )
& ! [U_10,U_8] :
( U_10 = U_8
| greater(U_10,U_8)
| ~ greater_or_equal(U_10,U_8) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( U_10 = U_8
| greater(U_10,U_8)
| ~ greater_or_equal(U_10,U_8) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ greater(U_11,U_9)
| greater_or_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_6,plain,
( U_11 != U_9
| greater_or_equal(U_11,U_9) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X,Y] :
( ( smaller(X,Y)
| ~ greater(Y,X) )
& ( greater(Y,X)
| ~ smaller(X,Y) ) ),
inference(fof_nnf,[status(thm)],[definition_smaller]) ).
fof(f_3_2,plain,
! [U_13,U_12] :
( ( smaller(U_13,U_12)
| ~ greater(U_12,U_13) )
& ( greater(U_12,U_13)
| ~ smaller(U_13,U_12) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_17,U_15] :
( smaller(U_17,U_15)
| ~ greater(U_15,U_17) )
& ! [U_16,U_14] :
( greater(U_14,U_16)
| ~ smaller(U_16,U_14) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( greater(U_14,U_16)
| ~ smaller(U_16,U_14) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( smaller(U_17,U_15)
| ~ greater(U_15,U_17) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [X,Y] :
( ~ greater(Y,X)
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[meaning_postulate_greater_strict]) ).
fof(f_4_2,plain,
! [U_19,U_18] :
( ~ greater(U_18,U_19)
| ~ greater(U_19,U_18) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
( ~ greater(U_18,U_19)
| ~ greater(U_19,U_18) ),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
! [X,Y,Z] :
( greater(X,Z)
| ~ greater(Y,Z)
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[meaning_postulate_greater_transitive]) ).
fof(f_5_2,plain,
! [U_22,U_21,U_20] :
( greater(U_22,U_20)
| ~ greater(U_21,U_20)
| ~ greater(U_22,U_21) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( greater(U_22,U_20)
| ~ greater(U_21,U_20)
| ~ greater(U_22,U_21) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
! [X,Y] :
( greater(X,Y)
| X = Y
| smaller(X,Y) ),
inference(fof_nnf,[status(thm)],[meaning_postulate_greater_comparable]) ).
fof(f_6_2,plain,
! [U_24,U_23] :
( greater(U_24,U_23)
| U_24 = U_23
| smaller(U_24,U_23) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( greater(U_24,U_23)
| U_24 = U_23
| smaller(U_24,U_23) ),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,plain,
! [X,T0,T] :
( ( dissimilar(X,T0,T)
| ( ( is_aligned(X,T0)
| ~ is_aligned(X,T) )
& ( is_aligned(X,T)
| ~ is_aligned(X,T0) ) )
| ~ organization(X) )
& ( ( ( ( ~ is_aligned(X,T0)
& is_aligned(X,T) )
| ( ~ is_aligned(X,T)
& is_aligned(X,T0) ) )
& organization(X) )
| ~ dissimilar(X,T0,T) ) ),
inference(fof_nnf,[status(thm)],[definition_2]) ).
fof(f_7_2,plain,
! [U_27,U_26,U_25] :
( ( dissimilar(U_27,U_26,U_25)
| ( ( is_aligned(U_27,U_26)
| ~ is_aligned(U_27,U_25) )
& ( is_aligned(U_27,U_25)
| ~ is_aligned(U_27,U_26) ) )
| ~ organization(U_27) )
& ( ( ( ( ~ is_aligned(U_27,U_26)
& is_aligned(U_27,U_25) )
| ( ~ is_aligned(U_27,U_25)
& is_aligned(U_27,U_26) ) )
& organization(U_27) )
| ~ dissimilar(U_27,U_26,U_25) ) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
( ! [U_33,U_31,U_29] :
( dissimilar(U_33,U_31,U_29)
| ( ( is_aligned(U_33,U_31)
| ~ is_aligned(U_33,U_29) )
& ( is_aligned(U_33,U_29)
| ~ is_aligned(U_33,U_31) ) )
| ~ organization(U_33) )
& ! [U_32,U_30,U_28] :
( ( ( ( ~ is_aligned(U_32,U_30)
& is_aligned(U_32,U_28) )
| ( ~ is_aligned(U_32,U_28)
& is_aligned(U_32,U_30) ) )
& organization(U_32) )
| ~ dissimilar(U_32,U_30,U_28) ) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
( organization(U_32)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_5,plain,
( is_aligned(U_32,U_28)
| is_aligned(U_32,U_30)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_6,plain,
( ~ is_aligned(U_32,U_30)
| is_aligned(U_32,U_30)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_7,plain,
( is_aligned(U_32,U_28)
| ~ is_aligned(U_32,U_28)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_8,plain,
( ~ is_aligned(U_32,U_30)
| ~ is_aligned(U_32,U_28)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_9,plain,
( is_aligned(U_33,U_29)
| ~ is_aligned(U_33,U_31)
| ~ organization(U_33)
| dissimilar(U_33,U_31,U_29) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_10,plain,
( is_aligned(U_33,U_31)
| ~ is_aligned(U_33,U_29)
| ~ organization(U_33)
| dissimilar(U_33,U_31,U_29) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,negated_conjecture,
~ ! [X,T1,T2] :
( dissimilar(X,T1,T2)
<=> dissimilar(X,T2,T1) ),
inference(negate,[status(cth)],[lemma_7]) ).
fof(f_8_2,negated_conjecture,
? [X,T1,T2] :
( ( ~ dissimilar(X,T1,T2)
& dissimilar(X,T2,T1) )
| ( ~ dissimilar(X,T2,T1)
& dissimilar(X,T1,T2) ) ),
inference(fof_nnf,[status(thm)],[f_8_1]) ).
fof(f_8_3,negated_conjecture,
? [U_36,U_35,U_34] :
( ( ~ dissimilar(U_36,U_35,U_34)
& dissimilar(U_36,U_34,U_35) )
| ( ~ dissimilar(U_36,U_34,U_35)
& dissimilar(U_36,U_35,U_34) ) ),
inference(variable_rename,[status(thm)],[f_8_2]) ).
fof(f_8_4,negated_conjecture,
( ? [U_42,U_40,U_38] :
( ~ dissimilar(U_42,U_40,U_38)
& dissimilar(U_42,U_38,U_40) )
| ? [U_41,U_39,U_37] :
( ~ dissimilar(U_41,U_37,U_39)
& dissimilar(U_41,U_39,U_37) ) ),
inference(miniscope,[status(thm)],[f_8_3]) ).
fof(f_8_5,negated_conjecture,
( ? [U_42,U_40,U_38] :
( ~ dissimilar(U_42,U_40,U_38)
& dissimilar(U_42,U_38,U_40) )
| ? [U_39,U_37] :
( ~ dissimilar(sK1,U_37,U_39)
& dissimilar(sK1,U_39,U_37) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_41,sK1)],[f_8_4]) ).
fof(f_8_6,negated_conjecture,
( ? [U_42,U_40,U_38] :
( ~ dissimilar(U_42,U_40,U_38)
& dissimilar(U_42,U_38,U_40) )
| ? [U_37] :
( ~ dissimilar(sK1,U_37,sK2)
& dissimilar(sK1,sK2,U_37) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_39,sK2)],[f_8_5]) ).
fof(f_8_7,negated_conjecture,
( ? [U_42,U_40,U_38] :
( ~ dissimilar(U_42,U_40,U_38)
& dissimilar(U_42,U_38,U_40) )
| ( ~ dissimilar(sK1,sK3,sK2)
& dissimilar(sK1,sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_37,sK3)],[f_8_6]) ).
fof(f_8_8,negated_conjecture,
( ? [U_40,U_38] :
( ~ dissimilar(sK4,U_40,U_38)
& dissimilar(sK4,U_38,U_40) )
| ( ~ dissimilar(sK1,sK3,sK2)
& dissimilar(sK1,sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_42,sK4)],[f_8_7]) ).
fof(f_8_9,negated_conjecture,
( ? [U_38] :
( ~ dissimilar(sK4,sK5,U_38)
& dissimilar(sK4,U_38,sK5) )
| ( ~ dissimilar(sK1,sK3,sK2)
& dissimilar(sK1,sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_40,sK5)],[f_8_8]) ).
fof(f_8_10,negated_conjecture,
( ( ~ dissimilar(sK4,sK5,sK6)
& dissimilar(sK4,sK6,sK5) )
| ( ~ dissimilar(sK1,sK3,sK2)
& dissimilar(sK1,sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_38,sK6)],[f_8_9]) ).
fof(f_8_11,negated_conjecture,
( ( ~ dissimilar(sK4,sK5,sK6)
| ~ sP1 )
& ( dissimilar(sK4,sK6,sK5)
| ~ sP1 )
& ( ~ dissimilar(sK1,sK3,sK2)
| ~ sP0 )
& ( dissimilar(sK1,sK2,sK3)
| ~ sP0 )
& ( sP1
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_8_10]) ).
cnf(f_8_12,negated_conjecture,
( sP1
| sP0 ),
inference(clausify,[status(thm)],[f_8_11]) ).
cnf(f_8_13,negated_conjecture,
( dissimilar(sK1,sK2,sK3)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_8_11]) ).
cnf(f_8_14,negated_conjecture,
( ~ dissimilar(sK1,sK3,sK2)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_8_11]) ).
cnf(f_8_15,negated_conjecture,
( dissimilar(sK4,sK6,sK5)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_8_11]) ).
cnf(f_8_16,negated_conjecture,
( ~ dissimilar(sK4,sK5,sK6)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_8_11]) ).
cnf(f_7_6_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_7_6]) ).
cnf(f_7_7_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_7_7]) ).
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,
( smaller_or_equal(Eq_y_0,Eq_y_1)
| ~ smaller_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(equality_5,axiom,
( smaller(Eq_y_0,Eq_y_1)
| ~ smaller(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,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(equality_7,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_8,axiom,
( dissimilar(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ dissimilar(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_9,axiom,
( organization(Eq_y_0)
| ~ organization(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,axiom,
( is_aligned(Eq_y_0,Eq_y_1)
| ~ is_aligned(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 : MGT053+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/5.37 % Computer : n004.cluster.edu
% 0.12/5.37 % Model : x86_64 x86_64
% 0.12/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37 % Memory : 8046.5625MB
% 0.12/5.37 % OS : Linux 6.8.0-71-generic
% 0.12/5.37 % CPULimit : 300
% 0.12/5.37 % WCLimit : 300
% 0.12/5.37 % DateTime : Sat Sep 19 16:17:12 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.15/5.40 % SZS status Theorem for theBenchmark
% 0.15/5.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------