↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LCL674+1.001 : TPTP v9.3.1. Released v4.0.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 : n005.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:49:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
    ! [X] : r1(X,X),
    file('theBenchmark.p',reflexivity) ).

fof(transitivity,axiom,
    ! [X,Y,Z] :
      ( ( r1(Y,Z)
        & r1(X,Y) )
     => r1(X,Z) ),
    file('theBenchmark.p',transitivity) ).

fof(main,conjecture,
    ~ ? [X] :
        ~ ( ~ ( p100(X)
              & ~ p101(X)
              & ! [Y] :
                  ( ( ( ~ p101(Y)
                      | p100(Y) )
                    & ( ~ p102(Y)
                      | p101(Y) )
                    & ( ~ p100(Y)
                      | ( ( ~ p1(Y)
                          | ! [X] :
                              ( ~ p100(X)
                              | p1(X)
                              | ~ r1(Y,X) ) )
                        & ( p1(Y)
                          | ! [X] :
                              ( ~ p100(X)
                              | ~ p1(X)
                              | ~ r1(Y,X) ) ) ) )
                    & ( ~ p101(Y)
                      | ( ( ~ p2(Y)
                          | ! [X] :
                              ( ~ p101(X)
                              | p2(X)
                              | ~ r1(Y,X) ) )
                        & ( p2(Y)
                          | ! [X] :
                              ( ~ p101(X)
                              | ~ p2(X)
                              | ~ r1(Y,X) ) ) ) )
                    & ( ~ ( p100(Y)
                          & ~ p101(Y) )
                      | ( ~ ! [X] :
                              ( ~ ( p101(X)
                                  & ~ p102(X)
                                  & p2(X) )
                              | ~ r1(Y,X) )
                        & ~ ! [X] :
                              ( ~ ( p101(X)
                                  & ~ p102(X)
                                  & ~ p2(X) )
                              | ~ r1(Y,X) ) ) ) )
                  | ~ r1(X,Y) ) )
          | ~ ! [Y] :
                ( p2(Y)
                | ~ r1(X,Y) ) ),
    file('theBenchmark.p',main) ).

fof(f_1_1,plain,
    ! [X] : r1(X,X),
    inference(fof_nnf,[status(thm)],[reflexivity]) ).

fof(f_1_2,plain,
    ! [U_0] : r1(U_0,U_0),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    r1(U_0,U_0),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_2_1,plain,
    ! [X,Y,Z] :
      ( r1(X,Z)
      | ~ r1(Y,Z)
      | ~ r1(X,Y) ),
    inference(fof_nnf,[status(thm)],[transitivity]) ).

fof(f_2_2,plain,
    ! [U_3,U_2,U_1] :
      ( r1(U_3,U_1)
      | ~ r1(U_2,U_1)
      | ~ r1(U_3,U_2) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

cnf(f_2_3,plain,
    ( r1(U_3,U_1)
    | ~ r1(U_2,U_1)
    | ~ r1(U_3,U_2) ),
    inference(clausify,[status(thm)],[f_2_2]) ).

fof(f_3_1,negated_conjecture,
    ? [X] :
      ~ ( ~ ( p100(X)
            & ~ p101(X)
            & ! [Y] :
                ( ( ( ~ p101(Y)
                    | p100(Y) )
                  & ( ~ p102(Y)
                    | p101(Y) )
                  & ( ~ p100(Y)
                    | ( ( ~ p1(Y)
                        | ! [X] :
                            ( ~ p100(X)
                            | p1(X)
                            | ~ r1(Y,X) ) )
                      & ( p1(Y)
                        | ! [X] :
                            ( ~ p100(X)
                            | ~ p1(X)
                            | ~ r1(Y,X) ) ) ) )
                  & ( ~ p101(Y)
                    | ( ( ~ p2(Y)
                        | ! [X] :
                            ( ~ p101(X)
                            | p2(X)
                            | ~ r1(Y,X) ) )
                      & ( p2(Y)
                        | ! [X] :
                            ( ~ p101(X)
                            | ~ p2(X)
                            | ~ r1(Y,X) ) ) ) )
                  & ( ~ ( p100(Y)
                        & ~ p101(Y) )
                    | ( ~ ! [X] :
                            ( ~ ( p101(X)
                                & ~ p102(X)
                                & p2(X) )
                            | ~ r1(Y,X) )
                      & ~ ! [X] :
                            ( ~ ( p101(X)
                                & ~ p102(X)
                                & ~ p2(X) )
                            | ~ r1(Y,X) ) ) ) )
                | ~ r1(X,Y) ) )
        | ~ ! [Y] :
              ( p2(Y)
              | ~ r1(X,Y) ) ),
    inference(negate,[status(cth)],[main]) ).

fof(f_3_2,negated_conjecture,
    ? [X] :
      ( p100(X)
      & ~ p101(X)
      & ! [Y] :
          ( ( ( ~ p101(Y)
              | p100(Y) )
            & ( ~ p102(Y)
              | p101(Y) )
            & ( ~ p100(Y)
              | ( ( ~ p1(Y)
                  | ! [X] :
                      ( ~ p100(X)
                      | p1(X)
                      | ~ r1(Y,X) ) )
                & ( p1(Y)
                  | ! [X] :
                      ( ~ p100(X)
                      | ~ p1(X)
                      | ~ r1(Y,X) ) ) ) )
            & ( ~ p101(Y)
              | ( ( ~ p2(Y)
                  | ! [X] :
                      ( ~ p101(X)
                      | p2(X)
                      | ~ r1(Y,X) ) )
                & ( p2(Y)
                  | ! [X] :
                      ( ~ p101(X)
                      | ~ p2(X)
                      | ~ r1(Y,X) ) ) ) )
            & ( ~ p100(Y)
              | p101(Y)
              | ( ? [X] :
                    ( p101(X)
                    & ~ p102(X)
                    & p2(X)
                    & r1(Y,X) )
                & ? [X] :
                    ( p101(X)
                    & ~ p102(X)
                    & ~ p2(X)
                    & r1(Y,X) ) ) ) )
          | ~ r1(X,Y) )
      & ! [Y] :
          ( p2(Y)
          | ~ r1(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[f_3_1]) ).

fof(f_3_3,negated_conjecture,
    ? [U_12] :
      ( p100(U_12)
      & ~ p101(U_12)
      & ! [U_11] :
          ( ( ( ~ p101(U_11)
              | p100(U_11) )
            & ( ~ p102(U_11)
              | p101(U_11) )
            & ( ~ p100(U_11)
              | ( ( ~ p1(U_11)
                  | ! [U_10] :
                      ( ~ p100(U_10)
                      | p1(U_10)
                      | ~ r1(U_11,U_10) ) )
                & ( p1(U_11)
                  | ! [U_9] :
                      ( ~ p100(U_9)
                      | ~ p1(U_9)
                      | ~ r1(U_11,U_9) ) ) ) )
            & ( ~ p101(U_11)
              | ( ( ~ p2(U_11)
                  | ! [U_8] :
                      ( ~ p101(U_8)
                      | p2(U_8)
                      | ~ r1(U_11,U_8) ) )
                & ( p2(U_11)
                  | ! [U_7] :
                      ( ~ p101(U_7)
                      | ~ p2(U_7)
                      | ~ r1(U_11,U_7) ) ) ) )
            & ( ~ p100(U_11)
              | p101(U_11)
              | ( ? [U_6] :
                    ( p101(U_6)
                    & ~ p102(U_6)
                    & p2(U_6)
                    & r1(U_11,U_6) )
                & ? [U_5] :
                    ( p101(U_5)
                    & ~ p102(U_5)
                    & ~ p2(U_5)
                    & r1(U_11,U_5) ) ) ) )
          | ~ r1(U_12,U_11) )
      & ! [U_4] :
          ( p2(U_4)
          | ~ r1(U_12,U_4) ) ),
    inference(variable_rename,[status(thm)],[f_3_2]) ).

fof(f_3_4,negated_conjecture,
    ( p100(sK1)
    & ~ p101(sK1)
    & ! [U_11] :
        ( ( ( ~ p101(U_11)
            | p100(U_11) )
          & ( ~ p102(U_11)
            | p101(U_11) )
          & ( ~ p100(U_11)
            | ( ( ~ p1(U_11)
                | ! [U_10] :
                    ( ~ p100(U_10)
                    | p1(U_10)
                    | ~ r1(U_11,U_10) ) )
              & ( p1(U_11)
                | ! [U_9] :
                    ( ~ p100(U_9)
                    | ~ p1(U_9)
                    | ~ r1(U_11,U_9) ) ) ) )
          & ( ~ p101(U_11)
            | ( ( ~ p2(U_11)
                | ! [U_8] :
                    ( ~ p101(U_8)
                    | p2(U_8)
                    | ~ r1(U_11,U_8) ) )
              & ( p2(U_11)
                | ! [U_7] :
                    ( ~ p101(U_7)
                    | ~ p2(U_7)
                    | ~ r1(U_11,U_7) ) ) ) )
          & ( ~ p100(U_11)
            | p101(U_11)
            | ( ? [U_6] :
                  ( p101(U_6)
                  & ~ p102(U_6)
                  & p2(U_6)
                  & r1(U_11,U_6) )
              & ? [U_5] :
                  ( p101(U_5)
                  & ~ p102(U_5)
                  & ~ p2(U_5)
                  & r1(U_11,U_5) ) ) ) )
        | ~ r1(sK1,U_11) )
    & ! [U_4] :
        ( p2(U_4)
        | ~ r1(sK1,U_4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_12,sK1)],[f_3_3]) ).

fof(f_3_5,negated_conjecture,
    ( p100(sK1)
    & ~ p101(sK1)
    & ! [U_11] :
        ( ( ( ~ p101(U_11)
            | p100(U_11) )
          & ( ~ p102(U_11)
            | p101(U_11) )
          & ( ~ p100(U_11)
            | ( ( ~ p1(U_11)
                | ! [U_10] :
                    ( ~ p100(U_10)
                    | p1(U_10)
                    | ~ r1(U_11,U_10) ) )
              & ( p1(U_11)
                | ! [U_9] :
                    ( ~ p100(U_9)
                    | ~ p1(U_9)
                    | ~ r1(U_11,U_9) ) ) ) )
          & ( ~ p101(U_11)
            | ( ( ~ p2(U_11)
                | ! [U_8] :
                    ( ~ p101(U_8)
                    | p2(U_8)
                    | ~ r1(U_11,U_8) ) )
              & ( p2(U_11)
                | ! [U_7] :
                    ( ~ p101(U_7)
                    | ~ p2(U_7)
                    | ~ r1(U_11,U_7) ) ) ) )
          & ( ~ p100(U_11)
            | p101(U_11)
            | ( ? [U_6] :
                  ( p101(U_6)
                  & ~ p102(U_6)
                  & p2(U_6)
                  & r1(U_11,U_6) )
              & p101(sK2(U_11))
              & ~ p102(sK2(U_11))
              & ~ p2(sK2(U_11))
              & r1(U_11,sK2(U_11)) ) ) )
        | ~ r1(sK1,U_11) )
    & ! [U_4] :
        ( p2(U_4)
        | ~ r1(sK1,U_4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2(U_11))],[f_3_4]) ).

fof(f_3_6,negated_conjecture,
    ( p100(sK1)
    & ~ p101(sK1)
    & ! [U_11] :
        ( ( ( ~ p101(U_11)
            | p100(U_11) )
          & ( ~ p102(U_11)
            | p101(U_11) )
          & ( ~ p100(U_11)
            | ( ( ~ p1(U_11)
                | ! [U_10] :
                    ( ~ p100(U_10)
                    | p1(U_10)
                    | ~ r1(U_11,U_10) ) )
              & ( p1(U_11)
                | ! [U_9] :
                    ( ~ p100(U_9)
                    | ~ p1(U_9)
                    | ~ r1(U_11,U_9) ) ) ) )
          & ( ~ p101(U_11)
            | ( ( ~ p2(U_11)
                | ! [U_8] :
                    ( ~ p101(U_8)
                    | p2(U_8)
                    | ~ r1(U_11,U_8) ) )
              & ( p2(U_11)
                | ! [U_7] :
                    ( ~ p101(U_7)
                    | ~ p2(U_7)
                    | ~ r1(U_11,U_7) ) ) ) )
          & ( ~ p100(U_11)
            | p101(U_11)
            | ( p101(sK3(U_11))
              & ~ p102(sK3(U_11))
              & p2(sK3(U_11))
              & r1(U_11,sK3(U_11))
              & p101(sK2(U_11))
              & ~ p102(sK2(U_11))
              & ~ p2(sK2(U_11))
              & r1(U_11,sK2(U_11)) ) ) )
        | ~ r1(sK1,U_11) )
    & ! [U_4] :
        ( p2(U_4)
        | ~ r1(sK1,U_4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3(U_11))],[f_3_5]) ).

fof(f_3_7,negated_conjecture,
    ( ! [U_9,U_10,U_11] :
        ( ~ p1(U_11)
        | ~ p100(U_10)
        | p1(U_10)
        | ~ r1(U_11,U_10)
        | ~ sP2(U_9,U_10,U_11) )
    & ! [U_9,U_10,U_11] :
        ( p1(U_11)
        | ~ p100(U_9)
        | ~ p1(U_9)
        | ~ r1(U_11,U_9)
        | ~ sP2(U_9,U_10,U_11) )
    & ! [U_7,U_8,U_11] :
        ( ~ p2(U_11)
        | ~ p101(U_8)
        | p2(U_8)
        | ~ r1(U_11,U_8)
        | ~ sP1(U_7,U_8,U_11) )
    & ! [U_7,U_8,U_11] :
        ( p2(U_11)
        | ~ p101(U_7)
        | ~ p2(U_7)
        | ~ r1(U_11,U_7)
        | ~ sP1(U_7,U_8,U_11) )
    & ! [U_11] :
        ( p101(sK3(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( ~ p102(sK3(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( p2(sK3(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( r1(U_11,sK3(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( p101(sK2(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( ~ p102(sK2(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( ~ p2(sK2(U_11))
        | ~ sP0(U_11) )
    & ! [U_11] :
        ( r1(U_11,sK2(U_11))
        | ~ sP0(U_11) )
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( ~ p101(U_11)
        | p100(U_11)
        | ~ sP3(U_7,U_9,U_8,U_10,U_11) )
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( ~ p102(U_11)
        | p101(U_11)
        | ~ sP3(U_7,U_9,U_8,U_10,U_11) )
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( ~ p100(U_11)
        | sP2(U_9,U_10,U_11)
        | ~ sP3(U_7,U_9,U_8,U_10,U_11) )
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( ~ p101(U_11)
        | sP1(U_7,U_8,U_11)
        | ~ sP3(U_7,U_9,U_8,U_10,U_11) )
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( ~ p100(U_11)
        | p101(U_11)
        | sP0(U_11)
        | ~ sP3(U_7,U_9,U_8,U_10,U_11) )
    & p100(sK1)
    & ~ p101(sK1)
    & ! [U_7,U_9,U_8,U_10,U_11] :
        ( sP3(U_7,U_9,U_8,U_10,U_11)
        | ~ r1(sK1,U_11) )
    & ! [U_4] :
        ( p2(U_4)
        | ~ r1(sK1,U_4) ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3])],[f_3_6]) ).

cnf(f_3_8,negated_conjecture,
    ( p2(U_4)
    | ~ r1(sK1,U_4) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_9,negated_conjecture,
    ( sP3(U_7,U_9,U_8,U_10,U_11)
    | ~ r1(sK1,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_10,negated_conjecture,
    ~ p101(sK1),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_11,negated_conjecture,
    p100(sK1),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_12,negated_conjecture,
    ( ~ p100(U_11)
    | p101(U_11)
    | sP0(U_11)
    | ~ sP3(U_7,U_9,U_8,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_13,negated_conjecture,
    ( ~ p101(U_11)
    | sP1(U_7,U_8,U_11)
    | ~ sP3(U_7,U_9,U_8,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_14,negated_conjecture,
    ( ~ p100(U_11)
    | sP2(U_9,U_10,U_11)
    | ~ sP3(U_7,U_9,U_8,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_15,negated_conjecture,
    ( ~ p102(U_11)
    | p101(U_11)
    | ~ sP3(U_7,U_9,U_8,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_16,negated_conjecture,
    ( ~ p101(U_11)
    | p100(U_11)
    | ~ sP3(U_7,U_9,U_8,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_17,negated_conjecture,
    ( r1(U_11,sK2(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_18,negated_conjecture,
    ( ~ p2(sK2(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_19,negated_conjecture,
    ( ~ p102(sK2(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_20,negated_conjecture,
    ( p101(sK2(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_21,negated_conjecture,
    ( r1(U_11,sK3(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_22,negated_conjecture,
    ( p2(sK3(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_23,negated_conjecture,
    ( ~ p102(sK3(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_24,negated_conjecture,
    ( p101(sK3(U_11))
    | ~ sP0(U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_25,negated_conjecture,
    ( p2(U_11)
    | ~ p101(U_7)
    | ~ p2(U_7)
    | ~ r1(U_11,U_7)
    | ~ sP1(U_7,U_8,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_26,negated_conjecture,
    ( ~ p2(U_11)
    | ~ p101(U_8)
    | p2(U_8)
    | ~ r1(U_11,U_8)
    | ~ sP1(U_7,U_8,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_27,negated_conjecture,
    ( p1(U_11)
    | ~ p100(U_9)
    | ~ p1(U_9)
    | ~ r1(U_11,U_9)
    | ~ sP2(U_9,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(f_3_28,negated_conjecture,
    ( ~ p1(U_11)
    | ~ p100(U_10)
    | p1(U_10)
    | ~ r1(U_11,U_10)
    | ~ sP2(U_9,U_10,U_11) ),
    inference(clausify,[status(thm)],[f_3_7]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ 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.10/0.38  % Computer : n005.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep 19 15:38:33 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.31/0.62  % SZS status Theorem for theBenchmark
% 0.31/0.62  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------