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

View Problem - Process Solution

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

% Computer : n009.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:29 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  12 unt;   0 def)
%            Number of atoms       :  101 (  44 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  109 (  41   ~;  35   |;  22   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   34 (  24   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f84,axiom,
    ! [U] :
      ( ssList(U)
     => app(U,nil) = U ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | X != W
                    | ? [Y] :
                        ( ssList(Y)
                        & ? [Z] :
                            ( ssList(Z)
                            & ? [X1] :
                                ( ssList(X1)
                                & app(app(Y,Z),X1) = U
                                & app(Y,X1) = V ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f388,plain,
    ! [U] :
      ( ~ ssList(U)
      | app(U,nil) = U ),
    inference(pre_NNF_transformation,[status(esa)],[f84]) ).

fof(f389,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[status(esa)],[f388]) ).

fof(f415,plain,
    ? [U] :
      ( ssList(U)
      & ? [V] :
          ( ssList(V)
          & ? [W] :
              ( ssList(W)
              & ? [X] :
                  ( ssList(X)
                  & V = X
                  & U = W
                  & X = W
                  & ! [Y] :
                      ( ~ ssList(Y)
                      | ! [Z] :
                          ( ~ ssList(Z)
                          | ! [X1] :
                              ( ~ ssList(X1)
                              | app(app(Y,Z),X1) != U
                              | app(Y,X1) != V ) ) ) ) ) ) ),
    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
    & sk0_50 = sk0_49
    & ! [Y] :
        ( ~ ssList(Y)
        | ! [Z] :
            ( ~ ssList(Z)
            | ! [X1] :
                ( ~ ssList(X1)
                | app(app(Y,Z),X1) != sk0_47
                | app(Y,X1) != sk0_48 ) ) ) ),
    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,
    sk0_50 = sk0_49,
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f424,plain,
    ! [X0,X1,X2] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X0,X1),X2) != sk0_47
      | app(X0,X2) != sk0_48 ),
    inference(cnf_transformation,[status(esa)],[f416]) ).

fof(f457,plain,
    sk0_48 = sk0_49,
    inference(forward_demodulation,[status(thm)],[f421,f423]) ).

fof(f458,plain,
    sk0_48 = sk0_47,
    inference(forward_demodulation,[status(thm)],[f422,f457]) ).

fof(f462,plain,
    app(sk0_47,nil) = sk0_47,
    inference(resolution,[status(thm)],[f389,f417]) ).

fof(f518,plain,
    ! [X0,X1,X2] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X0,X1),X2) != sk0_47
      | app(X0,X2) != sk0_47 ),
    inference(forward_demodulation,[status(thm)],[f458,f424]) ).

fof(f519,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(app(X0,nil),nil) != sk0_47
      | app(X0,nil) != sk0_47 ),
    inference(resolution,[status(thm)],[f518,f223]) ).

fof(f983,plain,
    ( spl0_34
  <=> app(app(sk0_47,nil),nil) = sk0_47 ),
    introduced(split_symbol_definition) ).

fof(f985,plain,
    ( app(app(sk0_47,nil),nil) != sk0_47
    | spl0_34 ),
    inference(component_clause,[status(thm)],[f983]) ).

fof(f986,plain,
    ( spl0_35
  <=> app(sk0_47,nil) = sk0_47 ),
    introduced(split_symbol_definition) ).

fof(f988,plain,
    ( app(sk0_47,nil) != sk0_47
    | spl0_35 ),
    inference(component_clause,[status(thm)],[f986]) ).

fof(f989,plain,
    ( app(app(sk0_47,nil),nil) != sk0_47
    | app(sk0_47,nil) != sk0_47 ),
    inference(resolution,[status(thm)],[f519,f417]) ).

fof(f990,plain,
    ( ~ spl0_34
    | ~ spl0_35 ),
    inference(split_clause,[status(thm)],[f989,f983,f986]) ).

fof(f1001,plain,
    ( app(sk0_47,nil) != sk0_47
    | spl0_34 ),
    inference(forward_demodulation,[status(thm)],[f462,f985]) ).

fof(f1002,plain,
    ( sk0_47 != sk0_47
    | spl0_34 ),
    inference(forward_demodulation,[status(thm)],[f462,f1001]) ).

fof(f1003,plain,
    ( $false
    | spl0_34 ),
    inference(trivial_equality_resolution,[status(esa)],[f1002]) ).

fof(f1004,plain,
    spl0_34,
    inference(contradiction_clause,[status(thm)],[f1003]) ).

fof(f1012,plain,
    ( sk0_47 != sk0_47
    | spl0_35 ),
    inference(forward_demodulation,[status(thm)],[f462,f988]) ).

fof(f1013,plain,
    ( $false
    | spl0_35 ),
    inference(trivial_equality_resolution,[status(esa)],[f1012]) ).

fof(f1014,plain,
    spl0_35,
    inference(contradiction_clause,[status(thm)],[f1013]) ).

fof(f1015,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f990,f1004,f1014]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC094+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr 29 23:55:41 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39  % Elapsed time: 0.039919 seconds
% 0.13/0.39  % CPU time: 0.173843 seconds
% 0.13/0.39  % Total memory used: 36.478 MB
% 0.13/0.39  % Net memory used: 36.350 MB
%------------------------------------------------------------------------------