TSTP Solution File: KRS117+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KRS117+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 13:00:42 EST 2010

% Result   : Unsatisfiable 0.28s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   79 (   6 unt;   0 def)
%            Number of atoms       :  311 (   9 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  391 ( 159   ~; 149   |;  72   &)
%                                         (   7 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :  150 (   3 sgn  90   !;  17   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    cUnsatisfiable(i2003_11_14_17_21_37349),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_11) ).

fof(3,axiom,
    ! [X1,X2] :
      ( rf(X1,X2)
     => rr(X1,X2) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_12) ).

fof(7,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
    <=> ( ccxcomp(X1)
        & ! [X2] :
            ( rinvR(X1,X2)
           => ca_Vx3(X2) )
        & ? [X2] :
            ( rinvF(X1,X2)
            & cd(X2) ) ) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_2) ).

fof(8,axiom,
    ! [X1] :
      ( cc(X1)
    <=> ~ ? [X2] : ra_Px1(X1,X2) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_3) ).

fof(9,axiom,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_0) ).

fof(11,axiom,
    ! [X1] :
      ( ca_Vx3(X1)
    <=> ? [X2] :
          ( rinvF(X1,X2)
          & cd(X2) ) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_6) ).

fof(12,axiom,
    ! [X1] :
      ( cowlThing(X1)
     => ! [X7,X8] :
          ( ( rf(X1,X7)
            & rf(X1,X8) )
         => X7 = X8 ) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_7) ).

fof(13,axiom,
    ! [X1] :
      ( ccxcomp(X1)
    <=> ? [X7] : ra_Px1(X1,X7) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_4) ).

fof(14,axiom,
    ! [X1] :
      ( cd(X1)
    <=> ( ? [X2] :
            ( rf(X1,X2)
            & ccxcomp(X2) )
        & cc(X1) ) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_5) ).

fof(15,axiom,
    ! [X1,X2] :
      ( rinvF(X1,X2)
    <=> rf(X2,X1) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_8) ).

fof(16,axiom,
    ! [X1,X2] :
      ( rinvR(X1,X2)
    <=> rr(X2,X1) ),
    file('/tmp/tmpn9lrFh/sel_KRS117+1.p_1',axiom_9) ).

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

cnf(38,plain,
    cUnsatisfiable(i2003_11_14_17_21_37349),
    inference(split_conjunct,[status(thm)],[2]) ).

fof(39,plain,
    ! [X1,X2] :
      ( ~ rf(X1,X2)
      | rr(X1,X2) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(40,plain,
    ! [X3,X4] :
      ( ~ rf(X3,X4)
      | rr(X3,X4) ),
    inference(variable_rename,[status(thm)],[39]) ).

cnf(41,plain,
    ( rr(X1,X2)
    | ~ rf(X1,X2) ),
    inference(split_conjunct,[status(thm)],[40]) ).

fof(51,plain,
    ! [X1] :
      ( ( ~ cUnsatisfiable(X1)
        | ( ccxcomp(X1)
          & ! [X2] :
              ( ~ rinvR(X1,X2)
              | ca_Vx3(X2) )
          & ? [X2] :
              ( rinvF(X1,X2)
              & cd(X2) ) ) )
      & ( ~ ccxcomp(X1)
        | ? [X2] :
            ( rinvR(X1,X2)
            & ~ ca_Vx3(X2) )
        | ! [X2] :
            ( ~ rinvF(X1,X2)
            | ~ cd(X2) )
        | cUnsatisfiable(X1) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(52,plain,
    ! [X3] :
      ( ( ~ cUnsatisfiable(X3)
        | ( ccxcomp(X3)
          & ! [X4] :
              ( ~ rinvR(X3,X4)
              | ca_Vx3(X4) )
          & ? [X5] :
              ( rinvF(X3,X5)
              & cd(X5) ) ) )
      & ( ~ ccxcomp(X3)
        | ? [X6] :
            ( rinvR(X3,X6)
            & ~ ca_Vx3(X6) )
        | ! [X7] :
            ( ~ rinvF(X3,X7)
            | ~ cd(X7) )
        | cUnsatisfiable(X3) ) ),
    inference(variable_rename,[status(thm)],[51]) ).

fof(53,plain,
    ! [X3] :
      ( ( ~ cUnsatisfiable(X3)
        | ( ccxcomp(X3)
          & ! [X4] :
              ( ~ rinvR(X3,X4)
              | ca_Vx3(X4) )
          & rinvF(X3,esk1_1(X3))
          & cd(esk1_1(X3)) ) )
      & ( ~ ccxcomp(X3)
        | ( rinvR(X3,esk2_1(X3))
          & ~ ca_Vx3(esk2_1(X3)) )
        | ! [X7] :
            ( ~ rinvF(X3,X7)
            | ~ cd(X7) )
        | cUnsatisfiable(X3) ) ),
    inference(skolemize,[status(esa)],[52]) ).

fof(54,plain,
    ! [X3,X4,X7] :
      ( ( ~ rinvF(X3,X7)
        | ~ cd(X7)
        | ~ ccxcomp(X3)
        | ( rinvR(X3,esk2_1(X3))
          & ~ ca_Vx3(esk2_1(X3)) )
        | cUnsatisfiable(X3) )
      & ( ( ( ~ rinvR(X3,X4)
            | ca_Vx3(X4) )
          & ccxcomp(X3)
          & rinvF(X3,esk1_1(X3))
          & cd(esk1_1(X3)) )
        | ~ cUnsatisfiable(X3) ) ),
    inference(shift_quantors,[status(thm)],[53]) ).

fof(55,plain,
    ! [X3,X4,X7] :
      ( ( rinvR(X3,esk2_1(X3))
        | ~ ccxcomp(X3)
        | ~ rinvF(X3,X7)
        | ~ cd(X7)
        | cUnsatisfiable(X3) )
      & ( ~ ca_Vx3(esk2_1(X3))
        | ~ ccxcomp(X3)
        | ~ rinvF(X3,X7)
        | ~ cd(X7)
        | cUnsatisfiable(X3) )
      & ( ~ rinvR(X3,X4)
        | ca_Vx3(X4)
        | ~ cUnsatisfiable(X3) )
      & ( ccxcomp(X3)
        | ~ cUnsatisfiable(X3) )
      & ( rinvF(X3,esk1_1(X3))
        | ~ cUnsatisfiable(X3) )
      & ( cd(esk1_1(X3))
        | ~ cUnsatisfiable(X3) ) ),
    inference(distribute,[status(thm)],[54]) ).

cnf(56,plain,
    ( cd(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[55]) ).

cnf(57,plain,
    ( rinvF(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[55]) ).

cnf(59,plain,
    ( ca_Vx3(X2)
    | ~ cUnsatisfiable(X1)
    | ~ rinvR(X1,X2) ),
    inference(split_conjunct,[status(thm)],[55]) ).

fof(62,plain,
    ! [X1] :
      ( ( ~ cc(X1)
        | ! [X2] : ~ ra_Px1(X1,X2) )
      & ( ? [X2] : ra_Px1(X1,X2)
        | cc(X1) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(63,plain,
    ! [X3] :
      ( ( ~ cc(X3)
        | ! [X4] : ~ ra_Px1(X3,X4) )
      & ( ? [X5] : ra_Px1(X3,X5)
        | cc(X3) ) ),
    inference(variable_rename,[status(thm)],[62]) ).

fof(64,plain,
    ! [X3] :
      ( ( ~ cc(X3)
        | ! [X4] : ~ ra_Px1(X3,X4) )
      & ( ra_Px1(X3,esk3_1(X3))
        | cc(X3) ) ),
    inference(skolemize,[status(esa)],[63]) ).

fof(65,plain,
    ! [X3,X4] :
      ( ( ~ ra_Px1(X3,X4)
        | ~ cc(X3) )
      & ( ra_Px1(X3,esk3_1(X3))
        | cc(X3) ) ),
    inference(shift_quantors,[status(thm)],[64]) ).

cnf(67,plain,
    ( ~ cc(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[65]) ).

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

cnf(70,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[68]) ).

fof(75,plain,
    ! [X1] :
      ( ( ~ ca_Vx3(X1)
        | ? [X2] :
            ( rinvF(X1,X2)
            & cd(X2) ) )
      & ( ! [X2] :
            ( ~ rinvF(X1,X2)
            | ~ cd(X2) )
        | ca_Vx3(X1) ) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(76,plain,
    ! [X3] :
      ( ( ~ ca_Vx3(X3)
        | ? [X4] :
            ( rinvF(X3,X4)
            & cd(X4) ) )
      & ( ! [X5] :
            ( ~ rinvF(X3,X5)
            | ~ cd(X5) )
        | ca_Vx3(X3) ) ),
    inference(variable_rename,[status(thm)],[75]) ).

fof(77,plain,
    ! [X3] :
      ( ( ~ ca_Vx3(X3)
        | ( rinvF(X3,esk4_1(X3))
          & cd(esk4_1(X3)) ) )
      & ( ! [X5] :
            ( ~ rinvF(X3,X5)
            | ~ cd(X5) )
        | ca_Vx3(X3) ) ),
    inference(skolemize,[status(esa)],[76]) ).

fof(78,plain,
    ! [X3,X5] :
      ( ( ~ rinvF(X3,X5)
        | ~ cd(X5)
        | ca_Vx3(X3) )
      & ( ~ ca_Vx3(X3)
        | ( rinvF(X3,esk4_1(X3))
          & cd(esk4_1(X3)) ) ) ),
    inference(shift_quantors,[status(thm)],[77]) ).

fof(79,plain,
    ! [X3,X5] :
      ( ( ~ rinvF(X3,X5)
        | ~ cd(X5)
        | ca_Vx3(X3) )
      & ( rinvF(X3,esk4_1(X3))
        | ~ ca_Vx3(X3) )
      & ( cd(esk4_1(X3))
        | ~ ca_Vx3(X3) ) ),
    inference(distribute,[status(thm)],[78]) ).

cnf(80,plain,
    ( cd(esk4_1(X1))
    | ~ ca_Vx3(X1) ),
    inference(split_conjunct,[status(thm)],[79]) ).

cnf(81,plain,
    ( rinvF(X1,esk4_1(X1))
    | ~ ca_Vx3(X1) ),
    inference(split_conjunct,[status(thm)],[79]) ).

fof(83,plain,
    ! [X1] :
      ( ~ cowlThing(X1)
      | ! [X7,X8] :
          ( ~ rf(X1,X7)
          | ~ rf(X1,X8)
          | X7 = X8 ) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(84,plain,
    ! [X9] :
      ( ~ cowlThing(X9)
      | ! [X10,X11] :
          ( ~ rf(X9,X10)
          | ~ rf(X9,X11)
          | X10 = X11 ) ),
    inference(variable_rename,[status(thm)],[83]) ).

fof(85,plain,
    ! [X9,X10,X11] :
      ( ~ rf(X9,X10)
      | ~ rf(X9,X11)
      | X10 = X11
      | ~ cowlThing(X9) ),
    inference(shift_quantors,[status(thm)],[84]) ).

cnf(86,plain,
    ( X2 = X3
    | ~ cowlThing(X1)
    | ~ rf(X1,X3)
    | ~ rf(X1,X2) ),
    inference(split_conjunct,[status(thm)],[85]) ).

fof(87,plain,
    ! [X1] :
      ( ( ~ ccxcomp(X1)
        | ? [X7] : ra_Px1(X1,X7) )
      & ( ! [X7] : ~ ra_Px1(X1,X7)
        | ccxcomp(X1) ) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(88,plain,
    ! [X8] :
      ( ( ~ ccxcomp(X8)
        | ? [X9] : ra_Px1(X8,X9) )
      & ( ! [X10] : ~ ra_Px1(X8,X10)
        | ccxcomp(X8) ) ),
    inference(variable_rename,[status(thm)],[87]) ).

fof(89,plain,
    ! [X8] :
      ( ( ~ ccxcomp(X8)
        | ra_Px1(X8,esk5_1(X8)) )
      & ( ! [X10] : ~ ra_Px1(X8,X10)
        | ccxcomp(X8) ) ),
    inference(skolemize,[status(esa)],[88]) ).

fof(90,plain,
    ! [X8,X10] :
      ( ( ~ ra_Px1(X8,X10)
        | ccxcomp(X8) )
      & ( ~ ccxcomp(X8)
        | ra_Px1(X8,esk5_1(X8)) ) ),
    inference(shift_quantors,[status(thm)],[89]) ).

cnf(91,plain,
    ( ra_Px1(X1,esk5_1(X1))
    | ~ ccxcomp(X1) ),
    inference(split_conjunct,[status(thm)],[90]) ).

fof(93,plain,
    ! [X1] :
      ( ( ~ cd(X1)
        | ( ? [X2] :
              ( rf(X1,X2)
              & ccxcomp(X2) )
          & cc(X1) ) )
      & ( ! [X2] :
            ( ~ rf(X1,X2)
            | ~ ccxcomp(X2) )
        | ~ cc(X1)
        | cd(X1) ) ),
    inference(fof_nnf,[status(thm)],[14]) ).

fof(94,plain,
    ! [X3] :
      ( ( ~ cd(X3)
        | ( ? [X4] :
              ( rf(X3,X4)
              & ccxcomp(X4) )
          & cc(X3) ) )
      & ( ! [X5] :
            ( ~ rf(X3,X5)
            | ~ ccxcomp(X5) )
        | ~ cc(X3)
        | cd(X3) ) ),
    inference(variable_rename,[status(thm)],[93]) ).

fof(95,plain,
    ! [X3] :
      ( ( ~ cd(X3)
        | ( rf(X3,esk6_1(X3))
          & ccxcomp(esk6_1(X3))
          & cc(X3) ) )
      & ( ! [X5] :
            ( ~ rf(X3,X5)
            | ~ ccxcomp(X5) )
        | ~ cc(X3)
        | cd(X3) ) ),
    inference(skolemize,[status(esa)],[94]) ).

fof(96,plain,
    ! [X3,X5] :
      ( ( ~ rf(X3,X5)
        | ~ ccxcomp(X5)
        | ~ cc(X3)
        | cd(X3) )
      & ( ~ cd(X3)
        | ( rf(X3,esk6_1(X3))
          & ccxcomp(esk6_1(X3))
          & cc(X3) ) ) ),
    inference(shift_quantors,[status(thm)],[95]) ).

fof(97,plain,
    ! [X3,X5] :
      ( ( ~ rf(X3,X5)
        | ~ ccxcomp(X5)
        | ~ cc(X3)
        | cd(X3) )
      & ( rf(X3,esk6_1(X3))
        | ~ cd(X3) )
      & ( ccxcomp(esk6_1(X3))
        | ~ cd(X3) )
      & ( cc(X3)
        | ~ cd(X3) ) ),
    inference(distribute,[status(thm)],[96]) ).

cnf(98,plain,
    ( cc(X1)
    | ~ cd(X1) ),
    inference(split_conjunct,[status(thm)],[97]) ).

cnf(99,plain,
    ( ccxcomp(esk6_1(X1))
    | ~ cd(X1) ),
    inference(split_conjunct,[status(thm)],[97]) ).

cnf(100,plain,
    ( rf(X1,esk6_1(X1))
    | ~ cd(X1) ),
    inference(split_conjunct,[status(thm)],[97]) ).

fof(102,plain,
    ! [X1,X2] :
      ( ( ~ rinvF(X1,X2)
        | rf(X2,X1) )
      & ( ~ rf(X2,X1)
        | rinvF(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[15]) ).

fof(103,plain,
    ! [X3,X4] :
      ( ( ~ rinvF(X3,X4)
        | rf(X4,X3) )
      & ( ~ rf(X4,X3)
        | rinvF(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[102]) ).

cnf(105,plain,
    ( rf(X1,X2)
    | ~ rinvF(X2,X1) ),
    inference(split_conjunct,[status(thm)],[103]) ).

fof(106,plain,
    ! [X1,X2] :
      ( ( ~ rinvR(X1,X2)
        | rr(X2,X1) )
      & ( ~ rr(X2,X1)
        | rinvR(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[16]) ).

fof(107,plain,
    ! [X3,X4] :
      ( ( ~ rinvR(X3,X4)
        | rr(X4,X3) )
      & ( ~ rr(X4,X3)
        | rinvR(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[106]) ).

cnf(108,plain,
    ( rinvR(X1,X2)
    | ~ rr(X2,X1) ),
    inference(split_conjunct,[status(thm)],[107]) ).

cnf(158,plain,
    ( X2 = X3
    | $false
    | ~ rf(X1,X3)
    | ~ rf(X1,X2) ),
    inference(rw,[status(thm)],[86,70,theory(equality)]),
    [unfolding] ).

cnf(164,plain,
    ( rf(esk1_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[105,57,theory(equality)]) ).

cnf(165,plain,
    ( rf(esk4_1(X1),X1)
    | ~ ca_Vx3(X1) ),
    inference(spm,[status(thm)],[105,81,theory(equality)]) ).

cnf(167,plain,
    ( ~ cc(X1)
    | ~ ccxcomp(X1) ),
    inference(spm,[status(thm)],[67,91,theory(equality)]) ).

cnf(168,plain,
    ( X1 = esk6_1(X2)
    | ~ rf(X2,X1)
    | ~ cd(X2) ),
    inference(spm,[status(thm)],[158,100,theory(equality)]) ).

cnf(169,plain,
    ( ca_Vx3(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rr(X1,X2) ),
    inference(spm,[status(thm)],[59,108,theory(equality)]) ).

cnf(178,plain,
    ( ~ ccxcomp(X1)
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[167,98,theory(equality)]) ).

cnf(180,plain,
    ( ~ cd(esk6_1(X1))
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[178,99,theory(equality)]) ).

cnf(188,plain,
    ( X1 = esk6_1(esk4_1(X1))
    | ~ cd(esk4_1(X1))
    | ~ ca_Vx3(X1) ),
    inference(spm,[status(thm)],[168,165,theory(equality)]) ).

cnf(193,plain,
    ( ca_Vx3(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rf(X1,X2) ),
    inference(spm,[status(thm)],[169,41,theory(equality)]) ).

cnf(198,plain,
    ( ca_Vx3(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[193,164,theory(equality)]) ).

cnf(217,plain,
    ( esk6_1(esk4_1(X1)) = X1
    | ~ ca_Vx3(X1) ),
    inference(csr,[status(thm)],[188,80]) ).

cnf(220,plain,
    ( ~ cd(X1)
    | ~ cd(esk4_1(X1))
    | ~ ca_Vx3(X1) ),
    inference(spm,[status(thm)],[180,217,theory(equality)]) ).

cnf(223,plain,
    ( ~ cd(X1)
    | ~ ca_Vx3(X1) ),
    inference(csr,[status(thm)],[220,80]) ).

cnf(226,plain,
    ( ~ cd(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[223,198,theory(equality)]) ).

cnf(233,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[226,56]) ).

cnf(234,plain,
    $false,
    inference(sr,[status(thm)],[38,233,theory(equality)]) ).

cnf(235,plain,
    $false,
    234,
    [proof] ).

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