↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN327+1 : TPTP v9.3.1. Released v2.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 : n020.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 09:10:03 AM UTC 2026

% Result   : Theorem 0.08s 0.37s
% Output   : Proof 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   93 (   0 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  115 (  46   ~;  27   |;  34   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   37 (   1 sgn  21   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_12_2,conjecture,
    ! [X] :
    ? [Y] :
    ! [Z] :
      ( big_f(Y,X)
     => ( ( big_f(X,Y)
         => ( ~ big_f(X,Z)
           => ( big_f(Z,Y)
              & big_f(Y,X) ) ) )
        & ( big_f(X,Z)
         => big_f(X,Y) ) ) ),
    file('theBenchmark.p',church_46_12_2) ).

fof(f_1_1,negated_conjecture,
    ~ ! [X] :
      ? [Y] :
      ! [Z] :
        ( big_f(Y,X)
       => ( ( big_f(X,Y)
           => ( ~ big_f(X,Z)
             => ( big_f(Z,Y)
                & big_f(Y,X) ) ) )
          & ( big_f(X,Z)
           => big_f(X,Y) ) ) ),
    inference(negate,[status(cth)],[church_46_12_2]) ).

fof(f_1_2,negated_conjecture,
    ? [X] :
    ! [Y] :
    ? [Z] :
      ( ( ( ( ~ big_f(Z,Y)
            | ~ big_f(Y,X) )
          & ~ big_f(X,Z)
          & big_f(X,Y) )
        | ( ~ big_f(X,Y)
          & big_f(X,Z) ) )
      & big_f(Y,X) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ? [U_2] :
    ! [U_1] :
    ? [U_0] :
      ( ( ( ( ~ big_f(U_0,U_1)
            | ~ big_f(U_1,U_2) )
          & ~ big_f(U_2,U_0)
          & big_f(U_2,U_1) )
        | ( ~ big_f(U_2,U_1)
          & big_f(U_2,U_0) ) )
      & big_f(U_1,U_2) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ? [U_2] :
      ( ! [U_6] :
          ( ( ? [U_4] :
                ( ( ~ big_f(U_4,U_6)
                  | ~ big_f(U_6,U_2) )
                & ~ big_f(U_2,U_4) )
            & big_f(U_2,U_6) )
          | ( ? [U_3] : big_f(U_2,U_3)
            & ~ big_f(U_2,U_6) ) )
      & ! [U_5] : big_f(U_5,U_2) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_6] :
        ( ( ? [U_4] :
              ( ( ~ big_f(U_4,U_6)
                | ~ big_f(U_6,sK1) )
              & ~ big_f(sK1,U_4) )
          & big_f(sK1,U_6) )
        | ( ? [U_3] : big_f(sK1,U_3)
          & ~ big_f(sK1,U_6) ) )
    & ! [U_5] : big_f(U_5,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_6] :
        ( ( ? [U_4] :
              ( ( ~ big_f(U_4,U_6)
                | ~ big_f(U_6,sK1) )
              & ~ big_f(sK1,U_4) )
          & big_f(sK1,U_6) )
        | ( big_f(sK1,sK2(U_6))
          & ~ big_f(sK1,U_6) ) )
    & ! [U_5] : big_f(U_5,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2(U_6))],[f_1_5]) ).

fof(f_1_7,negated_conjecture,
    ( ! [U_6] :
        ( ( ( ~ big_f(sK3(U_6),U_6)
            | ~ big_f(U_6,sK1) )
          & ~ big_f(sK1,sK3(U_6))
          & big_f(sK1,U_6) )
        | ( big_f(sK1,sK2(U_6))
          & ~ big_f(sK1,U_6) ) )
    & ! [U_5] : big_f(U_5,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_4,sK3(U_6))],[f_1_6]) ).

fof(f_1_8,negated_conjecture,
    ( ! [U_6] :
        ( ~ big_f(sK3(U_6),U_6)
        | ~ big_f(U_6,sK1)
        | ~ sP1(U_6) )
    & ! [U_6] :
        ( ~ big_f(sK1,sK3(U_6))
        | ~ sP1(U_6) )
    & ! [U_6] :
        ( big_f(sK1,U_6)
        | ~ sP1(U_6) )
    & ! [U_6] :
        ( big_f(sK1,sK2(U_6))
        | ~ sP0(U_6) )
    & ! [U_6] :
        ( ~ big_f(sK1,U_6)
        | ~ sP0(U_6) )
    & ! [U_6] :
        ( sP1(U_6)
        | sP0(U_6) )
    & ! [U_5] : big_f(U_5,sK1) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_7]) ).

cnf(f_1_9,negated_conjecture,
    big_f(U_5,sK1),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(f_1_10,negated_conjecture,
    ( sP1(U_6)
    | sP0(U_6) ),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(f_1_11,negated_conjecture,
    ( ~ big_f(sK1,U_6)
    | ~ sP0(U_6) ),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(f_1_15,negated_conjecture,
    ( ~ big_f(sK3(U_6),U_6)
    | ~ big_f(U_6,sK1)
    | ~ sP1(U_6) ),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(t1,plain,
    ( ~ big_f(sK1,sK1)
    | ~ sP0(sK1) ),
    inference(start,[status(thm),parent(0:0)],[f_1_11]) ).

cnf(t2,plain,
    ( sP1(sK1)
    | sP0(sK1) ),
    inference(extension,[status(thm),parent(t1:1)],[f_1_10]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    ( ~ big_f(sK1,sK1)
    | ~ big_f(sK3(sK1),sK1)
    | ~ sP1(sK1) ),
    inference(extension,[status(thm),parent(t2:2)],[f_1_15]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    big_f(sK3(sK1),sK1),
    inference(extension,[status(thm),parent(t4:2)],[f_1_9]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).

cnf(t8,plain,
    big_f(sK1,sK1),
    inference(extension,[status(thm),parent(t4:3)],[f_1_9]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).

cnf(t10,plain,
    big_f(sK1,sK1),
    inference(extension,[status(thm),parent(t1:2)],[f_1_9]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t1:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN327+1 : TPTP v9.3.1. Released v2.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.08/0.34  % Computer : n020.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sun Sep 20 06:29:47 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.37  % SZS status Theorem for theBenchmark
% 0.08/0.37  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------