↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV179+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n019.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:46:49 PM UTC 2026

% Result   : Theorem 0.12s 0.40s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   2 def)
%            Number of atoms       :  103 (  26 equ)
%            Maximal formula atoms :   26 (   5 avg)
%            Number of connectives :  112 (  27   ~;  24   |;  41   &)
%                                         (   2 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  12 con; 0-3 aty)
%            Number of variables   :   25 (  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( ! [H] :
          ( ( leq(H,n4)
            & leq(n0,H) )
         => a_select2(sigma_init,H) = init )
      & ! [G] :
          ( ( leq(G,n4)
            & leq(n0,G) )
         => a_select2(rho_init,G) = init )
      & ! [F] :
          ( ( leq(F,n4)
            & leq(n0,F) )
         => a_select2(mu_init,F) = init )
      & ! [E] :
          ( ( leq(E,pred(pv68))
            & leq(n0,E) )
         => a_select2(rhoold_init,E) = init )
      & ! [D] :
          ( ( leq(D,n4)
            & leq(n0,D) )
         => a_select2(muold_init,D) = init )
      & ! [C] :
          ( ( leq(C,n4)
            & leq(n0,C) )
         => a_select3(center_init,C,n0) = init )
      & ! [A] :
          ( ( leq(A,n135299)
            & leq(n0,A) )
         => ! [B] :
              ( ( leq(B,n4)
                & leq(n0,B) )
             => a_select3(q_init,A,B) = init ) )
      & leq(pv68,n4)
      & leq(n0,pv68) )
   => a_select2(rho_init,pv68) = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( ! [H] :
            ( ( leq(H,n4)
              & leq(n0,H) )
           => a_select2(sigma_init,H) = init )
        & ! [G] :
            ( ( leq(G,n4)
              & leq(n0,G) )
           => a_select2(rho_init,G) = init )
        & ! [F] :
            ( ( leq(F,n4)
              & leq(n0,F) )
           => a_select2(mu_init,F) = init )
        & ! [E] :
            ( ( leq(E,pred(pv68))
              & leq(n0,E) )
           => a_select2(rhoold_init,E) = init )
        & ! [D] :
            ( ( leq(D,n4)
              & leq(n0,D) )
           => a_select2(muold_init,D) = init )
        & ! [C] :
            ( ( leq(C,n4)
              & leq(n0,C) )
           => a_select3(center_init,C,n0) = init )
        & ! [A] :
            ( ( leq(A,n135299)
              & leq(n0,A) )
           => ! [B] :
                ( ( leq(B,n4)
                  & leq(n0,B) )
               => a_select3(q_init,A,B) = init ) )
        & leq(pv68,n4)
        & leq(n0,pv68) )
     => a_select2(rho_init,pv68) = init ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f251,plain,
    ( a_select2(rho_init,pv68) != init
    & ! [H] :
        ( a_select2(sigma_init,H) = init
        | ~ leq(H,n4)
        | ~ leq(n0,H) )
    & ! [G] :
        ( a_select2(rho_init,G) = init
        | ~ leq(G,n4)
        | ~ leq(n0,G) )
    & ! [F] :
        ( a_select2(mu_init,F) = init
        | ~ leq(F,n4)
        | ~ leq(n0,F) )
    & ! [E] :
        ( a_select2(rhoold_init,E) = init
        | ~ leq(E,pred(pv68))
        | ~ leq(n0,E) )
    & ! [D] :
        ( a_select2(muold_init,D) = init
        | ~ leq(D,n4)
        | ~ leq(n0,D) )
    & ! [C] :
        ( a_select3(center_init,C,n0) = init
        | ~ leq(C,n4)
        | ~ leq(n0,C) )
    & ! [A] :
        ( ! [B] :
            ( a_select3(q_init,A,B) = init
            | ~ leq(B,n4)
            | ~ leq(n0,B) )
        | ~ leq(A,n135299)
        | ~ leq(n0,A) )
    & leq(pv68,n4)
    & leq(n0,pv68) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f252,plain,
    leq(n0,pv68),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f253,plain,
    leq(pv68,n4),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f259,plain,
    ! [X0] :
      ( a_select2(rho_init,X0) = init
      | ~ leq(X0,n4)
      | ~ leq(n0,X0) ),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f261,plain,
    a_select2(rho_init,pv68) != init,
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f380,plain,
    ( ~ leq(pv68,n4)
    | ~ leq(n0,pv68) ),
    inference(resolution,[status(thm)],[f259,f261]) ).

fof(f381,definition,
    ( sQ0_spl
  <=> leq(n0,pv68) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f383,plain,
    ( sQ0_spl
    | ~ leq(n0,pv68) ),
    inference(component_clause,[status(thm)],[f381]) ).

fof(f384,definition,
    ( sQ1_spl
  <=> leq(pv68,n4) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f386,plain,
    ( sQ1_spl
    | ~ leq(pv68,n4) ),
    inference(component_clause,[status(thm)],[f384]) ).

fof(f387,plain,
    ( ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f380,f381,f384]) ).

fof(f388,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f383,f252]) ).

fof(f389,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f388]) ).

fof(f390,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f386,f253]) ).

fof(f391,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f390]) ).

fof(f392,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f387,f389,f391]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV179+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n019.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 08:34:05 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.12/0.37  % Drodi V4.1.1
% 0.12/0.40  % Refutation found
% 0.12/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.43  % Elapsed time: 0.065707 seconds
% 0.12/0.43  % CPU time: 0.167447 seconds
% 0.12/0.43  % Total memory used: 109.207 MB
% 0.12/0.43  % Net memory used: 109.006 MB
%------------------------------------------------------------------------------