TSTP Solution File: LCL638+1.001 by SInE---0.4

View Problem - Process Solution

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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 18:44:15 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   35 (   5 unt;   0 def)
%            Number of atoms       :  362 (   0 equ)
%            Maximal formula atoms :   56 (  10 avg)
%            Number of connectives :  626 ( 299   ~; 249   |;  78   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   8 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :  181 (   0 sgn 125   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | p1(X2) ) )
                    & ~ p1(X2) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ p1(X2) ) )
                    & p1(X2) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ! [X2] :
                              ( ~ r1(X1,X2)
                              | ~ ! [X1] :
                                    ( ~ r1(X2,X1)
                                    | ~ p1(X1) ) ) )
                    & ! [X1] :
                        ( ~ r1(X2,X1)
                        | ~ ! [X2] :
                              ( ~ r1(X1,X2)
                              | ~ p1(X2) ) ) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ! [X2] :
                              ( ~ r1(X1,X2)
                              | p1(X2) ) )
                    & ! [X1] :
                        ( ~ r1(X2,X1)
                        | p1(X1) ) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ! [X1] :
                      ( ~ r1(X2,X1)
                      | ~ $true ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p1(X2)
              | ~ ! [X1] :
                    ( ~ r1(X2,X1)
                    | p1(X1) ) ) ),
    file('/tmp/tmpBSldjv/sel_LCL638+1.001.p_1',main) ).

fof(2,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | p1(X2) ) )
                      & ~ p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | ~ p1(X2) ) )
                      & p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ ! [X1] :
                                      ( ~ r1(X2,X1)
                                      | ~ p1(X1) ) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ p1(X2) ) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | p1(X2) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | p1(X1) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ! [X1] :
                        ( ~ r1(X2,X1)
                        | ~ $true ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p1(X2)
                | ~ ! [X1] :
                      ( ~ r1(X2,X1)
                      | p1(X1) ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | p1(X2) ) )
                      & ~ p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | ~ p1(X2) ) )
                      & p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ ! [X1] :
                                      ( ~ r1(X2,X1)
                                      | ~ p1(X1) ) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ p1(X2) ) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | p1(X2) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | p1(X1) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ! [X1] :
                        ( ~ r1(X2,X1)
                        | ~ $true ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p1(X2)
                | ~ ! [X1] :
                      ( ~ r1(X2,X1)
                      | p1(X1) ) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(4,negated_conjecture,
    ? [X1] :
      ( ! [X2] :
          ( ~ r1(X1,X2)
          | ! [X1] :
              ( ~ r1(X2,X1)
              | ? [X2] :
                  ( r1(X1,X2)
                  & ~ p1(X2) ) )
          | p1(X2) )
      & ! [X2] :
          ( ~ r1(X1,X2)
          | ! [X1] :
              ( ~ r1(X2,X1)
              | ? [X2] :
                  ( r1(X1,X2)
                  & p1(X2) ) )
          | ~ p1(X2) )
      & ! [X2] :
          ( ~ r1(X1,X2)
          | ! [X1] :
              ( ~ r1(X2,X1)
              | ! [X2] :
                  ( ~ r1(X1,X2)
                  | ? [X1] :
                      ( r1(X2,X1)
                      & p1(X1) ) ) )
          | ? [X1] :
              ( r1(X2,X1)
              & ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ p1(X2) ) ) )
      & ! [X2] :
          ( ~ r1(X1,X2)
          | ! [X1] :
              ( ~ r1(X2,X1)
              | ! [X2] :
                  ( ~ r1(X1,X2)
                  | p1(X2) ) )
          | ? [X1] :
              ( r1(X2,X1)
              & ~ p1(X1) ) )
      & ! [X2] :
          ( ~ r1(X1,X2)
          | ? [X1] :
              ( r1(X2,X1)
              & $true ) )
      & ? [X2] :
          ( r1(X1,X2)
          & ~ p1(X2)
          & ! [X1] :
              ( ~ r1(X2,X1)
              | p1(X1) ) ) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ? [X3] :
      ( ! [X4] :
          ( ~ r1(X3,X4)
          | ! [X5] :
              ( ~ r1(X4,X5)
              | ? [X6] :
                  ( r1(X5,X6)
                  & ~ p1(X6) ) )
          | p1(X4) )
      & ! [X7] :
          ( ~ r1(X3,X7)
          | ! [X8] :
              ( ~ r1(X7,X8)
              | ? [X9] :
                  ( r1(X8,X9)
                  & p1(X9) ) )
          | ~ p1(X7) )
      & ! [X10] :
          ( ~ r1(X3,X10)
          | ! [X11] :
              ( ~ r1(X10,X11)
              | ! [X12] :
                  ( ~ r1(X11,X12)
                  | ? [X13] :
                      ( r1(X12,X13)
                      & p1(X13) ) ) )
          | ? [X14] :
              ( r1(X10,X14)
              & ! [X15] :
                  ( ~ r1(X14,X15)
                  | ~ p1(X15) ) ) )
      & ! [X16] :
          ( ~ r1(X3,X16)
          | ! [X17] :
              ( ~ r1(X16,X17)
              | ! [X18] :
                  ( ~ r1(X17,X18)
                  | p1(X18) ) )
          | ? [X19] :
              ( r1(X16,X19)
              & ~ p1(X19) ) )
      & ! [X20] :
          ( ~ r1(X3,X20)
          | ? [X21] :
              ( r1(X20,X21)
              & $true ) )
      & ? [X22] :
          ( r1(X3,X22)
          & ~ p1(X22)
          & ! [X23] :
              ( ~ r1(X22,X23)
              | p1(X23) ) ) ),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ( ! [X4] :
        ( ~ r1(esk1_0,X4)
        | ! [X5] :
            ( ~ r1(X4,X5)
            | ( r1(X5,esk2_2(X4,X5))
              & ~ p1(esk2_2(X4,X5)) ) )
        | p1(X4) )
    & ! [X7] :
        ( ~ r1(esk1_0,X7)
        | ! [X8] :
            ( ~ r1(X7,X8)
            | ( r1(X8,esk3_2(X7,X8))
              & p1(esk3_2(X7,X8)) ) )
        | ~ p1(X7) )
    & ! [X10] :
        ( ~ r1(esk1_0,X10)
        | ! [X11] :
            ( ~ r1(X10,X11)
            | ! [X12] :
                ( ~ r1(X11,X12)
                | ( r1(X12,esk4_3(X10,X11,X12))
                  & p1(esk4_3(X10,X11,X12)) ) ) )
        | ( r1(X10,esk5_1(X10))
          & ! [X15] :
              ( ~ r1(esk5_1(X10),X15)
              | ~ p1(X15) ) ) )
    & ! [X16] :
        ( ~ r1(esk1_0,X16)
        | ! [X17] :
            ( ~ r1(X16,X17)
            | ! [X18] :
                ( ~ r1(X17,X18)
                | p1(X18) ) )
        | ( r1(X16,esk6_1(X16))
          & ~ p1(esk6_1(X16)) ) )
    & ! [X20] :
        ( ~ r1(esk1_0,X20)
        | ( r1(X20,esk7_1(X20))
          & $true ) )
    & r1(esk1_0,esk8_0)
    & ~ p1(esk8_0)
    & ! [X23] :
        ( ~ r1(esk8_0,X23)
        | p1(X23) ) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X4,X5,X7,X8,X10,X11,X12,X15,X16,X17,X18,X20,X23] :
      ( ( ~ r1(esk8_0,X23)
        | p1(X23) )
      & r1(esk1_0,esk8_0)
      & ~ p1(esk8_0)
      & ( ~ r1(esk1_0,X20)
        | ( r1(X20,esk7_1(X20))
          & $true ) )
      & ( ~ r1(X17,X18)
        | p1(X18)
        | ~ r1(X16,X17)
        | ( r1(X16,esk6_1(X16))
          & ~ p1(esk6_1(X16)) )
        | ~ r1(esk1_0,X16) )
      & ( ( ( ~ r1(esk5_1(X10),X15)
            | ~ p1(X15) )
          & r1(X10,esk5_1(X10)) )
        | ~ r1(X11,X12)
        | ( r1(X12,esk4_3(X10,X11,X12))
          & p1(esk4_3(X10,X11,X12)) )
        | ~ r1(X10,X11)
        | ~ r1(esk1_0,X10) )
      & ( ~ r1(X7,X8)
        | ( r1(X8,esk3_2(X7,X8))
          & p1(esk3_2(X7,X8)) )
        | ~ p1(X7)
        | ~ r1(esk1_0,X7) )
      & ( ~ r1(X4,X5)
        | ( r1(X5,esk2_2(X4,X5))
          & ~ p1(esk2_2(X4,X5)) )
        | p1(X4)
        | ~ r1(esk1_0,X4) ) ),
    inference(shift_quantors,[status(thm)],[6]) ).

fof(8,negated_conjecture,
    ! [X4,X5,X7,X8,X10,X11,X12,X15,X16,X17,X18,X20,X23] :
      ( ( ~ r1(esk8_0,X23)
        | p1(X23) )
      & r1(esk1_0,esk8_0)
      & ~ p1(esk8_0)
      & ( r1(X20,esk7_1(X20))
        | ~ r1(esk1_0,X20) )
      & ( $true
        | ~ r1(esk1_0,X20) )
      & ( r1(X16,esk6_1(X16))
        | ~ r1(X17,X18)
        | p1(X18)
        | ~ r1(X16,X17)
        | ~ r1(esk1_0,X16) )
      & ( ~ p1(esk6_1(X16))
        | ~ r1(X17,X18)
        | p1(X18)
        | ~ r1(X16,X17)
        | ~ r1(esk1_0,X16) )
      & ( r1(X12,esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk5_1(X10),X15)
        | ~ p1(X15)
        | ~ r1(esk1_0,X10) )
      & ( p1(esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk5_1(X10),X15)
        | ~ p1(X15)
        | ~ r1(esk1_0,X10) )
      & ( r1(X12,esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | r1(X10,esk5_1(X10))
        | ~ r1(esk1_0,X10) )
      & ( p1(esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | r1(X10,esk5_1(X10))
        | ~ r1(esk1_0,X10) )
      & ( r1(X8,esk3_2(X7,X8))
        | ~ r1(X7,X8)
        | ~ p1(X7)
        | ~ r1(esk1_0,X7) )
      & ( p1(esk3_2(X7,X8))
        | ~ r1(X7,X8)
        | ~ p1(X7)
        | ~ r1(esk1_0,X7) )
      & ( r1(X5,esk2_2(X4,X5))
        | ~ r1(X4,X5)
        | p1(X4)
        | ~ r1(esk1_0,X4) )
      & ( ~ p1(esk2_2(X4,X5))
        | ~ r1(X4,X5)
        | p1(X4)
        | ~ r1(esk1_0,X4) ) ),
    inference(distribute,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | ~ p1(esk2_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(10,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk2_2(X1,X2))
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(17,negated_conjecture,
    ( p1(X3)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | ~ r1(X2,X3)
    | ~ p1(esk6_1(X1)) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(18,negated_conjecture,
    ( p1(X3)
    | r1(X1,esk6_1(X1))
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | ~ r1(X2,X3) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(20,negated_conjecture,
    ( r1(X1,esk7_1(X1))
    | ~ r1(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(21,negated_conjecture,
    ~ p1(esk8_0),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(22,negated_conjecture,
    r1(esk1_0,esk8_0),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(23,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk8_0,X1) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(26,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X3,X1)
    | ~ r1(X2,X3)
    | ~ r1(esk8_0,esk6_1(X2)) ),
    inference(spm,[status(thm)],[17,23,theory(equality)]) ).

cnf(29,negated_conjecture,
    ( p1(esk2_2(X1,X2))
    | r1(X3,esk6_1(X3))
    | p1(X1)
    | ~ r1(esk1_0,X3)
    | ~ r1(X3,X2)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2) ),
    inference(spm,[status(thm)],[18,10,theory(equality)]) ).

cnf(93,negated_conjecture,
    ( p1(X1)
    | r1(X3,esk6_1(X3))
    | ~ r1(esk1_0,X3)
    | ~ r1(esk1_0,X1)
    | ~ r1(X3,X2)
    | ~ r1(X1,X2) ),
    inference(csr,[status(thm)],[29,9]) ).

cnf(95,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk6_1(X2))
    | ~ r1(esk1_0,X2)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,esk7_1(X2)) ),
    inference(spm,[status(thm)],[93,20,theory(equality)]) ).

cnf(140,negated_conjecture,
    ( p1(X1)
    | r1(X1,esk6_1(X1))
    | ~ r1(esk1_0,X1) ),
    inference(spm,[status(thm)],[95,20,theory(equality)]) ).

cnf(149,negated_conjecture,
    ( p1(X1)
    | p1(esk8_0)
    | ~ r1(esk1_0,esk8_0)
    | ~ r1(X2,X1)
    | ~ r1(esk8_0,X2) ),
    inference(spm,[status(thm)],[26,140,theory(equality)]) ).

cnf(157,negated_conjecture,
    ( p1(X1)
    | p1(esk8_0)
    | $false
    | ~ r1(X2,X1)
    | ~ r1(esk8_0,X2) ),
    inference(rw,[status(thm)],[149,22,theory(equality)]) ).

cnf(158,negated_conjecture,
    ( p1(X1)
    | p1(esk8_0)
    | ~ r1(X2,X1)
    | ~ r1(esk8_0,X2) ),
    inference(cn,[status(thm)],[157,theory(equality)]) ).

cnf(159,negated_conjecture,
    ( p1(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk8_0,X2) ),
    inference(sr,[status(thm)],[158,21,theory(equality)]) ).

cnf(163,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_1(esk8_0),X1)
    | ~ r1(esk1_0,esk8_0) ),
    inference(spm,[status(thm)],[159,20,theory(equality)]) ).

cnf(169,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_1(esk8_0),X1)
    | $false ),
    inference(rw,[status(thm)],[163,22,theory(equality)]) ).

cnf(170,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_1(esk8_0),X1) ),
    inference(cn,[status(thm)],[169,theory(equality)]) ).

cnf(183,negated_conjecture,
    ( p1(esk2_2(X1,esk7_1(esk8_0)))
    | p1(X1)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,esk7_1(esk8_0)) ),
    inference(spm,[status(thm)],[170,10,theory(equality)]) ).

cnf(205,negated_conjecture,
    ( p1(X1)
    | ~ r1(X1,esk7_1(esk8_0))
    | ~ r1(esk1_0,X1) ),
    inference(csr,[status(thm)],[183,9]) ).

cnf(206,negated_conjecture,
    ( p1(esk8_0)
    | ~ r1(esk1_0,esk8_0) ),
    inference(spm,[status(thm)],[205,20,theory(equality)]) ).

cnf(207,negated_conjecture,
    ( p1(esk8_0)
    | $false ),
    inference(rw,[status(thm)],[206,22,theory(equality)]) ).

cnf(208,negated_conjecture,
    p1(esk8_0),
    inference(cn,[status(thm)],[207,theory(equality)]) ).

cnf(209,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[208,21,theory(equality)]) ).

cnf(210,negated_conjecture,
    $false,
    209,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL638+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpBSldjv/sel_LCL638+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL638+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL638+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL638+1.001.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------