%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KLE059+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:41 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/tmp/tmp_kByrL/sel_KLE059+1.p_1',additive_commutativity) ).

fof(9,axiom,
    ! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
    file('/tmp/tmp_kByrL/sel_KLE059+1.p_1',domain5) ).

fof(10,conjecture,
    ! [X4,X5] :
      ( addition(X4,X5) = X5
     => addition(domain(X4),domain(X5)) = domain(X5) ),
    file('/tmp/tmp_kByrL/sel_KLE059+1.p_1',goals) ).

fof(11,negated_conjecture,
    ~ ! [X4,X5] :
        ( addition(X4,X5) = X5
       => addition(domain(X4),domain(X5)) = domain(X5) ),
    inference(assume_negation,[status(cth)],[10]) ).

fof(14,plain,
    ! [X3,X4] : addition(X3,X4) = addition(X4,X3),
    inference(variable_rename,[status(thm)],[2]) ).

cnf(15,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(28,plain,
    ! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
    inference(variable_rename,[status(thm)],[9]) ).

cnf(29,plain,
    domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
    inference(split_conjunct,[status(thm)],[28]) ).

fof(30,negated_conjecture,
    ? [X4,X5] :
      ( addition(X4,X5) = X5
      & addition(domain(X4),domain(X5)) != domain(X5) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(31,negated_conjecture,
    ? [X6,X7] :
      ( addition(X6,X7) = X7
      & addition(domain(X6),domain(X7)) != domain(X7) ),
    inference(variable_rename,[status(thm)],[30]) ).

fof(32,negated_conjecture,
    ( addition(esk1_0,esk2_0) = esk2_0
    & addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0) ),
    inference(skolemize,[status(esa)],[31]) ).

cnf(33,negated_conjecture,
    addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
    inference(split_conjunct,[status(thm)],[32]) ).

cnf(34,negated_conjecture,
    addition(esk1_0,esk2_0) = esk2_0,
    inference(split_conjunct,[status(thm)],[32]) ).

cnf(37,negated_conjecture,
    addition(esk2_0,esk1_0) = esk2_0,
    inference(rw,[status(thm)],[34,15,theory(equality)]) ).

cnf(38,negated_conjecture,
    addition(domain(esk2_0),domain(esk1_0)) != domain(esk2_0),
    inference(rw,[status(thm)],[33,15,theory(equality)]) ).

cnf(163,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[38,29,theory(equality)]),37,theory(equality)]) ).

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

cnf(165,negated_conjecture,
    $false,
    164,
    [proof] ).

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