TSTP Solution File: SWC127+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWC127+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n031.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 Apr 30 20:44:37 EDT 2024

% Result   : Theorem 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   53 (  16 unt;   0 def)
%            Number of atoms       :  146 (  18 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  147 (  54   ~;  51   |;  23   &)
%                                         (   9 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   8 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   20 (  16   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ( neq(U,V)
          <=> U != V ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f39,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f217,plain,
    ! [U] :
      ( ~ ssList(U)
      | ! [V] :
          ( ~ ssList(V)
          | ( neq(U,V)
          <=> U != V ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f15]) ).

fof(f218,plain,
    ! [U] :
      ( ~ ssList(U)
      | ! [V] :
          ( ~ ssList(V)
          | ( ( ~ neq(U,V)
              | U != V )
            & ( neq(U,V)
              | U = V ) ) ) ),
    inference(NNF_transformation,[status(esa)],[f217]) ).

fof(f220,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f218]) ).

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

fof(f280,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[status(esa)],[f39]) ).

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

fof(f416,plain,
    ( ssList(sk0_47)
    & ssList(sk0_48)
    & ssList(sk0_49)
    & ssList(sk0_50)
    & sk0_48 = sk0_50
    & sk0_47 = sk0_49
    & neq(sk0_48,nil)
    & segmentP(sk0_50,sk0_49)
    & ( singletonP(sk0_49)
      | ~ neq(sk0_50,nil) )
    & ( ~ neq(sk0_47,nil)
      | ~ segmentP(sk0_48,sk0_47) ) ),
    inference(skolemization,[status(esa)],[f415]) ).

fof(f417,plain,
    ssList(sk0_47),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f421,plain,
    sk0_48 = sk0_50,
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f422,plain,
    sk0_47 = sk0_49,
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f423,plain,
    neq(sk0_48,nil),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f424,plain,
    segmentP(sk0_50,sk0_49),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f425,plain,
    ( singletonP(sk0_49)
    | ~ neq(sk0_50,nil) ),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f426,plain,
    ( ~ neq(sk0_47,nil)
    | ~ segmentP(sk0_48,sk0_47) ),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f427,plain,
    ( spl0_0
  <=> singletonP(sk0_49) ),
    introduced(split_symbol_definition) ).

fof(f428,plain,
    ( singletonP(sk0_49)
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f427]) ).

fof(f430,plain,
    ( spl0_1
  <=> neq(sk0_50,nil) ),
    introduced(split_symbol_definition) ).

fof(f432,plain,
    ( ~ neq(sk0_50,nil)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f430]) ).

fof(f433,plain,
    ( spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f425,f427,f430]) ).

fof(f434,plain,
    ( spl0_2
  <=> neq(sk0_47,nil) ),
    introduced(split_symbol_definition) ).

fof(f436,plain,
    ( ~ neq(sk0_47,nil)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f434]) ).

fof(f437,plain,
    ( spl0_3
  <=> segmentP(sk0_48,sk0_47) ),
    introduced(split_symbol_definition) ).

fof(f439,plain,
    ( ~ segmentP(sk0_48,sk0_47)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f437]) ).

fof(f440,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f426,f434,f437]) ).

fof(f473,plain,
    segmentP(sk0_48,sk0_49),
    inference(forward_demodulation,[status(thm)],[f421,f424]) ).

fof(f474,plain,
    segmentP(sk0_48,sk0_47),
    inference(forward_demodulation,[status(thm)],[f422,f473]) ).

fof(f475,plain,
    ( spl0_4
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f477,plain,
    ( ~ ssList(nil)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f475]) ).

fof(f485,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f477,f223]) ).

fof(f486,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f485]) ).

fof(f493,plain,
    ( spl0_8
  <=> sk0_47 = nil ),
    introduced(split_symbol_definition) ).

fof(f494,plain,
    ( sk0_47 = nil
    | ~ spl0_8 ),
    inference(component_clause,[status(thm)],[f493]) ).

fof(f498,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f439,f474]) ).

fof(f499,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f498]) ).

fof(f500,plain,
    ( ~ neq(sk0_48,nil)
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f421,f432]) ).

fof(f501,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f500,f423]) ).

fof(f502,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f501]) ).

fof(f503,plain,
    ( singletonP(sk0_47)
    | ~ spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f422,f428]) ).

fof(f507,plain,
    ( spl0_9
  <=> ssList(sk0_47) ),
    introduced(split_symbol_definition) ).

fof(f509,plain,
    ( ~ ssList(sk0_47)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f507]) ).

fof(f510,plain,
    ( ~ ssList(sk0_47)
    | ~ ssList(nil)
    | sk0_47 = nil
    | spl0_2 ),
    inference(resolution,[status(thm)],[f220,f436]) ).

fof(f511,plain,
    ( ~ spl0_9
    | ~ spl0_4
    | spl0_8
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f510,f507,f475,f493,f434]) ).

fof(f512,plain,
    ( $false
    | spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f509,f417]) ).

fof(f513,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f512]) ).

fof(f515,plain,
    ( singletonP(nil)
    | ~ spl0_8
    | ~ spl0_0 ),
    inference(backward_demodulation,[status(thm)],[f494,f503]) ).

fof(f516,plain,
    ( $false
    | ~ spl0_8
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f515,f280]) ).

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

fof(f518,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f433,f440,f486,f499,f502,f511,f513,f517]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC127+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.32  % Computer : n031.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Tue Apr 30 00:43:28 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.12/0.34  % Drodi V3.6.0
% 0.12/0.34  % Refutation found
% 0.12/0.34  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.34  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.35  % Elapsed time: 0.024488 seconds
% 0.12/0.35  % CPU time: 0.039509 seconds
% 0.12/0.35  % Total memory used: 14.593 MB
% 0.12/0.35  % Net memory used: 14.567 MB
%------------------------------------------------------------------------------