↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_17_2,conjecture,
    ! [X1,X2] :
    ? [Y1,Y2] :
    ! [Z1,Z2] :
      ( big_f(X2,Z1)
     => ( big_f(Y1,Z2)
       => ( ( big_f(Y2,Z2)
            & big_f(X2,Z2) )
          | ( big_f(Y2,Z1)
            & big_f(Y1,Z1) ) ) ) ),
    file('theBenchmark.p',church_46_17_2) ).

fof(f_1_1,negated_conjecture,
    ~ ! [X1,X2] :
      ? [Y1,Y2] :
      ! [Z1,Z2] :
        ( big_f(X2,Z1)
       => ( big_f(Y1,Z2)
         => ( ( big_f(Y2,Z2)
              & big_f(X2,Z2) )
            | ( big_f(Y2,Z1)
              & big_f(Y1,Z1) ) ) ) ),
    inference(negate,[status(cth)],[church_46_17_2]) ).

fof(f_1_2,negated_conjecture,
    ? [X1,X2] :
    ! [Y1,Y2] :
    ? [Z1,Z2] :
      ( ( ~ big_f(Y2,Z2)
        | ~ big_f(X2,Z2) )
      & ( ~ big_f(Y2,Z1)
        | ~ big_f(Y1,Z1) )
      & big_f(Y1,Z2)
      & big_f(X2,Z1) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

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

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

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

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

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

fof(f_1_8,negated_conjecture,
    ( ! [U_2,U_3] :
        ( ~ big_f(U_2,sK3(U_3,U_2))
        | ~ big_f(sK1,sK3(U_3,U_2)) )
    & ! [U_2,U_3] :
        ( ~ big_f(U_2,sK2(U_3,U_2))
        | ~ big_f(U_3,sK2(U_3,U_2)) )
    & ! [U_2,U_3] : big_f(U_3,sK3(U_3,U_2))
    & ! [U_2,U_3] : big_f(sK1,sK2(U_3,U_2)) ),
    inference(definitional_conversion,[status(esa)],[f_1_7]) ).

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

cnf(f_1_10,negated_conjecture,
    big_f(U_3,sK3(U_3,U_2)),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(f_1_11,negated_conjecture,
    ( ~ big_f(U_2,sK2(U_3,U_2))
    | ~ big_f(U_3,sK2(U_3,U_2)) ),
    inference(clausify,[status(thm)],[f_1_8]) ).

cnf(f_1_12,negated_conjecture,
    ( ~ big_f(U_2,sK3(U_3,U_2))
    | ~ big_f(sK1,sK3(U_3,U_2)) ),
    inference(clausify,[status(thm)],[f_1_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN346+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.36  % Computer : n020.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 20 06:30:02 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.14/0.39  % SZS status Theorem for theBenchmark
% 0.14/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------