↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

fof(f_1_1,negated_conjecture,
    ( ~ ? [Z] : a(Z,Z)
    & ! [X] :
      ? [Y] :
        ( a(Y,Y)
        & a(X,Y) ) ),
    inference(negate,[status(cth)],[prove_this]) ).

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

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

fof(f_1_4,negated_conjecture,
    ( ! [U_2] : ~ a(U_2,U_2)
    & ! [U_1] :
        ( a(sK1(U_1),sK1(U_1))
        & a(U_1,sK1(U_1)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_1))],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_2] : ~ a(U_2,U_2)
    & ! [U_1] : a(sK1(U_1),sK1(U_1))
    & ! [U_1] : a(U_1,sK1(U_1)) ),
    inference(definitional_conversion,[status(esa)],[f_1_4]) ).

cnf(f_1_7,negated_conjecture,
    a(sK1(U_1),sK1(U_1)),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(f_1_8,negated_conjecture,
    ~ a(U_2,U_2),
    inference(clausify,[status(thm)],[f_1_5]) ).

cnf(t1,plain,
    ~ a(sK1(U_19),sK1(U_19)),
    inference(start,[status(thm),parent(0:0)],[f_1_8]) ).

cnf(t2,plain,
    a(sK1(U_19),sK1(U_19)),
    inference(extension,[status(thm),parent(t1:1)],[f_1_7]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN948+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.36  % Computer : n011.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:09 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.39  % SZS status Theorem for theBenchmark
% 0.10/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------