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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 12:38:51 EST 2010

% Result   : Theorem 0.18s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (  21 unt;   0 def)
%            Number of atoms       :   21 (  19 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 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   :   16 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] : multiplication(zero,X1) = zero,
    file('/tmp/tmpzxj1Yb/sel_KLE138+1.p_1',left_annihilation) ).

fof(3,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/tmp/tmpzxj1Yb/sel_KLE138+1.p_1',additive_identity) ).

fof(4,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/tmp/tmpzxj1Yb/sel_KLE138+1.p_1',additive_commutativity) ).

fof(10,axiom,
    ! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
    file('/tmp/tmpzxj1Yb/sel_KLE138+1.p_1',infty_unfold1) ).

fof(19,conjecture,
    strong_iteration(zero) = one,
    file('/tmp/tmpzxj1Yb/sel_KLE138+1.p_1',goals) ).

fof(20,negated_conjecture,
    strong_iteration(zero) != one,
    inference(assume_negation,[status(cth)],[19]) ).

fof(21,negated_conjecture,
    strong_iteration(zero) != one,
    inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).

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

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

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

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

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

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

fof(42,plain,
    ! [X2] : strong_iteration(X2) = addition(multiplication(X2,strong_iteration(X2)),one),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(43,plain,
    strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
    inference(split_conjunct,[status(thm)],[42]) ).

cnf(63,negated_conjecture,
    strong_iteration(zero) != one,
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(110,plain,
    addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
    inference(rw,[status(thm)],[43,29,theory(equality)]) ).

cnf(111,plain,
    addition(one,zero) = strong_iteration(zero),
    inference(spm,[status(thm)],[110,23,theory(equality)]) ).

cnf(116,plain,
    one = strong_iteration(zero),
    inference(rw,[status(thm)],[111,27,theory(equality)]) ).

cnf(117,plain,
    $false,
    inference(sr,[status(thm)],[116,63,theory(equality)]) ).

cnf(118,plain,
    $false,
    117,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE138+1.p
% --creating new selector for [KLE004+0.ax]
% -running prover on /tmp/tmpzxj1Yb/sel_KLE138+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE138+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE138+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE138+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
% 
%------------------------------------------------------------------------------