↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV155+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n002.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 : Fri Sep 25 03:12:23 PM UTC 2026

% Result   : Theorem 26.57s 4.17s
% Output   : Proof 26.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :   71 (  25 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   79 (  20   ~;  11   |;  38   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 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 (   0 sgn  10   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,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/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0005) ).

fof(f52_neg,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)],[f52]) ).

fof(f52_nnf,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(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B] :
      ( sum(n0,n4,a_select3(q,sk27,tptp_sum_index)) != n1
      & pv10 != sk27
      & leq(sk27,pred(pv10))
      & leq(n0,sk27)
      & ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
        | ~ leq(B,pred(pv10))
        | ~ leq(n0,B) )
      & ( 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(skolemisation,[status(esa),new_symbols(skolem,[sk27])],[f52_nnf]) ).

cnf(c261,plain,
    ( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
    | ~ leq(X1,pred(pv10))
    | ~ leq(n0,X1) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c262,plain,
    leq(n0,sk27),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p316,plain,
    ( sum(n0,n4,a_select3(q,sk27,tptp_sum_index)) = n1
    | ~ leq(sk27,pred(pv10)) ),
    inference(resolution,[status(thm)],[c261,c262]) ).

cnf(c263,plain,
    leq(sk27,pred(pv10)),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p318,plain,
    sum(n0,n4,a_select3(q,sk27,tptp_sum_index)) = n1,
    inference(resolution,[status(thm)],[p316,c263]) ).

cnf(c265,plain,
    sum(n0,n4,a_select3(q,sk27,tptp_sum_index)) != n1,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p319,plain,
    n1 != n1,
    inference(demodulation,[status(thm)],[p318,c265]) ).

cnf(p320,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p319]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV155+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n002.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Thu Sep 24 18:41:36 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.57/4.17  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.57/4.17  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------