TSTP Solution File: SWC396+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWC396+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 20:15:25 EDT 2022

% Result   : Theorem 8.87s 2.41s
% Output   : CNFRefutation 8.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   85 (  16 unt;   0 def)
%            Number of atoms       :  390 ( 127 equ)
%            Maximal formula atoms :   25 (   4 avg)
%            Number of connectives :  494 ( 189   ~; 213   |;  48   &)
%                                         (   5 <=>;  39  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   6 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :  114 (   0 sgn  64   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ! [X5] :
                        ( ssItem(X5)
                       => ( ~ memberP(X1,X5)
                          | memberP(X2,X5) ) )
                    | ( nil != X3
                      & nil = X4 )
                    | ( neq(X4,nil)
                      & ( ~ neq(X3,nil)
                        | ? [X6] :
                            ( ssList(X6)
                            & X4 != X6
                            & ? [X7] :
                                ( ssList(X7)
                                & ? [X8] :
                                    ( ssList(X8)
                                    & tl(X3) = X7
                                    & app(X7,X8) = X6
                                    & ? [X9] :
                                        ( ssItem(X9)
                                        & cons(X9,nil) = X8
                                        & hd(X3) = X9
                                        & neq(nil,X3) )
                                    & neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(ax26,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ssList(app(X1,X2)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).

fof(ax24,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => ssList(tl(X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(ax22,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => ssItem(hd(X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).

fof(ax16,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ssList(cons(X2,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).

fof(ax78,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => cons(hd(X1),tl(X1)) = X1 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).

fof(ax86,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil != X1
           => tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).

fof(ax83,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil = app(X1,X2)
          <=> ( nil = X2
              & nil = X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).

fof(ax85,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil != X1
           => hd(app(X1,X2)) = hd(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).

fof(ax36,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( memberP(app(X2,X3),X1)
              <=> ( memberP(X2,X1)
                  | memberP(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).

fof(ax3,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ( memberP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).

fof(ax37,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( memberP(cons(X2,X3),X1)
              <=> ( X1 = X2
                  | memberP(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).

fof(ax38,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).

fof(c_0_15,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ! [X5] :
                          ( ssItem(X5)
                         => ( ~ memberP(X1,X5)
                            | memberP(X2,X5) ) )
                      | ( nil != X3
                        & nil = X4 )
                      | ( neq(X4,nil)
                        & ( ~ neq(X3,nil)
                          | ? [X6] :
                              ( ssList(X6)
                              & X4 != X6
                              & ? [X7] :
                                  ( ssList(X7)
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & tl(X3) = X7
                                      & app(X7,X8) = X6
                                      & ? [X9] :
                                          ( ssItem(X9)
                                          & cons(X9,nil) = X8
                                          & hd(X3) = X9
                                          & neq(nil,X3) )
                                      & neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_16,negated_conjecture,
    ! [X259,X260,X261,X262] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ssItem(esk52_0)
      & memberP(esk48_0,esk52_0)
      & ~ memberP(esk49_0,esk52_0)
      & ( nil = esk50_0
        | nil != esk51_0 )
      & ( neq(esk50_0,nil)
        | ~ neq(esk51_0,nil) )
      & ( ~ ssList(X259)
        | esk51_0 = X259
        | ~ ssList(X260)
        | ~ ssList(X261)
        | tl(esk50_0) != X260
        | app(X260,X261) != X259
        | ~ ssItem(X262)
        | cons(X262,nil) != X261
        | hd(esk50_0) != X262
        | ~ neq(nil,esk50_0)
        | ~ neq(nil,esk50_0)
        | ~ neq(esk51_0,nil) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_15])])])])])]) ).

cnf(c_0_17,negated_conjecture,
    ( esk51_0 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | tl(esk50_0) != X2
    | app(X2,X3) != X1
    | ~ ssItem(X4)
    | cons(X4,nil) != X3
    | hd(esk50_0) != X4
    | ~ neq(nil,esk50_0)
    | ~ neq(nil,esk50_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_18,plain,
    ! [X133,X134] :
      ( ~ ssList(X133)
      | ~ ssList(X134)
      | ssList(app(X133,X134)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

cnf(c_0_19,negated_conjecture,
    ( esk51_0 = X1
    | hd(esk50_0) != X4
    | tl(esk50_0) != X2
    | app(X2,X3) != X1
    | cons(X4,nil) != X3
    | ~ ssItem(X4)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ neq(nil,esk50_0)
    | ~ neq(esk51_0,nil) ),
    inference(cn,[status(thm)],[c_0_17]) ).

cnf(c_0_20,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_21,plain,
    ! [X130] :
      ( ~ ssList(X130)
      | nil = X130
      | ssList(tl(X130)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).

cnf(c_0_22,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | ~ ssList(cons(hd(esk50_0),nil))
    | ~ ssList(tl(esk50_0))
    | ~ neq(nil,esk50_0)
    | ~ neq(esk51_0,nil)
    | ~ ssItem(hd(esk50_0)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])])])]),c_0_20]) ).

cnf(c_0_25,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_27,plain,
    ! [X112,X113] :
      ( ( ~ neq(X112,X113)
        | X112 != X113
        | ~ ssList(X113)
        | ~ ssList(X112) )
      & ( X112 = X113
        | neq(X112,X113)
        | ~ ssList(X113)
        | ~ ssList(X112) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).

cnf(c_0_28,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil))
    | ~ neq(nil,esk50_0)
    | ~ neq(esk51_0,nil)
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_29,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_30,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_31,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_32,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_33,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil))
    | ~ neq(esk51_0,nil)
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    ( nil = esk50_0
    | nil != esk51_0 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_36,plain,
    ! [X127] :
      ( ~ ssList(X127)
      | nil = X127
      | ssItem(hd(X127)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).

cnf(c_0_37,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil))
    | ~ ssItem(hd(esk50_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_30]),c_0_34])]),c_0_35]) ).

cnf(c_0_38,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

fof(c_0_39,plain,
    ! [X114,X115] :
      ( ~ ssList(X114)
      | ~ ssItem(X115)
      | ssList(cons(X115,X114)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

fof(c_0_40,plain,
    ! [X216] :
      ( ~ ssList(X216)
      | nil = X216
      | cons(hd(X216),tl(X216)) = X216 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).

fof(c_0_41,plain,
    ! [X233,X234] :
      ( ~ ssList(X233)
      | ~ ssList(X234)
      | nil = X233
      | tl(app(X233,X234)) = app(tl(X233),X234) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])]) ).

fof(c_0_42,plain,
    ! [X228,X229] :
      ( ( nil = X229
        | nil != app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( nil = X228
        | nil != app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( nil != X229
        | nil != X228
        | nil = app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).

cnf(c_0_43,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26])]) ).

cnf(c_0_44,plain,
    ( ssList(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_45,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_46,plain,
    ( nil = X1
    | tl(app(X1,X2)) = app(tl(X1),X2)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_47,plain,
    ( nil = X1
    | nil != app(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_48,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30])]) ).

cnf(c_0_49,plain,
    ( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
    | nil = X1
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20]),c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    ( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
    | esk50_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_26])]) ).

cnf(c_0_51,negated_conjecture,
    ( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26])]) ).

cnf(c_0_52,negated_conjecture,
    ( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
    | esk50_0 = nil
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_44]),c_0_30])]) ).

fof(c_0_53,plain,
    ! [X231,X232] :
      ( ~ ssList(X231)
      | ~ ssList(X232)
      | nil = X231
      | hd(app(X231,X232)) = hd(X231) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).

cnf(c_0_54,negated_conjecture,
    ( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
    | esk50_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_38]),c_0_26])]) ).

cnf(c_0_55,plain,
    ( nil = X1
    | hd(app(X1,X2)) = hd(X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

fof(c_0_56,plain,
    ! [X154,X155,X156] :
      ( ( ~ memberP(app(X155,X156),X154)
        | memberP(X155,X154)
        | memberP(X156,X154)
        | ~ ssList(X156)
        | ~ ssList(X155)
        | ~ ssItem(X154) )
      & ( ~ memberP(X155,X154)
        | memberP(app(X155,X156),X154)
        | ~ ssList(X156)
        | ~ ssList(X155)
        | ~ ssItem(X154) )
      & ( ~ memberP(X156,X154)
        | memberP(app(X155,X156),X154)
        | ~ ssList(X156)
        | ~ ssList(X155)
        | ~ ssItem(X154) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).

cnf(c_0_57,negated_conjecture,
    memberP(esk48_0,esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_58,negated_conjecture,
    ( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
    | esk50_0 = nil
    | ~ ssList(cons(hd(esk50_0),nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_26])]) ).

cnf(c_0_59,plain,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

cnf(c_0_60,negated_conjecture,
    memberP(esk50_0,esk52_0),
    inference(rw,[status(thm)],[c_0_57,c_0_23]) ).

cnf(c_0_61,negated_conjecture,
    ssItem(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_62,negated_conjecture,
    ( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
    | esk50_0 = nil
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_44]),c_0_30])]) ).

fof(c_0_63,plain,
    ! [X14,X15,X18,X19] :
      ( ( ssList(esk3_2(X14,X15))
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( ssList(esk4_2(X14,X15))
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( app(esk3_2(X14,X15),cons(X15,esk4_2(X14,X15))) = X14
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( ~ ssList(X18)
        | ~ ssList(X19)
        | app(X18,cons(X15,X19)) != X14
        | memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).

cnf(c_0_64,negated_conjecture,
    ( memberP(app(esk50_0,X1),esk52_0)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_26]),c_0_61])]) ).

cnf(c_0_65,negated_conjecture,
    ( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
    | esk50_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_38]),c_0_26])]) ).

cnf(c_0_66,plain,
    ( memberP(X4,X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,cons(X3,X2)) != X4
    | ~ ssItem(X3)
    | ~ ssList(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    ( esk50_0 = nil
    | memberP(cons(hd(esk50_0),esk51_0),esk52_0)
    | ~ ssList(cons(hd(esk50_0),nil)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,plain,
    ( memberP(app(X1,cons(X2,X3)),X2)
    | ~ ssList(app(X1,cons(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(er,[status(thm)],[c_0_66]) ).

fof(c_0_69,plain,
    ! [X157,X158,X159] :
      ( ( ~ memberP(cons(X158,X159),X157)
        | X157 = X158
        | memberP(X159,X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) )
      & ( X157 != X158
        | memberP(cons(X158,X159),X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) )
      & ( ~ memberP(X159,X157)
        | memberP(cons(X158,X159),X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).

cnf(c_0_70,negated_conjecture,
    ( esk50_0 = nil
    | memberP(cons(hd(esk50_0),esk51_0),esk52_0)
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_44]),c_0_30])]) ).

cnf(c_0_71,negated_conjecture,
    ~ memberP(esk49_0,esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_72,negated_conjecture,
    ( esk50_0 = nil
    | memberP(esk51_0,hd(esk50_0))
    | ~ ssList(tl(esk50_0))
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_50]),c_0_34]),c_0_30])]) ).

cnf(c_0_73,plain,
    ( X3 = X1
    | memberP(X2,X3)
    | ~ memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_69]) ).

cnf(c_0_74,negated_conjecture,
    ( esk50_0 = nil
    | memberP(cons(hd(esk50_0),esk51_0),esk52_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_38]),c_0_26])]) ).

cnf(c_0_75,negated_conjecture,
    ~ memberP(esk51_0,esk52_0),
    inference(rw,[status(thm)],[c_0_71,c_0_32]) ).

cnf(c_0_76,negated_conjecture,
    ( esk50_0 = nil
    | memberP(esk51_0,hd(esk50_0))
    | ~ ssItem(hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_25]),c_0_26])]) ).

cnf(c_0_77,negated_conjecture,
    ( hd(esk50_0) = esk52_0
    | esk50_0 = nil
    | ~ ssItem(hd(esk50_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_34]),c_0_61])]),c_0_75]) ).

cnf(c_0_78,negated_conjecture,
    ( esk50_0 = nil
    | memberP(esk51_0,hd(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_38]),c_0_26])]) ).

cnf(c_0_79,negated_conjecture,
    ( hd(esk50_0) = esk52_0
    | esk50_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_38]),c_0_26])]) ).

fof(c_0_80,plain,
    ! [X160] :
      ( ~ ssItem(X160)
      | ~ memberP(nil,X160) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).

cnf(c_0_81,negated_conjecture,
    esk50_0 = nil,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_75]) ).

cnf(c_0_82,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_80]) ).

cnf(c_0_83,negated_conjecture,
    memberP(nil,esk52_0),
    inference(rw,[status(thm)],[c_0_60,c_0_81]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_61])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC396+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 20:43:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.87/2.41  # ENIGMATIC: Solved by autoschedule:
% 8.87/2.41  # No SInE strategy applied
% 8.87/2.41  # Trying AutoSched0 for 150 seconds
% 8.87/2.41  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.87/2.41  # and selection function SelectNewComplexAHP.
% 8.87/2.41  #
% 8.87/2.41  # Preprocessing time       : 0.036 s
% 8.87/2.41  # Presaturation interreduction done
% 8.87/2.41  
% 8.87/2.41  # Proof found!
% 8.87/2.41  # SZS status Theorem
% 8.87/2.41  # SZS output start CNFRefutation
% See solution above
% 8.87/2.41  # Training examples: 0 positive, 0 negative
% 8.87/2.41  
% 8.87/2.41  # -------------------------------------------------
% 8.87/2.41  # User time                : 0.113 s
% 8.87/2.41  # System time              : 0.007 s
% 8.87/2.41  # Total time               : 0.120 s
% 8.87/2.41  # Maximum resident set size: 7124 pages
% 8.87/2.41  
%------------------------------------------------------------------------------