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

% Computer : art04.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:24 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    cowlNothing(i2003_11_14_17_18_08754),
    file('/tmp/tmpzbfMWW/sel_KRS064+1.p_1',axiom_2) ).

fof(2,axiom,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    file('/tmp/tmpzbfMWW/sel_KRS064+1.p_1',axiom_0) ).

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

cnf(6,plain,
    cowlNothing(i2003_11_14_17_18_08754),
    inference(split_conjunct,[status(thm)],[1]) ).

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

cnf(8,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(14,plain,
    $false,
    inference(sr,[status(thm)],[6,8,theory(equality)]) ).

cnf(15,plain,
    $false,
    14,
    [proof] ).

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