%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SET592+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 03:03:41 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X1,X3) )
     => subset(X1,intersection(X2,X3)) ),
    file('/tmp/tmpqyjaFQ/sel_SET592+3.p_1',intersection_of_subsets) ).

fof(8,axiom,
    ! [X1] :
      ( subset(X1,empty_set)
     => X1 = empty_set ),
    file('/tmp/tmpqyjaFQ/sel_SET592+3.p_1',subset_of_empty_set_is_empty_set) ).

fof(11,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X1,X3)
        & intersection(X2,X3) = empty_set )
     => X1 = empty_set ),
    file('/tmp/tmpqyjaFQ/sel_SET592+3.p_1',prove_th51) ).

fof(12,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(X1,X2)
          & subset(X1,X3)
          & intersection(X2,X3) = empty_set )
       => X1 = empty_set ),
    inference(assume_negation,[status(cth)],[11]) ).

fof(31,plain,
    ! [X1,X2,X3] :
      ( ~ subset(X1,X2)
      | ~ subset(X1,X3)
      | subset(X1,intersection(X2,X3)) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(32,plain,
    ! [X4,X5,X6] :
      ( ~ subset(X4,X5)
      | ~ subset(X4,X6)
      | subset(X4,intersection(X5,X6)) ),
    inference(variable_rename,[status(thm)],[31]) ).

cnf(33,plain,
    ( subset(X1,intersection(X2,X3))
    | ~ subset(X1,X3)
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[32]) ).

fof(55,plain,
    ! [X1] :
      ( ~ subset(X1,empty_set)
      | X1 = empty_set ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(56,plain,
    ! [X2] :
      ( ~ subset(X2,empty_set)
      | X2 = empty_set ),
    inference(variable_rename,[status(thm)],[55]) ).

cnf(57,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    inference(split_conjunct,[status(thm)],[56]) ).

fof(62,negated_conjecture,
    ? [X1,X2,X3] :
      ( subset(X1,X2)
      & subset(X1,X3)
      & intersection(X2,X3) = empty_set
      & X1 != empty_set ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(63,negated_conjecture,
    ? [X4,X5,X6] :
      ( subset(X4,X5)
      & subset(X4,X6)
      & intersection(X5,X6) = empty_set
      & X4 != empty_set ),
    inference(variable_rename,[status(thm)],[62]) ).

fof(64,negated_conjecture,
    ( subset(esk4_0,esk5_0)
    & subset(esk4_0,esk6_0)
    & intersection(esk5_0,esk6_0) = empty_set
    & esk4_0 != empty_set ),
    inference(skolemize,[status(esa)],[63]) ).

cnf(65,negated_conjecture,
    esk4_0 != empty_set,
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(66,negated_conjecture,
    intersection(esk5_0,esk6_0) = empty_set,
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(67,negated_conjecture,
    subset(esk4_0,esk6_0),
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(68,negated_conjecture,
    subset(esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(75,negated_conjecture,
    ( subset(X1,empty_set)
    | ~ subset(X1,esk6_0)
    | ~ subset(X1,esk5_0) ),
    inference(spm,[status(thm)],[33,66,theory(equality)]) ).

cnf(121,negated_conjecture,
    ( subset(esk4_0,empty_set)
    | ~ subset(esk4_0,esk5_0) ),
    inference(spm,[status(thm)],[75,67,theory(equality)]) ).

cnf(124,negated_conjecture,
    ( subset(esk4_0,empty_set)
    | $false ),
    inference(rw,[status(thm)],[121,68,theory(equality)]) ).

cnf(125,negated_conjecture,
    subset(esk4_0,empty_set),
    inference(cn,[status(thm)],[124,theory(equality)]) ).

cnf(135,negated_conjecture,
    empty_set = esk4_0,
    inference(spm,[status(thm)],[57,125,theory(equality)]) ).

cnf(138,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[135,65,theory(equality)]) ).

cnf(139,negated_conjecture,
    $false,
    138,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET592+3.p
% --creating new selector for []
% -running prover on /tmp/tmpqyjaFQ/sel_SET592+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET592+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET592+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET592+3.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------