↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n011.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:41 PM UTC 2026

% Result   : Theorem 0.08s 0.38s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   46 (  29 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   46 (  14   ~;   8   |;  16   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   12 (   8   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( nil = U
                    | X != W
                    | U != W
                    | V != X
                    | nil != V ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f416,plain,
    ( nil != sK47_skl
    & sK50_skl = sK49_skl
    & sK47_skl = sK49_skl
    & sK48_skl = sK50_skl
    & nil = sK48_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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f415]) ).

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

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

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

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

fof(f425,plain,
    nil != sK47_skl,
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f456,plain,
    nil = sK50_skl,
    inference(backward_demodulation,[status(thm)],[f422,f421]) ).

fof(f459,plain,
    sK47_skl = sK50_skl,
    inference(backward_demodulation,[status(thm)],[f424,f423]) ).

fof(f461,plain,
    sK50_skl != sK47_skl,
    inference(backward_demodulation,[status(thm)],[f456,f425]) ).

fof(f463,plain,
    sK50_skl != sK50_skl,
    inference(forward_demodulation,[status(thm)],[f459,f461]) ).

fof(f464,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f463]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC035+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n011.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:50:26 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.08/0.38  % Refutation found
% 0.08/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41  % Elapsed time: 0.049002 seconds
% 0.13/0.41  % CPU time: 0.077687 seconds
% 0.13/0.41  % Total memory used: 10.336 MB
% 0.13/0.41  % Net memory used: 10.321 MB
%------------------------------------------------------------------------------