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

% Computer : art06.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:30:20 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(26,axiom,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = xk )
    & aElementOf0(xk,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = xl )
    & aElementOf0(xl,slsdtgt0(xb))
    & xu = sdtpldt0(xk,xl) ),
    file('/tmp/tmprebhoc/sel_RNG116+4.p_1',m__2456) ).

fof(48,conjecture,
    ? [X1,X2] :
      ( aElement0(X1)
      & aElement0(X2)
      & xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
    file('/tmp/tmprebhoc/sel_RNG116+4.p_1',m__) ).

fof(49,negated_conjecture,
    ~ ? [X1,X2] :
        ( aElement0(X1)
        & aElement0(X2)
        & xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
    inference(assume_negation,[status(cth)],[48]) ).

fof(236,plain,
    ( ? [X2] :
        ( aElement0(X2)
        & sdtasdt0(xa,X2) = xk )
    & aElementOf0(xk,slsdtgt0(xa))
    & ? [X3] :
        ( aElement0(X3)
        & sdtasdt0(xb,X3) = xl )
    & aElementOf0(xl,slsdtgt0(xb))
    & xu = sdtpldt0(xk,xl) ),
    inference(variable_rename,[status(thm)],[26]) ).

fof(237,plain,
    ( aElement0(esk18_0)
    & sdtasdt0(xa,esk18_0) = xk
    & aElementOf0(xk,slsdtgt0(xa))
    & aElement0(esk19_0)
    & sdtasdt0(xb,esk19_0) = xl
    & aElementOf0(xl,slsdtgt0(xb))
    & xu = sdtpldt0(xk,xl) ),
    inference(skolemize,[status(esa)],[236]) ).

cnf(238,plain,
    xu = sdtpldt0(xk,xl),
    inference(split_conjunct,[status(thm)],[237]) ).

cnf(240,plain,
    sdtasdt0(xb,esk19_0) = xl,
    inference(split_conjunct,[status(thm)],[237]) ).

cnf(241,plain,
    aElement0(esk19_0),
    inference(split_conjunct,[status(thm)],[237]) ).

cnf(243,plain,
    sdtasdt0(xa,esk18_0) = xk,
    inference(split_conjunct,[status(thm)],[237]) ).

cnf(244,plain,
    aElement0(esk18_0),
    inference(split_conjunct,[status(thm)],[237]) ).

fof(380,negated_conjecture,
    ! [X1,X2] :
      ( ~ aElement0(X1)
      | ~ aElement0(X2)
      | xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
    inference(fof_nnf,[status(thm)],[49]) ).

fof(381,negated_conjecture,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | xu != sdtpldt0(sdtasdt0(xa,X3),sdtasdt0(xb,X4)) ),
    inference(variable_rename,[status(thm)],[380]) ).

cnf(382,negated_conjecture,
    ( xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[381]) ).

cnf(393,plain,
    ( sdtpldt0(xk,sdtasdt0(xb,X1)) != xu
    | ~ aElement0(X1)
    | ~ aElement0(esk18_0) ),
    inference(spm,[status(thm)],[382,243,theory(equality)]) ).

cnf(401,plain,
    ( sdtpldt0(xk,sdtasdt0(xb,X1)) != xu
    | ~ aElement0(X1)
    | $false ),
    inference(rw,[status(thm)],[393,244,theory(equality)]) ).

cnf(402,plain,
    ( sdtpldt0(xk,sdtasdt0(xb,X1)) != xu
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[401,theory(equality)]) ).

cnf(2752,plain,
    ( sdtpldt0(xk,xl) != xu
    | ~ aElement0(esk19_0) ),
    inference(spm,[status(thm)],[402,240,theory(equality)]) ).

cnf(2769,plain,
    ( $false
    | ~ aElement0(esk19_0) ),
    inference(rw,[status(thm)],[2752,238,theory(equality)]) ).

cnf(2770,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[2769,241,theory(equality)]) ).

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

cnf(2772,plain,
    $false,
    2771,
    [proof] ).

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