↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV171+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n005.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 : Tue Sep 29 01:08:18 PM UTC 2026

% Result   : Theorem 3.50s 1.28s
% Output   : Refutation 3.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   5 unt;   0 def)
%            Number of atoms       :  157 (  39 equ)
%            Maximal formula atoms :   36 (  13 avg)
%            Number of connectives :  199 (  54   ~;  47   |;  72   &)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  17 con; 0-3 aty)
%            Number of variables   :   37 (  37   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( leq(n0,pv10)
      & leq(n0,pv52)
      & leq(n0,pv54)
      & leq(pv10,n135299)
      & leq(pv52,n4)
      & leq(pv54,n4)
      & ! [X0] :
          ( ( leq(n0,X0)
            & leq(X0,n135299) )
         => ! [X1] :
              ( ( leq(n0,X1)
                & leq(X1,n4) )
             => a_select3(q_init,X0,X1) = init ) )
      & ! [X2] :
          ( ( leq(n0,X2)
            & leq(X2,n4) )
         => a_select2(rho_init,X2) = init )
      & ! [X3] :
          ( ( leq(n0,X3)
            & leq(X3,n4) )
         => a_select2(mu_init,X3) = init )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(sigma_init,X4) = init )
      & ! [X5] :
          ( ( leq(n0,X5)
            & leq(X5,n4) )
         => a_select3(center_init,X5,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X6] :
            ( ( leq(n0,X6)
              & leq(X6,n4) )
           => a_select2(muold_init,X6) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X7] :
            ( ( leq(n0,X7)
              & leq(X7,n4) )
           => a_select2(rhoold_init,X7) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X8] :
            ( ( leq(n0,X8)
              & leq(X8,n4) )
           => a_select2(sigmaold_init,X8) = init ) ) )
   => a_select2(sigma_init,pv52) = init ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0031) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(n0,pv52)
        & leq(n0,pv54)
        & leq(pv10,n135299)
        & leq(pv52,n4)
        & leq(pv54,n4)
        & ! [X0] :
            ( ( leq(n0,X0)
              & leq(X0,n135299) )
           => ! [X1] :
                ( ( leq(n0,X1)
                  & leq(X1,n4) )
               => a_select3(q_init,X0,X1) = init ) )
        & ! [X2] :
            ( ( leq(n0,X2)
              & leq(X2,n4) )
           => a_select2(rho_init,X2) = init )
        & ! [X3] :
            ( ( leq(n0,X3)
              & leq(X3,n4) )
           => a_select2(mu_init,X3) = init )
        & ! [X4] :
            ( ( leq(n0,X4)
              & leq(X4,n4) )
           => a_select2(sigma_init,X4) = init )
        & ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select3(center_init,X5,n0) = init )
        & ( gt(loopcounter,n1)
         => ! [X6] :
              ( ( leq(n0,X6)
                & leq(X6,n4) )
             => a_select2(muold_init,X6) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X7] :
              ( ( leq(n0,X7)
                & leq(X7,n4) )
             => a_select2(rhoold_init,X7) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X8] :
              ( ( leq(n0,X8)
                & leq(X8,n4) )
             => a_select2(sigmaold_init,X8) = init ) ) )
     => a_select2(sigma_init,pv52) = init ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f143,plain,
    ( init != a_select2(sigma_init,pv52)
    & leq(n0,pv10)
    & leq(n0,pv52)
    & leq(n0,pv54)
    & leq(pv10,n135299)
    & leq(pv52,n4)
    & leq(pv54,n4)
    & ! [X0] :
        ( ! [X1] :
            ( a_select3(q_init,X0,X1) = init
            | ~ leq(n0,X1)
            | ~ leq(X1,n4) )
        | ~ leq(n0,X0)
        | ~ leq(X0,n135299) )
    & ! [X2] :
        ( a_select2(rho_init,X2) = init
        | ~ leq(n0,X2)
        | ~ leq(X2,n4) )
    & ! [X3] :
        ( a_select2(mu_init,X3) = init
        | ~ leq(n0,X3)
        | ~ leq(X3,n4) )
    & ! [X4] :
        ( a_select2(sigma_init,X4) = init
        | ~ leq(n0,X4)
        | ~ leq(X4,n4) )
    & ! [X5] :
        ( a_select3(center_init,X5,n0) = init
        | ~ leq(n0,X5)
        | ~ leq(X5,n4) )
    & ( ! [X6] :
          ( a_select2(muold_init,X6) = init
          | ~ leq(n0,X6)
          | ~ leq(X6,n4) )
      | ~ gt(loopcounter,n1) )
    & ( ! [X7] :
          ( a_select2(rhoold_init,X7) = init
          | ~ leq(n0,X7)
          | ~ leq(X7,n4) )
      | ~ gt(loopcounter,n1) )
    & ( ! [X8] :
          ( a_select2(sigmaold_init,X8) = init
          | ~ leq(n0,X8)
          | ~ leq(X8,n4) )
      | ~ gt(loopcounter,n1) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ( init != a_select2(sigma_init,pv52)
    & leq(n0,pv10)
    & leq(n0,pv52)
    & leq(n0,pv54)
    & leq(pv10,n135299)
    & leq(pv52,n4)
    & leq(pv54,n4)
    & ! [X0] :
        ( ! [X1] :
            ( a_select3(q_init,X0,X1) = init
            | ~ leq(n0,X1)
            | ~ leq(X1,n4) )
        | ~ leq(n0,X0)
        | ~ leq(X0,n135299) )
    & ! [X2] :
        ( a_select2(rho_init,X2) = init
        | ~ leq(n0,X2)
        | ~ leq(X2,n4) )
    & ! [X3] :
        ( a_select2(mu_init,X3) = init
        | ~ leq(n0,X3)
        | ~ leq(X3,n4) )
    & ! [X4] :
        ( a_select2(sigma_init,X4) = init
        | ~ leq(n0,X4)
        | ~ leq(X4,n4) )
    & ! [X5] :
        ( a_select3(center_init,X5,n0) = init
        | ~ leq(n0,X5)
        | ~ leq(X5,n4) )
    & ( ! [X6] :
          ( a_select2(muold_init,X6) = init
          | ~ leq(n0,X6)
          | ~ leq(X6,n4) )
      | ~ gt(loopcounter,n1) )
    & ( ! [X7] :
          ( a_select2(rhoold_init,X7) = init
          | ~ leq(n0,X7)
          | ~ leq(X7,n4) )
      | ~ gt(loopcounter,n1) )
    & ( ! [X8] :
          ( a_select2(sigmaold_init,X8) = init
          | ~ leq(n0,X8)
          | ~ leq(X8,n4) )
      | ~ gt(loopcounter,n1) ) ),
    inference(flattening,[],[f143]) ).

fof(f311,plain,
    ! [X4] :
      ( init = a_select2(sigma_init,X4)
      | ~ leq(n0,X4)
      | ~ leq(X4,n4) ),
    inference(cnf_transformation,[],[f144]) ).

fof(f316,plain,
    leq(pv52,n4),
    inference(cnf_transformation,[],[f144]) ).

fof(f319,plain,
    leq(n0,pv52),
    inference(cnf_transformation,[],[f144]) ).

fof(f321,plain,
    init != a_select2(sigma_init,pv52),
    inference(cnf_transformation,[],[f144]) ).

fof(f380,plain,
    ( init != init
    | ~ leq(n0,pv52)
    | ~ leq(pv52,n4) ),
    inference(superposition,[],[f321,f311]) ).

fof(f381,plain,
    ( ~ leq(n0,pv52)
    | ~ leq(pv52,n4) ),
    inference(trivial_inequality_removal,[],[f380]) ).

fof(f382,plain,
    ~ leq(pv52,n4),
    inference(forward_subsumption_resolution,[],[f381,f319]) ).

fof(f383,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f382,f316]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV171+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n005.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 10:04:17 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running first-order theorem proving
% 0.09/0.24  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.50/1.28  % (685505)Detected formulas, will run a generic FOF schedule.
% 3.50/1.28  % (685510)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3668494395:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.50/1.28  % (685515)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1061250833:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.50/1.28  % (685512)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=372367024:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.50/1.28  % (685515)First to succeed.
% 3.50/1.28  % (685515)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-685505"
% 3.50/1.28  % (685511)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1095358858:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.50/1.28  % (685514)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=953952767:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.50/1.28  % (685513)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2433190820:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.50/1.28  % (685514)Also succeeded, but the first one will report.
% 3.50/1.28  % (685516)dis-21_1_sil=8000:lcm=predicate:random_seed=2058261854:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.50/1.28  % (685516)Also succeeded, but the first one will report.
% 3.50/1.28  % (685513)Also succeeded, but the first one will report.
% 3.50/1.28  % (685515)Refutation found. Thanks to Tanya!
% 3.50/1.28  % SZS status Theorem for theBenchmark
% 3.50/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.28  % (685515)------------------------------
% 3.50/1.28  % (685515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.28  % (685515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.28  % (685515)CaDiCaL version: 2.1.3
% 3.50/1.28  % (685515)Termination reason: Refutation
% 3.50/1.28  % (685515)Time elapsed: 0.007 s
% 3.50/1.28  % (685515)Peak memory usage: 89 MB
% 3.50/1.28  % (685515)Instructions burned: 10 (million)
% 3.50/1.28  % (685515)------------------------------
% 3.50/1.28  % (685515)------------------------------
% 3.50/1.28  % (685505)Success in time 0.416 s
% 3.50/1.28  % Vampire exiting
%------------------------------------------------------------------------------