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

% Computer : art01.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:35:07 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(12,axiom,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( aElementOf0(X1,xI)
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    file('/tmp/tmp6fduqo/sel_RNG124+1.p_1',m__2273) ).

fof(13,axiom,
    ( aElement0(xq)
    & aElement0(xr)
    & xb = sdtpldt0(sdtasdt0(xq,xu),xr)
    & ( xr = sz00
      | iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
    file('/tmp/tmp6fduqo/sel_RNG124+1.p_1',m__2666) ).

fof(15,axiom,
    aElementOf0(xr,xI),
    file('/tmp/tmp6fduqo/sel_RNG124+1.p_1',m__2729) ).

fof(36,axiom,
    xr != sz00,
    file('/tmp/tmp6fduqo/sel_RNG124+1.p_1',m__2673) ).

fof(59,plain,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( aElementOf0(X1,xI)
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).

fof(113,plain,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ~ aElementOf0(X1,xI)
        | X1 = sz00
        | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    inference(fof_nnf,[status(thm)],[59]) ).

fof(114,plain,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X2] :
        ( ~ aElementOf0(X2,xI)
        | X2 = sz00
        | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
    inference(variable_rename,[status(thm)],[113]) ).

fof(115,plain,
    ! [X2] :
      ( ( ~ aElementOf0(X2,xI)
        | X2 = sz00
        | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) )
      & aElementOf0(xu,xI)
      & xu != sz00 ),
    inference(shift_quantors,[status(thm)],[114]) ).

cnf(118,plain,
    ( X1 = sz00
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu))
    | ~ aElementOf0(X1,xI) ),
    inference(split_conjunct,[status(thm)],[115]) ).

cnf(119,plain,
    ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
    | xr = sz00 ),
    inference(split_conjunct,[status(thm)],[13]) ).

cnf(126,plain,
    aElementOf0(xr,xI),
    inference(split_conjunct,[status(thm)],[15]) ).

cnf(223,plain,
    xr != sz00,
    inference(split_conjunct,[status(thm)],[36]) ).

cnf(302,plain,
    iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
    inference(sr,[status(thm)],[119,223,theory(equality)]) ).

cnf(465,plain,
    ( sz00 = xr
    | ~ aElementOf0(xr,xI) ),
    inference(spm,[status(thm)],[118,302,theory(equality)]) ).

cnf(466,plain,
    ( sz00 = xr
    | $false ),
    inference(rw,[status(thm)],[465,126,theory(equality)]) ).

cnf(467,plain,
    sz00 = xr,
    inference(cn,[status(thm)],[466,theory(equality)]) ).

cnf(468,plain,
    $false,
    inference(sr,[status(thm)],[467,223,theory(equality)]) ).

cnf(469,plain,
    $false,
    468,
    [proof] ).

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