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

View Problem - Process Solution

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

% Computer : art01.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 11:36:12 EST 2010

% Result   : Theorem 0.46s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   72 (  13 unt;   0 def)
%            Number of atoms       :  409 ( 127 equ)
%            Maximal formula atoms :   44 (   5 avg)
%            Number of connectives :  528 ( 191   ~; 200   |; 114   &)
%                                         (   2 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :  107 (   0 sgn  68   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    strictorderedP(nil),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax69) ).

fof(3,axiom,
    ! [X1] :
      ( ssItem(X1)
     => strictorderedP(cons(X1,nil)) ),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax68) ).

fof(14,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => nil != cons(X2,X1) ) ),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax21) ).

fof(21,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( segmentP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(app(X3,X2),X4) = X1 ) ) ) ) ),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax7) ).

fof(30,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( segmentP(nil,X1)
      <=> nil = X1 ) ),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax58) ).

fof(44,axiom,
    ssList(nil),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',ax17) ).

fof(45,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | ( ! [X5] :
                        ( ssItem(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ! [X7] :
                                ( ~ ssList(X7)
                                | cons(X5,nil) != X3
                                | app(app(X6,X3),X7) != X4
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & memberP(X6,X8)
                                    & lt(X5,X8) )
                                | ? [X9] :
                                    ( ssItem(X9)
                                    & memberP(X7,X9)
                                    & lt(X9,X5) ) ) ) )
                    & ( nil != X4
                      | nil != X3 ) )
                  | ( segmentP(X2,X1)
                    & strictorderedP(X1) ) ) ) ) ),
    file('/tmp/tmpg3qbmw/sel_SWC346+1.p_1',co1) ).

fof(46,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ! [X6] :
                              ( ssList(X6)
                             => ! [X7] :
                                  ( ~ ssList(X7)
                                  | cons(X5,nil) != X3
                                  | app(app(X6,X3),X7) != X4
                                  | ? [X8] :
                                      ( ssItem(X8)
                                      & memberP(X6,X8)
                                      & lt(X5,X8) )
                                  | ? [X9] :
                                      ( ssItem(X9)
                                      & memberP(X7,X9)
                                      & lt(X9,X5) ) ) ) )
                      & ( nil != X4
                        | nil != X3 ) )
                    | ( segmentP(X2,X1)
                      & strictorderedP(X1) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[45]) ).

fof(50,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ! [X6] :
                              ( ssList(X6)
                             => ! [X7] :
                                  ( ~ ssList(X7)
                                  | cons(X5,nil) != X3
                                  | app(app(X6,X3),X7) != X4
                                  | ? [X8] :
                                      ( ssItem(X8)
                                      & memberP(X6,X8)
                                      & lt(X5,X8) )
                                  | ? [X9] :
                                      ( ssItem(X9)
                                      & memberP(X7,X9)
                                      & lt(X9,X5) ) ) ) )
                      & ( nil != X4
                        | nil != X3 ) )
                    | ( segmentP(X2,X1)
                      & strictorderedP(X1) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[46,theory(equality)]) ).

cnf(55,plain,
    strictorderedP(nil),
    inference(split_conjunct,[status(thm)],[2]) ).

fof(56,plain,
    ! [X1] :
      ( ~ ssItem(X1)
      | strictorderedP(cons(X1,nil)) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(57,plain,
    ! [X2] :
      ( ~ ssItem(X2)
      | strictorderedP(cons(X2,nil)) ),
    inference(variable_rename,[status(thm)],[56]) ).

cnf(58,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[57]) ).

fof(100,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ! [X2] :
          ( ~ ssItem(X2)
          | nil != cons(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[14]) ).

fof(101,plain,
    ! [X3] :
      ( ~ ssList(X3)
      | ! [X4] :
          ( ~ ssItem(X4)
          | nil != cons(X4,X3) ) ),
    inference(variable_rename,[status(thm)],[100]) ).

fof(102,plain,
    ! [X3,X4] :
      ( ~ ssItem(X4)
      | nil != cons(X4,X3)
      | ~ ssList(X3) ),
    inference(shift_quantors,[status(thm)],[101]) ).

cnf(103,plain,
    ( ~ ssList(X1)
    | nil != cons(X2,X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[102]) ).

fof(136,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ! [X2] :
          ( ~ ssList(X2)
          | ( ( ~ segmentP(X1,X2)
              | ? [X3] :
                  ( ssList(X3)
                  & ? [X4] :
                      ( ssList(X4)
                      & app(app(X3,X2),X4) = X1 ) ) )
            & ( ! [X3] :
                  ( ~ ssList(X3)
                  | ! [X4] :
                      ( ~ ssList(X4)
                      | app(app(X3,X2),X4) != X1 ) )
              | segmentP(X1,X2) ) ) ) ),
    inference(fof_nnf,[status(thm)],[21]) ).

fof(137,plain,
    ! [X5] :
      ( ~ ssList(X5)
      | ! [X6] :
          ( ~ ssList(X6)
          | ( ( ~ segmentP(X5,X6)
              | ? [X7] :
                  ( ssList(X7)
                  & ? [X8] :
                      ( ssList(X8)
                      & app(app(X7,X6),X8) = X5 ) ) )
            & ( ! [X9] :
                  ( ~ ssList(X9)
                  | ! [X10] :
                      ( ~ ssList(X10)
                      | app(app(X9,X6),X10) != X5 ) )
              | segmentP(X5,X6) ) ) ) ),
    inference(variable_rename,[status(thm)],[136]) ).

fof(138,plain,
    ! [X5] :
      ( ~ ssList(X5)
      | ! [X6] :
          ( ~ ssList(X6)
          | ( ( ~ segmentP(X5,X6)
              | ( ssList(esk7_2(X5,X6))
                & ssList(esk8_2(X5,X6))
                & app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5 ) )
            & ( ! [X9] :
                  ( ~ ssList(X9)
                  | ! [X10] :
                      ( ~ ssList(X10)
                      | app(app(X9,X6),X10) != X5 ) )
              | segmentP(X5,X6) ) ) ) ),
    inference(skolemize,[status(esa)],[137]) ).

fof(139,plain,
    ! [X5,X6,X9,X10] :
      ( ( ( ~ ssList(X10)
          | app(app(X9,X6),X10) != X5
          | ~ ssList(X9)
          | segmentP(X5,X6) )
        & ( ~ segmentP(X5,X6)
          | ( ssList(esk7_2(X5,X6))
            & ssList(esk8_2(X5,X6))
            & app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5 ) ) )
      | ~ ssList(X6)
      | ~ ssList(X5) ),
    inference(shift_quantors,[status(thm)],[138]) ).

fof(140,plain,
    ! [X5,X6,X9,X10] :
      ( ( ~ ssList(X10)
        | app(app(X9,X6),X10) != X5
        | ~ ssList(X9)
        | segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk7_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk8_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) ) ),
    inference(distribute,[status(thm)],[139]) ).

cnf(144,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X4) ),
    inference(split_conjunct,[status(thm)],[140]) ).

fof(182,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ( ( ~ segmentP(nil,X1)
          | nil = X1 )
        & ( nil != X1
          | segmentP(nil,X1) ) ) ),
    inference(fof_nnf,[status(thm)],[30]) ).

fof(183,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | ( ( ~ segmentP(nil,X2)
          | nil = X2 )
        & ( nil != X2
          | segmentP(nil,X2) ) ) ),
    inference(variable_rename,[status(thm)],[182]) ).

fof(184,plain,
    ! [X2] :
      ( ( ~ segmentP(nil,X2)
        | nil = X2
        | ~ ssList(X2) )
      & ( nil != X2
        | segmentP(nil,X2)
        | ~ ssList(X2) ) ),
    inference(distribute,[status(thm)],[183]) ).

cnf(185,plain,
    ( segmentP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[184]) ).

cnf(256,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[44]) ).

fof(257,negated_conjecture,
    ? [X1] :
      ( ssList(X1)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ssList(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & X2 = X4
                  & X1 = X3
                  & ( ? [X5] :
                        ( ssItem(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & ? [X7] :
                                ( ssList(X7)
                                & cons(X5,nil) = X3
                                & app(app(X6,X3),X7) = X4
                                & ! [X8] :
                                    ( ~ ssItem(X8)
                                    | ~ memberP(X6,X8)
                                    | ~ lt(X5,X8) )
                                & ! [X9] :
                                    ( ~ ssItem(X9)
                                    | ~ memberP(X7,X9)
                                    | ~ lt(X9,X5) ) ) ) )
                    | ( nil = X4
                      & nil = X3 ) )
                  & ( ~ segmentP(X2,X1)
                    | ~ strictorderedP(X1) ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[50]) ).

fof(258,negated_conjecture,
    ? [X10] :
      ( ssList(X10)
      & ? [X11] :
          ( ssList(X11)
          & ? [X12] :
              ( ssList(X12)
              & ? [X13] :
                  ( ssList(X13)
                  & X11 = X13
                  & X10 = X12
                  & ( ? [X14] :
                        ( ssItem(X14)
                        & ? [X15] :
                            ( ssList(X15)
                            & ? [X16] :
                                ( ssList(X16)
                                & cons(X14,nil) = X12
                                & app(app(X15,X12),X16) = X13
                                & ! [X17] :
                                    ( ~ ssItem(X17)
                                    | ~ memberP(X15,X17)
                                    | ~ lt(X14,X17) )
                                & ! [X18] :
                                    ( ~ ssItem(X18)
                                    | ~ memberP(X16,X18)
                                    | ~ lt(X18,X14) ) ) ) )
                    | ( nil = X13
                      & nil = X12 ) )
                  & ( ~ segmentP(X11,X10)
                    | ~ strictorderedP(X10) ) ) ) ) ),
    inference(variable_rename,[status(thm)],[257]) ).

fof(259,negated_conjecture,
    ( ssList(esk15_0)
    & ssList(esk16_0)
    & ssList(esk17_0)
    & ssList(esk18_0)
    & esk16_0 = esk18_0
    & esk15_0 = esk17_0
    & ( ( ssItem(esk19_0)
        & ssList(esk20_0)
        & ssList(esk21_0)
        & cons(esk19_0,nil) = esk17_0
        & app(app(esk20_0,esk17_0),esk21_0) = esk18_0
        & ! [X17] :
            ( ~ ssItem(X17)
            | ~ memberP(esk20_0,X17)
            | ~ lt(esk19_0,X17) )
        & ! [X18] :
            ( ~ ssItem(X18)
            | ~ memberP(esk21_0,X18)
            | ~ lt(X18,esk19_0) ) )
      | ( nil = esk18_0
        & nil = esk17_0 ) )
    & ( ~ segmentP(esk16_0,esk15_0)
      | ~ strictorderedP(esk15_0) ) ),
    inference(skolemize,[status(esa)],[258]) ).

fof(260,negated_conjecture,
    ! [X17,X18] :
      ( ( ( ( ~ ssItem(X18)
            | ~ memberP(esk21_0,X18)
            | ~ lt(X18,esk19_0) )
          & ( ~ ssItem(X17)
            | ~ memberP(esk20_0,X17)
            | ~ lt(esk19_0,X17) )
          & ssList(esk21_0)
          & cons(esk19_0,nil) = esk17_0
          & app(app(esk20_0,esk17_0),esk21_0) = esk18_0
          & ssList(esk20_0)
          & ssItem(esk19_0) )
        | ( nil = esk18_0
          & nil = esk17_0 ) )
      & ssList(esk18_0)
      & esk16_0 = esk18_0
      & esk15_0 = esk17_0
      & ( ~ segmentP(esk16_0,esk15_0)
        | ~ strictorderedP(esk15_0) )
      & ssList(esk17_0)
      & ssList(esk16_0)
      & ssList(esk15_0) ),
    inference(shift_quantors,[status(thm)],[259]) ).

fof(261,negated_conjecture,
    ! [X17,X18] :
      ( ( nil = esk18_0
        | ~ ssItem(X18)
        | ~ memberP(esk21_0,X18)
        | ~ lt(X18,esk19_0) )
      & ( nil = esk17_0
        | ~ ssItem(X18)
        | ~ memberP(esk21_0,X18)
        | ~ lt(X18,esk19_0) )
      & ( nil = esk18_0
        | ~ ssItem(X17)
        | ~ memberP(esk20_0,X17)
        | ~ lt(esk19_0,X17) )
      & ( nil = esk17_0
        | ~ ssItem(X17)
        | ~ memberP(esk20_0,X17)
        | ~ lt(esk19_0,X17) )
      & ( nil = esk18_0
        | ssList(esk21_0) )
      & ( nil = esk17_0
        | ssList(esk21_0) )
      & ( nil = esk18_0
        | cons(esk19_0,nil) = esk17_0 )
      & ( nil = esk17_0
        | cons(esk19_0,nil) = esk17_0 )
      & ( nil = esk18_0
        | app(app(esk20_0,esk17_0),esk21_0) = esk18_0 )
      & ( nil = esk17_0
        | app(app(esk20_0,esk17_0),esk21_0) = esk18_0 )
      & ( nil = esk18_0
        | ssList(esk20_0) )
      & ( nil = esk17_0
        | ssList(esk20_0) )
      & ( nil = esk18_0
        | ssItem(esk19_0) )
      & ( nil = esk17_0
        | ssItem(esk19_0) )
      & ssList(esk18_0)
      & esk16_0 = esk18_0
      & esk15_0 = esk17_0
      & ( ~ segmentP(esk16_0,esk15_0)
        | ~ strictorderedP(esk15_0) )
      & ssList(esk17_0)
      & ssList(esk16_0)
      & ssList(esk15_0) ),
    inference(distribute,[status(thm)],[260]) ).

cnf(262,negated_conjecture,
    ssList(esk15_0),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(263,negated_conjecture,
    ssList(esk16_0),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(265,negated_conjecture,
    ( ~ strictorderedP(esk15_0)
    | ~ segmentP(esk16_0,esk15_0) ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(266,negated_conjecture,
    esk15_0 = esk17_0,
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(267,negated_conjecture,
    esk16_0 = esk18_0,
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(269,negated_conjecture,
    ( ssItem(esk19_0)
    | nil = esk17_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(270,negated_conjecture,
    ( ssItem(esk19_0)
    | nil = esk18_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(271,negated_conjecture,
    ( ssList(esk20_0)
    | nil = esk17_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(273,negated_conjecture,
    ( app(app(esk20_0,esk17_0),esk21_0) = esk18_0
    | nil = esk17_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(275,negated_conjecture,
    ( cons(esk19_0,nil) = esk17_0
    | nil = esk17_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(276,negated_conjecture,
    ( cons(esk19_0,nil) = esk17_0
    | nil = esk18_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(277,negated_conjecture,
    ( ssList(esk21_0)
    | nil = esk17_0 ),
    inference(split_conjunct,[status(thm)],[261]) ).

cnf(283,negated_conjecture,
    ssList(esk17_0),
    inference(rw,[status(thm)],[262,266,theory(equality)]) ).

cnf(284,negated_conjecture,
    ssList(esk18_0),
    inference(rw,[status(thm)],[263,267,theory(equality)]) ).

cnf(285,negated_conjecture,
    ( ~ strictorderedP(esk17_0)
    | ~ segmentP(esk16_0,esk15_0) ),
    inference(rw,[status(thm)],[265,266,theory(equality)]) ).

cnf(286,negated_conjecture,
    ( ~ strictorderedP(esk17_0)
    | ~ segmentP(esk18_0,esk17_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[285,267,theory(equality)]),266,theory(equality)]) ).

cnf(287,negated_conjecture,
    ( strictorderedP(esk17_0)
    | esk17_0 = nil
    | ~ ssItem(esk19_0) ),
    inference(spm,[status(thm)],[58,275,theory(equality)]) ).

cnf(306,negated_conjecture,
    ( esk18_0 = nil
    | esk17_0 != nil
    | ~ ssList(nil)
    | ~ ssItem(esk19_0) ),
    inference(spm,[status(thm)],[103,276,theory(equality)]) ).

cnf(309,negated_conjecture,
    ( esk18_0 = nil
    | esk17_0 != nil
    | $false
    | ~ ssItem(esk19_0) ),
    inference(rw,[status(thm)],[306,256,theory(equality)]) ).

cnf(310,negated_conjecture,
    ( esk18_0 = nil
    | esk17_0 != nil
    | ~ ssItem(esk19_0) ),
    inference(cn,[status(thm)],[309,theory(equality)]) ).

cnf(592,negated_conjecture,
    ( segmentP(X1,esk17_0)
    | esk17_0 = nil
    | esk18_0 != X1
    | ~ ssList(esk21_0)
    | ~ ssList(esk20_0)
    | ~ ssList(esk17_0)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[144,273,theory(equality)]) ).

cnf(725,negated_conjecture,
    ( esk17_0 = nil
    | strictorderedP(esk17_0) ),
    inference(csr,[status(thm)],[287,269]) ).

cnf(726,negated_conjecture,
    ( esk18_0 = nil
    | esk17_0 != nil ),
    inference(csr,[status(thm)],[310,270]) ).

cnf(728,negated_conjecture,
    ( ~ segmentP(nil,esk17_0)
    | ~ strictorderedP(esk17_0)
    | esk17_0 != nil ),
    inference(spm,[status(thm)],[286,726,theory(equality)]) ).

cnf(731,negated_conjecture,
    ( esk17_0 != nil
    | ~ strictorderedP(esk17_0)
    | ~ ssList(esk17_0) ),
    inference(spm,[status(thm)],[728,185,theory(equality)]) ).

cnf(732,negated_conjecture,
    ( esk17_0 != nil
    | ~ strictorderedP(esk17_0)
    | $false ),
    inference(rw,[status(thm)],[731,283,theory(equality)]) ).

cnf(733,negated_conjecture,
    ( esk17_0 != nil
    | ~ strictorderedP(esk17_0) ),
    inference(cn,[status(thm)],[732,theory(equality)]) ).

cnf(3948,negated_conjecture,
    ( segmentP(X1,esk17_0)
    | esk17_0 = nil
    | esk18_0 != X1
    | ~ ssList(esk21_0)
    | ~ ssList(esk20_0)
    | $false
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[592,283,theory(equality)]) ).

cnf(3949,negated_conjecture,
    ( segmentP(X1,esk17_0)
    | esk17_0 = nil
    | esk18_0 != X1
    | ~ ssList(esk21_0)
    | ~ ssList(esk20_0)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[3948,theory(equality)]) ).

cnf(3950,negated_conjecture,
    ( esk17_0 = nil
    | segmentP(X1,esk17_0)
    | esk18_0 != X1
    | ~ ssList(esk21_0)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[3949,271]) ).

cnf(3951,negated_conjecture,
    ( esk17_0 = nil
    | segmentP(X1,esk17_0)
    | esk18_0 != X1
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[3950,277]) ).

cnf(3952,negated_conjecture,
    ( esk17_0 = nil
    | ~ strictorderedP(esk17_0)
    | ~ ssList(esk18_0) ),
    inference(spm,[status(thm)],[286,3951,theory(equality)]) ).

cnf(3956,negated_conjecture,
    ( esk17_0 = nil
    | ~ strictorderedP(esk17_0)
    | $false ),
    inference(rw,[status(thm)],[3952,284,theory(equality)]) ).

cnf(3957,negated_conjecture,
    ( esk17_0 = nil
    | ~ strictorderedP(esk17_0) ),
    inference(cn,[status(thm)],[3956,theory(equality)]) ).

cnf(3965,negated_conjecture,
    esk17_0 = nil,
    inference(csr,[status(thm)],[3957,725]) ).

cnf(4161,negated_conjecture,
    ( $false
    | ~ strictorderedP(esk17_0) ),
    inference(rw,[status(thm)],[733,3965,theory(equality)]) ).

cnf(4162,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[4161,3965,theory(equality)]),55,theory(equality)]) ).

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

cnf(4164,negated_conjecture,
    $false,
    4163,
    [proof] ).

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