%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KLE056+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 : Sat Dec 25 12:06:10 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/tmp/tmpsbAwiZ/sel_KLE056+1.p_1',additive_identity) ).

fof(7,axiom,
    ! [X1] : multiplication(zero,X1) = zero,
    file('/tmp/tmpsbAwiZ/sel_KLE056+1.p_1',left_annihilation) ).

fof(10,axiom,
    ! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
    file('/tmp/tmpsbAwiZ/sel_KLE056+1.p_1',domain1) ).

fof(14,conjecture,
    ! [X4] :
      ( domain(X4) = zero
     => X4 = zero ),
    file('/tmp/tmpsbAwiZ/sel_KLE056+1.p_1',goals) ).

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

fof(18,plain,
    ! [X2] : addition(X2,zero) = X2,
    inference(variable_rename,[status(thm)],[2]) ).

cnf(19,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[18]) ).

fof(28,plain,
    ! [X2] : multiplication(zero,X2) = zero,
    inference(variable_rename,[status(thm)],[7]) ).

cnf(29,plain,
    multiplication(zero,X1) = zero,
    inference(split_conjunct,[status(thm)],[28]) ).

fof(34,plain,
    ! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(35,plain,
    addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
    inference(split_conjunct,[status(thm)],[34]) ).

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

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

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

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

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

cnf(105,negated_conjecture,
    addition(esk1_0,multiplication(zero,esk1_0)) = multiplication(zero,esk1_0),
    inference(spm,[status(thm)],[35,45,theory(equality)]) ).

cnf(112,negated_conjecture,
    esk1_0 = multiplication(zero,esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[105,29,theory(equality)]),19,theory(equality)]) ).

cnf(113,negated_conjecture,
    esk1_0 = zero,
    inference(rw,[status(thm)],[112,29,theory(equality)]) ).

cnf(114,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[113,44,theory(equality)]) ).

cnf(115,negated_conjecture,
    $false,
    114,
    [proof] ).

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