↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 22.98s 3.82s
% Output   : Proof 22.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :  143 (  31 equ)
%            Maximal formula atoms :   26 (   5 avg)
%            Number of connectives :  167 (  48   ~;  45   |;  50   &)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  15 con; 0-3 aty)
%            Number of variables   :   52 (   0 sgn  44   !;   1   ?)

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

fof(f8_nnf,plain,
    ! [X,Y] :
      ( gt(Y,X)
      | X = Y
      | ~ leq(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X,Y] :
      ( gt(Y,X)
      | X = Y
      | ~ leq(X,Y) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c10,plain,
    ( gt(X1,X0)
    | X0 = X1
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

fof(f52,conjecture,
    ( ( ( gt(loopcounter,n0)
       => ! [F] :
            ( ( leq(F,n4)
              & leq(n0,F) )
           => a_select2(sigma_init,F) = init ) )
      & ( gt(loopcounter,n0)
       => ! [E] :
            ( ( leq(E,n4)
              & leq(n0,E) )
           => a_select2(rho_init,E) = init ) )
      & ( gt(loopcounter,n0)
       => ! [D] :
            ( ( leq(D,n4)
              & leq(n0,D) )
           => a_select2(mu_init,D) = init ) )
      & ! [C] :
          ( ( leq(C,n4)
            & leq(n0,C) )
         => a_select3(center_init,C,n0) = init )
      & ! [A] :
          ( ( leq(A,n135299)
            & leq(n0,A) )
         => ! [B] :
              ( ( leq(B,n4)
                & leq(n0,B) )
             => a_select3(q_init,A,B) = init ) )
      & gt(n1,loopcounter)
      & leq(n1,loopcounter)
      & leq(tptp_float_0_001,pv76) )
   => ! [G] :
        ( ( leq(G,n4)
          & leq(n0,G) )
       => a_select2(muold_init,G) = init ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0081) ).

fof(f52_neg,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => ! [F] :
              ( ( leq(F,n4)
                & leq(n0,F) )
             => a_select2(sigma_init,F) = init ) )
        & ( gt(loopcounter,n0)
         => ! [E] :
              ( ( leq(E,n4)
                & leq(n0,E) )
             => a_select2(rho_init,E) = init ) )
        & ( gt(loopcounter,n0)
         => ! [D] :
              ( ( leq(D,n4)
                & leq(n0,D) )
             => a_select2(mu_init,D) = init ) )
        & ! [C] :
            ( ( leq(C,n4)
              & leq(n0,C) )
           => a_select3(center_init,C,n0) = init )
        & ! [A] :
            ( ( leq(A,n135299)
              & leq(n0,A) )
           => ! [B] :
                ( ( leq(B,n4)
                  & leq(n0,B) )
               => a_select3(q_init,A,B) = init ) )
        & gt(n1,loopcounter)
        & leq(n1,loopcounter)
        & leq(tptp_float_0_001,pv76) )
     => ! [G] :
          ( ( leq(G,n4)
            & leq(n0,G) )
         => a_select2(muold_init,G) = init ) ),
    inference(negated_conjecture,[status(cth)],[f52]) ).

fof(f52_nnf,plain,
    ( ? [G] :
        ( a_select2(muold_init,G) != init
        & leq(G,n4)
        & leq(n0,G) )
    & ( ! [F] :
          ( a_select2(sigma_init,F) = init
          | ~ leq(F,n4)
          | ~ leq(n0,F) )
      | ~ gt(loopcounter,n0) )
    & ( ! [E] :
          ( a_select2(rho_init,E) = init
          | ~ leq(E,n4)
          | ~ leq(n0,E) )
      | ~ gt(loopcounter,n0) )
    & ( ! [D] :
          ( a_select2(mu_init,D) = init
          | ~ leq(D,n4)
          | ~ leq(n0,D) )
      | ~ gt(loopcounter,n0) )
    & ! [C] :
        ( a_select3(center_init,C,n0) = 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) )
    & gt(n1,loopcounter)
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv76) ),
    inference(nnf_transformation,[status(thm)],[f52_neg]) ).

fof(f52_sk,plain,
    ! [A,B,C,D,E,F] :
      ( a_select2(muold_init,sk27) != init
      & leq(sk27,n4)
      & leq(n0,sk27)
      & ( a_select2(sigma_init,F) = init
        | ~ leq(F,n4)
        | ~ leq(n0,F)
        | ~ gt(loopcounter,n0) )
      & ( a_select2(rho_init,E) = init
        | ~ leq(E,n4)
        | ~ leq(n0,E)
        | ~ gt(loopcounter,n0) )
      & ( a_select2(mu_init,D) = init
        | ~ leq(D,n4)
        | ~ leq(n0,D)
        | ~ gt(loopcounter,n0) )
      & ( a_select3(center_init,C,n0) = 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) )
      & gt(n1,loopcounter)
      & leq(n1,loopcounter)
      & leq(tptp_float_0_001,pv76) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk27])],[f52_nnf]) ).

cnf(c256,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p349,plain,
    ( gt(loopcounter,n1)
    | n1 = loopcounter ),
    inference(resolution,[status(thm)],[c10,c256]) ).

fof(f1,axiom,
    ! [X,Y,Z] :
      ( ( gt(Y,Z)
        & gt(X,Y) )
     => gt(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_gt) ).

fof(f1_nnf,plain,
    ! [X,Y,Z] :
      ( gt(X,Z)
      | ~ gt(Y,Z)
      | ~ gt(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y,Z] :
      ( gt(X,Z)
      | ~ gt(Y,Z)
      | ~ gt(X,Y) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( gt(X0,X2)
    | ~ gt(X1,X2)
    | ~ gt(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(c257,plain,
    gt(n1,loopcounter),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(p307,plain,
    ( gt(n1,X0)
    | ~ gt(loopcounter,X0) ),
    inference(resolution,[status(thm)],[c1,c257]) ).

cnf(p355,plain,
    ( gt(n1,n1)
    | n1 = loopcounter ),
    inference(resolution,[status(thm)],[p349,p307]) ).

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(p362,plain,
    n1 = loopcounter,
    inference(resolution,[status(thm)],[p355,c2]) ).

cnf(p363,plain,
    gt(n1,n1),
    inference(superposition,[status(thm)],[p362,c257]) ).

cnf(p368,plain,
    $false,
    inference(resolution,[status(thm)],[p363,c2]) ).

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