↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN055+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 : n015.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.13s 15.41s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  15   ~;  10   |;   6   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn   6   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel25_1,axiom,
    ? [X] : big_p(X),
    file('theBenchmark.p',pel25_1) ).

fof(pel25_2,axiom,
    ! [X] :
      ( big_f(X)
     => ( big_r(X)
        & ~ big_g(X) ) ),
    file('theBenchmark.p',pel25_2) ).

fof(pel25_3,axiom,
    ! [X] :
      ( big_p(X)
     => ( big_f(X)
        & big_g(X) ) ),
    file('theBenchmark.p',pel25_3) ).

fof(f_1_1,plain,
    ? [X] : big_p(X),
    inference(fof_nnf,[status(thm)],[pel25_1]) ).

fof(f_1_2,plain,
    ? [U_0] : big_p(U_0),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    big_p(sK1),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_2]) ).

cnf(f_1_4,plain,
    big_p(sK1),
    inference(clausify,[status(thm)],[f_1_3]) ).

fof(f_2_1,plain,
    ! [X] :
      ( ( big_r(X)
        & ~ big_g(X) )
      | ~ big_f(X) ),
    inference(fof_nnf,[status(thm)],[pel25_2]) ).

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

cnf(f_2_3,plain,
    ( ~ big_g(U_1)
    | ~ big_f(U_1) ),
    inference(clausify,[status(thm)],[f_2_2]) ).

fof(f_3_1,plain,
    ! [X] :
      ( ( big_f(X)
        & big_g(X) )
      | ~ big_p(X) ),
    inference(fof_nnf,[status(thm)],[pel25_3]) ).

fof(f_3_2,plain,
    ! [U_2] :
      ( ( big_f(U_2)
        & big_g(U_2) )
      | ~ big_p(U_2) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( big_g(U_2)
    | ~ big_p(U_2) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(f_3_4,plain,
    ( big_f(U_2)
    | ~ big_p(U_2) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(t1,plain,
    ( ~ big_g(sK1)
    | ~ big_f(sK1) ),
    inference(start,[status(thm),parent(0:0)],[f_2_3]) ).

cnf(t2,plain,
    ( ~ big_p(sK1)
    | big_f(sK1) ),
    inference(extension,[status(thm),parent(t1:1)],[f_3_4]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    big_p(sK1),
    inference(extension,[status(thm),parent(t2:2)],[f_1_4]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    ( ~ big_p(sK1)
    | big_g(sK1) ),
    inference(extension,[status(thm),parent(t1:2)],[f_3_3]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:2]) ).

cnf(t8,plain,
    big_p(sK1),
    inference(extension,[status(thm),parent(t6:2)],[f_1_4]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN055+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a FOF_CAX_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.11/15.38  % Computer : n015.cluster.edu
% 0.11/15.38  % Model    : x86_64 x86_64
% 0.11/15.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.38  % Memory   : 8046.5625MB
% 0.11/15.38  % OS       : Linux 6.8.0-71-generic
% 0.11/15.38  % CPULimit : 300
% 0.11/15.38  % WCLimit  : 300
% 0.11/15.38  % DateTime : Sun Sep 20 06:27:20 UTC 2026
% 0.11/15.38  % CPUTime  : 
% 0.13/15.41  % SZS status Theorem for theBenchmark
% 0.13/15.41  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------