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

% Computer : art03.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 07:03:08 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1,X2] :
      ( ( relation(X1)
        & function(X1)
        & finite(X2) )
     => finite(relation_image(X1,X2)) ),
    file('/tmp/tmpVVbaJP/sel_SEU303+1.p_1',fc13_finset_1) ).

fof(7,axiom,
    ! [X1] :
      ( relation(X1)
     => relation_image(X1,relation_dom(X1)) = relation_rng(X1) ),
    file('/tmp/tmpVVbaJP/sel_SEU303+1.p_1',t146_relat_1) ).

fof(8,conjecture,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ( finite(relation_dom(X1))
       => finite(relation_rng(X1)) ) ),
    file('/tmp/tmpVVbaJP/sel_SEU303+1.p_1',t26_finset_1) ).

fof(9,negated_conjecture,
    ~ ! [X1] :
        ( ( relation(X1)
          & function(X1) )
       => ( finite(relation_dom(X1))
         => finite(relation_rng(X1)) ) ),
    inference(assume_negation,[status(cth)],[8]) ).

fof(10,plain,
    ! [X1,X2] :
      ( ~ relation(X1)
      | ~ function(X1)
      | ~ finite(X2)
      | finite(relation_image(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(11,plain,
    ! [X3,X4] :
      ( ~ relation(X3)
      | ~ function(X3)
      | ~ finite(X4)
      | finite(relation_image(X3,X4)) ),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(12,plain,
    ( finite(relation_image(X1,X2))
    | ~ finite(X2)
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[11]) ).

fof(23,plain,
    ! [X1] :
      ( ~ relation(X1)
      | relation_image(X1,relation_dom(X1)) = relation_rng(X1) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(24,plain,
    ! [X2] :
      ( ~ relation(X2)
      | relation_image(X2,relation_dom(X2)) = relation_rng(X2) ),
    inference(variable_rename,[status(thm)],[23]) ).

cnf(25,plain,
    ( relation_image(X1,relation_dom(X1)) = relation_rng(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[24]) ).

fof(26,negated_conjecture,
    ? [X1] :
      ( relation(X1)
      & function(X1)
      & finite(relation_dom(X1))
      & ~ finite(relation_rng(X1)) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(27,negated_conjecture,
    ? [X2] :
      ( relation(X2)
      & function(X2)
      & finite(relation_dom(X2))
      & ~ finite(relation_rng(X2)) ),
    inference(variable_rename,[status(thm)],[26]) ).

fof(28,negated_conjecture,
    ( relation(esk2_0)
    & function(esk2_0)
    & finite(relation_dom(esk2_0))
    & ~ finite(relation_rng(esk2_0)) ),
    inference(skolemize,[status(esa)],[27]) ).

cnf(29,negated_conjecture,
    ~ finite(relation_rng(esk2_0)),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(30,negated_conjecture,
    finite(relation_dom(esk2_0)),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(31,negated_conjecture,
    function(esk2_0),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(32,negated_conjecture,
    relation(esk2_0),
    inference(split_conjunct,[status(thm)],[28]) ).

cnf(33,plain,
    ( finite(relation_rng(X1))
    | ~ finite(relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[12,25,theory(equality)]) ).

cnf(34,negated_conjecture,
    ( finite(relation_rng(esk2_0))
    | ~ function(esk2_0)
    | ~ relation(esk2_0) ),
    inference(spm,[status(thm)],[33,30,theory(equality)]) ).

cnf(35,negated_conjecture,
    ( finite(relation_rng(esk2_0))
    | $false
    | ~ relation(esk2_0) ),
    inference(rw,[status(thm)],[34,31,theory(equality)]) ).

cnf(36,negated_conjecture,
    ( finite(relation_rng(esk2_0))
    | $false
    | $false ),
    inference(rw,[status(thm)],[35,32,theory(equality)]) ).

cnf(37,negated_conjecture,
    finite(relation_rng(esk2_0)),
    inference(cn,[status(thm)],[36,theory(equality)]) ).

cnf(38,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[37,29,theory(equality)]) ).

cnf(39,negated_conjecture,
    $false,
    38,
    [proof] ).

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