↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET883+1 : TPTP v9.3.1. Released v3.2.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 : n026.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:57:44 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(t24_zfmisc_1,conjecture,
    ! [A,B] :
      ( subset(singleton(A),singleton(B))
     => A = B ),
    file('theBenchmark.p',t24_zfmisc_1) ).

fof(t6_zfmisc_1,axiom,
    ! [A,B] :
      ( subset(singleton(A),singleton(B))
     => A = B ),
    file('theBenchmark.p',t6_zfmisc_1) ).

fof(f_4_1,negated_conjecture,
    ~ ! [A,B] :
        ( subset(singleton(A),singleton(B))
       => A = B ),
    inference(negate,[status(cth)],[t24_zfmisc_1]) ).

fof(f_4_2,negated_conjecture,
    ? [A,B] :
      ( A != B
      & subset(singleton(A),singleton(B)) ),
    inference(fof_nnf,[status(thm)],[f_4_1]) ).

fof(f_4_3,negated_conjecture,
    ? [U_5,U_4] :
      ( U_5 != U_4
      & subset(singleton(U_5),singleton(U_4)) ),
    inference(variable_rename,[status(thm)],[f_4_2]) ).

fof(f_4_4,negated_conjecture,
    ? [U_4] :
      ( sK3 != U_4
      & subset(singleton(sK3),singleton(U_4)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_5,sK3)],[f_4_3]) ).

fof(f_4_5,negated_conjecture,
    ( sK3 != sK4
    & subset(singleton(sK3),singleton(sK4)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_4,sK4)],[f_4_4]) ).

fof(f_4_6,negated_conjecture,
    ( sK3 != sK4
    & subset(singleton(sK3),singleton(sK4)) ),
    inference(definitional_conversion,[status(esa)],[f_4_5]) ).

cnf(f_4_7,negated_conjecture,
    subset(singleton(sK3),singleton(sK4)),
    inference(clausify,[status(thm)],[f_4_6]) ).

cnf(f_4_8,negated_conjecture,
    sK3 != sK4,
    inference(clausify,[status(thm)],[f_4_6]) ).

fof(f_5_1,plain,
    ! [A,B] :
      ( A = B
      | ~ subset(singleton(A),singleton(B)) ),
    inference(fof_nnf,[status(thm)],[t6_zfmisc_1]) ).

fof(f_5_2,plain,
    ! [U_7,U_6] :
      ( U_7 = U_6
      | ~ subset(singleton(U_7),singleton(U_6)) ),
    inference(variable_rename,[status(thm)],[f_5_1]) ).

cnf(f_5_3,plain,
    ( U_7 = U_6
    | ~ subset(singleton(U_7),singleton(U_6)) ),
    inference(clausify,[status(thm)],[f_5_2]) ).

cnf(t1,plain,
    sK3 != sK4,
    inference(start,[status(thm),parent(0:0)],[f_4_8]) ).

cnf(t2,plain,
    ( ~ subset(singleton(sK3),singleton(sK4))
    | sK3 = sK4 ),
    inference(extension,[status(thm),parent(t1:1)],[f_5_3]) ).

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

cnf(t4,plain,
    subset(singleton(sK3),singleton(sK4)),
    inference(extension,[status(thm),parent(t2:2)],[f_4_7]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET883+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.57  % Computer : n026.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Sat Sep 19 23:09:08 UTC 2026
% 0.09/0.57  % CPUTime  : 
% 0.09/0.60  % SZS status Theorem for theBenchmark
% 0.09/0.60  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------