↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV156+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 : n005.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.07s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   79 (  21 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   82 (  18   ~;  13   |;  40   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  12 con; 0-3 aty)
%            Number of variables   :   23 (  22   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [X,Y] :
      ( leq(X,pred(Y))
    <=> gt(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,C,tptp_sum_index))) = n1 ) ) ),
    file('/export/starexec/sandbox2/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,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,C,tptp_sum_index))) = n1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f98,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f115,plain,
    ! [X,Y] :
      ( ( ~ gt(Y,X)
        | leq(X,pred(Y)) )
      & ( gt(Y,X)
        | ~ leq(X,pred(Y)) ) ),
    inference(NNF_transformation,[status(thm)],[f10]) ).

fof(f116,plain,
    ( ! [X,Y] :
        ( ~ gt(Y,X)
        | leq(X,pred(Y)) )
    & ! [X,Y] :
        ( gt(Y,X)
        | ~ leq(X,pred(Y)) ) ),
    inference(miniscoping,[status(thm)],[f115]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | ~ leq(X0,pred(X1)) ),
    inference(cnf_transformation,[status(thm)],[f116]) ).

fof(f251,plain,
    ( ? [C] :
        ( sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),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,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),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(f261,plain,
    leq(sK23_skl,pred(pv10)),
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f262,plain,
    pv10 = sK23_skl,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f382,plain,
    leq(sK23_skl,pred(sK23_skl)),
    inference(forward_demodulation,[status(thm)],[f262,f261]) ).

fof(f383,plain,
    gt(sK23_skl,sK23_skl),
    inference(resolution,[status(thm)],[f382,f117]) ).

fof(f385,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f383,f98]) ).

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