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

% Computer : art06.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:29 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ? [X1] :
      ( rop(ia,X1)
      & cowlNothing(X1) ),
    file('/tmp/tmpcxwgG7/sel_KRS065+1.p_1',axiom_2) ).

fof(3,axiom,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    file('/tmp/tmpcxwgG7/sel_KRS065+1.p_1',axiom_0) ).

fof(5,plain,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).

fof(7,plain,
    ? [X2] :
      ( rop(ia,X2)
      & cowlNothing(X2) ),
    inference(variable_rename,[status(thm)],[1]) ).

fof(8,plain,
    ( rop(ia,esk1_0)
    & cowlNothing(esk1_0) ),
    inference(skolemize,[status(esa)],[7]) ).

cnf(9,plain,
    cowlNothing(esk1_0),
    inference(split_conjunct,[status(thm)],[8]) ).

fof(15,plain,
    ! [X2] :
      ( cowlThing(X2)
      & ~ cowlNothing(X2) ),
    inference(variable_rename,[status(thm)],[5]) ).

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

cnf(22,plain,
    $false,
    inference(sr,[status(thm)],[9,16,theory(equality)]) ).

cnf(23,plain,
    $false,
    22,
    [proof] ).

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