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

% Result   : Theorem 0.29s
% Output   : CNFRefutation 0.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   39 (  13 unt;   0 def)
%            Number of atoms       :   91 (  21 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   93 (  41   ~;  42   |;   7   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(9,axiom,
    ( aElementOf0(xx,slsdtgt0(xc))
    & aElementOf0(xy,slsdtgt0(xc))
    & aElement0(xz) ),
    file('/tmp/tmpncAHT7/sel_RNG104+1.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/tmpncAHT7/sel_RNG104+1.p_1',mMulAsso) ).

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

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

fof(37,axiom,
    aElement0(xc),
    file('/tmp/tmpncAHT7/sel_RNG104+1.p_1',m__1905) ).

fof(42,conjecture,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    file('/tmp/tmpncAHT7/sel_RNG104+1.p_1',m__) ).

fof(43,axiom,
    ( aElement0(xu)
    & sdtasdt0(xc,xu) = xx ),
    file('/tmp/tmpncAHT7/sel_RNG104+1.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)]) ).

cnf(93,plain,
    aElement0(xz),
    inference(split_conjunct,[status(thm)],[9]) ).

fof(172,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(173,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)],[172]) ).

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

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

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

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

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

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

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

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

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

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

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

cnf(267,plain,
    ( aElement0(xx)
    | ~ aElement0(xu)
    | ~ aElement0(xc) ),
    inference(spm,[status(thm)],[182,250,theory(equality)]) ).

cnf(276,plain,
    ( aElement0(xx)
    | $false
    | ~ aElement0(xc) ),
    inference(rw,[status(thm)],[267,251,theory(equality)]) ).

cnf(277,plain,
    ( aElement0(xx)
    | $false
    | $false ),
    inference(rw,[status(thm)],[276,223,theory(equality)]) ).

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

cnf(509,plain,
    ( sdtasdt0(xx,X1) = sdtasdt0(xc,sdtasdt0(xu,X1))
    | ~ aElement0(X1)
    | ~ aElement0(xu)
    | ~ aElement0(xc) ),
    inference(spm,[status(thm)],[174,250,theory(equality)]) ).

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

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

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

cnf(940,plain,
    ( sdtasdt0(xx,xz) != sdtasdt0(xz,xx)
    | ~ aElement0(xz) ),
    inference(spm,[status(thm)],[249,538,theory(equality)]) ).

cnf(958,plain,
    ( sdtasdt0(xx,xz) != sdtasdt0(xz,xx)
    | $false ),
    inference(rw,[status(thm)],[940,93,theory(equality)]) ).

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

cnf(1046,plain,
    ( ~ aElement0(xx)
    | ~ aElement0(xz) ),
    inference(spm,[status(thm)],[959,216,theory(equality)]) ).

cnf(1048,plain,
    ( $false
    | ~ aElement0(xz) ),
    inference(rw,[status(thm)],[1046,278,theory(equality)]) ).

cnf(1049,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[1048,93,theory(equality)]) ).

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

cnf(1051,plain,
    $false,
    1050,
    [proof] ).

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