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

% Computer : art02.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:56:49 EST 2010

% Result   : Unsatisfiable 0.28s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   65 (  29   ~;  25   |;   4   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   33 (   1 sgn  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => cc(X1) ),
    file('/tmp/tmpii-nBb/sel_KRS068+1.p_1',axiom_2) ).

fof(2,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => ~ cd(X1) ),
    file('/tmp/tmpii-nBb/sel_KRS068+1.p_1',axiom_3) ).

fof(5,axiom,
    ! [X1] :
      ( ! [X2] :
          ( rr(X1,X2)
         => cc(X2) )
     => cd(X1) ),
    file('/tmp/tmpii-nBb/sel_KRS068+1.p_1',axiom_6) ).

fof(6,axiom,
    ! [X1] :
      ( cc(X1)
     => ! [X2] :
          ( rr(X1,X2)
         => cc(X2) ) ),
    file('/tmp/tmpii-nBb/sel_KRS068+1.p_1',axiom_4) ).

fof(7,axiom,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    file('/tmp/tmpii-nBb/sel_KRS068+1.p_1',axiom_5) ).

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

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

fof(12,plain,
    ! [X2] :
      ( ~ cUnsatisfiable(X2)
      | cc(X2) ),
    inference(variable_rename,[status(thm)],[11]) ).

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

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

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

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

fof(24,plain,
    ! [X1] :
      ( ? [X2] :
          ( rr(X1,X2)
          & ~ cc(X2) )
      | cd(X1) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(25,plain,
    ! [X3] :
      ( ? [X4] :
          ( rr(X3,X4)
          & ~ cc(X4) )
      | cd(X3) ),
    inference(variable_rename,[status(thm)],[24]) ).

fof(26,plain,
    ! [X3] :
      ( ( rr(X3,esk1_1(X3))
        & ~ cc(esk1_1(X3)) )
      | cd(X3) ),
    inference(skolemize,[status(esa)],[25]) ).

fof(27,plain,
    ! [X3] :
      ( ( rr(X3,esk1_1(X3))
        | cd(X3) )
      & ( ~ cc(esk1_1(X3))
        | cd(X3) ) ),
    inference(distribute,[status(thm)],[26]) ).

cnf(28,plain,
    ( cd(X1)
    | ~ cc(esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[27]) ).

cnf(29,plain,
    ( cd(X1)
    | rr(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[27]) ).

fof(30,plain,
    ! [X1] :
      ( ~ cc(X1)
      | ! [X2] :
          ( ~ rr(X1,X2)
          | cc(X2) ) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(31,plain,
    ! [X3] :
      ( ~ cc(X3)
      | ! [X4] :
          ( ~ rr(X3,X4)
          | cc(X4) ) ),
    inference(variable_rename,[status(thm)],[30]) ).

fof(32,plain,
    ! [X3,X4] :
      ( ~ rr(X3,X4)
      | cc(X4)
      | ~ cc(X3) ),
    inference(shift_quantors,[status(thm)],[31]) ).

cnf(33,plain,
    ( cc(X2)
    | ~ cc(X1)
    | ~ rr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[32]) ).

cnf(34,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(36,plain,
    ( cc(esk1_1(X1))
    | cd(X1)
    | ~ cc(X1) ),
    inference(spm,[status(thm)],[33,29,theory(equality)]) ).

cnf(38,plain,
    ( cd(X1)
    | ~ cc(X1) ),
    inference(csr,[status(thm)],[36,28]) ).

cnf(39,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cc(X1) ),
    inference(spm,[status(thm)],[16,38,theory(equality)]) ).

cnf(40,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[39,13]) ).

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

cnf(42,plain,
    $false,
    41,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS068+1.p
% --creating new selector for []
% -running prover on /tmp/tmpii-nBb/sel_KRS068+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS068+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS068+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS068+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
% 
%------------------------------------------------------------------------------