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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWC001+1 : TPTP v5.0.0. Released v2.4.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 : Sun Dec 26 10:03:38 EST 2010

% Result   : Theorem 0.28s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   38 (  11 unt;   0 def)
%            Number of atoms       :  206 (  18 equ)
%            Maximal formula atoms :   21 (   5 avg)
%            Number of connectives :  249 (  81   ~;  80   |;  73   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   37 (   0 sgn  20   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(24,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ duplicatefreeP(X3)
                    | ? [X5] :
                        ( ssItem(X5)
                        & ( ( ~ memberP(X4,X5)
                            & memberP(X3,X5) )
                          | ( ~ memberP(X3,X5)
                            & memberP(X4,X5) ) ) )
                    | ( ! [X6] :
                          ( ssItem(X6)
                         => ( ( ~ memberP(X2,X6)
                              & ~ memberP(X1,X6) )
                            | ( memberP(X2,X6)
                              & memberP(X1,X6) ) ) )
                      & duplicatefreeP(X1) ) ) ) ) ) ),
    file('/tmp/tmpmejHax/sel_SWC001+1.p_1',co1) ).

fof(25,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ duplicatefreeP(X3)
                      | ? [X5] :
                          ( ssItem(X5)
                          & ( ( ~ memberP(X4,X5)
                              & memberP(X3,X5) )
                            | ( ~ memberP(X3,X5)
                              & memberP(X4,X5) ) ) )
                      | ( ! [X6] :
                            ( ssItem(X6)
                           => ( ( ~ memberP(X2,X6)
                                & ~ memberP(X1,X6) )
                              | ( memberP(X2,X6)
                                & memberP(X1,X6) ) ) )
                        & duplicatefreeP(X1) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[24]) ).

fof(27,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ duplicatefreeP(X3)
                      | ? [X5] :
                          ( ssItem(X5)
                          & ( ( ~ memberP(X4,X5)
                              & memberP(X3,X5) )
                            | ( ~ memberP(X3,X5)
                              & memberP(X4,X5) ) ) )
                      | ( ! [X6] :
                            ( ssItem(X6)
                           => ( ( ~ memberP(X2,X6)
                                & ~ memberP(X1,X6) )
                              | ( memberP(X2,X6)
                                & memberP(X1,X6) ) ) )
                        & duplicatefreeP(X1) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).

fof(139,negated_conjecture,
    ? [X1] :
      ( ssList(X1)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & X2 = X4
                  & X1 = X3
                  & duplicatefreeP(X3)
                  & ! [X5] :
                      ( ~ ssItem(X5)
                      | ( ( memberP(X4,X5)
                          | ~ memberP(X3,X5) )
                        & ( memberP(X3,X5)
                          | ~ memberP(X4,X5) ) ) )
                  & ( ? [X6] :
                        ( ssItem(X6)
                        & ( memberP(X2,X6)
                          | memberP(X1,X6) )
                        & ( ~ memberP(X2,X6)
                          | ~ memberP(X1,X6) ) )
                    | ~ duplicatefreeP(X1) ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[27]) ).

fof(140,negated_conjecture,
    ? [X7] :
      ( ssList(X7)
      & ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( ssList(X9)
              & ? [X10] :
                  ( ssList(X10)
                  & X8 = X10
                  & X7 = X9
                  & duplicatefreeP(X9)
                  & ! [X11] :
                      ( ~ ssItem(X11)
                      | ( ( memberP(X10,X11)
                          | ~ memberP(X9,X11) )
                        & ( memberP(X9,X11)
                          | ~ memberP(X10,X11) ) ) )
                  & ( ? [X12] :
                        ( ssItem(X12)
                        & ( memberP(X8,X12)
                          | memberP(X7,X12) )
                        & ( ~ memberP(X8,X12)
                          | ~ memberP(X7,X12) ) )
                    | ~ duplicatefreeP(X7) ) ) ) ) ),
    inference(variable_rename,[status(thm)],[139]) ).

fof(141,negated_conjecture,
    ( ssList(esk12_0)
    & ssList(esk13_0)
    & ssList(esk14_0)
    & ssList(esk15_0)
    & esk13_0 = esk15_0
    & esk12_0 = esk14_0
    & duplicatefreeP(esk14_0)
    & ! [X11] :
        ( ~ ssItem(X11)
        | ( ( memberP(esk15_0,X11)
            | ~ memberP(esk14_0,X11) )
          & ( memberP(esk14_0,X11)
            | ~ memberP(esk15_0,X11) ) ) )
    & ( ( ssItem(esk16_0)
        & ( memberP(esk13_0,esk16_0)
          | memberP(esk12_0,esk16_0) )
        & ( ~ memberP(esk13_0,esk16_0)
          | ~ memberP(esk12_0,esk16_0) ) )
      | ~ duplicatefreeP(esk12_0) ) ),
    inference(skolemize,[status(esa)],[140]) ).

fof(142,negated_conjecture,
    ! [X11] :
      ( ( ~ ssItem(X11)
        | ( ( memberP(esk15_0,X11)
            | ~ memberP(esk14_0,X11) )
          & ( memberP(esk14_0,X11)
            | ~ memberP(esk15_0,X11) ) ) )
      & esk13_0 = esk15_0
      & esk12_0 = esk14_0
      & duplicatefreeP(esk14_0)
      & ( ( ssItem(esk16_0)
          & ( memberP(esk13_0,esk16_0)
            | memberP(esk12_0,esk16_0) )
          & ( ~ memberP(esk13_0,esk16_0)
            | ~ memberP(esk12_0,esk16_0) ) )
        | ~ duplicatefreeP(esk12_0) )
      & ssList(esk15_0)
      & ssList(esk14_0)
      & ssList(esk13_0)
      & ssList(esk12_0) ),
    inference(shift_quantors,[status(thm)],[141]) ).

fof(143,negated_conjecture,
    ! [X11] :
      ( ( memberP(esk15_0,X11)
        | ~ memberP(esk14_0,X11)
        | ~ ssItem(X11) )
      & ( memberP(esk14_0,X11)
        | ~ memberP(esk15_0,X11)
        | ~ ssItem(X11) )
      & esk13_0 = esk15_0
      & esk12_0 = esk14_0
      & duplicatefreeP(esk14_0)
      & ( ssItem(esk16_0)
        | ~ duplicatefreeP(esk12_0) )
      & ( memberP(esk13_0,esk16_0)
        | memberP(esk12_0,esk16_0)
        | ~ duplicatefreeP(esk12_0) )
      & ( ~ memberP(esk13_0,esk16_0)
        | ~ memberP(esk12_0,esk16_0)
        | ~ duplicatefreeP(esk12_0) )
      & ssList(esk15_0)
      & ssList(esk14_0)
      & ssList(esk13_0)
      & ssList(esk12_0) ),
    inference(distribute,[status(thm)],[142]) ).

cnf(148,negated_conjecture,
    ( ~ duplicatefreeP(esk12_0)
    | ~ memberP(esk12_0,esk16_0)
    | ~ memberP(esk13_0,esk16_0) ),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(149,negated_conjecture,
    ( memberP(esk12_0,esk16_0)
    | memberP(esk13_0,esk16_0)
    | ~ duplicatefreeP(esk12_0) ),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(150,negated_conjecture,
    ( ssItem(esk16_0)
    | ~ duplicatefreeP(esk12_0) ),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(151,negated_conjecture,
    duplicatefreeP(esk14_0),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(152,negated_conjecture,
    esk12_0 = esk14_0,
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(153,negated_conjecture,
    esk13_0 = esk15_0,
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(154,negated_conjecture,
    ( memberP(esk14_0,X1)
    | ~ ssItem(X1)
    | ~ memberP(esk15_0,X1) ),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(155,negated_conjecture,
    ( memberP(esk15_0,X1)
    | ~ ssItem(X1)
    | ~ memberP(esk14_0,X1) ),
    inference(split_conjunct,[status(thm)],[143]) ).

cnf(156,negated_conjecture,
    duplicatefreeP(esk12_0),
    inference(rw,[status(thm)],[151,152,theory(equality)]) ).

cnf(160,negated_conjecture,
    ( memberP(esk12_0,esk16_0)
    | memberP(esk15_0,esk16_0)
    | ~ duplicatefreeP(esk12_0) ),
    inference(rw,[status(thm)],[149,153,theory(equality)]) ).

cnf(161,negated_conjecture,
    ( memberP(esk12_0,X1)
    | ~ ssItem(X1)
    | ~ memberP(esk15_0,X1) ),
    inference(rw,[status(thm)],[154,152,theory(equality)]) ).

cnf(162,negated_conjecture,
    ( memberP(esk15_0,X1)
    | ~ ssItem(X1)
    | ~ memberP(esk12_0,X1) ),
    inference(rw,[status(thm)],[155,152,theory(equality)]) ).

cnf(163,negated_conjecture,
    ( ~ duplicatefreeP(esk12_0)
    | ~ memberP(esk12_0,esk16_0)
    | ~ memberP(esk15_0,esk16_0) ),
    inference(rw,[status(thm)],[148,153,theory(equality)]) ).

cnf(301,negated_conjecture,
    ( $false
    | ~ memberP(esk12_0,esk16_0)
    | ~ memberP(esk15_0,esk16_0) ),
    inference(rw,[status(thm)],[163,156,theory(equality)]) ).

cnf(302,negated_conjecture,
    ( ~ memberP(esk12_0,esk16_0)
    | ~ memberP(esk15_0,esk16_0) ),
    inference(cn,[status(thm)],[301,theory(equality)]) ).

cnf(303,negated_conjecture,
    ( memberP(esk15_0,esk16_0)
    | memberP(esk12_0,esk16_0)
    | $false ),
    inference(rw,[status(thm)],[160,156,theory(equality)]) ).

cnf(304,negated_conjecture,
    ( memberP(esk15_0,esk16_0)
    | memberP(esk12_0,esk16_0) ),
    inference(cn,[status(thm)],[303,theory(equality)]) ).

cnf(305,negated_conjecture,
    ( ssItem(esk16_0)
    | $false ),
    inference(rw,[status(thm)],[150,156,theory(equality)]) ).

cnf(306,negated_conjecture,
    ssItem(esk16_0),
    inference(cn,[status(thm)],[305,theory(equality)]) ).

cnf(308,negated_conjecture,
    ( memberP(esk12_0,esk16_0)
    | ~ ssItem(esk16_0) ),
    inference(spm,[status(thm)],[161,304,theory(equality)]) ).

cnf(315,negated_conjecture,
    ( memberP(esk12_0,esk16_0)
    | $false ),
    inference(rw,[status(thm)],[308,306,theory(equality)]) ).

cnf(316,negated_conjecture,
    memberP(esk12_0,esk16_0),
    inference(cn,[status(thm)],[315,theory(equality)]) ).

cnf(347,negated_conjecture,
    ( memberP(esk15_0,esk16_0)
    | ~ ssItem(esk16_0) ),
    inference(spm,[status(thm)],[162,316,theory(equality)]) ).

cnf(355,negated_conjecture,
    ( $false
    | ~ memberP(esk15_0,esk16_0) ),
    inference(rw,[status(thm)],[302,316,theory(equality)]) ).

cnf(356,negated_conjecture,
    ~ memberP(esk15_0,esk16_0),
    inference(cn,[status(thm)],[355,theory(equality)]) ).

cnf(357,negated_conjecture,
    ( memberP(esk15_0,esk16_0)
    | $false ),
    inference(rw,[status(thm)],[347,306,theory(equality)]) ).

cnf(358,negated_conjecture,
    memberP(esk15_0,esk16_0),
    inference(cn,[status(thm)],[357,theory(equality)]) ).

cnf(405,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[356,358,theory(equality)]) ).

cnf(406,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[405,theory(equality)]) ).

cnf(407,negated_conjecture,
    $false,
    406,
    [proof] ).

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