↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC364+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n026.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  : 300s
% DateTime : Tue May  5 05:19:21 PM UTC 2026

% Result   : Theorem 1.68s 1.84s
% Output   : CNFRefutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   78 (  22 unt;   0 def)
%            Number of atoms       :  284 (  63 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  348 ( 142   ~; 142   |;  26   &)
%                                         (   3 <=>;  35  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :  115 (   0 sgn  60   !;   4   ?)

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(c_0_13,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(cons(X5,nil),X3) != X4 )
                          | segmentP(X2,X1) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_14,negated_conjecture,
    ( ssList(esk48_0)
    & ssList(esk49_0)
    & ssList(esk50_0)
    & ssList(esk51_0)
    & esk49_0 = esk51_0
    & esk48_0 = esk50_0
    & ( neq(esk49_0,nil)
      | neq(esk49_0,nil) )
    & ( ~ neq(esk51_0,nil)
      | neq(esk49_0,nil) )
    & ( neq(esk49_0,nil)
      | ssItem(esk52_0) )
    & ( ~ neq(esk51_0,nil)
      | ssItem(esk52_0) )
    & ( neq(esk49_0,nil)
      | app(cons(esk52_0,nil),esk50_0) = esk51_0 )
    & ( ~ neq(esk51_0,nil)
      | app(cons(esk52_0,nil),esk50_0) = esk51_0 )
    & ( neq(esk49_0,nil)
      | ~ segmentP(esk49_0,esk48_0) )
    & ( ~ neq(esk51_0,nil)
      | ~ segmentP(esk49_0,esk48_0) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).

fof(c_0_15,plain,
    ! [X232,X233,X235] :
      ( ( ssList(esk7_2(X232,X233))
        | ~ rearsegP(X232,X233)
        | ~ ssList(X233)
        | ~ ssList(X232) )
      & ( app(esk7_2(X232,X233),X233) = X232
        | ~ rearsegP(X232,X233)
        | ~ ssList(X233)
        | ~ ssList(X232) )
      & ( ~ ssList(X235)
        | app(X235,X233) != X232
        | rearsegP(X232,X233)
        | ~ ssList(X233)
        | ~ ssList(X232) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])]) ).

fof(c_0_16,plain,
    ! [X338,X339] :
      ( ~ ssList(X338)
      | ~ ssList(X339)
      | ssList(app(X338,X339)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

cnf(c_0_17,negated_conjecture,
    ( neq(esk49_0,nil)
    | neq(esk49_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( rearsegP(X3,X2)
    | ~ ssList(X1)
    | app(X1,X2) != X3
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_20,negated_conjecture,
    ( app(cons(esk52_0,nil),esk50_0) = esk51_0
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    neq(esk49_0,nil),
    inference(cn,[status(thm)],[c_0_17]) ).

fof(c_0_24,plain,
    ! [X428,X429] :
      ( ~ ssList(X428)
      | ~ ssItem(X429)
      | cons(X429,X428) = app(cons(X429,nil),X428) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).

cnf(c_0_25,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_26,plain,
    ! [X422,X423,X424] :
      ( ~ ssList(X422)
      | ~ ssList(X423)
      | ~ ssList(X424)
      | app(X424,X423) != app(X422,X423)
      | X424 = X422 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).

cnf(c_0_27,plain,
    ( rearsegP(app(X1,X2),X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]) ).

cnf(c_0_28,negated_conjecture,
    app(cons(esk52_0,nil),esk48_0) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]),c_0_23])]) ).

cnf(c_0_29,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_30,plain,
    ! [X319,X320] :
      ( ~ ssList(X319)
      | ~ ssItem(X320)
      | ssList(cons(X320,X319)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

fof(c_0_31,plain,
    ! [X340,X341,X342] :
      ( ~ ssList(X340)
      | ~ ssList(X341)
      | ~ ssItem(X342)
      | cons(X342,app(X341,X340)) = app(cons(X342,X341),X340) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).

cnf(c_0_32,plain,
    ( cons(X2,X1) = app(cons(X2,nil),X1)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ssItem(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_23])]) ).

cnf(c_0_34,plain,
    ( X3 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X3,X2) != app(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    ( rearsegP(esk49_0,esk48_0)
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

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

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

fof(c_0_38,plain,
    ! [X228,X229,X231] :
      ( ( ssList(esk6_2(X228,X229))
        | ~ frontsegP(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( app(X229,esk6_2(X228,X229)) = X228
        | ~ frontsegP(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( ~ ssList(X231)
        | app(X229,X231) != X228
        | frontsegP(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).

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

cnf(c_0_40,negated_conjecture,
    cons(esk52_0,esk48_0) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_29]),c_0_33])]) ).

fof(c_0_41,plain,
    ! [X435] :
      ( ~ ssList(X435)
      | app(X435,nil) = X435 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_42,negated_conjecture,
    ( X1 = cons(esk52_0,nil)
    | app(X1,esk48_0) != esk49_0
    | ~ ssList(cons(esk52_0,nil))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_29])]) ).

cnf(c_0_43,plain,
    ( app(esk7_2(X1,X2),X2) = X1
    | ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_44,negated_conjecture,
    rearsegP(esk49_0,esk48_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_33])]) ).

cnf(c_0_45,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_46,plain,
    ( ssList(esk7_2(X1,X2))
    | ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_48,negated_conjecture,
    ( cons(esk52_0,app(esk48_0,X1)) = app(esk49_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_29]),c_0_33])]) ).

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

fof(c_0_50,plain,
    ! [X236,X237,X240,X241] :
      ( ( ssList(esk8_2(X236,X237))
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( ssList(esk9_2(X236,X237))
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( app(app(esk8_2(X236,X237),X237),esk9_2(X236,X237)) = X236
        | ~ segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) )
      & ( ~ ssList(X240)
        | ~ ssList(X241)
        | app(app(X240,X237),X241) != X236
        | segmentP(X236,X237)
        | ~ ssList(X237)
        | ~ ssList(X236) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).

cnf(c_0_51,negated_conjecture,
    ( X1 = cons(esk52_0,nil)
    | app(X1,esk48_0) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_37]),c_0_33])]) ).

cnf(c_0_52,negated_conjecture,
    app(esk7_2(esk49_0,esk48_0),esk48_0) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29]),c_0_45])]) ).

cnf(c_0_53,negated_conjecture,
    ssList(esk7_2(esk49_0,esk48_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_29]),c_0_45])]) ).

fof(c_0_54,plain,
    ! [X425,X426,X427] :
      ( ~ ssList(X425)
      | ~ ssList(X426)
      | ~ ssList(X427)
      | app(X426,X427) != app(X426,X425)
      | X427 = X425 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).

cnf(c_0_55,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_19]) ).

cnf(c_0_56,negated_conjecture,
    app(esk49_0,nil) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_40]),c_0_37]),c_0_29])]) ).

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

cnf(c_0_58,negated_conjecture,
    esk7_2(esk49_0,esk48_0) = cons(esk52_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).

cnf(c_0_59,negated_conjecture,
    ( ssList(app(esk49_0,X1))
    | ~ ssList(app(esk48_0,X1))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_48]),c_0_33])]) ).

fof(c_0_60,plain,
    ! [X371] :
      ( ~ ssList(X371)
      | frontsegP(X371,X371) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).

cnf(c_0_61,plain,
    ( X3 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X2,X3) != app(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_62,plain,
    ( app(X1,esk6_2(X2,X1)) = X2
    | ~ frontsegP(X2,X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_63,negated_conjecture,
    frontsegP(esk49_0,esk49_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_45]),c_0_37])]) ).

cnf(c_0_64,plain,
    ( ssList(esk6_2(X1,X2))
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_65,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_57]) ).

cnf(c_0_66,negated_conjecture,
    ssList(cons(esk52_0,nil)),
    inference(rw,[status(thm)],[c_0_53,c_0_58]) ).

cnf(c_0_67,negated_conjecture,
    ( ssList(app(esk49_0,X1))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_19]),c_0_29])]) ).

cnf(c_0_68,plain,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_60]) ).

cnf(c_0_69,plain,
    ( X1 = nil
    | app(X2,X1) != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_49]),c_0_37])]) ).

cnf(c_0_70,negated_conjecture,
    app(esk49_0,esk6_2(esk49_0,esk49_0)) = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_45])]) ).

cnf(c_0_71,negated_conjecture,
    ssList(esk6_2(esk49_0,esk49_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_63]),c_0_45])]) ).

cnf(c_0_72,negated_conjecture,
    ( ~ neq(esk51_0,nil)
    | ~ segmentP(esk49_0,esk48_0) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_73,negated_conjecture,
    ( segmentP(app(esk49_0,X1),esk48_0)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_28]),c_0_29])]),c_0_66])]),c_0_67]) ).

cnf(c_0_74,plain,
    ( app(X1,esk6_2(X1,X1)) = X1
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_68]) ).

cnf(c_0_75,negated_conjecture,
    esk6_2(esk49_0,esk49_0) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_45]),c_0_71])]) ).

cnf(c_0_76,negated_conjecture,
    ~ segmentP(esk49_0,esk48_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_22]),c_0_23])]) ).

cnf(c_0_77,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_37]),c_0_45])]),c_0_76]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC364+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34  % Computer : n026.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Tue May  5 04:47:23 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.68/1.84  % Version  : CSE_E---1.7
% 1.68/1.84  % Problem  : theBenchmark.p
% 1.68/1.84  % SZS status Theorem for theBenchmark.p
% 1.68/1.84  % SZS output start CNFRefutation
% See solution above
% 1.68/1.84  % Total time : 1.376s
%------------------------------------------------------------------------------