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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SEU020+1 : TPTP v5.0.0. Released v3.2.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 04:11:21 EST 2010

% Result   : Theorem 0.21s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  15 unt;   0 def)
%            Number of atoms       :  157 (  19 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :  188 (  70   ~;  80   |;  28   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   1 sgn  22   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( ( relation(X2)
            & function(X2) )
         => ( ( one_to_one(relation_composition(X2,X1))
              & subset(relation_rng(X2),relation_dom(X1)) )
           => one_to_one(X2) ) ) ),
    file('/tmp/tmpC6bBA5/sel_SEU020+1.p_1',t47_funct_1) ).

fof(12,axiom,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( ( relation(X2)
            & function(X2) )
         => ( relation_dom(relation_composition(X2,X1)) = relation_dom(X2)
           => subset(relation_rng(X2),relation_dom(X1)) ) ) ),
    file('/tmp/tmpC6bBA5/sel_SEU020+1.p_1',t27_funct_1) ).

fof(17,axiom,
    ! [X1] : one_to_one(identity_relation(X1)),
    file('/tmp/tmpC6bBA5/sel_SEU020+1.p_1',t52_funct_1) ).

fof(26,conjecture,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ( ? [X2] :
            ( relation(X2)
            & function(X2)
            & relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
       => one_to_one(X1) ) ),
    file('/tmp/tmpC6bBA5/sel_SEU020+1.p_1',t53_funct_1) ).

fof(35,axiom,
    ! [X1] :
      ( relation_dom(identity_relation(X1)) = X1
      & relation_rng(identity_relation(X1)) = X1 ),
    file('/tmp/tmpC6bBA5/sel_SEU020+1.p_1',t71_relat_1) ).

fof(41,negated_conjecture,
    ~ ! [X1] :
        ( ( relation(X1)
          & function(X1) )
       => ( ? [X2] :
              ( relation(X2)
              & function(X2)
              & relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
         => one_to_one(X1) ) ),
    inference(assume_negation,[status(cth)],[26]) ).

fof(62,plain,
    ! [X1] :
      ( ~ relation(X1)
      | ~ function(X1)
      | ! [X2] :
          ( ~ relation(X2)
          | ~ function(X2)
          | ~ one_to_one(relation_composition(X2,X1))
          | ~ subset(relation_rng(X2),relation_dom(X1))
          | one_to_one(X2) ) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(63,plain,
    ! [X3] :
      ( ~ relation(X3)
      | ~ function(X3)
      | ! [X4] :
          ( ~ relation(X4)
          | ~ function(X4)
          | ~ one_to_one(relation_composition(X4,X3))
          | ~ subset(relation_rng(X4),relation_dom(X3))
          | one_to_one(X4) ) ),
    inference(variable_rename,[status(thm)],[62]) ).

fof(64,plain,
    ! [X3,X4] :
      ( ~ relation(X4)
      | ~ function(X4)
      | ~ one_to_one(relation_composition(X4,X3))
      | ~ subset(relation_rng(X4),relation_dom(X3))
      | one_to_one(X4)
      | ~ relation(X3)
      | ~ function(X3) ),
    inference(shift_quantors,[status(thm)],[63]) ).

cnf(65,plain,
    ( one_to_one(X2)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ subset(relation_rng(X2),relation_dom(X1))
    | ~ one_to_one(relation_composition(X2,X1))
    | ~ function(X2)
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[64]) ).

fof(90,plain,
    ! [X1] :
      ( ~ relation(X1)
      | ~ function(X1)
      | ! [X2] :
          ( ~ relation(X2)
          | ~ function(X2)
          | relation_dom(relation_composition(X2,X1)) != relation_dom(X2)
          | subset(relation_rng(X2),relation_dom(X1)) ) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(91,plain,
    ! [X3] :
      ( ~ relation(X3)
      | ~ function(X3)
      | ! [X4] :
          ( ~ relation(X4)
          | ~ function(X4)
          | relation_dom(relation_composition(X4,X3)) != relation_dom(X4)
          | subset(relation_rng(X4),relation_dom(X3)) ) ),
    inference(variable_rename,[status(thm)],[90]) ).

fof(92,plain,
    ! [X3,X4] :
      ( ~ relation(X4)
      | ~ function(X4)
      | relation_dom(relation_composition(X4,X3)) != relation_dom(X4)
      | subset(relation_rng(X4),relation_dom(X3))
      | ~ relation(X3)
      | ~ function(X3) ),
    inference(shift_quantors,[status(thm)],[91]) ).

cnf(93,plain,
    ( subset(relation_rng(X2),relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | relation_dom(relation_composition(X2,X1)) != relation_dom(X2)
    | ~ function(X2)
    | ~ relation(X2) ),
    inference(split_conjunct,[status(thm)],[92]) ).

fof(106,plain,
    ! [X2] : one_to_one(identity_relation(X2)),
    inference(variable_rename,[status(thm)],[17]) ).

cnf(107,plain,
    one_to_one(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[106]) ).

fof(131,negated_conjecture,
    ? [X1] :
      ( relation(X1)
      & function(X1)
      & ? [X2] :
          ( relation(X2)
          & function(X2)
          & relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
      & ~ one_to_one(X1) ),
    inference(fof_nnf,[status(thm)],[41]) ).

fof(132,negated_conjecture,
    ? [X3] :
      ( relation(X3)
      & function(X3)
      & ? [X4] :
          ( relation(X4)
          & function(X4)
          & relation_composition(X3,X4) = identity_relation(relation_dom(X3)) )
      & ~ one_to_one(X3) ),
    inference(variable_rename,[status(thm)],[131]) ).

fof(133,negated_conjecture,
    ( relation(esk5_0)
    & function(esk5_0)
    & relation(esk6_0)
    & function(esk6_0)
    & relation_composition(esk5_0,esk6_0) = identity_relation(relation_dom(esk5_0))
    & ~ one_to_one(esk5_0) ),
    inference(skolemize,[status(esa)],[132]) ).

cnf(134,negated_conjecture,
    ~ one_to_one(esk5_0),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(135,negated_conjecture,
    relation_composition(esk5_0,esk6_0) = identity_relation(relation_dom(esk5_0)),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(136,negated_conjecture,
    function(esk6_0),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(137,negated_conjecture,
    relation(esk6_0),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(138,negated_conjecture,
    function(esk5_0),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(139,negated_conjecture,
    relation(esk5_0),
    inference(split_conjunct,[status(thm)],[133]) ).

fof(169,plain,
    ! [X2] :
      ( relation_dom(identity_relation(X2)) = X2
      & relation_rng(identity_relation(X2)) = X2 ),
    inference(variable_rename,[status(thm)],[35]) ).

cnf(171,plain,
    relation_dom(identity_relation(X1)) = X1,
    inference(split_conjunct,[status(thm)],[169]) ).

cnf(195,negated_conjecture,
    one_to_one(relation_composition(esk5_0,esk6_0)),
    inference(spm,[status(thm)],[107,135,theory(equality)]) ).

cnf(196,negated_conjecture,
    relation_dom(relation_composition(esk5_0,esk6_0)) = relation_dom(esk5_0),
    inference(spm,[status(thm)],[171,135,theory(equality)]) ).

cnf(249,plain,
    ( one_to_one(X1)
    | ~ one_to_one(relation_composition(X1,X2))
    | ~ function(X1)
    | ~ function(X2)
    | ~ relation(X1)
    | ~ relation(X2)
    | relation_dom(relation_composition(X1,X2)) != relation_dom(X1) ),
    inference(spm,[status(thm)],[65,93,theory(equality)]) ).

cnf(1154,negated_conjecture,
    ( one_to_one(esk5_0)
    | relation_dom(relation_composition(esk5_0,esk6_0)) != relation_dom(esk5_0)
    | ~ function(esk5_0)
    | ~ function(esk6_0)
    | ~ relation(esk5_0)
    | ~ relation(esk6_0) ),
    inference(spm,[status(thm)],[249,195,theory(equality)]) ).

cnf(1159,negated_conjecture,
    ( one_to_one(esk5_0)
    | $false
    | ~ function(esk5_0)
    | ~ function(esk6_0)
    | ~ relation(esk5_0)
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[1154,196,theory(equality)]) ).

cnf(1160,negated_conjecture,
    ( one_to_one(esk5_0)
    | $false
    | $false
    | ~ function(esk6_0)
    | ~ relation(esk5_0)
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[1159,138,theory(equality)]) ).

cnf(1161,negated_conjecture,
    ( one_to_one(esk5_0)
    | $false
    | $false
    | $false
    | ~ relation(esk5_0)
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[1160,136,theory(equality)]) ).

cnf(1162,negated_conjecture,
    ( one_to_one(esk5_0)
    | $false
    | $false
    | $false
    | $false
    | ~ relation(esk6_0) ),
    inference(rw,[status(thm)],[1161,139,theory(equality)]) ).

cnf(1163,negated_conjecture,
    ( one_to_one(esk5_0)
    | $false
    | $false
    | $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[1162,137,theory(equality)]) ).

cnf(1164,negated_conjecture,
    one_to_one(esk5_0),
    inference(cn,[status(thm)],[1163,theory(equality)]) ).

cnf(1165,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[1164,134,theory(equality)]) ).

cnf(1166,negated_conjecture,
    $false,
    1165,
    [proof] ).

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