TSTP Solution File: SET078-6 by Faust---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET078-6 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art06.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:27:24 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(unordered_pairs_in_universal,plain,
    ! [A,B] : member(unordered_pair(A,B),universal_class),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),
    [] ).

cnf(146489952,plain,
    member(unordered_pair(A,B),universal_class),
    inference(rewrite,[status(thm)],[unordered_pairs_in_universal]),
    [] ).

fof(unordered_pair3,plain,
    ! [A,B] :
      ( ~ member(A,universal_class)
      | member(A,unordered_pair(B,A)) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),
    [] ).

cnf(146486328,plain,
    ( ~ member(A,universal_class)
    | member(A,unordered_pair(B,A)) ),
    inference(rewrite,[status(thm)],[unordered_pair3]),
    [] ).

fof(prove_corollary_1_to_singletons_are_sets_1,plain,
    ~ member(singleton(y),unordered_pair(x,singleton(y))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),
    [] ).

cnf(147339640,plain,
    ~ member(singleton(y),unordered_pair(x,singleton(y))),
    inference(rewrite,[status(thm)],[prove_corollary_1_to_singletons_are_sets_1]),
    [] ).

cnf(168214424,plain,
    ~ member(singleton(y),universal_class),
    inference(resolution,[status(thm)],[146486328,147339640]),
    [] ).

fof(singleton_set,plain,
    ! [A] : $equal(singleton(A),unordered_pair(A,A)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),
    [] ).

cnf(146500024,plain,
    $equal(singleton(A),unordered_pair(A,A)),
    inference(rewrite,[status(thm)],[singleton_set]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[146489952,168214424,146500024,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(unordered_pairs_in_universal,plain,(member(unordered_pair(A,B),universal_class)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),[]).
% 
% cnf(146489952,plain,(member(unordered_pair(A,B),universal_class)),inference(rewrite,[status(thm)],[unordered_pairs_in_universal]),[]).
% 
% fof(unordered_pair3,plain,(~member(A,universal_class)|member(A,unordered_pair(B,A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),[]).
% 
% cnf(146486328,plain,(~member(A,universal_class)|member(A,unordered_pair(B,A))),inference(rewrite,[status(thm)],[unordered_pair3]),[]).
% 
% fof(prove_corollary_1_to_singletons_are_sets_1,plain,(~member(singleton(y),unordered_pair(x,singleton(y)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),[]).
% 
% cnf(147339640,plain,(~member(singleton(y),unordered_pair(x,singleton(y)))),inference(rewrite,[status(thm)],[prove_corollary_1_to_singletons_are_sets_1]),[]).
% 
% cnf(168214424,plain,(~member(singleton(y),universal_class)),inference(resolution,[status(thm)],[146486328,147339640]),[]).
% 
% fof(singleton_set,plain,($equal(singleton(A),unordered_pair(A,A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET078-6.tptp',unknown),[]).
% 
% cnf(146500024,plain,($equal(singleton(A),unordered_pair(A,A))),inference(rewrite,[status(thm)],[singleton_set]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[146489952,168214424,146500024,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------