↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.08s 0.41s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
%            Number of atoms       :  125 (  28 equ)
%            Maximal formula atoms :   25 (   6 avg)
%            Number of connectives :  152 (  47   ~;  38   |;  44   &)
%                                         (   0 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  14 con; 0-3 aty)
%            Number of variables   :   34 (  33   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f43,axiom,
    ! [X,Y] :
      ( leq(succ(X),Y)
     => gt(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( ( ( gt(loopcounter,n0)
       => ! [F] :
            ( ( leq(F,n4)
              & leq(n0,F) )
           => a_select2(sigma_init,F) = init ) )
      & ( gt(loopcounter,n0)
       => ! [E] :
            ( ( leq(E,n4)
              & leq(n0,E) )
           => a_select2(rho_init,E) = init ) )
      & ( gt(loopcounter,n0)
       => ! [D] :
            ( ( leq(D,n4)
              & leq(n0,D) )
           => a_select2(mu_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(n1,loopcounter)
      & leq(tptp_float_0_001,pv76) )
   => ! [G] :
        ( ( leq(G,n4)
          & leq(n0,G) )
       => a_select2(rho_init,G) = init ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => ! [F] :
              ( ( leq(F,n4)
                & leq(n0,F) )
             => a_select2(sigma_init,F) = init ) )
        & ( gt(loopcounter,n0)
         => ! [E] :
              ( ( leq(E,n4)
                & leq(n0,E) )
             => a_select2(rho_init,E) = init ) )
        & ( gt(loopcounter,n0)
         => ! [D] :
              ( ( leq(D,n4)
                & leq(n0,D) )
             => a_select2(mu_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(n1,loopcounter)
        & leq(tptp_float_0_001,pv76) )
     => ! [G] :
          ( ( leq(G,n4)
            & leq(n0,G) )
         => a_select2(rho_init,G) = init ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f91,axiom,
    succ(n0) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f224,plain,
    ! [X,Y] :
      ( gt(Y,X)
      | ~ leq(succ(X),Y) ),
    inference(pre_NNF_transformation,[status(thm)],[f43]) ).

fof(f225,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | ~ leq(succ(X0),X1) ),
    inference(cnf_transformation,[status(thm)],[f224]) ).

fof(f251,plain,
    ( ? [G] :
        ( a_select2(rho_init,G) != init
        & leq(G,n4)
        & leq(n0,G) )
    & ( ! [F] :
          ( a_select2(sigma_init,F) = init
          | ~ leq(F,n4)
          | ~ leq(n0,F) )
      | ~ gt(loopcounter,n0) )
    & ( ! [E] :
          ( a_select2(rho_init,E) = init
          | ~ leq(E,n4)
          | ~ leq(n0,E) )
      | ~ gt(loopcounter,n0) )
    & ( ! [D] :
          ( a_select2(mu_init,D) = init
          | ~ leq(D,n4)
          | ~ leq(n0,D) )
      | ~ gt(loopcounter,n0) )
    & ! [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(n1,loopcounter)
    & leq(tptp_float_0_001,pv76) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f252,plain,
    ( a_select2(rho_init,sK23_skl) != init
    & leq(sK23_skl,n4)
    & leq(n0,sK23_skl)
    & ( ! [F] :
          ( a_select2(sigma_init,F) = init
          | ~ leq(F,n4)
          | ~ leq(n0,F) )
      | ~ gt(loopcounter,n0) )
    & ( ! [E] :
          ( a_select2(rho_init,E) = init
          | ~ leq(E,n4)
          | ~ leq(n0,E) )
      | ~ gt(loopcounter,n0) )
    & ( ! [D] :
          ( a_select2(mu_init,D) = init
          | ~ leq(D,n4)
          | ~ leq(n0,D) )
      | ~ gt(loopcounter,n0) )
    & ! [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(n1,loopcounter)
    & leq(tptp_float_0_001,pv76) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(G,sK23_skl)],[f251]) ).

fof(f254,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[status(thm)],[f252]) ).

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

fof(f260,plain,
    leq(n0,sK23_skl),
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f261,plain,
    leq(sK23_skl,n4),
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f262,plain,
    a_select2(rho_init,sK23_skl) != init,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f305,plain,
    succ(n0) = n1,
    inference(cnf_transformation,[status(thm)],[f91]) ).

fof(f361,plain,
    ( ~ leq(sK23_skl,n4)
    | ~ leq(n0,sK23_skl)
    | ~ gt(loopcounter,n0) ),
    inference(resolution,[status(thm)],[f258,f262]) ).

fof(f362,plain,
    ( ~ leq(sK23_skl,n4)
    | ~ gt(loopcounter,n0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f361,f260]) ).

fof(f363,plain,
    ~ gt(loopcounter,n0),
    inference(forward_subsumption_resolution,[status(thm)],[f362,f261]) ).

fof(f391,plain,
    ~ leq(succ(n0),loopcounter),
    inference(resolution,[status(thm)],[f225,f363]) ).

fof(f394,plain,
    ~ leq(n1,loopcounter),
    inference(forward_demodulation,[status(thm)],[f305,f391]) ).

fof(f395,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f394,f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV182+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n010.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 08:34:10 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.38  % Drodi V4.1.1
% 0.08/0.41  % Refutation found
% 0.08/0.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.42  % Elapsed time: 0.048099 seconds
% 0.08/0.42  % CPU time: 0.134679 seconds
% 0.08/0.42  % Total memory used: 51.487 MB
% 0.08/0.42  % Net memory used: 51.376 MB
%------------------------------------------------------------------------------