↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

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

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

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

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

fof(f_1_4,negated_conjecture,
    ( ! [U_10,U_8] :
        ( ( ~ big_f(U_10,U_8)
          & ! [U_4] : big_g(U_10,U_4) )
        | ( ? [U_3] : ~ big_g(U_10,U_3)
          & big_f(U_10,U_8) ) )
    & ! [U_7,U_2] :
        ( big_f(U_2,U_7)
        | ~ big_g(U_2,U_2) )
    & ! [U_9] :
        ( ! [U_1] : big_g(U_9,U_1)
        | ! [U_0] : ~ big_f(U_9,U_0) ) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_10,U_8] :
        ( ( ~ big_f(U_10,U_8)
          & ! [U_4] : big_g(U_10,U_4) )
        | ( ~ big_g(U_10,sK1(U_10,U_8))
          & big_f(U_10,U_8) ) )
    & ! [U_7,U_2] :
        ( big_f(U_2,U_7)
        | ~ big_g(U_2,U_2) )
    & ! [U_9] :
        ( ! [U_1] : big_g(U_9,U_1)
        | ! [U_0] : ~ big_f(U_9,U_0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1(U_10,U_8))],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_4,U_8,U_10] :
        ( ~ big_f(U_10,U_8)
        | ~ sP1(U_4,U_8,U_10) )
    & ! [U_4,U_8,U_10] :
        ( big_g(U_10,U_4)
        | ~ sP1(U_4,U_8,U_10) )
    & ! [U_8,U_10] :
        ( ~ big_g(U_10,sK1(U_10,U_8))
        | ~ sP0(U_8,U_10) )
    & ! [U_8,U_10] :
        ( big_f(U_10,U_8)
        | ~ sP0(U_8,U_10) )
    & ! [U_4,U_8,U_10] :
        ( sP1(U_4,U_8,U_10)
        | sP0(U_8,U_10) )
    & ! [U_2,U_7] :
        ( big_f(U_2,U_7)
        | ~ big_g(U_2,U_2) )
    & ! [U_0,U_1,U_9] :
        ( big_g(U_9,U_1)
        | ~ big_f(U_9,U_0) ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_5]) ).

cnf(f_1_7,negated_conjecture,
    ( big_g(U_9,U_1)
    | ~ big_f(U_9,U_0) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    ( big_f(U_2,U_7)
    | ~ big_g(U_2,U_2) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_9,negated_conjecture,
    ( sP1(U_4,U_8,U_10)
    | sP0(U_8,U_10) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_10,negated_conjecture,
    ( big_f(U_10,U_8)
    | ~ sP0(U_8,U_10) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_11,negated_conjecture,
    ( ~ big_g(U_10,sK1(U_10,U_8))
    | ~ sP0(U_8,U_10) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_12,negated_conjecture,
    ( big_g(U_10,U_4)
    | ~ sP1(U_4,U_8,U_10) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_13,negated_conjecture,
    ( ~ big_f(U_10,U_8)
    | ~ sP1(U_4,U_8,U_10) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN321+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.09/0.35  % Computer : n002.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 06:31:16 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.13/0.38  % SZS status Theorem for theBenchmark
% 0.13/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------