%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU188+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art09.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 05:17:37 EST 2010

% Result   : Theorem 0.18s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (   7 unt;   0 def)
%            Number of atoms       :   92 (  27 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   91 (  34   ~;  37   |;  11   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 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-1 aty)
%            Number of variables   :   18 (   0 sgn  13   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_dom(X1)) ),
    file('/tmp/tmpbWB6FU/sel_SEU188+1.p_1',fc5_relat_1) ).

fof(7,conjecture,
    ! [X1] :
      ( relation(X1)
     => ( ( relation_dom(X1) = empty_set
          | relation_rng(X1) = empty_set )
       => X1 = empty_set ) ),
    file('/tmp/tmpbWB6FU/sel_SEU188+1.p_1',t64_relat_1) ).

fof(13,axiom,
    ( empty(empty_set)
    & relation(empty_set) ),
    file('/tmp/tmpbWB6FU/sel_SEU188+1.p_1',fc4_relat_1) ).

fof(21,axiom,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_rng(X1)) ),
    file('/tmp/tmpbWB6FU/sel_SEU188+1.p_1',fc6_relat_1) ).

fof(28,axiom,
    ! [X1] :
      ( empty(X1)
     => X1 = empty_set ),
    file('/tmp/tmpbWB6FU/sel_SEU188+1.p_1',t6_boole) ).

fof(35,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ( ( relation_dom(X1) = empty_set
            | relation_rng(X1) = empty_set )
         => X1 = empty_set ) ),
    inference(assume_negation,[status(cth)],[7]) ).

fof(37,plain,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_dom(X1)) ),
    inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).

fof(42,plain,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_rng(X1)) ),
    inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).

fof(57,plain,
    ! [X1] :
      ( empty(X1)
      | ~ relation(X1)
      | ~ empty(relation_dom(X1)) ),
    inference(fof_nnf,[status(thm)],[37]) ).

fof(58,plain,
    ! [X2] :
      ( empty(X2)
      | ~ relation(X2)
      | ~ empty(relation_dom(X2)) ),
    inference(variable_rename,[status(thm)],[57]) ).

cnf(59,plain,
    ( empty(X1)
    | ~ empty(relation_dom(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[58]) ).

fof(72,negated_conjecture,
    ? [X1] :
      ( relation(X1)
      & ( relation_dom(X1) = empty_set
        | relation_rng(X1) = empty_set )
      & X1 != empty_set ),
    inference(fof_nnf,[status(thm)],[35]) ).

fof(73,negated_conjecture,
    ? [X2] :
      ( relation(X2)
      & ( relation_dom(X2) = empty_set
        | relation_rng(X2) = empty_set )
      & X2 != empty_set ),
    inference(variable_rename,[status(thm)],[72]) ).

fof(74,negated_conjecture,
    ( relation(esk6_0)
    & ( relation_dom(esk6_0) = empty_set
      | relation_rng(esk6_0) = empty_set )
    & esk6_0 != empty_set ),
    inference(skolemize,[status(esa)],[73]) ).

cnf(75,negated_conjecture,
    esk6_0 != empty_set,
    inference(split_conjunct,[status(thm)],[74]) ).

cnf(76,negated_conjecture,
    ( relation_rng(esk6_0) = empty_set
    | relation_dom(esk6_0) = empty_set ),
    inference(split_conjunct,[status(thm)],[74]) ).

cnf(77,negated_conjecture,
    relation(esk6_0),
    inference(split_conjunct,[status(thm)],[74]) ).

cnf(92,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[13]) ).

fof(114,plain,
    ! [X1] :
      ( empty(X1)
      | ~ relation(X1)
      | ~ empty(relation_rng(X1)) ),
    inference(fof_nnf,[status(thm)],[42]) ).

fof(115,plain,
    ! [X2] :
      ( empty(X2)
      | ~ relation(X2)
      | ~ empty(relation_rng(X2)) ),
    inference(variable_rename,[status(thm)],[114]) ).

cnf(116,plain,
    ( empty(X1)
    | ~ empty(relation_rng(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[115]) ).

fof(129,plain,
    ! [X1] :
      ( ~ empty(X1)
      | X1 = empty_set ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(130,plain,
    ! [X2] :
      ( ~ empty(X2)
      | X2 = empty_set ),
    inference(variable_rename,[status(thm)],[129]) ).

cnf(131,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    inference(split_conjunct,[status(thm)],[130]) ).

cnf(172,negated_conjecture,
    ( empty(esk6_0)
    | relation_rng(esk6_0) = empty_set
    | ~ empty(empty_set)
    | ~ relation(esk6_0) ),
    inference(spm,[status(thm)],[59,76,theory(equality)]) ).

cnf(174,negated_conjecture,
    ( empty(esk6_0)
    | relation_rng(esk6_0) = empty_set
    | $false
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[172,92,theory(equality)]) ).

cnf(175,negated_conjecture,
    ( empty(esk6_0)
    | relation_rng(esk6_0) = empty_set
    | $false
    | $false ),
    inference(rw,[status(thm)],[174,77,theory(equality)]) ).

cnf(176,negated_conjecture,
    ( empty(esk6_0)
    | relation_rng(esk6_0) = empty_set ),
    inference(cn,[status(thm)],[175,theory(equality)]) ).

cnf(222,negated_conjecture,
    ( empty(esk6_0)
    | ~ empty(empty_set)
    | ~ relation(esk6_0) ),
    inference(spm,[status(thm)],[116,176,theory(equality)]) ).

cnf(225,negated_conjecture,
    ( empty(esk6_0)
    | $false
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[222,92,theory(equality)]) ).

cnf(226,negated_conjecture,
    ( empty(esk6_0)
    | $false
    | $false ),
    inference(rw,[status(thm)],[225,77,theory(equality)]) ).

cnf(227,negated_conjecture,
    empty(esk6_0),
    inference(cn,[status(thm)],[226,theory(equality)]) ).

cnf(228,negated_conjecture,
    empty_set = esk6_0,
    inference(spm,[status(thm)],[131,227,theory(equality)]) ).

cnf(231,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[228,75,theory(equality)]) ).

cnf(232,negated_conjecture,
    $false,
    231,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU188+1.p
% --creating new selector for []
% -running prover on /tmp/tmpbWB6FU/sel_SEU188+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU188+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU188+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU188+1.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
% 
%------------------------------------------------------------------------------