%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KLE003+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 11:37:15 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   31 (  26 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   29 (  12   ~;  11   |;   4   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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-2 aty)
%            Number of variables   :   11 (   0 sgn   8   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/tmp/tmp85k2h9/sel_KLE003+1.p_1',additive_idempotence) ).

fof(9,conjecture,
    ( ! [X4] : addition(X4,X4) = X4
  <=> addition(one,one) = one ),
    file('/tmp/tmp85k2h9/sel_KLE003+1.p_1',goals) ).

fof(10,negated_conjecture,
    ~ ( ! [X4] : addition(X4,X4) = X4
    <=> addition(one,one) = one ),
    inference(assume_negation,[status(cth)],[9]) ).

fof(17,plain,
    ! [X2] : addition(X2,X2) = X2,
    inference(variable_rename,[status(thm)],[4]) ).

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

fof(27,negated_conjecture,
    ( ( ? [X4] : addition(X4,X4) != X4
      | addition(one,one) != one )
    & ( ! [X4] : addition(X4,X4) = X4
      | addition(one,one) = one ) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(28,negated_conjecture,
    ( ( ? [X5] : addition(X5,X5) != X5
      | addition(one,one) != one )
    & ( ! [X6] : addition(X6,X6) = X6
      | addition(one,one) = one ) ),
    inference(variable_rename,[status(thm)],[27]) ).

fof(29,negated_conjecture,
    ( ( addition(esk1_0,esk1_0) != esk1_0
      | addition(one,one) != one )
    & ( ! [X6] : addition(X6,X6) = X6
      | addition(one,one) = one ) ),
    inference(skolemize,[status(esa)],[28]) ).

fof(30,negated_conjecture,
    ! [X6] :
      ( ( addition(X6,X6) = X6
        | addition(one,one) = one )
      & ( addition(esk1_0,esk1_0) != esk1_0
        | addition(one,one) != one ) ),
    inference(shift_quantors,[status(thm)],[29]) ).

cnf(31,negated_conjecture,
    ( addition(one,one) != one
    | addition(esk1_0,esk1_0) != esk1_0 ),
    inference(split_conjunct,[status(thm)],[30]) ).

cnf(33,negated_conjecture,
    ( $false
    | addition(esk1_0,esk1_0) != esk1_0 ),
    inference(rw,[status(thm)],[31,18,theory(equality)]) ).

cnf(34,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[33,18,theory(equality)]) ).

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

cnf(36,negated_conjecture,
    $false,
    35,
    [proof] ).

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