%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KLE053+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:10:07 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(11,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/tmp/tmpPPpaGO/sel_KLE053+1.p_5',domain2) ).

fof(13,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/tmp/tmpPPpaGO/sel_KLE053+1.p_5',multiplicative_left_identity) ).

fof(17,conjecture,
    ! [X4] : domain(domain(X4)) = domain(X4),
    file('/tmp/tmpPPpaGO/sel_KLE053+1.p_5',goals) ).

fof(18,negated_conjecture,
    ~ ! [X4] : domain(domain(X4)) = domain(X4),
    inference(assume_negation,[status(cth)],[17]) ).

fof(39,plain,
    ! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
    inference(variable_rename,[status(thm)],[11]) ).

cnf(40,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[39]) ).

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

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

fof(50,negated_conjecture,
    ? [X4] : domain(domain(X4)) != domain(X4),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(51,negated_conjecture,
    ? [X5] : domain(domain(X5)) != domain(X5),
    inference(variable_rename,[status(thm)],[50]) ).

fof(52,negated_conjecture,
    domain(domain(esk1_0)) != domain(esk1_0),
    inference(skolemize,[status(esa)],[51]) ).

cnf(53,negated_conjecture,
    domain(domain(esk1_0)) != domain(esk1_0),
    inference(split_conjunct,[status(thm)],[52]) ).

cnf(105,plain,
    domain(domain(X1)) = domain(multiplication(one,X1)),
    inference(spm,[status(thm)],[40,44,theory(equality)]) ).

cnf(112,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[105,44,theory(equality)]) ).

cnf(219,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[53,112,theory(equality)]) ).

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

cnf(221,negated_conjecture,
    $false,
    220,
    [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/KLE053+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpPPpaGO/sel_KLE053+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpPPpaGO/sel_KLE053+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpPPpaGO/sel_KLE053+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpPPpaGO/sel_KLE053+1.p_4 with time limit 56
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpPPpaGO/sel_KLE053+1.p_5 with time limit 55
% -prover status Theorem
% Problem KLE053+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE053+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE053+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
% 
%------------------------------------------------------------------------------