↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel24_1,axiom,
    ~ ? [X] :
        ( big_q(X)
        & big_s(X) ),
    file('theBenchmark.p',pel24_1) ).

fof(pel24_2,axiom,
    ! [X] :
      ( big_p(X)
     => ( big_r(X)
        | big_q(X) ) ),
    file('theBenchmark.p',pel24_2) ).

fof(pel24_3,axiom,
    ( ~ ? [X] : big_p(X)
   => ? [Y] : big_q(Y) ),
    file('theBenchmark.p',pel24_3) ).

fof(pel24_4,axiom,
    ! [X] :
      ( ( big_r(X)
        | big_q(X) )
     => big_s(X) ),
    file('theBenchmark.p',pel24_4) ).

fof(pel24,conjecture,
    ? [X] :
      ( big_r(X)
      & big_p(X) ),
    file('theBenchmark.p',pel24) ).

fof(f_1_1,plain,
    ! [X] :
      ( ~ big_q(X)
      | ~ big_s(X) ),
    inference(fof_nnf,[status(thm)],[pel24_1]) ).

fof(f_1_2,plain,
    ! [U_0] :
      ( ~ big_q(U_0)
      | ~ big_s(U_0) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    ( ~ big_q(U_0)
    | ~ big_s(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_2_1,plain,
    ! [X] :
      ( big_r(X)
      | big_q(X)
      | ~ big_p(X) ),
    inference(fof_nnf,[status(thm)],[pel24_2]) ).

fof(f_2_2,plain,
    ! [U_1] :
      ( big_r(U_1)
      | big_q(U_1)
      | ~ big_p(U_1) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

cnf(f_2_3,plain,
    ( big_r(U_1)
    | big_q(U_1)
    | ~ big_p(U_1) ),
    inference(clausify,[status(thm)],[f_2_2]) ).

fof(f_3_1,plain,
    ( ? [Y] : big_q(Y)
    | ? [X] : big_p(X) ),
    inference(fof_nnf,[status(thm)],[pel24_3]) ).

fof(f_3_2,plain,
    ( ? [U_3] : big_q(U_3)
    | ? [U_2] : big_p(U_2) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

fof(f_3_3,plain,
    ( ? [U_3] : big_q(U_3)
    | big_p(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_3_2]) ).

fof(f_3_4,plain,
    ( big_q(sK2)
    | big_p(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_3_3]) ).

cnf(f_3_5,plain,
    ( big_q(sK2)
    | big_p(sK1) ),
    inference(clausify,[status(thm)],[f_3_4]) ).

fof(f_4_1,plain,
    ! [X] :
      ( big_s(X)
      | ( ~ big_r(X)
        & ~ big_q(X) ) ),
    inference(fof_nnf,[status(thm)],[pel24_4]) ).

fof(f_4_2,plain,
    ! [U_4] :
      ( big_s(U_4)
      | ( ~ big_r(U_4)
        & ~ big_q(U_4) ) ),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

cnf(f_4_3,plain,
    ( ~ big_q(U_4)
    | big_s(U_4) ),
    inference(clausify,[status(thm)],[f_4_2]) ).

cnf(f_4_4,plain,
    ( ~ big_r(U_4)
    | big_s(U_4) ),
    inference(clausify,[status(thm)],[f_4_2]) ).

fof(f_5_1,negated_conjecture,
    ~ ? [X] :
        ( big_r(X)
        & big_p(X) ),
    inference(negate,[status(cth)],[pel24]) ).

fof(f_5_2,negated_conjecture,
    ! [X] :
      ( ~ big_r(X)
      | ~ big_p(X) ),
    inference(fof_nnf,[status(thm)],[f_5_1]) ).

fof(f_5_3,negated_conjecture,
    ! [U_5] :
      ( ~ big_r(U_5)
      | ~ big_p(U_5) ),
    inference(variable_rename,[status(thm)],[f_5_2]) ).

fof(f_5_4,negated_conjecture,
    ! [U_5] :
      ( ~ big_r(U_5)
      | ~ big_p(U_5) ),
    inference(definitional_conversion,[status(esa)],[f_5_3]) ).

cnf(f_5_5,negated_conjecture,
    ( ~ big_r(U_5)
    | ~ big_p(U_5) ),
    inference(clausify,[status(thm)],[f_5_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN054+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03  % 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/5.34  % Computer : n005.cluster.edu
% 0.08/5.34  % Model    : x86_64 x86_64
% 0.08/5.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.34  % Memory   : 8046.5625MB
% 0.08/5.34  % OS       : Linux 6.8.0-71-generic
% 0.08/5.34  % CPULimit : 300
% 0.08/5.34  % WCLimit  : 300
% 0.08/5.34  % DateTime : Sun Sep 20 06:23:24 UTC 2026
% 0.08/5.35  % CPUTime  : 
% 0.08/5.37  % SZS status Theorem for theBenchmark
% 0.08/5.37  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------