↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n006.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:25 PM UTC 2026

% Result   : Theorem 25.51s 3.79s
% Output   : Proof 25.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   8 unt;   0 def)
%            Number of atoms       :  134 (  35 equ)
%            Maximal formula atoms :   28 (   8 avg)
%            Number of connectives :  167 (  49   ~;  44   |;  52   &)
%                                         (   0 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   6 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   :   32 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ( ( gt(loopcounter,n1)
       => ! [G] :
            ( ( leq(G,n4)
              & leq(n0,G) )
           => a_select2(sigmaold_init,G) = init ) )
      & ( gt(loopcounter,n1)
       => ! [F] :
            ( ( leq(F,n4)
              & leq(n0,F) )
           => a_select2(rhoold_init,F) = init ) )
      & ( gt(loopcounter,n1)
       => ! [E] :
            ( ( leq(E,n4)
              & leq(n0,E) )
           => a_select2(muold_init,E) = init ) )
      & ! [D] :
          ( ( leq(D,n4)
            & leq(n0,D) )
         => a_select3(center_init,D,n0) = init )
      & ! [C] :
          ( ( leq(C,pred(pv28))
            & 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(pv30,n135299)
      & leq(pv28,n4)
      & leq(n0,pv30)
      & leq(n0,pv28) )
   => a_select3(q_init,pv30,pv28) = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0051) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n1)
         => ! [G] :
              ( ( leq(G,n4)
                & leq(n0,G) )
             => a_select2(sigmaold_init,G) = init ) )
        & ( gt(loopcounter,n1)
         => ! [F] :
              ( ( leq(F,n4)
                & leq(n0,F) )
             => a_select2(rhoold_init,F) = init ) )
        & ( gt(loopcounter,n1)
         => ! [E] :
              ( ( leq(E,n4)
                & leq(n0,E) )
             => a_select2(muold_init,E) = init ) )
        & ! [D] :
            ( ( leq(D,n4)
              & leq(n0,D) )
           => a_select3(center_init,D,n0) = init )
        & ! [C] :
            ( ( leq(C,pred(pv28))
              & 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(pv30,n135299)
        & leq(pv28,n4)
        & leq(n0,pv30)
        & leq(n0,pv28) )
     => a_select3(q_init,pv30,pv28) = init ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( a_select3(q_init,pv30,pv28) != init
    & ( ! [G] :
          ( a_select2(sigmaold_init,G) = init
          | ~ leq(G,n4)
          | ~ leq(n0,G) )
      | ~ gt(loopcounter,n1) )
    & ( ! [F] :
          ( a_select2(rhoold_init,F) = init
          | ~ leq(F,n4)
          | ~ leq(n0,F) )
      | ~ gt(loopcounter,n1) )
    & ( ! [E] :
          ( a_select2(muold_init,E) = init
          | ~ leq(E,n4)
          | ~ leq(n0,E) )
      | ~ gt(loopcounter,n1) )
    & ! [D] :
        ( a_select3(center_init,D,n0) = init
        | ~ leq(D,n4)
        | ~ leq(n0,D) )
    & ! [C] :
        ( a_select2(rho_init,C) = init
        | ~ leq(C,pred(pv28))
        | ~ 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(pv30,n135299)
    & leq(pv28,n4)
    & leq(n0,pv30)
    & leq(n0,pv28) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B,C,D,E,F,G] :
      ( a_select3(q_init,pv30,pv28) != init
      & ( a_select2(sigmaold_init,G) = init
        | ~ leq(G,n4)
        | ~ leq(n0,G)
        | ~ gt(loopcounter,n1) )
      & ( a_select2(rhoold_init,F) = init
        | ~ leq(F,n4)
        | ~ leq(n0,F)
        | ~ gt(loopcounter,n1) )
      & ( a_select2(muold_init,E) = init
        | ~ leq(E,n4)
        | ~ leq(n0,E)
        | ~ gt(loopcounter,n1) )
      & ( a_select3(center_init,D,n0) = init
        | ~ leq(D,n4)
        | ~ leq(n0,D) )
      & ( a_select2(rho_init,C) = init
        | ~ leq(C,pred(pv28))
        | ~ leq(n0,C) )
      & ( a_select3(q_init,A,B) = init
        | ~ leq(B,n4)
        | ~ leq(n0,B)
        | ~ leq(A,n135299)
        | ~ leq(n0,A) )
      & leq(pv30,n135299)
      & leq(pv28,n4)
      & leq(n0,pv30)
      & leq(n0,pv28) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c259,plain,
    ( a_select3(q_init,X0,X1) = init
    | ~ leq(X1,n4)
    | ~ leq(n0,X1)
    | ~ leq(X0,n135299)
    | ~ leq(n0,X0) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c256,plain,
    leq(n0,pv30),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p310,plain,
    ( a_select3(q_init,pv30,X0) = init
    | ~ leq(X0,n4)
    | ~ leq(n0,X0)
    | ~ leq(pv30,n135299) ),
    inference(resolution,[status(thm)],[c259,c256]) ).

cnf(c258,plain,
    leq(pv30,n135299),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p320,plain,
    ( a_select3(q_init,pv30,X0) = init
    | ~ leq(X0,n4)
    | ~ leq(n0,X0) ),
    inference(resolution,[status(thm)],[p310,c258]) ).

cnf(c255,plain,
    leq(n0,pv28),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p325,plain,
    ( a_select3(q_init,pv30,pv28) = init
    | ~ leq(pv28,n4) ),
    inference(resolution,[status(thm)],[p320,c255]) ).

cnf(c257,plain,
    leq(pv28,n4),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p326,plain,
    a_select3(q_init,pv30,pv28) = init,
    inference(resolution,[status(thm)],[p325,c257]) ).

cnf(c265,plain,
    a_select3(q_init,pv30,pv28) != init,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p327,plain,
    init != init,
    inference(demodulation,[status(thm)],[p326,c265]) ).

cnf(p328,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p327]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35  % Computer : n006.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 18:40:56 UTC 2026
% 0.07/0.36  % CPUTime  : 
% 0.07/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 25.51/3.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 25.51/3.79  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------