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

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            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    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   16 (   2 sgn  10   !;   0   ?)

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

fof(7,axiom,
    ! [X1] : multiplication(X1,one) = X1,
    file('/tmp/tmpfyqG31/sel_KLE058+1.p_1',multiplicative_right_identity) ).

fof(8,axiom,
    ! [X4] : addition(domain(X4),one) = one,
    file('/tmp/tmpfyqG31/sel_KLE058+1.p_1',domain3) ).

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

fof(13,conjecture,
    domain(one) = one,
    file('/tmp/tmpfyqG31/sel_KLE058+1.p_1',goals) ).

fof(14,negated_conjecture,
    domain(one) != one,
    inference(assume_negation,[status(cth)],[13]) ).

fof(15,negated_conjecture,
    domain(one) != one,
    inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).

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

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

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

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

fof(30,plain,
    ! [X5] : addition(domain(X5),one) = one,
    inference(variable_rename,[status(thm)],[8]) ).

cnf(31,plain,
    addition(domain(X1),one) = one,
    inference(split_conjunct,[status(thm)],[30]) ).

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]) ).

cnf(40,negated_conjecture,
    domain(one) != one,
    inference(split_conjunct,[status(thm)],[15]) ).

cnf(43,plain,
    addition(one,domain(X1)) = one,
    inference(rw,[status(thm)],[31,21,theory(equality)]) ).

cnf(83,plain,
    addition(one,domain(one)) = domain(one),
    inference(spm,[status(thm)],[35,29,theory(equality)]) ).

cnf(168,plain,
    one = domain(one),
    inference(rw,[status(thm)],[83,43,theory(equality)]) ).

cnf(169,plain,
    $false,
    inference(sr,[status(thm)],[168,40,theory(equality)]) ).

cnf(170,plain,
    $false,
    169,
    [proof] ).

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