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

% Computer : art07.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:59:04 EST 2010

% Result   : Unsatisfiable 0.30s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  17   ~;  11   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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   :   14 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
    <=> cc1(X1) ),
    file('/tmp/tmpKXyu1w/sel_KRS094+1.p_1',axiom_2) ).

fof(7,axiom,
    ! [X1] :
      ( cc1(X1)
     => ~ cd1(X1) ),
    file('/tmp/tmpKXyu1w/sel_KRS094+1.p_1',axiom_4) ).

fof(8,axiom,
    ! [X1] :
      ( cc1(X1)
     => cd1(X1) ),
    file('/tmp/tmpKXyu1w/sel_KRS094+1.p_1',axiom_5) ).

fof(9,axiom,
    cUnsatisfiable(i2003_11_14_17_20_11330),
    file('/tmp/tmpKXyu1w/sel_KRS094+1.p_1',axiom_8) ).

fof(13,plain,
    ! [X1] :
      ( cc1(X1)
     => ~ cd1(X1) ),
    inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).

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

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

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

fof(34,plain,
    ! [X1] :
      ( ~ cc1(X1)
      | ~ cd1(X1) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(35,plain,
    ! [X2] :
      ( ~ cc1(X2)
      | ~ cd1(X2) ),
    inference(variable_rename,[status(thm)],[34]) ).

cnf(36,plain,
    ( ~ cd1(X1)
    | ~ cc1(X1) ),
    inference(split_conjunct,[status(thm)],[35]) ).

fof(37,plain,
    ! [X1] :
      ( ~ cc1(X1)
      | cd1(X1) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(38,plain,
    ! [X2] :
      ( ~ cc1(X2)
      | cd1(X2) ),
    inference(variable_rename,[status(thm)],[37]) ).

cnf(39,plain,
    ( cd1(X1)
    | ~ cc1(X1) ),
    inference(split_conjunct,[status(thm)],[38]) ).

cnf(40,plain,
    cUnsatisfiable(i2003_11_14_17_20_11330),
    inference(split_conjunct,[status(thm)],[9]) ).

cnf(41,plain,
    cc1(i2003_11_14_17_20_11330),
    inference(spm,[status(thm)],[17,40,theory(equality)]) ).

cnf(43,plain,
    ~ cc1(X1),
    inference(csr,[status(thm)],[36,39]) ).

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

cnf(46,plain,
    $false,
    45,
    [proof] ).

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