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

% Computer : art09.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 12:06:17 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(13,axiom,
    domain(zero) = zero,
    file('/tmp/tmpwwi4Oa/sel_KLE057+1.p_1',domain4) ).

fof(14,conjecture,
    ! [X4] :
      ( domain(X4) = zero
     <= X4 = zero ),
    file('/tmp/tmpwwi4Oa/sel_KLE057+1.p_1',goals) ).

fof(15,negated_conjecture,
    ~ ! [X4] :
        ( domain(X4) = zero
       <= X4 = zero ),
    inference(assume_negation,[status(cth)],[14]) ).

fof(16,negated_conjecture,
    ~ ! [X4] :
        ( X4 = zero
       => domain(X4) = zero ),
    inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).

cnf(41,plain,
    domain(zero) = zero,
    inference(split_conjunct,[status(thm)],[13]) ).

fof(42,negated_conjecture,
    ? [X4] :
      ( X4 = zero
      & domain(X4) != zero ),
    inference(fof_nnf,[status(thm)],[16]) ).

fof(43,negated_conjecture,
    ? [X5] :
      ( X5 = zero
      & domain(X5) != zero ),
    inference(variable_rename,[status(thm)],[42]) ).

fof(44,negated_conjecture,
    ( esk1_0 = zero
    & domain(esk1_0) != zero ),
    inference(skolemize,[status(esa)],[43]) ).

cnf(45,negated_conjecture,
    domain(esk1_0) != zero,
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(46,negated_conjecture,
    esk1_0 = zero,
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(47,negated_conjecture,
    domain(zero) != zero,
    inference(rw,[status(thm)],[45,46,theory(equality)]) ).

cnf(160,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[47,41,theory(equality)]) ).

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

cnf(162,negated_conjecture,
    $false,
    161,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE057+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpwwi4Oa/sel_KLE057+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE057+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE057+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE057+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
% 
%------------------------------------------------------------------------------