TSTP Solution File: SEU040+1 by SInE---0.4

View Problem - Process Solution

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

% Computer : art01.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 04:13:47 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(21,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2)) ),
    file('/tmp/tmpei2dYt/sel_SEU040+1.p_1',t89_relat_1) ).

fof(36,conjecture,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
        & subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
    file('/tmp/tmpei2dYt/sel_SEU040+1.p_1',t76_funct_1) ).

fof(38,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
    file('/tmp/tmpei2dYt/sel_SEU040+1.p_1',t99_relat_1) ).

fof(39,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( relation(X2)
          & function(X2) )
       => ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
          & subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
    inference(assume_negation,[status(cth)],[36]) ).

fof(116,plain,
    ! [X1,X2] :
      ( ~ relation(X2)
      | subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2)) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(117,plain,
    ! [X3,X4] :
      ( ~ relation(X4)
      | subset(relation_dom(relation_dom_restriction(X4,X3)),relation_dom(X4)) ),
    inference(variable_rename,[status(thm)],[116]) ).

cnf(118,plain,
    ( subset(relation_dom(relation_dom_restriction(X1,X2)),relation_dom(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[117]) ).

fof(169,negated_conjecture,
    ? [X1,X2] :
      ( relation(X2)
      & function(X2)
      & ( ~ subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
        | ~ subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
    inference(fof_nnf,[status(thm)],[39]) ).

fof(170,negated_conjecture,
    ? [X3,X4] :
      ( relation(X4)
      & function(X4)
      & ( ~ subset(relation_dom(relation_dom_restriction(X4,X3)),relation_dom(X4))
        | ~ subset(relation_rng(relation_dom_restriction(X4,X3)),relation_rng(X4)) ) ),
    inference(variable_rename,[status(thm)],[169]) ).

fof(171,negated_conjecture,
    ( relation(esk12_0)
    & function(esk12_0)
    & ( ~ subset(relation_dom(relation_dom_restriction(esk12_0,esk11_0)),relation_dom(esk12_0))
      | ~ subset(relation_rng(relation_dom_restriction(esk12_0,esk11_0)),relation_rng(esk12_0)) ) ),
    inference(skolemize,[status(esa)],[170]) ).

cnf(172,negated_conjecture,
    ( ~ subset(relation_rng(relation_dom_restriction(esk12_0,esk11_0)),relation_rng(esk12_0))
    | ~ subset(relation_dom(relation_dom_restriction(esk12_0,esk11_0)),relation_dom(esk12_0)) ),
    inference(split_conjunct,[status(thm)],[171]) ).

cnf(174,negated_conjecture,
    relation(esk12_0),
    inference(split_conjunct,[status(thm)],[171]) ).

fof(180,plain,
    ! [X1,X2] :
      ( ~ relation(X2)
      | subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
    inference(fof_nnf,[status(thm)],[38]) ).

fof(181,plain,
    ! [X3,X4] :
      ( ~ relation(X4)
      | subset(relation_rng(relation_dom_restriction(X4,X3)),relation_rng(X4)) ),
    inference(variable_rename,[status(thm)],[180]) ).

cnf(182,plain,
    ( subset(relation_rng(relation_dom_restriction(X1,X2)),relation_rng(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[181]) ).

cnf(212,negated_conjecture,
    ( ~ subset(relation_dom(relation_dom_restriction(esk12_0,esk11_0)),relation_dom(esk12_0))
    | ~ relation(esk12_0) ),
    inference(spm,[status(thm)],[172,182,theory(equality)]) ).

cnf(213,negated_conjecture,
    ( ~ subset(relation_dom(relation_dom_restriction(esk12_0,esk11_0)),relation_dom(esk12_0))
    | $false ),
    inference(rw,[status(thm)],[212,174,theory(equality)]) ).

cnf(214,negated_conjecture,
    ~ subset(relation_dom(relation_dom_restriction(esk12_0,esk11_0)),relation_dom(esk12_0)),
    inference(cn,[status(thm)],[213,theory(equality)]) ).

cnf(237,negated_conjecture,
    ~ relation(esk12_0),
    inference(spm,[status(thm)],[214,118,theory(equality)]) ).

cnf(238,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[237,174,theory(equality)]) ).

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

cnf(240,negated_conjecture,
    $false,
    239,
    [proof] ).

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