↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWC205+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 : n018.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:23 PM UTC 2026

% Result   : Theorem 0.14s 5.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (  14 unt;   0 def)
%            Number of atoms       :   89 (  39 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   98 (  35   ~;  28   |;  23   &)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 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/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

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

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

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,
    neq(sK48_skl,nil),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f424,plain,
    ~ neq(sK47_skl,nil),
    inference(cnf_transformation,[status(thm)],[f416]) ).

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

fof(f459,plain,
    neq(sK50_skl,nil),
    inference(forward_demodulation,[status(thm)],[f421,f423]) ).

fof(f460,plain,
    ~ neq(sK49_skl,nil),
    inference(forward_demodulation,[status(thm)],[f422,f424]) ).

fof(f465,plain,
    ( sK49_skl = nil
    | ~ ssList(nil)
    | ~ ssList(sK49_skl) ),
    inference(resolution,[status(thm)],[f220,f460]) ).

fof(f468,plain,
    ( sK49_skl = nil
    | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[status(thm)],[f465,f419]) ).

fof(f471,plain,
    ( nil != nil
    | nil = sK50_skl ),
    inference(backward_demodulation,[status(thm)],[f475,f425]) ).

fof(f472,plain,
    ~ neq(nil,nil),
    inference(backward_demodulation,[status(thm)],[f475,f460]) ).

fof(f475,plain,
    sK49_skl = nil,
    inference(forward_subsumption_resolution,[status(thm)],[f468,f223]) ).

fof(f476,plain,
    nil = sK50_skl,
    inference(trivial_equality_resolution,[status(thm)],[f471]) ).

fof(f477,plain,
    neq(nil,nil),
    inference(backward_demodulation,[status(thm)],[f476,f459]) ).

fof(f482,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f477,f472]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC205+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.37  % Computer : n018.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Mon Sep 21 08:07:04 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.39  % Drodi V4.1.1
% 0.14/5.41  % Refutation found
% 0.14/5.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.45  % Elapsed time: 0.061747 seconds
% 0.14/5.45  % CPU time: 0.170098 seconds
% 0.14/5.45  % Total memory used: 110.338 MB
% 0.14/5.45  % Net memory used: 110.207 MB
%------------------------------------------------------------------------------