↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC054+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:39:46 PM UTC 2026

% Result   : Theorem 0.12s 0.40s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  109 (  14 unt;  19 def)
%            Number of atoms       :  370 (  71 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  424 ( 163   ~; 157   |;  72   &)
%                                         (  21 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   25 (  23 usr;  19 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   79 (  60   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ? [U] :
      ( ? [V] :
          ( U != V
          & ssItem(V) )
      & ssItem(U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ( ( segmentP(V,W)
                  & segmentP(U,V) )
               => segmentP(U,W) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f58,axiom,
    ! [U] :
      ( ssList(U)
     => ( segmentP(nil,U)
      <=> nil = U ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ( ( ? [Z] :
                          ( segmentP(U,Z)
                          & segmentP(V,Z)
                          & neq(Z,nil)
                          & ssList(Z) )
                      | ~ neq(V,nil) )
                    & ( nil = U
                      | nil != V ) )
                  | ( neq(X,nil)
                    & ! [Y] :
                        ( ~ segmentP(W,Y)
                        | ~ segmentP(X,Y)
                        | ~ neq(Y,nil)
                        | ~ ssList(Y) ) )
                  | ( nil = X
                    & nil != W )
                  | U != W
                  | V != X
                  | ~ ssList(X) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f97,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ( ( ? [Z] :
                            ( segmentP(U,Z)
                            & segmentP(V,Z)
                            & neq(Z,nil)
                            & ssList(Z) )
                        | ~ neq(V,nil) )
                      & ( nil = U
                        | nil != V ) )
                    | ( neq(X,nil)
                      & ! [Y] :
                          ( ~ segmentP(W,Y)
                          | ~ segmentP(X,Y)
                          | ~ neq(Y,nil)
                          | ~ ssList(Y) ) )
                    | ( nil = X
                      & nil != W )
                    | U != W
                    | V != X
                    | ~ ssList(X) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f102,plain,
    ( sK0_skl != sK1_skl
    & ssItem(sK1_skl)
    & ssItem(sK0_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl)],[f2]) ).

fof(f105,plain,
    sK0_skl != sK1_skl,
    inference(cnf_transformation,[status(thm)],[f102]) ).

fof(f223,plain,
    ssList(nil),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f314,plain,
    ! [U] :
      ( ! [V] :
          ( ! [W] :
              ( segmentP(U,W)
              | ~ segmentP(V,W)
              | ~ segmentP(U,V)
              | ~ ssList(W) )
          | ~ ssList(V) )
      | ~ ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f53]) ).

fof(f315,plain,
    ! [X0,X1,X2] :
      ( segmentP(X0,X2)
      | ~ segmentP(X1,X2)
      | ~ segmentP(X0,X1)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f314]) ).

fof(f324,plain,
    ! [U] :
      ( ( segmentP(nil,U)
      <=> nil = U )
      | ~ ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f58]) ).

fof(f325,plain,
    ! [U] :
      ( ( ( nil != U
          | segmentP(nil,U) )
        & ( nil = U
          | ~ segmentP(nil,U) ) )
      | ~ ssList(U) ),
    inference(NNF_transformation,[status(thm)],[f324]) ).

fof(f327,plain,
    ! [X0] :
      ( nil != X0
      | segmentP(nil,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f325]) ).

fof(f415,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ( ! [Z] :
                          ( ~ segmentP(U,Z)
                          | ~ segmentP(V,Z)
                          | ~ neq(Z,nil)
                          | ~ ssList(Z) )
                      & neq(V,nil) )
                    | ( nil != U
                      & nil = V ) )
                  & ( ~ neq(X,nil)
                    | ? [Y] :
                        ( segmentP(W,Y)
                        & segmentP(X,Y)
                        & neq(Y,nil)
                        & ssList(Y) ) )
                  & ( nil != X
                    | nil = W )
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f97]) ).

fof(f416,definition,
    ! [U,V] :
      ( sP0_prd(V,U)
    <=> ( nil != U
        & nil = V ) ),
    introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).

fof(f417,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ? [X] :
                  ( ( ( ! [Z] :
                          ( ~ segmentP(U,Z)
                          | ~ segmentP(V,Z)
                          | ~ neq(Z,nil)
                          | ~ ssList(Z) )
                      & neq(V,nil) )
                    | sP0_prd(V,U) )
                  & ( ~ neq(X,nil)
                    | ? [Y] :
                        ( segmentP(W,Y)
                        & segmentP(X,Y)
                        & neq(Y,nil)
                        & ssList(Y) ) )
                  & ( nil != X
                    | nil = W )
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(formula_renaming,[status(thm)],[f415,f416]) ).

fof(f418,plain,
    ? [U] :
      ( ? [V] :
          ( ? [W] :
              ( ( ( ! [Z] :
                      ( ~ segmentP(U,Z)
                      | ~ segmentP(V,Z)
                      | ~ neq(Z,nil)
                      | ~ ssList(Z) )
                  & neq(V,nil) )
                | sP0_prd(V,U) )
              & ? [X] :
                  ( ( ~ neq(X,nil)
                    | ? [Y] :
                        ( segmentP(W,Y)
                        & segmentP(X,Y)
                        & neq(Y,nil)
                        & ssList(Y) ) )
                  & ( nil != X
                    | nil = W )
                  & U = W
                  & V = X
                  & ssList(X) )
              & ssList(W) )
          & ssList(V) )
      & ssList(U) ),
    inference(miniscoping,[status(thm)],[f417]) ).

fof(f419,plain,
    ( ( ( ! [Z] :
            ( ~ segmentP(sK47_skl,Z)
            | ~ segmentP(sK48_skl,Z)
            | ~ neq(Z,nil)
            | ~ ssList(Z) )
        & neq(sK48_skl,nil) )
      | sP0_prd(sK48_skl,sK47_skl) )
    & ( ~ neq(sK50_skl,nil)
      | ( segmentP(sK49_skl,sK51_skl)
        & segmentP(sK50_skl,sK51_skl)
        & neq(sK51_skl,nil)
        & ssList(sK51_skl) ) )
    & ( nil != sK50_skl
      | nil = sK49_skl )
    & sK47_skl = sK49_skl
    & sK48_skl = sK50_skl
    & ssList(sK50_skl)
    & ssList(sK49_skl)
    & ssList(sK48_skl)
    & ssList(sK47_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl,sK51_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Y,sK51_skl)],[f418]) ).

fof(f422,plain,
    ssList(sK49_skl),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f423,plain,
    ssList(sK50_skl),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f424,plain,
    sK48_skl = sK50_skl,
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f425,plain,
    sK47_skl = sK49_skl,
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f426,plain,
    ( nil != sK50_skl
    | nil = sK49_skl ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f427,plain,
    ( ~ neq(sK50_skl,nil)
    | ssList(sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f428,plain,
    ( ~ neq(sK50_skl,nil)
    | neq(sK51_skl,nil) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f429,plain,
    ( ~ neq(sK50_skl,nil)
    | segmentP(sK50_skl,sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f430,plain,
    ( ~ neq(sK50_skl,nil)
    | segmentP(sK49_skl,sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f431,plain,
    ( neq(sK48_skl,nil)
    | sP0_prd(sK48_skl,sK47_skl) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f432,plain,
    ! [X0] :
      ( ~ segmentP(sK47_skl,X0)
      | ~ segmentP(sK48_skl,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0)
      | sP0_prd(sK48_skl,sK47_skl) ),
    inference(cnf_transformation,[status(thm)],[f419]) ).

fof(f433,plain,
    ! [U,V] :
      ( ( nil = U
        | nil != V
        | sP0_prd(V,U) )
      & ( ( nil != U
          & nil = V )
        | ~ sP0_prd(V,U) ) ),
    inference(NNF_transformation,[status(thm)],[f416]) ).

fof(f434,plain,
    ( ! [U,V] :
        ( nil = U
        | nil != V
        | sP0_prd(V,U) )
    & ! [U,V] :
        ( ( nil != U
          & nil = V )
        | ~ sP0_prd(V,U) ) ),
    inference(miniscoping,[status(thm)],[f433]) ).

fof(f435,plain,
    ! [X0,X1] :
      ( nil = X0
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f434]) ).

fof(f436,plain,
    ! [X0,X1] :
      ( nil != X1
      | ~ sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f434]) ).

fof(f437,plain,
    ! [X0,X1] :
      ( nil = X1
      | nil != X0
      | sP0_prd(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f434]) ).

fof(f438,definition,
    ( sQ0_spl
  <=> nil = sK49_skl ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f439,plain,
    ( ~ sQ0_spl
    | nil = sK49_skl ),
    inference(component_clause,[status(thm)],[f438]) ).

fof(f441,definition,
    ( sQ1_spl
  <=> nil = sK50_skl ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f443,plain,
    ( sQ1_spl
    | nil != sK50_skl ),
    inference(component_clause,[status(thm)],[f441]) ).

fof(f444,plain,
    ( ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f426,f438,f441]) ).

fof(f445,definition,
    ( sQ2_spl
  <=> ssList(sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f448,definition,
    ( sQ3_spl
  <=> neq(sK50_skl,nil) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f450,plain,
    ( sQ3_spl
    | ~ neq(sK50_skl,nil) ),
    inference(component_clause,[status(thm)],[f448]) ).

fof(f451,plain,
    ( ~ sQ3_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f427,f445,f448]) ).

fof(f452,definition,
    ( sQ4_spl
  <=> neq(sK51_skl,nil) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f453,plain,
    ( ~ sQ4_spl
    | neq(sK51_skl,nil) ),
    inference(component_clause,[status(thm)],[f452]) ).

fof(f455,plain,
    ( ~ sQ3_spl
    | sQ4_spl ),
    inference(split_clause,[status(thm)],[f428,f452,f448]) ).

fof(f456,definition,
    ( sQ5_spl
  <=> segmentP(sK50_skl,sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f459,plain,
    ( ~ sQ3_spl
    | sQ5_spl ),
    inference(split_clause,[status(thm)],[f429,f456,f448]) ).

fof(f460,definition,
    ( sQ6_spl
  <=> segmentP(sK49_skl,sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f463,plain,
    ( ~ sQ3_spl
    | sQ6_spl ),
    inference(split_clause,[status(thm)],[f430,f460,f448]) ).

fof(f464,definition,
    ( sQ7_spl
  <=> sP0_prd(sK48_skl,sK47_skl) ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f465,plain,
    ( ~ sQ7_spl
    | sP0_prd(sK48_skl,sK47_skl) ),
    inference(component_clause,[status(thm)],[f464]) ).

fof(f467,definition,
    ( sQ8_spl
  <=> neq(sK48_skl,nil) ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f468,plain,
    ( ~ sQ8_spl
    | neq(sK48_skl,nil) ),
    inference(component_clause,[status(thm)],[f467]) ).

fof(f470,plain,
    ( sQ8_spl
    | sQ7_spl ),
    inference(split_clause,[status(thm)],[f431,f464,f467]) ).

fof(f471,definition,
    ! [X0] :
      ( sQ9_spl
    <=> ( ~ segmentP(sK47_skl,X0)
        | ~ segmentP(sK48_skl,X0)
        | ~ neq(X0,nil)
        | ~ ssList(X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).

fof(f472,plain,
    ! [X0] :
      ( ~ sQ9_spl
      | ~ segmentP(sK47_skl,X0)
      | ~ segmentP(sK48_skl,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(component_clause,[status(thm)],[f471]) ).

fof(f474,plain,
    ( sQ9_spl
    | sQ7_spl ),
    inference(split_clause,[status(thm)],[f432,f464,f471]) ).

fof(f498,plain,
    ( segmentP(nil,nil)
    | ~ ssList(nil) ),
    inference(destructive_equality_resolution,[status(thm)],[f327]) ).

fof(f505,plain,
    ! [X0] : ~ sP0_prd(X0,nil),
    inference(destructive_equality_resolution,[status(thm)],[f436]) ).

fof(f506,plain,
    ! [X0] :
      ( nil = X0
      | sP0_prd(nil,X0) ),
    inference(destructive_equality_resolution,[status(thm)],[f437]) ).

fof(f510,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | ~ sP0_prd(X0,sK49_skl) ),
    inference(forward_demodulation,[status(thm)],[f439,f505]) ).

fof(f512,plain,
    ( ~ sQ7_spl
    | sP0_prd(sK50_skl,sK47_skl) ),
    inference(forward_demodulation,[status(thm)],[f424,f465]) ).

fof(f513,plain,
    ( ~ sQ7_spl
    | sP0_prd(sK50_skl,sK49_skl) ),
    inference(forward_demodulation,[status(thm)],[f425,f512]) ).

fof(f514,plain,
    ( ~ sQ7_spl
    | ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f510]) ).

fof(f515,plain,
    ( ~ sQ7_spl
    | ~ sQ0_spl ),
    inference(contradiction_clause,[status(thm)],[f514]) ).

fof(f516,plain,
    ( ~ sQ8_spl
    | neq(sK50_skl,nil) ),
    inference(forward_demodulation,[status(thm)],[f424,f468]) ).

fof(f517,plain,
    ! [X0] :
      ( ~ sQ9_spl
      | ~ segmentP(sK47_skl,X0)
      | ~ segmentP(sK50_skl,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(forward_demodulation,[status(thm)],[f424,f472]) ).

fof(f518,plain,
    ! [X0] :
      ( ~ sQ9_spl
      | ~ segmentP(sK49_skl,X0)
      | ~ segmentP(sK50_skl,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(forward_demodulation,[status(thm)],[f425,f517]) ).

fof(f522,plain,
    ( sQ3_spl
    | ~ sQ8_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f450,f516]) ).

fof(f523,plain,
    ( sQ3_spl
    | ~ sQ8_spl ),
    inference(contradiction_clause,[status(thm)],[f522]) ).

fof(f524,plain,
    ( ~ sQ7_spl
    | nil = sK50_skl ),
    inference(resolution,[status(thm)],[f435,f513]) ).

fof(f525,plain,
    ( ~ sQ7_spl
    | sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f524,f443]) ).

fof(f526,plain,
    ( ~ sQ7_spl
    | sQ1_spl ),
    inference(contradiction_clause,[status(thm)],[f525]) ).

fof(f528,plain,
    ! [X0] :
      ( nil = nil
      | nil = X0 ),
    inference(resolution,[status(thm)],[f506,f435]) ).

fof(f529,definition,
    ! [X0] :
      ( sQ10_spl
    <=> nil = X0 ),
    introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).

fof(f530,plain,
    ! [X0] :
      ( ~ sQ10_spl
      | nil = X0 ),
    inference(component_clause,[status(thm)],[f529]) ).

fof(f532,definition,
    ( sQ11_spl
  <=> nil = nil ),
    introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).

fof(f535,plain,
    ( sQ11_spl
    | sQ10_spl ),
    inference(split_clause,[status(thm)],[f528,f529,f532]) ).

fof(f536,plain,
    ! [X0,X1] :
      ( ~ sQ10_spl
      | X0 = X1 ),
    inference(paramodulation,[status(thm)],[f530,f530]) ).

fof(f549,plain,
    ( ~ sQ10_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f105,f536]) ).

fof(f550,plain,
    ~ sQ10_spl,
    inference(contradiction_clause,[status(thm)],[f549]) ).

fof(f569,definition,
    ! [X0] :
      ( sQ12_spl
    <=> sK49_skl = X0 ),
    introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).

fof(f570,plain,
    ! [X0] :
      ( ~ sQ12_spl
      | sK49_skl = X0 ),
    inference(component_clause,[status(thm)],[f569]) ).

fof(f576,plain,
    ! [X0,X1] :
      ( ~ sQ12_spl
      | X0 = X1 ),
    inference(paramodulation,[status(thm)],[f570,f570]) ).

fof(f591,plain,
    ( ~ sQ12_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f105,f576]) ).

fof(f592,plain,
    ~ sQ12_spl,
    inference(contradiction_clause,[status(thm)],[f591]) ).

fof(f610,definition,
    ( sQ15_spl
  <=> ssList(sK49_skl) ),
    introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).

fof(f612,plain,
    ( sQ15_spl
    | ~ ssList(sK49_skl) ),
    inference(component_clause,[status(thm)],[f610]) ).

fof(f615,definition,
    ( sQ16_spl
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[sQ16_spl])],[split_symbol_definition]) ).

fof(f617,plain,
    ( sQ16_spl
    | ~ ssList(nil) ),
    inference(component_clause,[status(thm)],[f615]) ).

fof(f618,definition,
    ( sQ17_spl
  <=> segmentP(nil,nil) ),
    introduced(definition,[new_symbols(definition,[sQ17_spl])],[split_symbol_definition]) ).

fof(f619,plain,
    ( ~ sQ17_spl
    | segmentP(nil,nil) ),
    inference(component_clause,[status(thm)],[f618]) ).

fof(f621,plain,
    ( sQ17_spl
    | ~ sQ16_spl ),
    inference(split_clause,[status(thm)],[f498,f615,f618]) ).

fof(f636,definition,
    ( sQ20_spl
  <=> ssList(sK50_skl) ),
    introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition]) ).

fof(f638,plain,
    ( sQ20_spl
    | ~ ssList(sK50_skl) ),
    inference(component_clause,[status(thm)],[f636]) ).

fof(f640,plain,
    ( sQ15_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f612,f422]) ).

fof(f641,plain,
    sQ15_spl,
    inference(contradiction_clause,[status(thm)],[f640]) ).

fof(f642,plain,
    ( sQ16_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f617,f223]) ).

fof(f643,plain,
    sQ16_spl,
    inference(contradiction_clause,[status(thm)],[f642]) ).

fof(f644,plain,
    ! [X0] :
      ( ~ sQ17_spl
      | segmentP(X0,nil)
      | ~ segmentP(X0,nil)
      | ~ ssList(nil)
      | ~ ssList(nil)
      | ~ ssList(X0) ),
    inference(resolution,[status(thm)],[f619,f315]) ).

fof(f645,definition,
    ! [X0] :
      ( sQ21_spl
    <=> ( segmentP(X0,nil)
        | ~ segmentP(X0,nil)
        | ~ ssList(X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).

fof(f648,plain,
    ( ~ sQ17_spl
    | ~ sQ16_spl
    | sQ21_spl ),
    inference(split_clause,[status(thm)],[f644,f645,f615,f618]) ).

fof(f659,plain,
    ( sQ20_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f638,f423]) ).

fof(f660,plain,
    sQ20_spl,
    inference(contradiction_clause,[status(thm)],[f659]) ).

fof(f674,plain,
    ( ~ sQ4_spl
    | ~ sQ9_spl
    | ~ segmentP(sK49_skl,sK51_skl)
    | ~ segmentP(sK50_skl,sK51_skl)
    | ~ ssList(sK51_skl) ),
    inference(resolution,[status(thm)],[f518,f453]) ).

fof(f677,plain,
    ( ~ sQ4_spl
    | ~ sQ9_spl
    | ~ sQ6_spl
    | ~ sQ5_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f674,f445,f456,f460,f471,f452]) ).

fof(f689,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f444,f451,f455,f459,f463,f470,f474,f515,f523,f526,f535,f550,f592,f621,f641,f643,f648,f660,f677]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC054+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n007.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 07:49:50 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.12/0.40  % Refutation found
% 0.12/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42  % Elapsed time: 0.066476 seconds
% 0.12/0.42  % CPU time: 0.180097 seconds
% 0.12/0.42  % Total memory used: 110.825 MB
% 0.12/0.42  % Net memory used: 110.701 MB
%------------------------------------------------------------------------------