↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET064+1 : TPTP v9.3.1. Bugfixed v5.4.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 : n004.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 08:56:09 AM UTC 2026

% Result   : Theorem 0.14s 5.91s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   38 (  14 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   34 (  14   ~;   7   |;  12   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   19 (   1 sgn  10   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(regularity,axiom,
    ! [X] :
      ( X != null_class
     => ? [U] :
          ( disjoint(U,X)
          & member(U,X)
          & member(U,universal_class) ) ),
    file('SET005+0.ax',regularity) ).

fof(null_class_is_unique,conjecture,
    ! [Z] :
      ( ? [Y] : member(Y,Z)
      | Z = null_class ),
    file('theBenchmark.p',null_class_is_unique) ).

fof(f_41_1,plain,
    ! [X] :
      ( ? [U] :
          ( disjoint(U,X)
          & member(U,X)
          & member(U,universal_class) )
      | X = null_class ),
    inference(fof_nnf,[status(thm)],[regularity]) ).

fof(f_41_2,plain,
    ! [U_177] :
      ( ? [U_176] :
          ( disjoint(U_176,U_177)
          & member(U_176,U_177)
          & member(U_176,universal_class) )
      | U_177 = null_class ),
    inference(variable_rename,[status(thm)],[f_41_1]) ).

fof(f_41_3,plain,
    ! [U_177] :
      ( ( disjoint(sK6(U_177),U_177)
        & member(sK6(U_177),U_177)
        & member(sK6(U_177),universal_class) )
      | U_177 = null_class ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_176,sK6(U_177))],[f_41_2]) ).

cnf(f_41_5,plain,
    ( member(sK6(U_177),U_177)
    | U_177 = null_class ),
    inference(clausify,[status(thm)],[f_41_3]) ).

fof(f_44_1,negated_conjecture,
    ~ ! [Z] :
        ( ? [Y] : member(Y,Z)
        | Z = null_class ),
    inference(negate,[status(cth)],[null_class_is_unique]) ).

fof(f_44_2,negated_conjecture,
    ? [Z] :
      ( ! [Y] : ~ member(Y,Z)
      & Z != null_class ),
    inference(fof_nnf,[status(thm)],[f_44_1]) ).

fof(f_44_3,negated_conjecture,
    ? [U_183] :
      ( ! [U_182] : ~ member(U_182,U_183)
      & U_183 != null_class ),
    inference(variable_rename,[status(thm)],[f_44_2]) ).

fof(f_44_4,negated_conjecture,
    ( ! [U_182] : ~ member(U_182,sK8)
    & sK8 != null_class ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_183,sK8)],[f_44_3]) ).

fof(f_44_5,negated_conjecture,
    ( ! [U_182] : ~ member(U_182,sK8)
    & sK8 != null_class ),
    inference(definitional_conversion,[status(esa)],[f_44_4]) ).

cnf(f_44_6,negated_conjecture,
    sK8 != null_class,
    inference(clausify,[status(thm)],[f_44_5]) ).

cnf(f_44_7,negated_conjecture,
    ~ member(U_182,sK8),
    inference(clausify,[status(thm)],[f_44_5]) ).

cnf(t1,plain,
    sK8 != null_class,
    inference(start,[status(thm),parent(0:0)],[f_44_6]) ).

cnf(t2,plain,
    ( member(sK6(sK8),sK8)
    | sK8 = null_class ),
    inference(extension,[status(thm),parent(t1:1)],[f_41_5]) ).

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

cnf(t4,plain,
    ~ member(sK6(sK8),sK8),
    inference(extension,[status(thm),parent(t2:2)],[f_44_7]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET064+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ 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/5.38  % Computer : n004.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Sat Sep 19 21:36:54 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.14/5.91  % SZS status Theorem for theBenchmark
% 0.14/5.91  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------