↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN732+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n009.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:59 AM UTC 2026

% Result   : Theorem 0.14s 0.38s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   53 (  21   ~;   8   |;  19   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   60 (   2 sgn  42   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(x3411,conjecture,
    ( ! [Y] :
        ( ! [X] : p(X,Y)
       => ! [U] : q(U,Y) )
   => ? [Z] :
        ( ? [V] : p(V,Z)
       => ? [W] :
            ( q(W,Z)
            | p(Z,W) ) ) ),
    file('theBenchmark.p',x3411) ).

fof(f_1_1,negated_conjecture,
    ( ~ ? [Z] :
          ( ? [V] : p(V,Z)
         => ? [W] :
              ( q(W,Z)
              | p(Z,W) ) )
    & ! [Y] :
        ( ! [X] : p(X,Y)
       => ! [U] : q(U,Y) ) ),
    inference(negate,[status(cth)],[x3411]) ).

fof(f_1_2,negated_conjecture,
    ( ! [Z] :
        ( ! [W] :
            ( ~ q(W,Z)
            & ~ p(Z,W) )
        & ? [V] : p(V,Z) )
    & ! [Y] :
        ( ! [U] : q(U,Y)
        | ? [X] : ~ p(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

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

fof(f_1_4,negated_conjecture,
    ( ! [U_11,U_7] : ~ q(U_7,U_11)
    & ! [U_10,U_6] : ~ p(U_10,U_6)
    & ! [U_8] :
      ? [U_3] : p(U_3,U_8)
    & ! [U_2] :
        ( ! [U_1] : q(U_1,U_2)
        | ? [U_0] : ~ p(U_0,U_2) ) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_11,U_7] : ~ q(U_7,U_11)
    & ! [U_10,U_6] : ~ p(U_10,U_6)
    & ! [U_8] :
      ? [U_3] : p(U_3,U_8)
    & ! [U_2] :
        ( ! [U_1] : q(U_1,U_2)
        | ~ p(sK1(U_2),U_2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_2))],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_11,U_7] : ~ q(U_7,U_11)
    & ! [U_10,U_6] : ~ p(U_10,U_6)
    & ! [U_8] : p(sK2(U_8),U_8)
    & ! [U_2] :
        ( ! [U_1] : q(U_1,U_2)
        | ~ p(sK1(U_2),U_2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2(U_8))],[f_1_5]) ).

fof(f_1_7,negated_conjecture,
    ( ! [U_7,U_11] : ~ q(U_7,U_11)
    & ! [U_6,U_10] : ~ p(U_10,U_6)
    & ! [U_8] : p(sK2(U_8),U_8)
    & ! [U_2,U_1] :
        ( q(U_1,U_2)
        | ~ p(sK1(U_2),U_2) ) ),
    inference(definitional_conversion,[status(esa)],[f_1_6]) ).

cnf(f_1_9,negated_conjecture,
    p(sK2(U_8),U_8),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_10,negated_conjecture,
    ~ p(U_10,U_6),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(t1,plain,
    ~ p(sK2(U_49),U_49),
    inference(start,[status(thm),parent(0:0)],[f_1_10]) ).

cnf(t2,plain,
    p(sK2(U_49),U_49),
    inference(extension,[status(thm),parent(t1:1)],[f_1_9]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN732+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 07:07:42 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------