%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : RNG104+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:23:17 EST 2010

% Result   : Theorem 0.31s
% Output   : CNFRefutation 0.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   41 (  13 unt;   0 def)
%            Number of atoms       :  109 (  27 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  109 (  41   ~;  42   |;  23   &)
%                                         (   0 <=>;   3  =>;   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    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  21   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(9,axiom,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xc,X1) = xx )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xc,X1) = xy )
    & aElementOf0(xy,slsdtgt0(xc))
    & aElement0(xz) ),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',m__1933) ).

fof(25,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aElement0(X2)
        & aElement0(X3) )
     => sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',mMulAsso) ).

fof(27,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => aElement0(sdtasdt0(X1,X2)) ),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',mSortsB_02) ).

fof(34,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',mMulComm) ).

fof(37,axiom,
    aElement0(xc),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',m__1905) ).

fof(42,conjecture,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',m__) ).

fof(43,axiom,
    ( aElement0(xu)
    & sdtasdt0(xc,xu) = xx ),
    file('/tmp/tmpfHr-OW/sel_RNG104+2.p_1',m__1956) ).

fof(44,negated_conjecture,
    sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(assume_negation,[status(cth)],[42]) ).

fof(45,negated_conjecture,
    sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).

fof(93,plain,
    ( ? [X2] :
        ( aElement0(X2)
        & sdtasdt0(xc,X2) = xx )
    & aElementOf0(xx,slsdtgt0(xc))
    & ? [X3] :
        ( aElement0(X3)
        & sdtasdt0(xc,X3) = xy )
    & aElementOf0(xy,slsdtgt0(xc))
    & aElement0(xz) ),
    inference(variable_rename,[status(thm)],[9]) ).

fof(94,plain,
    ( aElement0(esk6_0)
    & sdtasdt0(xc,esk6_0) = xx
    & aElementOf0(xx,slsdtgt0(xc))
    & aElement0(esk7_0)
    & sdtasdt0(xc,esk7_0) = xy
    & aElementOf0(xy,slsdtgt0(xc))
    & aElement0(xz) ),
    inference(skolemize,[status(esa)],[93]) ).

cnf(95,plain,
    aElement0(xz),
    inference(split_conjunct,[status(thm)],[94]) ).

fof(178,plain,
    ! [X1,X2,X3] :
      ( ~ aElement0(X1)
      | ~ aElement0(X2)
      | ~ aElement0(X3)
      | sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
    inference(fof_nnf,[status(thm)],[25]) ).

fof(179,plain,
    ! [X4,X5,X6] :
      ( ~ aElement0(X4)
      | ~ aElement0(X5)
      | ~ aElement0(X6)
      | sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6)) ),
    inference(variable_rename,[status(thm)],[178]) ).

cnf(180,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[179]) ).

fof(186,plain,
    ! [X1,X2] :
      ( ~ aElement0(X1)
      | ~ aElement0(X2)
      | aElement0(sdtasdt0(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[27]) ).

fof(187,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | aElement0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[186]) ).

cnf(188,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[187]) ).

fof(220,plain,
    ! [X1,X2] :
      ( ~ aElement0(X1)
      | ~ aElement0(X2)
      | sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
    inference(fof_nnf,[status(thm)],[34]) ).

fof(221,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[220]) ).

cnf(222,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[221]) ).

cnf(229,plain,
    aElement0(xc),
    inference(split_conjunct,[status(thm)],[37]) ).

cnf(255,negated_conjecture,
    sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(split_conjunct,[status(thm)],[45]) ).

cnf(256,plain,
    sdtasdt0(xc,xu) = xx,
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(257,plain,
    aElement0(xu),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(316,plain,
    ( aElement0(xx)
    | ~ aElement0(xu)
    | ~ aElement0(xc) ),
    inference(spm,[status(thm)],[188,256,theory(equality)]) ).

cnf(329,plain,
    ( aElement0(xx)
    | $false
    | ~ aElement0(xc) ),
    inference(rw,[status(thm)],[316,257,theory(equality)]) ).

cnf(330,plain,
    ( aElement0(xx)
    | $false
    | $false ),
    inference(rw,[status(thm)],[329,229,theory(equality)]) ).

cnf(331,plain,
    aElement0(xx),
    inference(cn,[status(thm)],[330,theory(equality)]) ).

cnf(540,plain,
    ( sdtasdt0(xx,X1) = sdtasdt0(xc,sdtasdt0(xu,X1))
    | ~ aElement0(X1)
    | ~ aElement0(xu)
    | ~ aElement0(xc) ),
    inference(spm,[status(thm)],[180,256,theory(equality)]) ).

cnf(569,plain,
    ( sdtasdt0(xx,X1) = sdtasdt0(xc,sdtasdt0(xu,X1))
    | ~ aElement0(X1)
    | $false
    | ~ aElement0(xc) ),
    inference(rw,[status(thm)],[540,257,theory(equality)]) ).

cnf(570,plain,
    ( sdtasdt0(xx,X1) = sdtasdt0(xc,sdtasdt0(xu,X1))
    | ~ aElement0(X1)
    | $false
    | $false ),
    inference(rw,[status(thm)],[569,229,theory(equality)]) ).

cnf(571,plain,
    ( sdtasdt0(xx,X1) = sdtasdt0(xc,sdtasdt0(xu,X1))
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[570,theory(equality)]) ).

cnf(1256,plain,
    ( sdtasdt0(xx,xz) != sdtasdt0(xz,xx)
    | ~ aElement0(xz) ),
    inference(spm,[status(thm)],[255,571,theory(equality)]) ).

cnf(1275,plain,
    ( sdtasdt0(xx,xz) != sdtasdt0(xz,xx)
    | $false ),
    inference(rw,[status(thm)],[1256,95,theory(equality)]) ).

cnf(1276,plain,
    sdtasdt0(xx,xz) != sdtasdt0(xz,xx),
    inference(cn,[status(thm)],[1275,theory(equality)]) ).

cnf(1404,plain,
    ( ~ aElement0(xx)
    | ~ aElement0(xz) ),
    inference(spm,[status(thm)],[1276,222,theory(equality)]) ).

cnf(1406,plain,
    ( $false
    | ~ aElement0(xz) ),
    inference(rw,[status(thm)],[1404,331,theory(equality)]) ).

cnf(1407,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[1406,95,theory(equality)]) ).

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

cnf(1409,plain,
    $false,
    1408,
    [proof] ).

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