↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : PHI009+1 : TPTP v9.3.1. Released v7.2.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 : n006.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:53:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(description_axiom_schema_instance,axiom,
    ! [F,G,X] :
      ( ( object(X)
        & property(G)
        & property(F) )
     => ( ( exemplifies_property(G,X)
          & is_the(X,F) )
      <=> ? [Y] :
            ( exemplifies_property(G,Y)
            & ! [Z] :
                ( object(Z)
               => ( exemplifies_property(F,Z)
                 => Z = Y ) )
            & exemplifies_property(F,Y)
            & object(Y) ) ) ),
    file('theBenchmark.p',description_axiom_schema_instance) ).

fof(description_theorem_1,conjecture,
    ! [F] :
      ( property(F)
     => ( ? [Y] :
            ( ! [Z] :
                ( object(Z)
               => ( exemplifies_property(F,Z)
                 => Z = Y ) )
            & exemplifies_property(F,Y)
            & object(Y) )
       => ? [U] :
            ( is_the(U,F)
            & object(U) ) ) ),
    file('theBenchmark.p',description_theorem_1) ).

fof(f_1_1,plain,
    ! [F,G,X] :
      ( ( ( ( exemplifies_property(G,X)
            & is_the(X,F) )
          | ! [Y] :
              ( ~ exemplifies_property(G,Y)
              | ? [Z] :
                  ( Z != Y
                  & exemplifies_property(F,Z)
                  & object(Z) )
              | ~ exemplifies_property(F,Y)
              | ~ object(Y) ) )
        & ( ? [Y] :
              ( exemplifies_property(G,Y)
              & ! [Z] :
                  ( Z = Y
                  | ~ exemplifies_property(F,Z)
                  | ~ object(Z) )
              & exemplifies_property(F,Y)
              & object(Y) )
          | ~ exemplifies_property(G,X)
          | ~ is_the(X,F) ) )
      | ~ object(X)
      | ~ property(G)
      | ~ property(F) ),
    inference(fof_nnf,[status(thm)],[description_axiom_schema_instance]) ).

fof(f_1_2,plain,
    ! [U_6,U_5,U_4] :
      ( ( ( ( exemplifies_property(U_5,U_4)
            & is_the(U_4,U_6) )
          | ! [U_3] :
              ( ~ exemplifies_property(U_5,U_3)
              | ? [U_2] :
                  ( U_2 != U_3
                  & exemplifies_property(U_6,U_2)
                  & object(U_2) )
              | ~ exemplifies_property(U_6,U_3)
              | ~ object(U_3) ) )
        & ( ? [U_1] :
              ( exemplifies_property(U_5,U_1)
              & ! [U_0] :
                  ( U_0 = U_1
                  | ~ exemplifies_property(U_6,U_0)
                  | ~ object(U_0) )
              & exemplifies_property(U_6,U_1)
              & object(U_1) )
          | ~ exemplifies_property(U_5,U_4)
          | ~ is_the(U_4,U_6) ) )
      | ~ object(U_4)
      | ~ property(U_5)
      | ~ property(U_6) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ! [U_6,U_5,U_4] :
      ( ( ( ( exemplifies_property(U_5,U_4)
            & is_the(U_4,U_6) )
          | ! [U_3] :
              ( ~ exemplifies_property(U_5,U_3)
              | ? [U_2] :
                  ( U_2 != U_3
                  & exemplifies_property(U_6,U_2)
                  & object(U_2) )
              | ~ exemplifies_property(U_6,U_3)
              | ~ object(U_3) ) )
        & ( ( exemplifies_property(U_5,sK1(U_6,U_5,U_4))
            & ! [U_0] :
                ( U_0 = sK1(U_6,U_5,U_4)
                | ~ exemplifies_property(U_6,U_0)
                | ~ object(U_0) )
            & exemplifies_property(U_6,sK1(U_6,U_5,U_4))
            & object(sK1(U_6,U_5,U_4)) )
          | ~ exemplifies_property(U_5,U_4)
          | ~ is_the(U_4,U_6) ) )
      | ~ object(U_4)
      | ~ property(U_5)
      | ~ property(U_6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_6,U_5,U_4))],[f_1_2]) ).

fof(f_1_4,plain,
    ! [U_6,U_5,U_4] :
      ( ( ( ( exemplifies_property(U_5,U_4)
            & is_the(U_4,U_6) )
          | ! [U_3] :
              ( ~ exemplifies_property(U_5,U_3)
              | ( sK2(U_6,U_5,U_4,U_3) != U_3
                & exemplifies_property(U_6,sK2(U_6,U_5,U_4,U_3))
                & object(sK2(U_6,U_5,U_4,U_3)) )
              | ~ exemplifies_property(U_6,U_3)
              | ~ object(U_3) ) )
        & ( ( exemplifies_property(U_5,sK1(U_6,U_5,U_4))
            & ! [U_0] :
                ( U_0 = sK1(U_6,U_5,U_4)
                | ~ exemplifies_property(U_6,U_0)
                | ~ object(U_0) )
            & exemplifies_property(U_6,sK1(U_6,U_5,U_4))
            & object(sK1(U_6,U_5,U_4)) )
          | ~ exemplifies_property(U_5,U_4)
          | ~ is_the(U_4,U_6) ) )
      | ~ object(U_4)
      | ~ property(U_5)
      | ~ property(U_6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2(U_6,U_5,U_4,U_3))],[f_1_3]) ).

cnf(f_1_5,plain,
    ( object(sK1(U_6,U_5,U_4))
    | ~ exemplifies_property(U_5,U_4)
    | ~ is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_6,plain,
    ( exemplifies_property(U_6,sK1(U_6,U_5,U_4))
    | ~ exemplifies_property(U_5,U_4)
    | ~ is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_7,plain,
    ( U_0 = sK1(U_6,U_5,U_4)
    | ~ exemplifies_property(U_6,U_0)
    | ~ object(U_0)
    | ~ exemplifies_property(U_5,U_4)
    | ~ is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_8,plain,
    ( exemplifies_property(U_5,sK1(U_6,U_5,U_4))
    | ~ exemplifies_property(U_5,U_4)
    | ~ is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_9,plain,
    ( object(sK2(U_6,U_5,U_4,U_3))
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_10,plain,
    ( exemplifies_property(U_6,sK2(U_6,U_5,U_4,U_3))
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_11,plain,
    ( sK2(U_6,U_5,U_4,U_3) != U_3
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | is_the(U_4,U_6)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_12,plain,
    ( object(sK2(U_6,U_5,U_4,U_3))
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | exemplifies_property(U_5,U_4)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_13,plain,
    ( exemplifies_property(U_6,sK2(U_6,U_5,U_4,U_3))
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | exemplifies_property(U_5,U_4)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_14,plain,
    ( sK2(U_6,U_5,U_4,U_3) != U_3
    | ~ exemplifies_property(U_5,U_3)
    | ~ exemplifies_property(U_6,U_3)
    | ~ object(U_3)
    | exemplifies_property(U_5,U_4)
    | ~ object(U_4)
    | ~ property(U_5)
    | ~ property(U_6) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

fof(f_2_1,negated_conjecture,
    ~ ! [F] :
        ( property(F)
       => ( ? [Y] :
              ( ! [Z] :
                  ( object(Z)
                 => ( exemplifies_property(F,Z)
                   => Z = Y ) )
              & exemplifies_property(F,Y)
              & object(Y) )
         => ? [U] :
              ( is_the(U,F)
              & object(U) ) ) ),
    inference(negate,[status(cth)],[description_theorem_1]) ).

fof(f_2_2,negated_conjecture,
    ? [F] :
      ( ! [U] :
          ( ~ is_the(U,F)
          | ~ object(U) )
      & ? [Y] :
          ( ! [Z] :
              ( Z = Y
              | ~ exemplifies_property(F,Z)
              | ~ object(Z) )
          & exemplifies_property(F,Y)
          & object(Y) )
      & property(F) ),
    inference(fof_nnf,[status(thm)],[f_2_1]) ).

fof(f_2_3,negated_conjecture,
    ? [U_10] :
      ( ! [U_9] :
          ( ~ is_the(U_9,U_10)
          | ~ object(U_9) )
      & ? [U_8] :
          ( ! [U_7] :
              ( U_7 = U_8
              | ~ exemplifies_property(U_10,U_7)
              | ~ object(U_7) )
          & exemplifies_property(U_10,U_8)
          & object(U_8) )
      & property(U_10) ),
    inference(variable_rename,[status(thm)],[f_2_2]) ).

fof(f_2_4,negated_conjecture,
    ( ! [U_9] :
        ( ~ is_the(U_9,sK3)
        | ~ object(U_9) )
    & ? [U_8] :
        ( ! [U_7] :
            ( U_7 = U_8
            | ~ exemplifies_property(sK3,U_7)
            | ~ object(U_7) )
        & exemplifies_property(sK3,U_8)
        & object(U_8) )
    & property(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3)],[f_2_3]) ).

fof(f_2_5,negated_conjecture,
    ( ! [U_9] :
        ( ~ is_the(U_9,sK3)
        | ~ object(U_9) )
    & ! [U_7] :
        ( U_7 = sK4
        | ~ exemplifies_property(sK3,U_7)
        | ~ object(U_7) )
    & exemplifies_property(sK3,sK4)
    & object(sK4)
    & property(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_8,sK4)],[f_2_4]) ).

fof(f_2_6,negated_conjecture,
    ( ! [U_9] :
        ( ~ is_the(U_9,sK3)
        | ~ object(U_9) )
    & ! [U_7] :
        ( U_7 = sK4
        | ~ exemplifies_property(sK3,U_7)
        | ~ object(U_7) )
    & exemplifies_property(sK3,sK4)
    & object(sK4)
    & property(sK3) ),
    inference(definitional_conversion,[status(esa)],[f_2_5]) ).

cnf(f_2_7,negated_conjecture,
    property(sK3),
    inference(clausify,[status(thm)],[f_2_6]) ).

cnf(f_2_8,negated_conjecture,
    object(sK4),
    inference(clausify,[status(thm)],[f_2_6]) ).

cnf(f_2_9,negated_conjecture,
    exemplifies_property(sK3,sK4),
    inference(clausify,[status(thm)],[f_2_6]) ).

cnf(f_2_10,negated_conjecture,
    ( U_7 = sK4
    | ~ exemplifies_property(sK3,U_7)
    | ~ object(U_7) ),
    inference(clausify,[status(thm)],[f_2_6]) ).

cnf(f_2_11,negated_conjecture,
    ( ~ is_the(U_9,sK3)
    | ~ object(U_9) ),
    inference(clausify,[status(thm)],[f_2_6]) ).

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

cnf(equality_6,axiom,
    ( property(Eq_y_0)
    | ~ property(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_7,axiom,
    ( object(Eq_y_0)
    | ~ object(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_8,axiom,
    ( is_the(Eq_y_0,Eq_y_1)
    | ~ is_the(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,
    ( exemplifies_property(Eq_y_0,Eq_y_1)
    | ~ exemplifies_property(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.02  % Problem  : PHI009+1 : TPTP v9.3.1. Released v7.2.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/0.36  % Computer : n006.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 19 19:35:57 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.40  % SZS status Theorem for theBenchmark
% 0.08/0.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------