↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.14s 0.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :   98 (  31 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  109 (  42   ~;  31   |;  23   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   23 (  19   !;   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(f45,axiom,
    ! [U] :
      ( ssList(U)
     => frontsegP(U,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f96,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( ( ( ~ frontsegP(X,W)
                        | ~ neq(W,nil) )
                      & neq(X,nil) )
                    | ( nil = X
                      & nil != W )
                    | frontsegP(V,U)
                    | 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)
                   => ( ( ( ~ frontsegP(X,W)
                          | ~ neq(W,nil) )
                        & neq(X,nil) )
                      | ( nil = X
                        & nil != W )
                      | frontsegP(V,U)
                      | 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(f294,plain,
    ! [U] :
      ( frontsegP(U,nil)
      | ~ ssList(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f45]) ).

fof(f295,plain,
    ! [X0] :
      ( frontsegP(X0,nil)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[status(thm)],[f294]) ).

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

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

fof(f420,plain,
    ssList(sK50_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,
    ~ frontsegP(sK48_skl,sK47_skl),
    inference(cnf_transformation,[status(thm)],[f416]) ).

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

fof(f426,plain,
    ( frontsegP(sK50_skl,sK49_skl)
    | ~ neq(sK50_skl,nil) ),
    inference(cnf_transformation,[status(thm)],[f416]) ).

fof(f459,plain,
    ~ frontsegP(sK50_skl,sK47_skl),
    inference(forward_demodulation,[status(thm)],[f421,f423]) ).

fof(f460,plain,
    ~ frontsegP(sK50_skl,sK49_skl),
    inference(forward_demodulation,[status(thm)],[f422,f459]) ).

fof(f463,plain,
    ~ neq(sK50_skl,nil),
    inference(forward_subsumption_resolution,[status(thm)],[f426,f460]) ).

fof(f467,plain,
    ( sK50_skl = nil
    | ~ ssList(nil)
    | ~ ssList(sK50_skl) ),
    inference(resolution,[status(thm)],[f220,f463]) ).

fof(f470,plain,
    ( sK50_skl = nil
    | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[status(thm)],[f467,f420]) ).

fof(f473,plain,
    ( nil != nil
    | nil = sK49_skl ),
    inference(backward_demodulation,[status(thm)],[f477,f424]) ).

fof(f474,plain,
    ~ frontsegP(nil,sK49_skl),
    inference(backward_demodulation,[status(thm)],[f477,f460]) ).

fof(f477,plain,
    sK50_skl = nil,
    inference(forward_subsumption_resolution,[status(thm)],[f470,f223]) ).

fof(f478,plain,
    nil = sK49_skl,
    inference(trivial_equality_resolution,[status(thm)],[f473]) ).

fof(f502,plain,
    ~ frontsegP(nil,nil),
    inference(forward_demodulation,[status(thm)],[f478,f474]) ).

fof(f503,plain,
    ~ ssList(nil),
    inference(resolution,[status(thm)],[f502,f295]) ).

fof(f506,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f503,f223]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC352+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n016.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 08:22:53 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.14/0.41  % Refutation found
% 0.14/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.44  % Elapsed time: 0.063698 seconds
% 0.14/0.44  % CPU time: 0.174787 seconds
% 0.14/0.44  % Total memory used: 106.845 MB
% 0.14/0.44  % Net memory used: 106.715 MB
%------------------------------------------------------------------------------