↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel44_1,axiom,
    ! [X] :
      ( big_f(X)
     => ( ? [Y1] :
            ( ~ big_h(X,Y1)
            & big_g(Y1) )
        & ? [Y] :
            ( big_h(X,Y)
            & big_g(Y) ) ) ),
    file('theBenchmark.p',pel44_1) ).

fof(pel44_2,axiom,
    ? [X] :
      ( ! [Y] :
          ( big_g(Y)
         => big_h(X,Y) )
      & big_j(X) ),
    file('theBenchmark.p',pel44_2) ).

fof(pel44,conjecture,
    ? [X] :
      ( ~ big_f(X)
      & big_j(X) ),
    file('theBenchmark.p',pel44) ).

fof(f_1_1,plain,
    ! [X] :
      ( ( ? [Y1] :
            ( ~ big_h(X,Y1)
            & big_g(Y1) )
        & ? [Y] :
            ( big_h(X,Y)
            & big_g(Y) ) )
      | ~ big_f(X) ),
    inference(fof_nnf,[status(thm)],[pel44_1]) ).

fof(f_1_2,plain,
    ! [U_2] :
      ( ( ? [U_1] :
            ( ~ big_h(U_2,U_1)
            & big_g(U_1) )
        & ? [U_0] :
            ( big_h(U_2,U_0)
            & big_g(U_0) ) )
      | ~ big_f(U_2) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ! [U_2] :
      ( ( ? [U_1] :
            ( ~ big_h(U_2,U_1)
            & big_g(U_1) )
        & big_h(U_2,sK1(U_2))
        & big_g(sK1(U_2)) )
      | ~ big_f(U_2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_2))],[f_1_2]) ).

fof(f_1_4,plain,
    ! [U_2] :
      ( ( ~ big_h(U_2,sK2(U_2))
        & big_g(sK2(U_2))
        & big_h(U_2,sK1(U_2))
        & big_g(sK1(U_2)) )
      | ~ big_f(U_2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2(U_2))],[f_1_3]) ).

cnf(f_1_5,plain,
    ( big_g(sK1(U_2))
    | ~ big_f(U_2) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_6,plain,
    ( big_h(U_2,sK1(U_2))
    | ~ big_f(U_2) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_7,plain,
    ( big_g(sK2(U_2))
    | ~ big_f(U_2) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

cnf(f_1_8,plain,
    ( ~ big_h(U_2,sK2(U_2))
    | ~ big_f(U_2) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

fof(f_2_1,plain,
    ? [X] :
      ( ! [Y] :
          ( big_h(X,Y)
          | ~ big_g(Y) )
      & big_j(X) ),
    inference(fof_nnf,[status(thm)],[pel44_2]) ).

fof(f_2_2,plain,
    ? [U_4] :
      ( ! [U_3] :
          ( big_h(U_4,U_3)
          | ~ big_g(U_3) )
      & big_j(U_4) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ( ! [U_3] :
        ( big_h(sK3,U_3)
        | ~ big_g(U_3) )
    & big_j(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_4,sK3)],[f_2_2]) ).

cnf(f_2_4,plain,
    big_j(sK3),
    inference(clausify,[status(thm)],[f_2_3]) ).

cnf(f_2_5,plain,
    ( big_h(sK3,U_3)
    | ~ big_g(U_3) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

fof(f_3_1,negated_conjecture,
    ~ ? [X] :
        ( ~ big_f(X)
        & big_j(X) ),
    inference(negate,[status(cth)],[pel44]) ).

fof(f_3_2,negated_conjecture,
    ! [X] :
      ( big_f(X)
      | ~ big_j(X) ),
    inference(fof_nnf,[status(thm)],[f_3_1]) ).

fof(f_3_3,negated_conjecture,
    ! [U_5] :
      ( big_f(U_5)
      | ~ big_j(U_5) ),
    inference(variable_rename,[status(thm)],[f_3_2]) ).

fof(f_3_4,negated_conjecture,
    ! [U_5] :
      ( big_f(U_5)
      | ~ big_j(U_5) ),
    inference(definitional_conversion,[status(esa)],[f_3_3]) ).

cnf(f_3_5,negated_conjecture,
    ( big_f(U_5)
    | ~ big_j(U_5) ),
    inference(clausify,[status(thm)],[f_3_4]) ).

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

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