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

% Computer : art02.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 : Sat Dec 25 05:48:09 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   54 (  25   ~;  23   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   1 sgn  12   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ( aElement0(xw)
    & sdtmndtasgtdt0(xu,xR,xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    file('/tmp/tmpM3dd3Z/sel_COM018+1.p_1',m__799) ).

fof(5,axiom,
    aRewritingSystem0(xR),
    file('/tmp/tmpM3dd3Z/sel_COM018+1.p_1',m__656) ).

fof(7,axiom,
    ! [X1] :
      ( ( aRewritingSystem0(X1)
        & isTerminating0(X1) )
     => ! [X2] :
          ( aElement0(X2)
         => ? [X3] : aNormalFormOfIn0(X3,X2,X1) ) ),
    file('/tmp/tmpM3dd3Z/sel_COM018+1.p_1',mTermNF) ).

fof(12,conjecture,
    ? [X1] : aNormalFormOfIn0(X1,xw,xR),
    file('/tmp/tmpM3dd3Z/sel_COM018+1.p_1',m__) ).

fof(21,axiom,
    ( isLocallyConfluent0(xR)
    & isTerminating0(xR) ),
    file('/tmp/tmpM3dd3Z/sel_COM018+1.p_1',m__656_01) ).

fof(24,negated_conjecture,
    ~ ? [X1] : aNormalFormOfIn0(X1,xw,xR),
    inference(assume_negation,[status(cth)],[12]) ).

cnf(51,plain,
    aElement0(xw),
    inference(split_conjunct,[status(thm)],[4]) ).

cnf(52,plain,
    aRewritingSystem0(xR),
    inference(split_conjunct,[status(thm)],[5]) ).

fof(57,plain,
    ! [X1] :
      ( ~ aRewritingSystem0(X1)
      | ~ isTerminating0(X1)
      | ! [X2] :
          ( ~ aElement0(X2)
          | ? [X3] : aNormalFormOfIn0(X3,X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(58,plain,
    ! [X4] :
      ( ~ aRewritingSystem0(X4)
      | ~ isTerminating0(X4)
      | ! [X5] :
          ( ~ aElement0(X5)
          | ? [X6] : aNormalFormOfIn0(X6,X5,X4) ) ),
    inference(variable_rename,[status(thm)],[57]) ).

fof(59,plain,
    ! [X4] :
      ( ~ aRewritingSystem0(X4)
      | ~ isTerminating0(X4)
      | ! [X5] :
          ( ~ aElement0(X5)
          | aNormalFormOfIn0(esk6_2(X4,X5),X5,X4) ) ),
    inference(skolemize,[status(esa)],[58]) ).

fof(60,plain,
    ! [X4,X5] :
      ( ~ aElement0(X5)
      | aNormalFormOfIn0(esk6_2(X4,X5),X5,X4)
      | ~ aRewritingSystem0(X4)
      | ~ isTerminating0(X4) ),
    inference(shift_quantors,[status(thm)],[59]) ).

cnf(61,plain,
    ( aNormalFormOfIn0(esk6_2(X1,X2),X2,X1)
    | ~ isTerminating0(X1)
    | ~ aRewritingSystem0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[60]) ).

fof(87,negated_conjecture,
    ! [X1] : ~ aNormalFormOfIn0(X1,xw,xR),
    inference(fof_nnf,[status(thm)],[24]) ).

fof(88,negated_conjecture,
    ! [X2] : ~ aNormalFormOfIn0(X2,xw,xR),
    inference(variable_rename,[status(thm)],[87]) ).

cnf(89,negated_conjecture,
    ~ aNormalFormOfIn0(X1,xw,xR),
    inference(split_conjunct,[status(thm)],[88]) ).

cnf(134,plain,
    isTerminating0(xR),
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(152,negated_conjecture,
    ( ~ isTerminating0(xR)
    | ~ aElement0(xw)
    | ~ aRewritingSystem0(xR) ),
    inference(spm,[status(thm)],[89,61,theory(equality)]) ).

cnf(156,negated_conjecture,
    ( $false
    | ~ aElement0(xw)
    | ~ aRewritingSystem0(xR) ),
    inference(rw,[status(thm)],[152,134,theory(equality)]) ).

cnf(157,negated_conjecture,
    ( $false
    | $false
    | ~ aRewritingSystem0(xR) ),
    inference(rw,[status(thm)],[156,51,theory(equality)]) ).

cnf(158,negated_conjecture,
    ( $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[157,52,theory(equality)]) ).

cnf(159,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[158,theory(equality)]) ).

cnf(160,negated_conjecture,
    $false,
    159,
    [proof] ).

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