%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KRS126+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 13:01:20 EST 2010

% Result   : Unsatisfiable 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (   5 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   69 (  31   ~;  26   |;   8   &)
%                                         (   2 <=>;   2  =>;   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    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   38 (   2 sgn  24   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    cUnsatisfiable(i2003_11_14_17_22_23554),
    file('/tmp/tmp2KOgkM/sel_KRS126+1.p_1',axiom_11) ).

fof(3,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => cd1xcomp(X1) ),
    file('/tmp/tmp2KOgkM/sel_KRS126+1.p_1',axiom_2) ).

fof(4,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => cd1(X1) ),
    file('/tmp/tmp2KOgkM/sel_KRS126+1.p_1',axiom_3) ).

fof(8,axiom,
    ! [X1] :
      ( cd1(X1)
    <=> ? [X2] : ra_Px2(X1,X2) ),
    file('/tmp/tmp2KOgkM/sel_KRS126+1.p_1',axiom_7) ).

fof(11,axiom,
    ! [X1] :
      ( cd1xcomp(X1)
    <=> ~ ? [X3] : ra_Px2(X1,X3) ),
    file('/tmp/tmp2KOgkM/sel_KRS126+1.p_1',axiom_8) ).

cnf(18,plain,
    cUnsatisfiable(i2003_11_14_17_22_23554),
    inference(split_conjunct,[status(thm)],[2]) ).

fof(19,plain,
    ! [X1] :
      ( ~ cUnsatisfiable(X1)
      | cd1xcomp(X1) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(20,plain,
    ! [X2] :
      ( ~ cUnsatisfiable(X2)
      | cd1xcomp(X2) ),
    inference(variable_rename,[status(thm)],[19]) ).

cnf(21,plain,
    ( cd1xcomp(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[20]) ).

fof(22,plain,
    ! [X1] :
      ( ~ cUnsatisfiable(X1)
      | cd1(X1) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(23,plain,
    ! [X2] :
      ( ~ cUnsatisfiable(X2)
      | cd1(X2) ),
    inference(variable_rename,[status(thm)],[22]) ).

cnf(24,plain,
    ( cd1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[23]) ).

fof(38,plain,
    ! [X1] :
      ( ( ~ cd1(X1)
        | ? [X2] : ra_Px2(X1,X2) )
      & ( ! [X2] : ~ ra_Px2(X1,X2)
        | cd1(X1) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(39,plain,
    ! [X3] :
      ( ( ~ cd1(X3)
        | ? [X4] : ra_Px2(X3,X4) )
      & ( ! [X5] : ~ ra_Px2(X3,X5)
        | cd1(X3) ) ),
    inference(variable_rename,[status(thm)],[38]) ).

fof(40,plain,
    ! [X3] :
      ( ( ~ cd1(X3)
        | ra_Px2(X3,esk2_1(X3)) )
      & ( ! [X5] : ~ ra_Px2(X3,X5)
        | cd1(X3) ) ),
    inference(skolemize,[status(esa)],[39]) ).

fof(41,plain,
    ! [X3,X5] :
      ( ( ~ ra_Px2(X3,X5)
        | cd1(X3) )
      & ( ~ cd1(X3)
        | ra_Px2(X3,esk2_1(X3)) ) ),
    inference(shift_quantors,[status(thm)],[40]) ).

cnf(42,plain,
    ( ra_Px2(X1,esk2_1(X1))
    | ~ cd1(X1) ),
    inference(split_conjunct,[status(thm)],[41]) ).

fof(53,plain,
    ! [X1] :
      ( ( ~ cd1xcomp(X1)
        | ! [X3] : ~ ra_Px2(X1,X3) )
      & ( ? [X3] : ra_Px2(X1,X3)
        | cd1xcomp(X1) ) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(54,plain,
    ! [X4] :
      ( ( ~ cd1xcomp(X4)
        | ! [X5] : ~ ra_Px2(X4,X5) )
      & ( ? [X6] : ra_Px2(X4,X6)
        | cd1xcomp(X4) ) ),
    inference(variable_rename,[status(thm)],[53]) ).

fof(55,plain,
    ! [X4] :
      ( ( ~ cd1xcomp(X4)
        | ! [X5] : ~ ra_Px2(X4,X5) )
      & ( ra_Px2(X4,esk4_1(X4))
        | cd1xcomp(X4) ) ),
    inference(skolemize,[status(esa)],[54]) ).

fof(56,plain,
    ! [X4,X5] :
      ( ( ~ ra_Px2(X4,X5)
        | ~ cd1xcomp(X4) )
      & ( ra_Px2(X4,esk4_1(X4))
        | cd1xcomp(X4) ) ),
    inference(shift_quantors,[status(thm)],[55]) ).

cnf(58,plain,
    ( ~ cd1xcomp(X1)
    | ~ ra_Px2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[56]) ).

cnf(70,plain,
    ( ~ cd1xcomp(X1)
    | ~ cd1(X1) ),
    inference(spm,[status(thm)],[58,42,theory(equality)]) ).

cnf(72,plain,
    ( ~ cd1xcomp(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[70,24,theory(equality)]) ).

cnf(73,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[72,21]) ).

cnf(74,plain,
    $false,
    inference(sr,[status(thm)],[18,73,theory(equality)]) ).

cnf(75,plain,
    $false,
    74,
    [proof] ).

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