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

View Problem - Process Solution

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

% Computer : art03.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:16:54 EST 2010

% Result   : Theorem 0.18s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   26 (   8 unt;   0 def)
%            Number of atoms       :  145 (  44 equ)
%            Maximal formula atoms :   24 (   5 avg)
%            Number of connectives :  168 (  49   ~;  45   |;  59   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  20   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(19,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ( ( ~ neq(X2,nil)
                        | ? [X5] :
                            ( ssItem(X5)
                            & app(X1,cons(X5,nil)) = X2 )
                        | ! [X6] :
                            ( ssItem(X6)
                           => app(X3,cons(X6,nil)) != X4 ) )
                      & ( ~ neq(X2,nil)
                        | neq(X4,nil) ) ) ) ) ) ) ),
    file('/tmp/tmp2i6Xnw/sel_SWC097+1.p_1',co1) ).

fof(20,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ( ( ~ neq(X2,nil)
                          | ? [X5] :
                              ( ssItem(X5)
                              & app(X1,cons(X5,nil)) = X2 )
                          | ! [X6] :
                              ( ssItem(X6)
                             => app(X3,cons(X6,nil)) != X4 ) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[19]) ).

fof(21,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ( ( ~ neq(X2,nil)
                          | ? [X5] :
                              ( ssItem(X5)
                              & app(X1,cons(X5,nil)) = X2 )
                          | ! [X6] :
                              ( ssItem(X6)
                             => app(X3,cons(X6,nil)) != X4 ) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).

fof(102,negated_conjecture,
    ? [X1] :
      ( ssList(X1)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & X2 = X4
                  & X1 = X3
                  & ( ( neq(X2,nil)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | app(X1,cons(X5,nil)) != X2 )
                      & ? [X6] :
                          ( ssItem(X6)
                          & app(X3,cons(X6,nil)) = X4 ) )
                    | ( neq(X2,nil)
                      & ~ neq(X4,nil) ) ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(103,negated_conjecture,
    ? [X7] :
      ( ssList(X7)
      & ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( ssList(X9)
              & ? [X10] :
                  ( ssList(X10)
                  & X8 = X10
                  & X7 = X9
                  & ( ( neq(X8,nil)
                      & ! [X11] :
                          ( ~ ssItem(X11)
                          | app(X7,cons(X11,nil)) != X8 )
                      & ? [X12] :
                          ( ssItem(X12)
                          & app(X9,cons(X12,nil)) = X10 ) )
                    | ( neq(X8,nil)
                      & ~ neq(X10,nil) ) ) ) ) ) ),
    inference(variable_rename,[status(thm)],[102]) ).

fof(104,negated_conjecture,
    ( ssList(esk5_0)
    & ssList(esk6_0)
    & ssList(esk7_0)
    & ssList(esk8_0)
    & esk6_0 = esk8_0
    & esk5_0 = esk7_0
    & ( ( neq(esk6_0,nil)
        & ! [X11] :
            ( ~ ssItem(X11)
            | app(esk5_0,cons(X11,nil)) != esk6_0 )
        & ssItem(esk9_0)
        & app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
      | ( neq(esk6_0,nil)
        & ~ neq(esk8_0,nil) ) ) ),
    inference(skolemize,[status(esa)],[103]) ).

fof(105,negated_conjecture,
    ! [X11] :
      ( ( ( ( ~ ssItem(X11)
            | app(esk5_0,cons(X11,nil)) != esk6_0 )
          & neq(esk6_0,nil)
          & ssItem(esk9_0)
          & app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
        | ( neq(esk6_0,nil)
          & ~ neq(esk8_0,nil) ) )
      & esk6_0 = esk8_0
      & esk5_0 = esk7_0
      & ssList(esk8_0)
      & ssList(esk7_0)
      & ssList(esk6_0)
      & ssList(esk5_0) ),
    inference(shift_quantors,[status(thm)],[104]) ).

fof(106,negated_conjecture,
    ! [X11] :
      ( ( neq(esk6_0,nil)
        | ~ ssItem(X11)
        | app(esk5_0,cons(X11,nil)) != esk6_0 )
      & ( ~ neq(esk8_0,nil)
        | ~ ssItem(X11)
        | app(esk5_0,cons(X11,nil)) != esk6_0 )
      & ( neq(esk6_0,nil)
        | neq(esk6_0,nil) )
      & ( ~ neq(esk8_0,nil)
        | neq(esk6_0,nil) )
      & ( neq(esk6_0,nil)
        | ssItem(esk9_0) )
      & ( ~ neq(esk8_0,nil)
        | ssItem(esk9_0) )
      & ( neq(esk6_0,nil)
        | app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
      & ( ~ neq(esk8_0,nil)
        | app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
      & esk6_0 = esk8_0
      & esk5_0 = esk7_0
      & ssList(esk8_0)
      & ssList(esk7_0)
      & ssList(esk6_0)
      & ssList(esk5_0) ),
    inference(distribute,[status(thm)],[105]) ).

cnf(111,negated_conjecture,
    esk5_0 = esk7_0,
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(112,negated_conjecture,
    esk6_0 = esk8_0,
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(113,negated_conjecture,
    ( app(esk7_0,cons(esk9_0,nil)) = esk8_0
    | ~ neq(esk8_0,nil) ),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(115,negated_conjecture,
    ( ssItem(esk9_0)
    | ~ neq(esk8_0,nil) ),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(118,negated_conjecture,
    ( neq(esk6_0,nil)
    | neq(esk6_0,nil) ),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(119,negated_conjecture,
    ( app(esk5_0,cons(X1,nil)) != esk6_0
    | ~ ssItem(X1)
    | ~ neq(esk8_0,nil) ),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(126,negated_conjecture,
    ( ssItem(esk9_0)
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,112,theory(equality)]),118,theory(equality)]) ).

cnf(127,negated_conjecture,
    ssItem(esk9_0),
    inference(cn,[status(thm)],[126,theory(equality)]) ).

cnf(140,negated_conjecture,
    ( app(esk5_0,cons(esk9_0,nil)) = esk8_0
    | ~ neq(esk8_0,nil) ),
    inference(rw,[status(thm)],[113,111,theory(equality)]) ).

cnf(141,negated_conjecture,
    ( app(esk5_0,cons(esk9_0,nil)) = esk6_0
    | ~ neq(esk8_0,nil) ),
    inference(rw,[status(thm)],[140,112,theory(equality)]) ).

cnf(142,negated_conjecture,
    ( app(esk5_0,cons(esk9_0,nil)) = esk6_0
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[141,112,theory(equality)]),118,theory(equality)]) ).

cnf(143,negated_conjecture,
    app(esk5_0,cons(esk9_0,nil)) = esk6_0,
    inference(cn,[status(thm)],[142,theory(equality)]) ).

cnf(172,negated_conjecture,
    ( app(esk5_0,cons(X1,nil)) != esk6_0
    | ~ ssItem(X1)
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[119,112,theory(equality)]),118,theory(equality)]) ).

cnf(173,negated_conjecture,
    ( app(esk5_0,cons(X1,nil)) != esk6_0
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[172,theory(equality)]) ).

cnf(174,negated_conjecture,
    ~ ssItem(esk9_0),
    inference(spm,[status(thm)],[173,143,theory(equality)]) ).

cnf(175,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[174,127,theory(equality)]) ).

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

cnf(177,negated_conjecture,
    $false,
    176,
    [proof] ).

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