%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KRS091+1 : TPTP v5.0.0. Released v3.1.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 13:03:03 EST 2010

% Result   : Unsatisfiable 0.21s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   49 (  23   ~;  16   |;   7   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   13 (   1 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
    <=> ( cd(X1)
        & cc(X1) ) ),
    file('/tmp/tmpb95mwb/sel_KRS091+1.p_1',axiom_2) ).

fof(2,axiom,
    ! [X1] :
      ( cc(X1)
     => ~ cd(X1) ),
    file('/tmp/tmpb95mwb/sel_KRS091+1.p_1',axiom_3) ).

fof(9,axiom,
    cUnsatisfiable(i2003_11_14_17_20_00819),
    file('/tmp/tmpb95mwb/sel_KRS091+1.p_1',axiom_8) ).

fof(10,plain,
    ! [X1] :
      ( cc(X1)
     => ~ cd(X1) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(14,plain,
    ! [X1] :
      ( ( ~ cUnsatisfiable(X1)
        | ( cd(X1)
          & cc(X1) ) )
      & ( ~ cd(X1)
        | ~ cc(X1)
        | cUnsatisfiable(X1) ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(15,plain,
    ! [X2] :
      ( ( ~ cUnsatisfiable(X2)
        | ( cd(X2)
          & cc(X2) ) )
      & ( ~ cd(X2)
        | ~ cc(X2)
        | cUnsatisfiable(X2) ) ),
    inference(variable_rename,[status(thm)],[14]) ).

fof(16,plain,
    ! [X2] :
      ( ( cd(X2)
        | ~ cUnsatisfiable(X2) )
      & ( cc(X2)
        | ~ cUnsatisfiable(X2) )
      & ( ~ cd(X2)
        | ~ cc(X2)
        | cUnsatisfiable(X2) ) ),
    inference(distribute,[status(thm)],[15]) ).

cnf(18,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(19,plain,
    ( cd(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[16]) ).

fof(20,plain,
    ! [X1] :
      ( ~ cc(X1)
      | ~ cd(X1) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(21,plain,
    ! [X2] :
      ( ~ cc(X2)
      | ~ cd(X2) ),
    inference(variable_rename,[status(thm)],[20]) ).

cnf(22,plain,
    ( ~ cd(X1)
    | ~ cc(X1) ),
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(42,plain,
    cUnsatisfiable(i2003_11_14_17_20_00819),
    inference(split_conjunct,[status(thm)],[9]) ).

cnf(43,plain,
    ( ~ cd(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[22,18,theory(equality)]) ).

cnf(47,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[43,19]) ).

cnf(48,plain,
    $false,
    inference(sr,[status(thm)],[42,47,theory(equality)]) ).

cnf(49,plain,
    $false,
    48,
    [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/KRS/KRS091+1.p
% --creating new selector for []
% -running prover on /tmp/tmpb95mwb/sel_KRS091+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS091+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS091+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS091+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Unsatisfiable
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------