↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art08.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:31:44 EDT 2009

% Result   : Theorem 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :   58 (  24   ~;  24   |;  10   &)
%                                         (   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    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   20 (   2 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(intersection_defn,plain,
    ! [C,B,A] :
      ( ( member(C,B)
        | ~ member(C,intersection(A,B)) )
      & ( member(C,A)
        | ~ member(C,intersection(A,B)) )
      & ( member(C,intersection(A,B))
        | ~ member(C,A)
        | ~ member(C,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),
    [] ).

cnf(168298304,plain,
    ( member(C,intersection(A,B))
    | ~ member(C,A)
    | ~ member(C,B) ),
    inference(rewrite,[status(thm)],[intersection_defn]),
    [] ).

fof(prove_th24,plain,
    ( member(b,c)
    & member(b,d)
    & ~ not_equal(intersection(c,d),empty_set) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),
    [] ).

cnf(168463576,plain,
    member(b,d),
    inference(rewrite,[status(thm)],[prove_th24]),
    [] ).

cnf(181635592,plain,
    ( member(b,intersection(A,d))
    | ~ member(b,A) ),
    inference(resolution,[status(thm)],[168298304,168463576]),
    [] ).

cnf(168470848,plain,
    member(b,c),
    inference(rewrite,[status(thm)],[prove_th24]),
    [] ).

cnf(181661672,plain,
    member(b,intersection(c,d)),
    inference(resolution,[status(thm)],[181635592,168470848]),
    [] ).

fof(empty_set_defn,plain,
    ! [A] : ~ member(A,empty_set),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),
    [] ).

cnf(168316680,plain,
    ~ member(A,empty_set),
    inference(rewrite,[status(thm)],[empty_set_defn]),
    [] ).

fof(equal_member_defn,plain,
    ! [C,A,B] :
      ( ( member(C,A)
        | ~ member(C,B)
        | ~ $equal(B,A) )
      & ( ~ member(C,A)
        | member(C,B)
        | ~ $equal(B,A) )
      & ( member(d(A,B,C),B)
        | ~ member(d(A,B,C),B)
        | $equal(B,A) )
      & ( ~ member(d(A,B,C),A)
        | ~ member(d(A,B,C),B)
        | $equal(B,A) )
      & ( member(d(A,B,C),B)
        | member(d(A,B,C),A)
        | $equal(B,A) )
      & ( ~ member(d(A,B,C),A)
        | member(d(A,B,C),A)
        | $equal(B,A) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),
    [] ).

cnf(168350632,plain,
    ( ~ member(C,A)
    | member(C,B)
    | ~ $equal(B,A) ),
    inference(rewrite,[status(thm)],[equal_member_defn]),
    [] ).

fof(not_equal_defn,plain,
    ! [A,B] :
      ( ( ~ not_equal(A,B)
        | ~ $equal(B,A) )
      & ( not_equal(A,B)
        | $equal(B,A) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),
    [] ).

cnf(168362304,plain,
    ( not_equal(A,B)
    | $equal(B,A) ),
    inference(rewrite,[status(thm)],[not_equal_defn]),
    [] ).

cnf(168452024,plain,
    ~ not_equal(intersection(c,d),empty_set),
    inference(rewrite,[status(thm)],[prove_th24]),
    [] ).

cnf(182017928,plain,
    $equal(empty_set,intersection(c,d)),
    inference(resolution,[status(thm)],[168362304,168452024]),
    [] ).

cnf(182033176,plain,
    ~ member(A,intersection(c,d)),
    inference(forward_subsumption_resolution__resolution,[status(thm)],[168316680,168350632,182017928]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[181661672,182033176]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(intersection_defn,plain,(((member(C,B)|~member(C,intersection(A,B)))&(member(C,A)|~member(C,intersection(A,B)))&(member(C,intersection(A,B))|~member(C,A)|~member(C,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),[]).
% 
% cnf(168298304,plain,(member(C,intersection(A,B))|~member(C,A)|~member(C,B)),inference(rewrite,[status(thm)],[intersection_defn]),[]).
% 
% fof(prove_th24,plain,((member(b,c)&member(b,d)&~not_equal(intersection(c,d),empty_set))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),[]).
% 
% cnf(168463576,plain,(member(b,d)),inference(rewrite,[status(thm)],[prove_th24]),[]).
% 
% cnf(181635592,plain,(member(b,intersection(A,d))|~member(b,A)),inference(resolution,[status(thm)],[168298304,168463576]),[]).
% 
% cnf(168470848,plain,(member(b,c)),inference(rewrite,[status(thm)],[prove_th24]),[]).
% 
% cnf(181661672,plain,(member(b,intersection(c,d))),inference(resolution,[status(thm)],[181635592,168470848]),[]).
% 
% fof(empty_set_defn,plain,(~member(A,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),[]).
% 
% cnf(168316680,plain,(~member(A,empty_set)),inference(rewrite,[status(thm)],[empty_set_defn]),[]).
% 
% fof(equal_member_defn,plain,(((member(C,A)|~member(C,B)|~$equal(B,A))&(~member(C,A)|member(C,B)|~$equal(B,A))&(member(d(A,B,C),B)|~member(d(A,B,C),B)|$equal(B,A))&(~member(d(A,B,C),A)|~member(d(A,B,C),B)|$equal(B,A))&(member(d(A,B,C),B)|member(d(A,B,C),A)|$equal(B,A))&(~member(d(A,B,C),A)|member(d(A,B,C),A)|$equal(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),[]).
% 
% cnf(168350632,plain,(~member(C,A)|member(C,B)|~$equal(B,A)),inference(rewrite,[status(thm)],[equal_member_defn]),[]).
% 
% fof(not_equal_defn,plain,(((~not_equal(A,B)|~$equal(B,A))&(not_equal(A,B)|$equal(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET581+3.tptp',unknown),[]).
% 
% cnf(168362304,plain,(not_equal(A,B)|$equal(B,A)),inference(rewrite,[status(thm)],[not_equal_defn]),[]).
% 
% cnf(168452024,plain,(~not_equal(intersection(c,d),empty_set)),inference(rewrite,[status(thm)],[prove_th24]),[]).
% 
% cnf(182017928,plain,($equal(empty_set,intersection(c,d))),inference(resolution,[status(thm)],[168362304,168452024]),[]).
% 
% cnf(182033176,plain,(~member(A,intersection(c,d))),inference(forward_subsumption_resolution__resolution,[status(thm)],[168316680,168350632,182017928]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[181661672,182033176]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------