↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MGT045+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 : n013.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:43 AM UTC 2026

% Result   : Theorem 0.13s 10.42s
% Output   : Proof 0.13s
% 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(assumption_6,axiom,
    ! [X,T0,T] :
      ( organization(X)
     => ( ( external_ties(X,T) = external_ties(X,T0)
         => position(X,T) = position(X,T0) )
        & ( greater(external_ties(X,T),external_ties(X,T0))
         => greater(position(X,T),position(X,T0)) ) ) ),
    file('theBenchmark.p',assumption_6) ).

fof(assumption_8,axiom,
    ! [X,T0,T] :
      ( ( greater(age(X,T),age(X,T0))
        & organization(X) )
     => greater(external_ties(X,T),external_ties(X,T0)) ),
    file('theBenchmark.p',assumption_8) ).

fof(lemma_4,conjecture,
    ! [X,T0,T] :
      ( ( greater(age(X,T),age(X,T0))
        & organization(X) )
     => greater(position(X,T),position(X,T0)) ),
    file('theBenchmark.p',lemma_4) ).

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] :
      ( ( ( position(X,T) = position(X,T0)
          | external_ties(X,T) != external_ties(X,T0) )
        & ( greater(position(X,T),position(X,T0))
          | ~ greater(external_ties(X,T),external_ties(X,T0)) ) )
      | ~ organization(X) ),
    inference(fof_nnf,[status(thm)],[assumption_6]) ).

fof(f_7_2,plain,
    ! [U_27,U_26,U_25] :
      ( ( ( position(U_27,U_25) = position(U_27,U_26)
          | external_ties(U_27,U_25) != external_ties(U_27,U_26) )
        & ( greater(position(U_27,U_25),position(U_27,U_26))
          | ~ greater(external_ties(U_27,U_25),external_ties(U_27,U_26)) ) )
      | ~ organization(U_27) ),
    inference(variable_rename,[status(thm)],[f_7_1]) ).

fof(f_7_3,plain,
    ! [U_27] :
      ( ( ! [U_31,U_29] :
            ( position(U_27,U_29) = position(U_27,U_31)
            | external_ties(U_27,U_29) != external_ties(U_27,U_31) )
        & ! [U_30,U_28] :
            ( greater(position(U_27,U_28),position(U_27,U_30))
            | ~ greater(external_ties(U_27,U_28),external_ties(U_27,U_30)) ) )
      | ~ organization(U_27) ),
    inference(miniscope,[status(thm)],[f_7_2]) ).

cnf(f_7_4,plain,
    ( greater(position(U_27,U_28),position(U_27,U_30))
    | ~ greater(external_ties(U_27,U_28),external_ties(U_27,U_30))
    | ~ organization(U_27) ),
    inference(clausify,[status(thm)],[f_7_3]) ).

cnf(f_7_5,plain,
    ( position(U_27,U_29) = position(U_27,U_31)
    | external_ties(U_27,U_29) != external_ties(U_27,U_31)
    | ~ organization(U_27) ),
    inference(clausify,[status(thm)],[f_7_3]) ).

fof(f_8_1,plain,
    ! [X,T0,T] :
      ( greater(external_ties(X,T),external_ties(X,T0))
      | ~ greater(age(X,T),age(X,T0))
      | ~ organization(X) ),
    inference(fof_nnf,[status(thm)],[assumption_8]) ).

fof(f_8_2,plain,
    ! [U_34,U_33,U_32] :
      ( greater(external_ties(U_34,U_32),external_ties(U_34,U_33))
      | ~ greater(age(U_34,U_32),age(U_34,U_33))
      | ~ organization(U_34) ),
    inference(variable_rename,[status(thm)],[f_8_1]) ).

cnf(f_8_3,plain,
    ( greater(external_ties(U_34,U_32),external_ties(U_34,U_33))
    | ~ greater(age(U_34,U_32),age(U_34,U_33))
    | ~ organization(U_34) ),
    inference(clausify,[status(thm)],[f_8_2]) ).

fof(f_9_1,negated_conjecture,
    ~ ! [X,T0,T] :
        ( ( greater(age(X,T),age(X,T0))
          & organization(X) )
       => greater(position(X,T),position(X,T0)) ),
    inference(negate,[status(cth)],[lemma_4]) ).

fof(f_9_2,negated_conjecture,
    ? [X,T0,T] :
      ( ~ greater(position(X,T),position(X,T0))
      & greater(age(X,T),age(X,T0))
      & organization(X) ),
    inference(fof_nnf,[status(thm)],[f_9_1]) ).

fof(f_9_3,negated_conjecture,
    ? [U_37,U_36,U_35] :
      ( ~ greater(position(U_37,U_35),position(U_37,U_36))
      & greater(age(U_37,U_35),age(U_37,U_36))
      & organization(U_37) ),
    inference(variable_rename,[status(thm)],[f_9_2]) ).

fof(f_9_4,negated_conjecture,
    ? [U_36,U_35] :
      ( ~ greater(position(sK1,U_35),position(sK1,U_36))
      & greater(age(sK1,U_35),age(sK1,U_36))
      & organization(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_37,sK1)],[f_9_3]) ).

fof(f_9_5,negated_conjecture,
    ? [U_35] :
      ( ~ greater(position(sK1,U_35),position(sK1,sK2))
      & greater(age(sK1,U_35),age(sK1,sK2))
      & organization(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_36,sK2)],[f_9_4]) ).

fof(f_9_6,negated_conjecture,
    ( ~ greater(position(sK1,sK3),position(sK1,sK2))
    & greater(age(sK1,sK3),age(sK1,sK2))
    & organization(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_35,sK3)],[f_9_5]) ).

fof(f_9_7,negated_conjecture,
    ( ~ greater(position(sK1,sK3),position(sK1,sK2))
    & greater(age(sK1,sK3),age(sK1,sK2))
    & organization(sK1) ),
    inference(definitional_conversion,[status(esa)],[f_9_6]) ).

cnf(f_9_8,negated_conjecture,
    organization(sK1),
    inference(clausify,[status(thm)],[f_9_7]) ).

cnf(f_9_9,negated_conjecture,
    greater(age(sK1,sK3),age(sK1,sK2)),
    inference(clausify,[status(thm)],[f_9_7]) ).

cnf(f_9_10,negated_conjecture,
    ~ greater(position(sK1,sK3),position(sK1,sK2)),
    inference(clausify,[status(thm)],[f_9_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,
    ( external_ties(Eq_x_0,Eq_x_1) = external_ties(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( position(Eq_x_0,Eq_x_1) = position(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( age(Eq_x_0,Eq_x_1) = age(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,
    ( 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_8,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_9,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_10,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_11,axiom,
    ( organization(Eq_y_0)
    | ~ organization(Eq_x_0)
    | 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.02  % Problem  : MGT045+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03  % 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/10.37  % Computer : n013.cluster.edu
% 0.08/10.37  % Model    : x86_64 x86_64
% 0.08/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37  % Memory   : 8046.5625MB
% 0.08/10.37  % OS       : Linux 6.8.0-71-generic
% 0.08/10.37  % CPULimit : 300
% 0.08/10.37  % WCLimit  : 300
% 0.08/10.37  % DateTime : Sat Sep 19 16:15:40 UTC 2026
% 0.08/10.38  % CPUTime  : 
% 0.13/10.42  % SZS status Theorem for theBenchmark
% 0.13/10.42  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------