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

% Result   : Theorem 0.25s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   53 (  12 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   50 (  13   ~;   9   |;  28   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn   4   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(27,conjecture,
    ? [X1,X2] :
      ( aElementOf0(X1,xI)
      & aElementOf0(X2,xJ)
      & xy = sdtpldt0(X1,X2) ),
    file('/tmp/tmpInLrxD/sel_RNG087+2.p_1',m__) ).

fof(28,axiom,
    ( ? [X1,X2] :
        ( aElementOf0(X1,xI)
        & aElementOf0(X2,xJ)
        & sdtpldt0(X1,X2) = xx )
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & ? [X1,X2] :
        ( aElementOf0(X1,xI)
        & aElementOf0(X2,xJ)
        & sdtpldt0(X1,X2) = xy )
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElement0(xz) ),
    file('/tmp/tmpInLrxD/sel_RNG087+2.p_1',m__901) ).

fof(29,negated_conjecture,
    ~ ? [X1,X2] :
        ( aElementOf0(X1,xI)
        & aElementOf0(X2,xJ)
        & xy = sdtpldt0(X1,X2) ),
    inference(assume_negation,[status(cth)],[27]) ).

fof(159,negated_conjecture,
    ! [X1,X2] :
      ( ~ aElementOf0(X1,xI)
      | ~ aElementOf0(X2,xJ)
      | xy != sdtpldt0(X1,X2) ),
    inference(fof_nnf,[status(thm)],[29]) ).

fof(160,negated_conjecture,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,xI)
      | ~ aElementOf0(X4,xJ)
      | xy != sdtpldt0(X3,X4) ),
    inference(variable_rename,[status(thm)],[159]) ).

cnf(161,negated_conjecture,
    ( xy != sdtpldt0(X1,X2)
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI) ),
    inference(split_conjunct,[status(thm)],[160]) ).

fof(162,plain,
    ( ? [X3,X4] :
        ( aElementOf0(X3,xI)
        & aElementOf0(X4,xJ)
        & sdtpldt0(X3,X4) = xx )
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & ? [X5,X6] :
        ( aElementOf0(X5,xI)
        & aElementOf0(X6,xJ)
        & sdtpldt0(X5,X6) = xy )
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElement0(xz) ),
    inference(variable_rename,[status(thm)],[28]) ).

fof(163,plain,
    ( aElementOf0(esk12_0,xI)
    & aElementOf0(esk13_0,xJ)
    & sdtpldt0(esk12_0,esk13_0) = xx
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & aElementOf0(esk14_0,xI)
    & aElementOf0(esk15_0,xJ)
    & sdtpldt0(esk14_0,esk15_0) = xy
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElement0(xz) ),
    inference(skolemize,[status(esa)],[162]) ).

cnf(166,plain,
    sdtpldt0(esk14_0,esk15_0) = xy,
    inference(split_conjunct,[status(thm)],[163]) ).

cnf(167,plain,
    aElementOf0(esk15_0,xJ),
    inference(split_conjunct,[status(thm)],[163]) ).

cnf(168,plain,
    aElementOf0(esk14_0,xI),
    inference(split_conjunct,[status(thm)],[163]) ).

cnf(367,plain,
    ( ~ aElementOf0(esk15_0,xJ)
    | ~ aElementOf0(esk14_0,xI) ),
    inference(spm,[status(thm)],[161,166,theory(equality)]) ).

cnf(380,plain,
    ( $false
    | ~ aElementOf0(esk14_0,xI) ),
    inference(rw,[status(thm)],[367,167,theory(equality)]) ).

cnf(381,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[380,168,theory(equality)]) ).

cnf(382,plain,
    $false,
    inference(cn,[status(thm)],[381,theory(equality)]) ).

cnf(383,plain,
    $false,
    382,
    [proof] ).

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