↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Result   : Theorem 0.10s 0.38s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   7 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   69 (  25   ~;  16   |;  21   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   30 (   2 sgn  18   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ( ? [Y] :
          ( q(Y)
         => r(Y) )
      & ! [X] :
          ( p(X)
         => q(X) ) )
   => ? [Z] :
        ( p(Z)
       => r(Z) ) ),
    file('theBenchmark.p',prove_this) ).

fof(f_1_1,negated_conjecture,
    ( ~ ? [Z] :
          ( p(Z)
         => r(Z) )
    & ? [Y] :
        ( q(Y)
       => r(Y) )
    & ! [X] :
        ( p(X)
       => q(X) ) ),
    inference(negate,[status(cth)],[prove_this]) ).

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

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

fof(f_1_4,negated_conjecture,
    ( ! [U_6] : ~ r(U_6)
    & ! [U_5] : p(U_5)
    & ( ? [U_4] : r(U_4)
      | ? [U_3] : ~ q(U_3) )
    & ! [U_0] :
        ( q(U_0)
        | ~ p(U_0) ) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_6] : ~ r(U_6)
    & ! [U_5] : p(U_5)
    & ( ? [U_4] : r(U_4)
      | ~ q(sK1) )
    & ! [U_0] :
        ( q(U_0)
        | ~ p(U_0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_6] : ~ r(U_6)
    & ! [U_5] : p(U_5)
    & ( r(sK2)
      | ~ q(sK1) )
    & ! [U_0] :
        ( q(U_0)
        | ~ p(U_0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_4,sK2)],[f_1_5]) ).

fof(f_1_7,negated_conjecture,
    ( ! [U_6] : ~ r(U_6)
    & ! [U_5] : p(U_5)
    & ( r(sK2)
      | ~ q(sK1) )
    & ! [U_0] :
        ( q(U_0)
        | ~ p(U_0) ) ),
    inference(definitional_conversion,[status(esa)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    ( q(U_0)
    | ~ p(U_0) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_9,negated_conjecture,
    ( r(sK2)
    | ~ q(sK1) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_10,negated_conjecture,
    p(U_5),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_11,negated_conjecture,
    ~ r(U_6),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(t1,plain,
    ~ r(sK2),
    inference(start,[status(thm),parent(0:0)],[f_1_11]) ).

cnf(t2,plain,
    ( ~ q(sK1)
    | r(sK2) ),
    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]) ).

cnf(t4,plain,
    ( ~ p(sK1)
    | q(sK1) ),
    inference(extension,[status(thm),parent(t2:2)],[f_1_8]) ).

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

cnf(t6,plain,
    p(sK1),
    inference(extension,[status(thm),parent(t4:2)],[f_1_10]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN981+1 : TPTP v9.3.1. Released v3.1.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.10/0.36  % Computer : n006.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:29:12 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % SZS status Theorem for theBenchmark
% 0.10/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------