↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Result   : Theorem 0.12s 0.41s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
%            Number of atoms       :   70 (  22 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :   80 (  21   ~;  11   |;  38   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-3 aty)
%            Number of variables   :   12 (  11   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( ! [B] :
          ( ( leq(B,pred(pv10))
            & leq(n0,B) )
         => sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
      & ! [A] :
          ( ( leq(A,pred(pv12))
            & leq(n0,A) )
         => a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
      & leq(pv12,n4)
      & leq(pv10,n135299)
      & leq(n0,pv12)
      & leq(n0,pv10)
      & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
   => ! [C] :
        ( ( leq(C,pred(pv10))
          & leq(n0,C) )
       => ( pv10 != C
         => sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( ! [B] :
            ( ( leq(B,pred(pv10))
              & leq(n0,B) )
           => sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
        & ! [A] :
            ( ( leq(A,pred(pv12))
              & leq(n0,A) )
           => a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
        & leq(pv12,n4)
        & leq(pv10,n135299)
        & leq(n0,pv12)
        & leq(n0,pv10)
        & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
     => ! [C] :
          ( ( leq(C,pred(pv10))
            & leq(n0,C) )
         => ( pv10 != C
           => sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f251,plain,
    ( ? [C] :
        ( sum(n0,n4,a_select3(q,C,tptp_sum_index)) != n1
        & pv10 != C
        & leq(C,pred(pv10))
        & leq(n0,C) )
    & ! [B] :
        ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
        | ~ leq(B,pred(pv10))
        | ~ leq(n0,B) )
    & ! [A] :
        ( a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(A,pred(pv12))
        | ~ leq(n0,A) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f252,plain,
    ( sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index)) != n1
    & pv10 != sK23_skl
    & leq(sK23_skl,pred(pv10))
    & leq(n0,sK23_skl)
    & ! [B] :
        ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
        | ~ leq(B,pred(pv10))
        | ~ leq(n0,B) )
    & ! [A] :
        ( a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(A,pred(pv12))
        | ~ leq(n0,A) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(C,sK23_skl)],[f251]) ).

fof(f259,plain,
    ! [X0] :
      ( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1
      | ~ leq(X0,pred(pv10))
      | ~ leq(n0,X0) ),
    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,pred(pv10)),
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f263,plain,
    sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index)) != n1,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f358,plain,
    ( ~ leq(sK23_skl,pred(pv10))
    | ~ leq(n0,sK23_skl) ),
    inference(resolution,[status(thm)],[f259,f263]) ).

fof(f359,plain,
    ~ leq(sK23_skl,pred(pv10)),
    inference(forward_subsumption_resolution,[status(thm)],[f358,f260]) ).

fof(f363,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f359,f261]) ).

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