↑ Up

Faust---1.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET876+1 : TPTP v3.4.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art02.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:40:16 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(l28_zfmisc_1,plain,
    ! [A,B] :
      ( in(A,B)
      | disjoint(singleton(A),B) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),
    [] ).

cnf(160597856,plain,
    ( in(A,B)
    | disjoint(singleton(A),B) ),
    inference(rewrite,[status(thm)],[l28_zfmisc_1]),
    [] ).

fof(t17_zfmisc_1,plain,
    ( ~ $equal(b,a)
    & ~ disjoint(singleton(a),singleton(b)) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),
    [] ).

cnf(160674560,plain,
    ~ disjoint(singleton(a),singleton(b)),
    inference(rewrite,[status(thm)],[t17_zfmisc_1]),
    [] ).

cnf(171146848,plain,
    in(a,singleton(b)),
    inference(resolution,[status(thm)],[160597856,160674560]),
    [] ).

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('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),
    [] ).

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

cnf(171421480,plain,
    ( ~ in(B,singleton(A))
    | $equal(A,B) ),
    inference(equality_resolution,[status(thm)],[160581248]),
    [] ).

cnf(160683720,plain,
    ~ $equal(b,a),
    inference(rewrite,[status(thm)],[t17_zfmisc_1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[171146848,171421480,160683720]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(l28_zfmisc_1,plain,(in(A,B)|disjoint(singleton(A),B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),[]).
% 
% cnf(160597856,plain,(in(A,B)|disjoint(singleton(A),B)),inference(rewrite,[status(thm)],[l28_zfmisc_1]),[]).
% 
% fof(t17_zfmisc_1,plain,((~$equal(b,a)&~disjoint(singleton(a),singleton(b)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),[]).
% 
% cnf(160674560,plain,(~disjoint(singleton(a),singleton(b))),inference(rewrite,[status(thm)],[t17_zfmisc_1]),[]).
% 
% cnf(171146848,plain,(in(a,singleton(b))),inference(resolution,[status(thm)],[160597856,160674560]),[]).
% 
% 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('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET876+1.tptp',unknown),[]).
% 
% cnf(160581248,plain,(~in(C,B)|$equal(A,C)|~$equal(singleton(A),B)),inference(rewrite,[status(thm)],[d1_tarski]),[]).
% 
% cnf(171421480,plain,(~in(B,singleton(A))|$equal(A,B)),inference(equality_resolution,[status(thm)],[160581248]),[]).
% 
% cnf(160683720,plain,(~$equal(b,a)),inference(rewrite,[status(thm)],[t17_zfmisc_1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[171146848,171421480,160683720]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------