%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : RNG095+2 : TPTP v5.0.0. Released v4.0.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 02:17:39 EST 2010

% Result   : Theorem 0.34s
% Output   : CNFRefutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   4 unt;   0 def)
%            Number of atoms       :   62 (  14 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   71 (  29   ~;  22   |;  19   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn   9   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(14,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ( ? [X2,X3] :
            ( aElementOf0(X2,xI)
            & aElementOf0(X3,xJ)
            & sdtpldt0(X2,X3) = X1 )
        & aElementOf0(X1,sdtpldt1(xI,xJ)) ) ),
    file('/tmp/tmpyLRx70/sel_RNG095+2.p_1',m__1205_03) ).

fof(15,axiom,
    aElement0(sz10),
    file('/tmp/tmpyLRx70/sel_RNG095+2.p_1',mSortsC_01) ).

fof(31,conjecture,
    ? [X1,X2] :
      ( aElementOf0(X1,xI)
      & aElementOf0(X2,xJ)
      & sdtpldt0(X1,X2) = sz10 ),
    file('/tmp/tmpyLRx70/sel_RNG095+2.p_1',m__) ).

fof(32,negated_conjecture,
    ~ ? [X1,X2] :
        ( aElementOf0(X1,xI)
        & aElementOf0(X2,xJ)
        & sdtpldt0(X1,X2) = sz10 ),
    inference(assume_negation,[status(cth)],[31]) ).

fof(81,plain,
    ! [X1] :
      ( ~ aElement0(X1)
      | ( ? [X2,X3] :
            ( aElementOf0(X2,xI)
            & aElementOf0(X3,xJ)
            & sdtpldt0(X2,X3) = X1 )
        & aElementOf0(X1,sdtpldt1(xI,xJ)) ) ),
    inference(fof_nnf,[status(thm)],[14]) ).

fof(82,plain,
    ! [X4] :
      ( ~ aElement0(X4)
      | ( ? [X5,X6] :
            ( aElementOf0(X5,xI)
            & aElementOf0(X6,xJ)
            & sdtpldt0(X5,X6) = X4 )
        & aElementOf0(X4,sdtpldt1(xI,xJ)) ) ),
    inference(variable_rename,[status(thm)],[81]) ).

fof(83,plain,
    ! [X4] :
      ( ~ aElement0(X4)
      | ( aElementOf0(esk3_1(X4),xI)
        & aElementOf0(esk4_1(X4),xJ)
        & sdtpldt0(esk3_1(X4),esk4_1(X4)) = X4
        & aElementOf0(X4,sdtpldt1(xI,xJ)) ) ),
    inference(skolemize,[status(esa)],[82]) ).

fof(84,plain,
    ! [X4] :
      ( ( aElementOf0(esk3_1(X4),xI)
        | ~ aElement0(X4) )
      & ( aElementOf0(esk4_1(X4),xJ)
        | ~ aElement0(X4) )
      & ( sdtpldt0(esk3_1(X4),esk4_1(X4)) = X4
        | ~ aElement0(X4) )
      & ( aElementOf0(X4,sdtpldt1(xI,xJ))
        | ~ aElement0(X4) ) ),
    inference(distribute,[status(thm)],[83]) ).

cnf(86,plain,
    ( sdtpldt0(esk3_1(X1),esk4_1(X1)) = X1
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[84]) ).

cnf(87,plain,
    ( aElementOf0(esk4_1(X1),xJ)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[84]) ).

cnf(88,plain,
    ( aElementOf0(esk3_1(X1),xI)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[84]) ).

cnf(89,plain,
    aElement0(sz10),
    inference(split_conjunct,[status(thm)],[15]) ).

fof(180,negated_conjecture,
    ! [X1,X2] :
      ( ~ aElementOf0(X1,xI)
      | ~ aElementOf0(X2,xJ)
      | sdtpldt0(X1,X2) != sz10 ),
    inference(fof_nnf,[status(thm)],[32]) ).

fof(181,negated_conjecture,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,xI)
      | ~ aElementOf0(X4,xJ)
      | sdtpldt0(X3,X4) != sz10 ),
    inference(variable_rename,[status(thm)],[180]) ).

cnf(182,negated_conjecture,
    ( sdtpldt0(X1,X2) != sz10
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI) ),
    inference(split_conjunct,[status(thm)],[181]) ).

cnf(360,plain,
    ( X1 != sz10
    | ~ aElementOf0(esk4_1(X1),xJ)
    | ~ aElementOf0(esk3_1(X1),xI)
    | ~ aElement0(X1) ),
    inference(spm,[status(thm)],[182,86,theory(equality)]) ).

cnf(736,plain,
    ( X1 != sz10
    | ~ aElementOf0(esk4_1(X1),xJ)
    | ~ aElement0(X1) ),
    inference(csr,[status(thm)],[360,88]) ).

cnf(737,plain,
    ( X1 != sz10
    | ~ aElement0(X1) ),
    inference(csr,[status(thm)],[736,87]) ).

cnf(741,plain,
    $false,
    inference(spm,[status(thm)],[737,89,theory(equality)]) ).

cnf(749,plain,
    $false,
    741,
    [proof] ).

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