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

% Computer : art05.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 06:13:41 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   34 (  15 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   27 (  13   ~;   7   |;   3   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  19   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(8,axiom,
    ! [X1,X2,X3] :
      ( relation(X3)
     => relation_dom_restriction(relation_rng_restriction(X1,X3),X2) = relation_rng_restriction(X1,relation_dom_restriction(X3,X2)) ),
    file('/tmp/tmpQ7229y/sel_SEU247+1.p_1',t140_relat_1) ).

fof(9,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => relation_restriction(X2,X1) = relation_dom_restriction(relation_rng_restriction(X1,X2),X1) ),
    file('/tmp/tmpQ7229y/sel_SEU247+1.p_1',t17_wellord1) ).

fof(11,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
    file('/tmp/tmpQ7229y/sel_SEU247+1.p_1',t18_wellord1) ).

fof(12,negated_conjecture,
    ~ ! [X1,X2] :
        ( relation(X2)
       => relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
    inference(assume_negation,[status(cth)],[11]) ).

fof(30,plain,
    ! [X1,X2,X3] :
      ( ~ relation(X3)
      | relation_dom_restriction(relation_rng_restriction(X1,X3),X2) = relation_rng_restriction(X1,relation_dom_restriction(X3,X2)) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(31,plain,
    ! [X4,X5,X6] :
      ( ~ relation(X6)
      | relation_dom_restriction(relation_rng_restriction(X4,X6),X5) = relation_rng_restriction(X4,relation_dom_restriction(X6,X5)) ),
    inference(variable_rename,[status(thm)],[30]) ).

cnf(32,plain,
    ( relation_dom_restriction(relation_rng_restriction(X1,X2),X3) = relation_rng_restriction(X1,relation_dom_restriction(X2,X3))
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[31]) ).

fof(33,plain,
    ! [X1,X2] :
      ( ~ relation(X2)
      | relation_restriction(X2,X1) = relation_dom_restriction(relation_rng_restriction(X1,X2),X1) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(34,plain,
    ! [X3,X4] :
      ( ~ relation(X4)
      | relation_restriction(X4,X3) = relation_dom_restriction(relation_rng_restriction(X3,X4),X3) ),
    inference(variable_rename,[status(thm)],[33]) ).

cnf(35,plain,
    ( relation_restriction(X1,X2) = relation_dom_restriction(relation_rng_restriction(X2,X1),X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[34]) ).

fof(38,negated_conjecture,
    ? [X1,X2] :
      ( relation(X2)
      & relation_restriction(X2,X1) != relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(39,negated_conjecture,
    ? [X3,X4] :
      ( relation(X4)
      & relation_restriction(X4,X3) != relation_rng_restriction(X3,relation_dom_restriction(X4,X3)) ),
    inference(variable_rename,[status(thm)],[38]) ).

fof(40,negated_conjecture,
    ( relation(esk2_0)
    & relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)) ),
    inference(skolemize,[status(esa)],[39]) ).

cnf(41,negated_conjecture,
    relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[40]) ).

cnf(42,negated_conjecture,
    relation(esk2_0),
    inference(split_conjunct,[status(thm)],[40]) ).

cnf(52,plain,
    ( relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) = relation_restriction(X2,X1)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[35,32,theory(equality)]) ).

cnf(54,negated_conjecture,
    ~ relation(esk2_0),
    inference(spm,[status(thm)],[41,52,theory(equality)]) ).

cnf(60,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[54,42,theory(equality)]) ).

cnf(61,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[60,theory(equality)]) ).

cnf(62,negated_conjecture,
    $false,
    61,
    [proof] ).

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