↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV169+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 : n004.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:24 PM UTC 2026

% Result   : Theorem 23.29s 4.21s
% Output   : Proof 23.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :  123 (  29 equ)
%            Maximal formula atoms :   28 (  10 avg)
%            Number of connectives :  153 (  42   ~;  37   |;  58   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   29 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f52,conjecture,
    ( ( ! [G] :
          ( ( leq(G,n4)
            & leq(n0,G) )
         => a_select3(center_init,G,n0) = init )
      & ! [E] :
          ( ( leq(E,pred(pv10))
            & leq(n0,E) )
         => ! [F] :
              ( ( leq(F,n4)
                & leq(n0,F) )
             => a_select3(q_init,E,F) = init ) )
      & ! [C,D] :
          ( ( leq(D,n4)
            & leq(C,n135299)
            & leq(n0,D)
            & leq(n0,C) )
         => ( gt(pv10,C)
           => a_select3(q_init,C,D) = init ) )
      & ! [A,B] :
          ( ( leq(B,n4)
            & leq(A,n135299)
            & leq(n0,B)
            & leq(n0,A) )
         => ( ( gt(pv11,B)
              & A = pv10 )
           => a_select3(q_init,A,B) = init ) )
      & leq(pv65,n4)
      & leq(pv11,n4)
      & leq(pv10,n135299)
      & leq(n0,pv65)
      & leq(n0,pv11)
      & leq(n0,pv10) )
   => a_select3(center_init,pv65,n0) = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0021) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( ! [G] :
            ( ( leq(G,n4)
              & leq(n0,G) )
           => a_select3(center_init,G,n0) = init )
        & ! [E] :
            ( ( leq(E,pred(pv10))
              & leq(n0,E) )
           => ! [F] :
                ( ( leq(F,n4)
                  & leq(n0,F) )
               => a_select3(q_init,E,F) = init ) )
        & ! [C,D] :
            ( ( leq(D,n4)
              & leq(C,n135299)
              & leq(n0,D)
              & leq(n0,C) )
           => ( gt(pv10,C)
             => a_select3(q_init,C,D) = init ) )
        & ! [A,B] :
            ( ( leq(B,n4)
              & leq(A,n135299)
              & leq(n0,B)
              & leq(n0,A) )
           => ( ( gt(pv11,B)
                & A = pv10 )
             => a_select3(q_init,A,B) = init ) )
        & leq(pv65,n4)
        & leq(pv11,n4)
        & leq(pv10,n135299)
        & leq(n0,pv65)
        & leq(n0,pv11)
        & leq(n0,pv10) )
     => a_select3(center_init,pv65,n0) = init ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( a_select3(center_init,pv65,n0) != init
    & ! [G] :
        ( a_select3(center_init,G,n0) = init
        | ~ leq(G,n4)
        | ~ leq(n0,G) )
    & ! [E] :
        ( ! [F] :
            ( a_select3(q_init,E,F) = init
            | ~ leq(F,n4)
            | ~ leq(n0,F) )
        | ~ leq(E,pred(pv10))
        | ~ leq(n0,E) )
    & ! [C,D] :
        ( a_select3(q_init,C,D) = init
        | ~ gt(pv10,C)
        | ~ leq(D,n4)
        | ~ leq(C,n135299)
        | ~ leq(n0,D)
        | ~ leq(n0,C) )
    & ! [A,B] :
        ( a_select3(q_init,A,B) = init
        | ~ gt(pv11,B)
        | A != pv10
        | ~ leq(B,n4)
        | ~ leq(A,n135299)
        | ~ leq(n0,B)
        | ~ leq(n0,A) )
    & leq(pv65,n4)
    & leq(pv11,n4)
    & leq(pv10,n135299)
    & leq(n0,pv65)
    & leq(n0,pv11)
    & leq(n0,pv10) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B,C,D,E,F,G] :
      ( a_select3(center_init,pv65,n0) != init
      & ( a_select3(center_init,G,n0) = init
        | ~ leq(G,n4)
        | ~ leq(n0,G) )
      & ( a_select3(q_init,E,F) = init
        | ~ leq(F,n4)
        | ~ leq(n0,F)
        | ~ leq(E,pred(pv10))
        | ~ leq(n0,E) )
      & ( a_select3(q_init,C,D) = init
        | ~ gt(pv10,C)
        | ~ leq(D,n4)
        | ~ leq(C,n135299)
        | ~ leq(n0,D)
        | ~ leq(n0,C) )
      & ( a_select3(q_init,A,B) = init
        | ~ gt(pv11,B)
        | A != pv10
        | ~ leq(B,n4)
        | ~ leq(A,n135299)
        | ~ leq(n0,B)
        | ~ leq(n0,A) )
      & leq(pv65,n4)
      & leq(pv11,n4)
      & leq(pv10,n135299)
      & leq(n0,pv65)
      & leq(n0,pv11)
      & leq(n0,pv10) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c264,plain,
    ( a_select3(center_init,X6,n0) = init
    | ~ leq(X6,n4)
    | ~ leq(n0,X6) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(c257,plain,
    leq(n0,pv65),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p364,plain,
    ( a_select3(center_init,pv65,n0) = init
    | ~ leq(pv65,n4) ),
    inference(resolution,[status(thm)],[c264,c257]) ).

cnf(c260,plain,
    leq(pv65,n4),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p366,plain,
    a_select3(center_init,pv65,n0) = init,
    inference(resolution,[status(thm)],[p364,c260]) ).

cnf(c265,plain,
    a_select3(center_init,pv65,n0) != init,
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

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

cnf(p368,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p367]) ).

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