↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC333+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 : n009.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:40:49 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   52 (   7 unt;   9 def)
%            Number of atoms       :  190 (  10 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  221 (  83   ~;  81   |;  38   &)
%                                         (   9 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   20 (  13   !;   7   ?)

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

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

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

fof(f416,plain,
    ( ( ~ totalorderedP(sK47_skl)
      | ~ segmentP(sK48_skl,sK47_skl)
      | ( totalorderedP(sK51_skl)
        & segmentP(sK51_skl,sK47_skl)
        & segmentP(sK48_skl,sK51_skl)
        & neq(sK47_skl,sK51_skl)
        & ssList(sK51_skl) ) )
    & ! [Y] :
        ( ~ totalorderedP(Y)
        | ~ segmentP(Y,sK49_skl)
        | ~ segmentP(sK50_skl,Y)
        | ~ neq(sK49_skl,Y)
        | ~ ssList(Y) )
    & totalorderedP(sK49_skl)
    & segmentP(sK50_skl,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(Z,sK51_skl)],[f415]) ).

fof(f421,plain,
    sK48_skl = sK50_skl,
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f422,plain,
    sK47_skl = sK49_skl,
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f423,plain,
    segmentP(sK50_skl,sK49_skl),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f424,plain,
    totalorderedP(sK49_skl),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f425,plain,
    ! [X0] :
      ( ~ totalorderedP(X0)
      | ~ segmentP(X0,sK49_skl)
      | ~ segmentP(sK50_skl,X0)
      | ~ neq(sK49_skl,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f426,plain,
    ( ~ totalorderedP(sK47_skl)
    | ~ segmentP(sK48_skl,sK47_skl)
    | ssList(sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f427,plain,
    ( ~ totalorderedP(sK47_skl)
    | ~ segmentP(sK48_skl,sK47_skl)
    | neq(sK47_skl,sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f428,plain,
    ( ~ totalorderedP(sK47_skl)
    | ~ segmentP(sK48_skl,sK47_skl)
    | segmentP(sK48_skl,sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f429,plain,
    ( ~ totalorderedP(sK47_skl)
    | ~ segmentP(sK48_skl,sK47_skl)
    | segmentP(sK51_skl,sK47_skl) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f430,plain,
    ( ~ totalorderedP(sK47_skl)
    | ~ segmentP(sK48_skl,sK47_skl)
    | totalorderedP(sK51_skl) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

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

fof(f434,definition,
    ( sQ1_spl
  <=> segmentP(sK48_skl,sK47_skl) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f436,plain,
    ( sQ1_spl
    | ~ segmentP(sK48_skl,sK47_skl) ),
    inference(component_clause,[status(thm)],[f434]) ).

fof(f437,definition,
    ( sQ2_spl
  <=> totalorderedP(sK47_skl) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f439,plain,
    ( sQ2_spl
    | ~ totalorderedP(sK47_skl) ),
    inference(component_clause,[status(thm)],[f437]) ).

fof(f440,plain,
    ( ~ sQ2_spl
    | ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f426,f431,f434,f437]) ).

fof(f441,definition,
    ( sQ3_spl
  <=> neq(sK47_skl,sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f442,plain,
    ( ~ sQ3_spl
    | neq(sK47_skl,sK51_skl) ),
    inference(component_clause,[status(thm)],[f441]) ).

fof(f444,plain,
    ( ~ sQ2_spl
    | ~ sQ1_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f427,f441,f434,f437]) ).

fof(f445,definition,
    ( sQ4_spl
  <=> segmentP(sK48_skl,sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f446,plain,
    ( ~ sQ4_spl
    | segmentP(sK48_skl,sK51_skl) ),
    inference(component_clause,[status(thm)],[f445]) ).

fof(f448,plain,
    ( ~ sQ2_spl
    | ~ sQ1_spl
    | sQ4_spl ),
    inference(split_clause,[status(thm)],[f428,f445,f434,f437]) ).

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

fof(f450,plain,
    ( ~ sQ5_spl
    | segmentP(sK51_skl,sK47_skl) ),
    inference(component_clause,[status(thm)],[f449]) ).

fof(f452,plain,
    ( ~ sQ2_spl
    | ~ sQ1_spl
    | sQ5_spl ),
    inference(split_clause,[status(thm)],[f429,f449,f434,f437]) ).

fof(f453,definition,
    ( sQ6_spl
  <=> totalorderedP(sK51_skl) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f456,plain,
    ( ~ sQ2_spl
    | ~ sQ1_spl
    | sQ6_spl ),
    inference(split_clause,[status(thm)],[f430,f453,f434,f437]) ).

fof(f489,plain,
    ( sQ2_spl
    | ~ totalorderedP(sK49_skl) ),
    inference(forward_demodulation,[status(thm)],[f422,f439]) ).

fof(f490,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f489,f424]) ).

fof(f491,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f490]) ).

fof(f492,plain,
    ( sQ1_spl
    | ~ segmentP(sK50_skl,sK47_skl) ),
    inference(forward_demodulation,[status(thm)],[f421,f436]) ).

fof(f493,plain,
    ( sQ1_spl
    | ~ segmentP(sK50_skl,sK49_skl) ),
    inference(forward_demodulation,[status(thm)],[f422,f492]) ).

fof(f495,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f493,f423]) ).

fof(f496,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f495]) ).

fof(f497,plain,
    ( ~ sQ3_spl
    | neq(sK49_skl,sK51_skl) ),
    inference(forward_demodulation,[status(thm)],[f422,f442]) ).

fof(f498,plain,
    ( ~ sQ4_spl
    | segmentP(sK50_skl,sK51_skl) ),
    inference(forward_demodulation,[status(thm)],[f421,f446]) ).

fof(f499,plain,
    ( ~ sQ5_spl
    | segmentP(sK51_skl,sK49_skl) ),
    inference(forward_demodulation,[status(thm)],[f422,f450]) ).

fof(f506,plain,
    ( ~ sQ3_spl
    | ~ totalorderedP(sK51_skl)
    | ~ segmentP(sK51_skl,sK49_skl)
    | ~ segmentP(sK50_skl,sK51_skl)
    | ~ ssList(sK51_skl) ),
    inference(resolution,[status(thm)],[f425,f497]) ).

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

fof(f509,plain,
    ( sQ7_spl
    | ~ segmentP(sK50_skl,sK51_skl) ),
    inference(component_clause,[status(thm)],[f507]) ).

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

fof(f512,plain,
    ( sQ8_spl
    | ~ segmentP(sK51_skl,sK49_skl) ),
    inference(component_clause,[status(thm)],[f510]) ).

fof(f513,plain,
    ( ~ sQ3_spl
    | ~ sQ6_spl
    | ~ sQ8_spl
    | ~ sQ7_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f506,f431,f507,f510,f453,f441]) ).

fof(f514,plain,
    ( sQ7_spl
    | ~ sQ4_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f509,f498]) ).

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

fof(f516,plain,
    ( sQ8_spl
    | ~ sQ5_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f512,f499]) ).

fof(f517,plain,
    ( sQ8_spl
    | ~ sQ5_spl ),
    inference(contradiction_clause,[status(thm)],[f516]) ).

fof(f518,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f440,f444,f448,f452,f456,f491,f496,f513,f515,f517]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 08:16:42 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.43  % Elapsed time: 0.065014 seconds
% 0.09/0.43  % CPU time: 0.169331 seconds
% 0.09/0.43  % Total memory used: 110.636 MB
% 0.09/0.43  % Net memory used: 110.491 MB
%------------------------------------------------------------------------------