↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 58.86s 8.15s
% Output   : Proof 58.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :  139 (  28 equ)
%            Maximal formula atoms :   26 (   6 avg)
%            Number of connectives :  170 (  53   ~;  46   |;  45   &)
%                                         (   1 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  15 con; 0-3 aty)
%            Number of variables   :   56 (   0 sgn  48   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X,Y,Z] :
      ( ( leq(Y,Z)
        & leq(X,Y) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f4_nnf,plain,
    ! [X,Y,Z] :
      ( leq(X,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X,Y,Z] :
      ( leq(X,Z)
      | ~ leq(Y,Z)
      | ~ leq(X,Y) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( leq(X0,X2)
    | ~ leq(X1,X2)
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

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,n4)
            & 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 ) ) )
   => ! [H] :
        ( ( leq(H,tptp_minus_1)
          & leq(n0,H) )
       => a_select2(mu_init,H) = init ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0116) ).

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,n4)
              & 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 ) ) )
     => ! [H] :
          ( ( leq(H,tptp_minus_1)
            & leq(n0,H) )
         => a_select2(mu_init,H) = init ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ? [H] :
        ( a_select2(mu_init,H) != init
        & leq(H,tptp_minus_1)
        & leq(n0,H) )
    & ( ! [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,n4)
        | ~ leq(n0,C) )
    & ! [A] :
        ( ! [B] :
            ( a_select3(q_init,A,B) = init
            | ~ leq(B,n4)
            | ~ leq(n0,B) )
        | ~ leq(A,n135299)
        | ~ leq(n0,A) ) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B,C,D,E,F,G] :
      ( a_select2(mu_init,sk27) != init
      & leq(sk27,tptp_minus_1)
      & leq(n0,sk27)
      & ( 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,n4)
        | ~ leq(n0,C) )
      & ( a_select3(q_init,A,B) = init
        | ~ leq(B,n4)
        | ~ leq(n0,B)
        | ~ leq(A,n135299)
        | ~ leq(n0,A) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk27])],[f52_nnf]) ).

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

cnf(p311,plain,
    ( leq(n0,X0)
    | ~ leq(sk27,X0) ),
    inference(resolution,[status(thm)],[c4,c261]) ).

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

cnf(p11500,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[status(thm)],[p311,c262]) ).

fof(f12,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> gt(succ(Y),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).

fof(f12_nnf,plain,
    ! [X,Y] :
      ( ( ~ gt(succ(Y),X)
        | leq(X,Y) )
      & ( gt(succ(Y),X)
        | ~ leq(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X,Y] :
      ( ( ~ gt(succ(Y),X)
        | leq(X,Y) )
      & ( gt(succ(Y),X)
        | ~ leq(X,Y) ) ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c15,plain,
    ( gt(succ(X1),X0)
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(p11504,plain,
    gt(n0,n0),
    inference(resolution,[status(thm)],[p11500,c15]) ).

fof(f2,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).

fof(f2_nnf,plain,
    ! [X] : ~ gt(X,X),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] : ~ gt(X,X),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ~ gt(X0,X0),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p11641,plain,
    $false,
    inference(resolution,[status(thm)],[p11504,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV188+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.38  % Computer : n018.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Thu Sep 24 18:45:19 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 58.86/8.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 58.86/8.15  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------