↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n010.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:48 PM UTC 2026

% Result   : Theorem 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   5 unt;   0 def)
%            Number of atoms       :  118 (  29 equ)
%            Maximal formula atoms :   36 (  11 avg)
%            Number of connectives :  137 (  29   ~;  24   |;  58   &)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  17 con; 0-3 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( ( gt(loopcounter,n1)
       => ! [I] :
            ( ( leq(I,n4)
              & leq(n0,I) )
           => a_select2(sigmaold_init,I) = init ) )
      & ( gt(loopcounter,n1)
       => ! [H] :
            ( ( leq(H,n4)
              & leq(n0,H) )
           => a_select2(rhoold_init,H) = init ) )
      & ( gt(loopcounter,n1)
       => ! [G] :
            ( ( leq(G,n4)
              & leq(n0,G) )
           => a_select2(muold_init,G) = init ) )
      & ! [F] :
          ( ( leq(F,n4)
            & leq(n0,F) )
         => a_select3(center_init,F,n0) = init )
      & ! [E] :
          ( ( leq(E,n4)
            & leq(n0,E) )
         => a_select2(sigma_init,E) = init )
      & ! [D] :
          ( ( leq(D,n4)
            & leq(n0,D) )
         => a_select2(mu_init,D) = init )
      & ! [C] :
          ( ( leq(C,n4)
            & leq(n0,C) )
         => a_select2(rho_init,C) = init )
      & ! [A] :
          ( ( leq(A,n135299)
            & leq(n0,A) )
         => ! [B] :
              ( ( leq(B,n4)
                & leq(n0,B) )
             => a_select3(q_init,A,B) = init ) )
      & leq(pv54,n4)
      & leq(pv52,n4)
      & leq(pv10,n135299)
      & leq(n0,pv54)
      & leq(n0,pv52)
      & leq(n0,pv10) )
   => a_select2(sigma_init,pv52) = init ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f251,plain,
    ( a_select2(sigma_init,pv52) != init
    & ( ! [I] :
          ( a_select2(sigmaold_init,I) = init
          | ~ leq(I,n4)
          | ~ leq(n0,I) )
      | ~ gt(loopcounter,n1) )
    & ( ! [H] :
          ( a_select2(rhoold_init,H) = init
          | ~ leq(H,n4)
          | ~ leq(n0,H) )
      | ~ gt(loopcounter,n1) )
    & ( ! [G] :
          ( a_select2(muold_init,G) = init
          | ~ leq(G,n4)
          | ~ leq(n0,G) )
      | ~ gt(loopcounter,n1) )
    & ! [F] :
        ( a_select3(center_init,F,n0) = init
        | ~ leq(F,n4)
        | ~ leq(n0,F) )
    & ! [E] :
        ( a_select2(sigma_init,E) = init
        | ~ leq(E,n4)
        | ~ leq(n0,E) )
    & ! [D] :
        ( a_select2(mu_init,D) = init
        | ~ leq(D,n4)
        | ~ leq(n0,D) )
    & ! [C] :
        ( a_select2(rho_init,C) = 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(pv54,n4)
    & leq(pv52,n4)
    & leq(pv10,n135299)
    & leq(n0,pv54)
    & leq(n0,pv52)
    & leq(n0,pv10) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f253,plain,
    leq(n0,pv52),
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f256,plain,
    leq(pv52,n4),
    inference(cnf_transformation,[status(thm)],[f251]) ).

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

fof(f266,plain,
    a_select2(sigma_init,pv52) != init,
    inference(cnf_transformation,[status(thm)],[f251]) ).

fof(f360,plain,
    ( ~ leq(pv52,n4)
    | ~ leq(n0,pv52) ),
    inference(resolution,[status(thm)],[f261,f266]) ).

fof(f361,plain,
    ~ leq(pv52,n4),
    inference(forward_subsumption_resolution,[status(thm)],[f360,f253]) ).

fof(f368,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f361,f256]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV171+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n010.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 08:33:55 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42  % Elapsed time: 0.059484 seconds
% 0.13/0.42  % CPU time: 0.169975 seconds
% 0.13/0.42  % Total memory used: 95.756 MB
% 0.13/0.42  % Net memory used: 95.567 MB
%------------------------------------------------------------------------------