↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SET991+1 : TPTP v5.0.0. Released v3.2.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 04:00:15 EST 2010

% Result   : Theorem 0.25s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   23 (   6 unt;   0 def)
%            Number of atoms       :  151 (  39 equ)
%            Maximal formula atoms :   32 (   6 avg)
%            Number of connectives :  206 (  78   ~;  83   |;  38   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   50 (   0 sgn  32   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(10,axiom,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( X2 = relation_rng(X1)
        <=> ! [X3] :
              ( in(X3,X2)
            <=> ? [X4] :
                  ( in(X4,relation_dom(X1))
                  & X3 = apply(X1,X4) ) ) ) ),
    file('/tmp/tmpqw5qid/sel_SET991+1.p_1',d5_funct_1) ).

fof(27,conjecture,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ( in(X1,relation_dom(X2))
       => in(apply(X2,X1),relation_rng(X2)) ) ),
    file('/tmp/tmpqw5qid/sel_SET991+1.p_1',t12_funct_1) ).

fof(32,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( relation(X2)
          & function(X2) )
       => ( in(X1,relation_dom(X2))
         => in(apply(X2,X1),relation_rng(X2)) ) ),
    inference(assume_negation,[status(cth)],[27]) ).

fof(72,plain,
    ! [X1] :
      ( ~ relation(X1)
      | ~ function(X1)
      | ! [X2] :
          ( ( X2 != relation_rng(X1)
            | ! [X3] :
                ( ( ~ in(X3,X2)
                  | ? [X4] :
                      ( in(X4,relation_dom(X1))
                      & X3 = apply(X1,X4) ) )
                & ( ! [X4] :
                      ( ~ in(X4,relation_dom(X1))
                      | X3 != apply(X1,X4) )
                  | in(X3,X2) ) ) )
          & ( ? [X3] :
                ( ( ~ in(X3,X2)
                  | ! [X4] :
                      ( ~ in(X4,relation_dom(X1))
                      | X3 != apply(X1,X4) ) )
                & ( in(X3,X2)
                  | ? [X4] :
                      ( in(X4,relation_dom(X1))
                      & X3 = apply(X1,X4) ) ) )
            | X2 = relation_rng(X1) ) ) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(73,plain,
    ! [X5] :
      ( ~ relation(X5)
      | ~ function(X5)
      | ! [X6] :
          ( ( X6 != relation_rng(X5)
            | ! [X7] :
                ( ( ~ in(X7,X6)
                  | ? [X8] :
                      ( in(X8,relation_dom(X5))
                      & X7 = apply(X5,X8) ) )
                & ( ! [X9] :
                      ( ~ in(X9,relation_dom(X5))
                      | X7 != apply(X5,X9) )
                  | in(X7,X6) ) ) )
          & ( ? [X10] :
                ( ( ~ in(X10,X6)
                  | ! [X11] :
                      ( ~ in(X11,relation_dom(X5))
                      | X10 != apply(X5,X11) ) )
                & ( in(X10,X6)
                  | ? [X12] :
                      ( in(X12,relation_dom(X5))
                      & X10 = apply(X5,X12) ) ) )
            | X6 = relation_rng(X5) ) ) ),
    inference(variable_rename,[status(thm)],[72]) ).

fof(74,plain,
    ! [X5] :
      ( ~ relation(X5)
      | ~ function(X5)
      | ! [X6] :
          ( ( X6 != relation_rng(X5)
            | ! [X7] :
                ( ( ~ in(X7,X6)
                  | ( in(esk5_3(X5,X6,X7),relation_dom(X5))
                    & X7 = apply(X5,esk5_3(X5,X6,X7)) ) )
                & ( ! [X9] :
                      ( ~ in(X9,relation_dom(X5))
                      | X7 != apply(X5,X9) )
                  | in(X7,X6) ) ) )
          & ( ( ( ~ in(esk6_2(X5,X6),X6)
                | ! [X11] :
                    ( ~ in(X11,relation_dom(X5))
                    | esk6_2(X5,X6) != apply(X5,X11) ) )
              & ( in(esk6_2(X5,X6),X6)
                | ( in(esk7_2(X5,X6),relation_dom(X5))
                  & esk6_2(X5,X6) = apply(X5,esk7_2(X5,X6)) ) ) )
            | X6 = relation_rng(X5) ) ) ),
    inference(skolemize,[status(esa)],[73]) ).

fof(75,plain,
    ! [X5,X6,X7,X9,X11] :
      ( ( ( ( ( ~ in(X11,relation_dom(X5))
              | esk6_2(X5,X6) != apply(X5,X11)
              | ~ in(esk6_2(X5,X6),X6) )
            & ( in(esk6_2(X5,X6),X6)
              | ( in(esk7_2(X5,X6),relation_dom(X5))
                & esk6_2(X5,X6) = apply(X5,esk7_2(X5,X6)) ) ) )
          | X6 = relation_rng(X5) )
        & ( ( ( ~ in(X9,relation_dom(X5))
              | X7 != apply(X5,X9)
              | in(X7,X6) )
            & ( ~ in(X7,X6)
              | ( in(esk5_3(X5,X6,X7),relation_dom(X5))
                & X7 = apply(X5,esk5_3(X5,X6,X7)) ) ) )
          | X6 != relation_rng(X5) ) )
      | ~ relation(X5)
      | ~ function(X5) ),
    inference(shift_quantors,[status(thm)],[74]) ).

fof(76,plain,
    ! [X5,X6,X7,X9,X11] :
      ( ( ~ in(X11,relation_dom(X5))
        | esk6_2(X5,X6) != apply(X5,X11)
        | ~ in(esk6_2(X5,X6),X6)
        | X6 = relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) )
      & ( in(esk7_2(X5,X6),relation_dom(X5))
        | in(esk6_2(X5,X6),X6)
        | X6 = relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) )
      & ( esk6_2(X5,X6) = apply(X5,esk7_2(X5,X6))
        | in(esk6_2(X5,X6),X6)
        | X6 = relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) )
      & ( ~ in(X9,relation_dom(X5))
        | X7 != apply(X5,X9)
        | in(X7,X6)
        | X6 != relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) )
      & ( in(esk5_3(X5,X6,X7),relation_dom(X5))
        | ~ in(X7,X6)
        | X6 != relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) )
      & ( X7 = apply(X5,esk5_3(X5,X6,X7))
        | ~ in(X7,X6)
        | X6 != relation_rng(X5)
        | ~ relation(X5)
        | ~ function(X5) ) ),
    inference(distribute,[status(thm)],[75]) ).

cnf(79,plain,
    ( in(X3,X2)
    | ~ function(X1)
    | ~ relation(X1)
    | X2 != relation_rng(X1)
    | X3 != apply(X1,X4)
    | ~ in(X4,relation_dom(X1)) ),
    inference(split_conjunct,[status(thm)],[76]) ).

fof(132,negated_conjecture,
    ? [X1,X2] :
      ( relation(X2)
      & function(X2)
      & in(X1,relation_dom(X2))
      & ~ in(apply(X2,X1),relation_rng(X2)) ),
    inference(fof_nnf,[status(thm)],[32]) ).

fof(133,negated_conjecture,
    ? [X3,X4] :
      ( relation(X4)
      & function(X4)
      & in(X3,relation_dom(X4))
      & ~ in(apply(X4,X3),relation_rng(X4)) ),
    inference(variable_rename,[status(thm)],[132]) ).

fof(134,negated_conjecture,
    ( relation(esk11_0)
    & function(esk11_0)
    & in(esk10_0,relation_dom(esk11_0))
    & ~ in(apply(esk11_0,esk10_0),relation_rng(esk11_0)) ),
    inference(skolemize,[status(esa)],[133]) ).

cnf(135,negated_conjecture,
    ~ in(apply(esk11_0,esk10_0),relation_rng(esk11_0)),
    inference(split_conjunct,[status(thm)],[134]) ).

cnf(136,negated_conjecture,
    in(esk10_0,relation_dom(esk11_0)),
    inference(split_conjunct,[status(thm)],[134]) ).

cnf(137,negated_conjecture,
    function(esk11_0),
    inference(split_conjunct,[status(thm)],[134]) ).

cnf(138,negated_conjecture,
    relation(esk11_0),
    inference(split_conjunct,[status(thm)],[134]) ).

cnf(194,plain,
    ( in(apply(X1,X2),X3)
    | relation_rng(X1) != X3
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1))
    | ~ relation(X1) ),
    inference(er,[status(thm)],[79,theory(equality)]) ).

cnf(449,negated_conjecture,
    ( ~ function(esk11_0)
    | ~ in(esk10_0,relation_dom(esk11_0))
    | ~ relation(esk11_0) ),
    inference(spm,[status(thm)],[135,194,theory(equality)]) ).

cnf(464,negated_conjecture,
    ( $false
    | ~ in(esk10_0,relation_dom(esk11_0))
    | ~ relation(esk11_0) ),
    inference(rw,[status(thm)],[449,137,theory(equality)]) ).

cnf(465,negated_conjecture,
    ( $false
    | $false
    | ~ relation(esk11_0) ),
    inference(rw,[status(thm)],[464,136,theory(equality)]) ).

cnf(466,negated_conjecture,
    ( $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[465,138,theory(equality)]) ).

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

cnf(468,negated_conjecture,
    $false,
    467,
    [proof] ).

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