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

% Computer : art03.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:13:33 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  31 unt;   0 def)
%            Number of atoms       :   31 (  28 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   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    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  14   !;   0   ?)

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

fof(5,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',additive_commutativity) ).

fof(12,axiom,
    ! [X1] : multiplication(X1,one) = X1,
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',multiplicative_right_identity) ).

fof(13,axiom,
    ! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',domain3) ).

fof(16,axiom,
    ! [X4] : multiplication(antidomain(X4),X4) = zero,
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',domain1) ).

fof(18,axiom,
    ! [X4] : domain(X4) = antidomain(antidomain(X4)),
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',domain4) ).

fof(19,conjecture,
    domain(zero) = zero,
    file('/tmp/tmptt44mg/sel_KLE086+1.p_1',goals) ).

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

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

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(30,plain,
    ! [X3,X4] : addition(X3,X4) = addition(X4,X3),
    inference(variable_rename,[status(thm)],[5]) ).

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

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

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

fof(46,plain,
    ! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
    inference(variable_rename,[status(thm)],[13]) ).

cnf(47,plain,
    addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
    inference(split_conjunct,[status(thm)],[46]) ).

fof(52,plain,
    ! [X5] : multiplication(antidomain(X5),X5) = zero,
    inference(variable_rename,[status(thm)],[16]) ).

cnf(53,plain,
    multiplication(antidomain(X1),X1) = zero,
    inference(split_conjunct,[status(thm)],[52]) ).

fof(56,plain,
    ! [X5] : domain(X5) = antidomain(antidomain(X5)),
    inference(variable_rename,[status(thm)],[18]) ).

cnf(57,plain,
    domain(X1) = antidomain(antidomain(X1)),
    inference(split_conjunct,[status(thm)],[56]) ).

cnf(58,negated_conjecture,
    domain(zero) != zero,
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(59,negated_conjecture,
    antidomain(antidomain(zero)) != zero,
    inference(rw,[status(thm)],[58,57,theory(equality)]),
    [unfolding] ).

cnf(61,plain,
    zero = antidomain(one),
    inference(spm,[status(thm)],[45,53,theory(equality)]) ).

cnf(62,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[27,31,theory(equality)]) ).

cnf(68,plain,
    addition(antidomain(X1),antidomain(antidomain(X1))) = one,
    inference(rw,[status(thm)],[47,31,theory(equality)]) ).

cnf(224,plain,
    addition(zero,antidomain(zero)) = one,
    inference(spm,[status(thm)],[68,61,theory(equality)]) ).

cnf(240,plain,
    antidomain(zero) = one,
    inference(rw,[status(thm)],[224,62,theory(equality)]) ).

cnf(244,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[59,240,theory(equality)]),61,theory(equality)]) ).

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

cnf(246,negated_conjecture,
    $false,
    245,
    [proof] ).

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