↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SEU133+1 : TPTP v9.3.1. Released v3.3.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 : n026.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:58:08 AM UTC 2026

% Result   : Theorem 0.45s 0.76s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
    ! [A,B] :
      ( in(A,B)
     => ~ in(B,A) ),
    file('theBenchmark.p',antisymmetry_r2_hidden) ).

fof(d3_tarski,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('theBenchmark.p',d3_tarski) ).

fof(d4_xboole_0,axiom,
    ! [A,B,C] :
      ( C = set_difference(A,B)
    <=> ! [D] :
          ( in(D,C)
        <=> ( ~ in(D,B)
            & in(D,A) ) ) ),
    file('theBenchmark.p',d4_xboole_0) ).

fof(dt_k1_xboole_0,axiom,
    $true,
    file('theBenchmark.p',dt_k1_xboole_0) ).

fof(dt_k4_xboole_0,axiom,
    $true,
    file('theBenchmark.p',dt_k4_xboole_0) ).

fof(fc1_xboole_0,axiom,
    empty(empty_set),
    file('theBenchmark.p',fc1_xboole_0) ).

fof(rc1_xboole_0,axiom,
    ? [A] : empty(A),
    file('theBenchmark.p',rc1_xboole_0) ).

fof(rc2_xboole_0,axiom,
    ? [A] : ~ empty(A),
    file('theBenchmark.p',rc2_xboole_0) ).

fof(reflexivity_r1_tarski,axiom,
    ! [A,B] : subset(A,A),
    file('theBenchmark.p',reflexivity_r1_tarski) ).

fof(t36_xboole_1,conjecture,
    ! [A,B] : subset(set_difference(A,B),A),
    file('theBenchmark.p',t36_xboole_1) ).

fof(t3_boole,axiom,
    ! [A] : set_difference(A,empty_set) = A,
    file('theBenchmark.p',t3_boole) ).

fof(t4_boole,axiom,
    ! [A] : set_difference(empty_set,A) = empty_set,
    file('theBenchmark.p',t4_boole) ).

fof(t6_boole,axiom,
    ! [A] :
      ( empty(A)
     => A = empty_set ),
    file('theBenchmark.p',t6_boole) ).

fof(t7_boole,axiom,
    ! [A,B] :
      ~ ( empty(B)
        & in(A,B) ),
    file('theBenchmark.p',t7_boole) ).

fof(t8_boole,axiom,
    ! [A,B] :
      ~ ( empty(B)
        & A != B
        & empty(A) ),
    file('theBenchmark.p',t8_boole) ).

fof(f_1_1,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).

fof(f_1_2,plain,
    ! [U_1,U_0] :
      ( ~ in(U_0,U_1)
      | ~ in(U_1,U_0) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    ( ~ in(U_0,U_1)
    | ~ in(U_1,U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_2_1,plain,
    ! [A,B] :
      ( ( subset(A,B)
        | ? [C] :
            ( ~ in(C,B)
            & in(C,A) ) )
      & ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(fof_nnf,[status(thm)],[d3_tarski]) ).

fof(f_2_2,plain,
    ! [U_5,U_4] :
      ( ( subset(U_5,U_4)
        | ? [U_3] :
            ( ~ in(U_3,U_4)
            & in(U_3,U_5) ) )
      & ( ! [U_2] :
            ( in(U_2,U_4)
            | ~ in(U_2,U_5) )
        | ~ subset(U_5,U_4) ) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ( ! [U_9,U_7] :
        ( subset(U_9,U_7)
        | ? [U_3] :
            ( ~ in(U_3,U_7)
            & in(U_3,U_9) ) )
    & ! [U_8,U_6] :
        ( ! [U_2] :
            ( in(U_2,U_6)
            | ~ in(U_2,U_8) )
        | ~ subset(U_8,U_6) ) ),
    inference(miniscope,[status(thm)],[f_2_2]) ).

fof(f_2_4,plain,
    ( ! [U_9,U_7] :
        ( subset(U_9,U_7)
        | ( ~ in(sK1(U_9,U_7),U_7)
          & in(sK1(U_9,U_7),U_9) ) )
    & ! [U_8,U_6] :
        ( ! [U_2] :
            ( in(U_2,U_6)
            | ~ in(U_2,U_8) )
        | ~ subset(U_8,U_6) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1(U_9,U_7))],[f_2_3]) ).

cnf(f_2_5,plain,
    ( in(U_2,U_6)
    | ~ in(U_2,U_8)
    | ~ subset(U_8,U_6) ),
    inference(clausify,[status(thm)],[f_2_4]) ).

cnf(f_2_6,plain,
    ( in(sK1(U_9,U_7),U_9)
    | subset(U_9,U_7) ),
    inference(clausify,[status(thm)],[f_2_4]) ).

cnf(f_2_7,plain,
    ( ~ in(sK1(U_9,U_7),U_7)
    | subset(U_9,U_7) ),
    inference(clausify,[status(thm)],[f_2_4]) ).

fof(f_3_1,plain,
    ! [A,B,C] :
      ( ( C = set_difference(A,B)
        | ? [D] :
            ( ( ~ in(D,C)
              & ~ in(D,B)
              & in(D,A) )
            | ( ( in(D,B)
                | ~ in(D,A) )
              & in(D,C) ) ) )
      & ( ! [D] :
            ( ( in(D,C)
              | in(D,B)
              | ~ in(D,A) )
            & ( ( ~ in(D,B)
                & in(D,A) )
              | ~ in(D,C) ) )
        | C != set_difference(A,B) ) ),
    inference(fof_nnf,[status(thm)],[d4_xboole_0]) ).

fof(f_3_2,plain,
    ! [U_14,U_13,U_12] :
      ( ( U_12 = set_difference(U_14,U_13)
        | ? [U_11] :
            ( ( ~ in(U_11,U_12)
              & ~ in(U_11,U_13)
              & in(U_11,U_14) )
            | ( ( in(U_11,U_13)
                | ~ in(U_11,U_14) )
              & in(U_11,U_12) ) ) )
      & ( ! [U_10] :
            ( ( in(U_10,U_12)
              | in(U_10,U_13)
              | ~ in(U_10,U_14) )
            & ( ( ~ in(U_10,U_13)
                & in(U_10,U_14) )
              | ~ in(U_10,U_12) ) )
        | U_12 != set_difference(U_14,U_13) ) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

fof(f_3_3,plain,
    ( ! [U_24,U_22,U_20] :
        ( U_20 = set_difference(U_24,U_22)
        | ? [U_18] :
            ( ~ in(U_18,U_20)
            & ~ in(U_18,U_22)
            & in(U_18,U_24) )
        | ? [U_17] :
            ( ( in(U_17,U_22)
              | ~ in(U_17,U_24) )
            & in(U_17,U_20) ) )
    & ! [U_23,U_21,U_19] :
        ( ( ! [U_16] :
              ( in(U_16,U_19)
              | in(U_16,U_21)
              | ~ in(U_16,U_23) )
          & ! [U_15] :
              ( ( ~ in(U_15,U_21)
                & in(U_15,U_23) )
              | ~ in(U_15,U_19) ) )
        | U_19 != set_difference(U_23,U_21) ) ),
    inference(miniscope,[status(thm)],[f_3_2]) ).

fof(f_3_4,plain,
    ( ! [U_24,U_22,U_20] :
        ( U_20 = set_difference(U_24,U_22)
        | ? [U_18] :
            ( ~ in(U_18,U_20)
            & ~ in(U_18,U_22)
            & in(U_18,U_24) )
        | ( ( in(sK2(U_24,U_22,U_20),U_22)
            | ~ in(sK2(U_24,U_22,U_20),U_24) )
          & in(sK2(U_24,U_22,U_20),U_20) ) )
    & ! [U_23,U_21,U_19] :
        ( ( ! [U_16] :
              ( in(U_16,U_19)
              | in(U_16,U_21)
              | ~ in(U_16,U_23) )
          & ! [U_15] :
              ( ( ~ in(U_15,U_21)
                & in(U_15,U_23) )
              | ~ in(U_15,U_19) ) )
        | U_19 != set_difference(U_23,U_21) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_17,sK2(U_24,U_22,U_20))],[f_3_3]) ).

fof(f_3_5,plain,
    ( ! [U_24,U_22,U_20] :
        ( U_20 = set_difference(U_24,U_22)
        | ( ~ in(sK3(U_24,U_22,U_20),U_20)
          & ~ in(sK3(U_24,U_22,U_20),U_22)
          & in(sK3(U_24,U_22,U_20),U_24) )
        | ( ( in(sK2(U_24,U_22,U_20),U_22)
            | ~ in(sK2(U_24,U_22,U_20),U_24) )
          & in(sK2(U_24,U_22,U_20),U_20) ) )
    & ! [U_23,U_21,U_19] :
        ( ( ! [U_16] :
              ( in(U_16,U_19)
              | in(U_16,U_21)
              | ~ in(U_16,U_23) )
          & ! [U_15] :
              ( ( ~ in(U_15,U_21)
                & in(U_15,U_23) )
              | ~ in(U_15,U_19) ) )
        | U_19 != set_difference(U_23,U_21) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_18,sK3(U_24,U_22,U_20))],[f_3_4]) ).

cnf(f_3_6,plain,
    ( in(U_15,U_23)
    | ~ in(U_15,U_19)
    | U_19 != set_difference(U_23,U_21) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_7,plain,
    ( ~ in(U_15,U_21)
    | ~ in(U_15,U_19)
    | U_19 != set_difference(U_23,U_21) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_8,plain,
    ( in(U_16,U_19)
    | in(U_16,U_21)
    | ~ in(U_16,U_23)
    | U_19 != set_difference(U_23,U_21) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_9,plain,
    ( in(sK3(U_24,U_22,U_20),U_24)
    | in(sK2(U_24,U_22,U_20),U_20)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_10,plain,
    ( ~ in(sK3(U_24,U_22,U_20),U_22)
    | in(sK2(U_24,U_22,U_20),U_20)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_11,plain,
    ( ~ in(sK3(U_24,U_22,U_20),U_20)
    | in(sK2(U_24,U_22,U_20),U_20)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_12,plain,
    ( in(sK3(U_24,U_22,U_20),U_24)
    | in(sK2(U_24,U_22,U_20),U_22)
    | ~ in(sK2(U_24,U_22,U_20),U_24)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_13,plain,
    ( ~ in(sK3(U_24,U_22,U_20),U_22)
    | in(sK2(U_24,U_22,U_20),U_22)
    | ~ in(sK2(U_24,U_22,U_20),U_24)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

cnf(f_3_14,plain,
    ( ~ in(sK3(U_24,U_22,U_20),U_20)
    | in(sK2(U_24,U_22,U_20),U_22)
    | ~ in(sK2(U_24,U_22,U_20),U_24)
    | U_20 = set_difference(U_24,U_22) ),
    inference(clausify,[status(thm)],[f_3_5]) ).

fof(f_4_1,plain,
    $true,
    inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).

cnf(f_4_2,plain,
    $true,
    inference(clausify,[status(thm)],[f_4_1]) ).

fof(f_5_1,plain,
    $true,
    inference(fof_nnf,[status(thm)],[dt_k4_xboole_0]) ).

cnf(f_5_2,plain,
    $true,
    inference(clausify,[status(thm)],[f_5_1]) ).

fof(f_6_1,plain,
    empty(empty_set),
    inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).

cnf(f_6_2,plain,
    empty(empty_set),
    inference(clausify,[status(thm)],[f_6_1]) ).

fof(f_7_1,plain,
    ? [A] : empty(A),
    inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).

fof(f_7_2,plain,
    ? [U_25] : empty(U_25),
    inference(variable_rename,[status(thm)],[f_7_1]) ).

fof(f_7_3,plain,
    empty(sK4),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_25,sK4)],[f_7_2]) ).

cnf(f_7_4,plain,
    empty(sK4),
    inference(clausify,[status(thm)],[f_7_3]) ).

fof(f_8_1,plain,
    ? [A] : ~ empty(A),
    inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).

fof(f_8_2,plain,
    ? [U_26] : ~ empty(U_26),
    inference(variable_rename,[status(thm)],[f_8_1]) ).

fof(f_8_3,plain,
    ~ empty(sK5),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_26,sK5)],[f_8_2]) ).

cnf(f_8_4,plain,
    ~ empty(sK5),
    inference(clausify,[status(thm)],[f_8_3]) ).

fof(f_9_1,plain,
    ! [A,B] : subset(A,A),
    inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).

fof(f_9_2,plain,
    ! [U_28,U_27] : subset(U_28,U_28),
    inference(variable_rename,[status(thm)],[f_9_1]) ).

fof(f_9_3,plain,
    ! [U_28] : subset(U_28,U_28),
    inference(miniscope,[status(thm)],[f_9_2]) ).

cnf(f_9_4,plain,
    subset(U_28,U_28),
    inference(clausify,[status(thm)],[f_9_3]) ).

fof(f_10_1,negated_conjecture,
    ~ ! [A,B] : subset(set_difference(A,B),A),
    inference(negate,[status(cth)],[t36_xboole_1]) ).

fof(f_10_2,negated_conjecture,
    ? [A,B] : ~ subset(set_difference(A,B),A),
    inference(fof_nnf,[status(thm)],[f_10_1]) ).

fof(f_10_3,negated_conjecture,
    ? [U_30,U_29] : ~ subset(set_difference(U_30,U_29),U_30),
    inference(variable_rename,[status(thm)],[f_10_2]) ).

fof(f_10_4,negated_conjecture,
    ? [U_29] : ~ subset(set_difference(sK6,U_29),sK6),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_30,sK6)],[f_10_3]) ).

fof(f_10_5,negated_conjecture,
    ~ subset(set_difference(sK6,sK7),sK6),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_29,sK7)],[f_10_4]) ).

fof(f_10_6,negated_conjecture,
    ~ subset(set_difference(sK6,sK7),sK6),
    inference(definitional_conversion,[status(esa)],[f_10_5]) ).

cnf(f_10_7,negated_conjecture,
    ~ subset(set_difference(sK6,sK7),sK6),
    inference(clausify,[status(thm)],[f_10_6]) ).

fof(f_11_1,plain,
    ! [A] : set_difference(A,empty_set) = A,
    inference(fof_nnf,[status(thm)],[t3_boole]) ).

fof(f_11_2,plain,
    ! [U_31] : set_difference(U_31,empty_set) = U_31,
    inference(variable_rename,[status(thm)],[f_11_1]) ).

cnf(f_11_3,plain,
    set_difference(U_31,empty_set) = U_31,
    inference(clausify,[status(thm)],[f_11_2]) ).

fof(f_12_1,plain,
    ! [A] : set_difference(empty_set,A) = empty_set,
    inference(fof_nnf,[status(thm)],[t4_boole]) ).

fof(f_12_2,plain,
    ! [U_32] : set_difference(empty_set,U_32) = empty_set,
    inference(variable_rename,[status(thm)],[f_12_1]) ).

cnf(f_12_3,plain,
    set_difference(empty_set,U_32) = empty_set,
    inference(clausify,[status(thm)],[f_12_2]) ).

fof(f_13_1,plain,
    ! [A] :
      ( A = empty_set
      | ~ empty(A) ),
    inference(fof_nnf,[status(thm)],[t6_boole]) ).

fof(f_13_2,plain,
    ! [U_33] :
      ( U_33 = empty_set
      | ~ empty(U_33) ),
    inference(variable_rename,[status(thm)],[f_13_1]) ).

cnf(f_13_3,plain,
    ( U_33 = empty_set
    | ~ empty(U_33) ),
    inference(clausify,[status(thm)],[f_13_2]) ).

fof(f_14_1,plain,
    ! [A,B] :
      ( ~ empty(B)
      | ~ in(A,B) ),
    inference(fof_nnf,[status(thm)],[t7_boole]) ).

fof(f_14_2,plain,
    ! [U_35,U_34] :
      ( ~ empty(U_34)
      | ~ in(U_35,U_34) ),
    inference(variable_rename,[status(thm)],[f_14_1]) ).

cnf(f_14_3,plain,
    ( ~ empty(U_34)
    | ~ in(U_35,U_34) ),
    inference(clausify,[status(thm)],[f_14_2]) ).

fof(f_15_1,plain,
    ! [A,B] :
      ( ~ empty(B)
      | A = B
      | ~ empty(A) ),
    inference(fof_nnf,[status(thm)],[t8_boole]) ).

fof(f_15_2,plain,
    ! [U_37,U_36] :
      ( ~ empty(U_36)
      | U_37 = U_36
      | ~ empty(U_37) ),
    inference(variable_rename,[status(thm)],[f_15_1]) ).

fof(f_15_3,plain,
    ! [U_37] :
      ( ! [U_36] :
          ( ~ empty(U_36)
          | U_37 = U_36 )
      | ~ empty(U_37) ),
    inference(miniscope,[status(thm)],[f_15_2]) ).

cnf(f_15_4,plain,
    ( ~ empty(U_36)
    | U_37 = U_36
    | ~ empty(U_37) ),
    inference(clausify,[status(thm)],[f_15_3]) ).

cnf(f_4_2_true,plain,
    $true,
    inference(clause_is_true,[status(thm)],[f_4_2]) ).

cnf(f_5_2_true,plain,
    $true,
    inference(clause_is_true,[status(thm)],[f_5_2]) ).

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,
    ( set_difference(Eq_x_0,Eq_x_1) = set_difference(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,
    ( sK1(Eq_x_0,Eq_x_1) = sK1(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,
    ( sK2(Eq_x_0,Eq_x_1,Eq_x_2) = sK2(Eq_y_0,Eq_y_1,Eq_y_2)
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_7,axiom,
    ( sK3(Eq_x_0,Eq_x_1,Eq_x_2) = sK3(Eq_y_0,Eq_y_1,Eq_y_2)
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_8,axiom,
    ( in(Eq_y_0,Eq_y_1)
    | ~ in(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,
    ( subset(Eq_y_0,Eq_y_1)
    | ~ subset(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,
    ( empty(Eq_y_0)
    | ~ empty(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.03  % Problem  : SEU133+1 : TPTP v9.3.1. Released v3.3.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.08/0.35  % Computer : n026.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 23:24:06 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.45/0.76  % SZS status Theorem for theBenchmark
% 0.45/0.76  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------