TSTP Solution File: SEU143+1 by Faust---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SEU143+1 : TPTP v3.4.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May  6 15:48:39 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(d1_tarski,plain,
    ! [C,B,A] :
      ( ( in(C,B)
        | ~ $equal(A,C)
        | ~ $equal(singleton(A),B) )
      & ( ~ in(C,B)
        | $equal(A,C)
        | ~ $equal(singleton(A),B) )
      & ( $equal(c(A,B,C),A)
        | ~ $equal(c(A,B,C),A)
        | $equal(singleton(A),B) )
      & ( ~ in(c(A,B,C),B)
        | ~ $equal(c(A,B,C),A)
        | $equal(singleton(A),B) )
      & ( $equal(c(A,B,C),A)
        | in(c(A,B,C),B)
        | $equal(singleton(A),B) )
      & ( ~ in(c(A,B,C),B)
        | in(c(A,B,C),B)
        | $equal(singleton(A),B) ) ),
    file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),
    [] ).

cnf(161799864,plain,
    ( in(C,B)
    | ~ $equal(A,C)
    | ~ $equal(singleton(A),B) ),
    inference(rewrite,[status(thm)],[d1_tarski]),
    [] ).

cnf(170238936,plain,
    in(A,singleton(A)),
    inference(equality_resolution,[status(thm)],[161799864]),
    [] ).

fof(d1_xboole_0,plain,
    ! [A,B] :
      ( ( ~ $equal(empty_set,A)
        | ~ in(B,A) )
      & ( $equal(empty_set,A)
        | in(b(A,B),A) ) ),
    file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),
    [] ).

cnf(161812104,plain,
    ( ~ $equal(empty_set,A)
    | ~ in(B,A) ),
    inference(rewrite,[status(thm)],[d1_xboole_0]),
    [] ).

cnf(169713376,plain,
    ~ in(A,empty_set),
    inference(equality_resolution,[status(thm)],[161812104]),
    [] ).

fof(l1_zfmisc_1,plain,
    $equal(singleton(a),empty_set),
    file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),
    [] ).

cnf(161847064,plain,
    $equal(singleton(a),empty_set),
    inference(rewrite,[status(thm)],[l1_zfmisc_1]),
    [] ).

cnf(169760904,plain,
    ~ in(A,singleton(a)),
    inference(paramodulation,[status(thm)],[169713376,161847064,theory(equality)]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[170238936,169760904]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(d1_tarski,plain,(((in(C,B)|~$equal(A,C)|~$equal(singleton(A),B))&(~in(C,B)|$equal(A,C)|~$equal(singleton(A),B))&($equal(c(A,B,C),A)|~$equal(c(A,B,C),A)|$equal(singleton(A),B))&(~in(c(A,B,C),B)|~$equal(c(A,B,C),A)|$equal(singleton(A),B))&($equal(c(A,B,C),A)|in(c(A,B,C),B)|$equal(singleton(A),B))&(~in(c(A,B,C),B)|in(c(A,B,C),B)|$equal(singleton(A),B)))),file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),[]).
% 
% cnf(161799864,plain,(in(C,B)|~$equal(A,C)|~$equal(singleton(A),B)),inference(rewrite,[status(thm)],[d1_tarski]),[]).
% 
% cnf(170238936,plain,(in(A,singleton(A))),inference(equality_resolution,[status(thm)],[161799864]),[]).
% 
% fof(d1_xboole_0,plain,(((~$equal(empty_set,A)|~in(B,A))&($equal(empty_set,A)|in(b(A,B),A)))),file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),[]).
% 
% cnf(161812104,plain,(~$equal(empty_set,A)|~in(B,A)),inference(rewrite,[status(thm)],[d1_xboole_0]),[]).
% 
% cnf(169713376,plain,(~in(A,empty_set)),inference(equality_resolution,[status(thm)],[161812104]),[]).
% 
% fof(l1_zfmisc_1,plain,($equal(singleton(a),empty_set)),file('/tmp/SystemOnTPTP7074/SEU143+1.p',unknown),[]).
% 
% cnf(161847064,plain,($equal(singleton(a),empty_set)),inference(rewrite,[status(thm)],[l1_zfmisc_1]),[]).
% 
% cnf(169760904,plain,(~in(A,singleton(a))),inference(paramodulation,[status(thm)],[169713376,161847064,theory(equality)]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[170238936,169760904]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------