↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN943+1 : TPTP v9.3.1. Released v3.1.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:11:15 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [A] :
    ? [X,X2,X3,X4,Y] :
      ( ( ( s(A,Y)
         => p(Y) )
        & ( e(X2)
         => ( c(f(X2))
            | g(X2) ) )
        & ( e(X)
         => ( s(X,f(X))
            | g(X) ) )
        & e(A)
        & p(A) )
     => ( ( c(X4)
          & p(X4) )
        | ( g(X3)
          & p(X3) ) ) ),
    file('theBenchmark.p',prove_this) ).

fof(f_1_1,negated_conjecture,
    ~ ! [A] :
      ? [X,X2,X3,X4,Y] :
        ( ( ( s(A,Y)
           => p(Y) )
          & ( e(X2)
           => ( c(f(X2))
              | g(X2) ) )
          & ( e(X)
           => ( s(X,f(X))
              | g(X) ) )
          & e(A)
          & p(A) )
       => ( ( c(X4)
            & p(X4) )
          | ( g(X3)
            & p(X3) ) ) ),
    inference(negate,[status(cth)],[prove_this]) ).

fof(f_1_2,negated_conjecture,
    ? [A] :
    ! [X,X2,X3,X4,Y] :
      ( ( ~ c(X4)
        | ~ p(X4) )
      & ( ~ g(X3)
        | ~ p(X3) )
      & ( p(Y)
        | ~ s(A,Y) )
      & ( c(f(X2))
        | g(X2)
        | ~ e(X2) )
      & ( s(X,f(X))
        | g(X)
        | ~ e(X) )
      & e(A)
      & p(A) ),
    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] :
      ( ( ~ c(U_1)
        | ~ p(U_1) )
      & ( ~ g(U_2)
        | ~ p(U_2) )
      & ( p(U_0)
        | ~ s(U_5,U_0) )
      & ( c(f(U_3))
        | g(U_3)
        | ~ e(U_3) )
      & ( s(U_4,f(U_4))
        | g(U_4)
        | ~ e(U_4) )
      & e(U_5)
      & p(U_5) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ( ? [U_5] :
        ( ! [U_0] :
            ( p(U_0)
            | ~ s(U_5,U_0) )
        & e(U_5)
        & p(U_5) )
    & ! [U_4] :
        ( s(U_4,f(U_4))
        | g(U_4)
        | ~ e(U_4) )
    & ! [U_3] :
        ( c(f(U_3))
        | g(U_3)
        | ~ e(U_3) )
    & ! [U_2] :
        ( ~ g(U_2)
        | ~ p(U_2) )
    & ! [U_1] :
        ( ~ c(U_1)
        | ~ p(U_1) ) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_0] :
        ( p(U_0)
        | ~ s(sK1,U_0) )
    & e(sK1)
    & p(sK1)
    & ! [U_4] :
        ( s(U_4,f(U_4))
        | g(U_4)
        | ~ e(U_4) )
    & ! [U_3] :
        ( c(f(U_3))
        | g(U_3)
        | ~ e(U_3) )
    & ! [U_2] :
        ( ~ g(U_2)
        | ~ p(U_2) )
    & ! [U_1] :
        ( ~ c(U_1)
        | ~ p(U_1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_5,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_0] :
        ( p(U_0)
        | ~ s(sK1,U_0) )
    & e(sK1)
    & p(sK1)
    & ! [U_4] :
        ( s(U_4,f(U_4))
        | g(U_4)
        | ~ e(U_4) )
    & ! [U_3] :
        ( c(f(U_3))
        | g(U_3)
        | ~ e(U_3) )
    & ! [U_2] :
        ( ~ g(U_2)
        | ~ p(U_2) )
    & ! [U_1] :
        ( ~ c(U_1)
        | ~ p(U_1) ) ),
    inference(definitional_conversion,[status(esa)],[f_1_5]) ).

cnf(f_1_7,negated_conjecture,
    ( ~ c(U_1)
    | ~ p(U_1) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    ( ~ g(U_2)
    | ~ p(U_2) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_9,negated_conjecture,
    ( c(f(U_3))
    | g(U_3)
    | ~ e(U_3) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_10,negated_conjecture,
    ( s(U_4,f(U_4))
    | g(U_4)
    | ~ e(U_4) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_11,negated_conjecture,
    p(sK1),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_12,negated_conjecture,
    e(sK1),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_13,negated_conjecture,
    ( p(U_0)
    | ~ s(sK1,U_0) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN943+1 : TPTP v9.3.1. Released v3.1.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.35  % Computer : n002.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sun Sep 20 07:31:46 UTC 2026
% 0.03/0.36  % CPUTime  : 
% 0.03/0.38  % SZS status Theorem for theBenchmark
% 0.03/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------