↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

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

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  10 unt;   2 def)
%            Number of atoms       :  167 (  42 equ)
%            Maximal formula atoms :   33 (   7 avg)
%            Number of connectives :  206 (  62   ~;  56   |;  58   &)
%                                         (   2 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  15 con; 0-3 aty)
%            Number of variables   :   43 (   0 sgn  41   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( gt(loopcounter,n1)
      & ! [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 ) ) )
   => ! [X9] :
        ( ( leq(n0,X9)
          & leq(X9,n4) )
       => a_select2(rhoold_init,X9) = init ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0101) ).

fof(f54,negated_conjecture,
    ~ ( ( gt(loopcounter,n1)
        & ! [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 ) ) )
     => ! [X9] :
          ( ( leq(n0,X9)
            & leq(X9,n4) )
         => a_select2(rhoold_init,X9) = init ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f143,plain,
    ( ? [X9] :
        ( init != a_select2(rhoold_init,X9)
        & leq(n0,X9)
        & leq(X9,n4) )
    & gt(loopcounter,n1)
    & ! [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,
    ( ? [X9] :
        ( init != a_select2(rhoold_init,X9)
        & leq(n0,X9)
        & leq(X9,n4) )
    & gt(loopcounter,n1)
    & ! [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(f317,plain,
    ! [X7] :
      ( ~ gt(loopcounter,n1)
      | ~ leq(X7,n4)
      | ~ leq(n0,X7)
      | init = a_select2(rhoold_init,X7) ),
    inference(cnf_transformation,[],[f144]) ).

fof(f319,plain,
    leq(sK31,n4),
    inference(cnf_transformation,[],[f144]) ).

fof(f320,plain,
    leq(n0,sK31),
    inference(cnf_transformation,[],[f144]) ).

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

fof(f326,plain,
    gt(loopcounter,n1),
    inference(cnf_transformation,[],[f144]) ).

fof(f401,definition,
    ( spl32_2
  <=> gt(loopcounter,n1) ),
    introduced(definition,[new_symbols(definition,[spl32_2])],[avatar_definition]) ).

fof(f406,definition,
    ( spl32_3
  <=> ! [X7] :
        ( ~ leq(X7,n4)
        | init = a_select2(rhoold_init,X7)
        | ~ leq(n0,X7) ) ),
    introduced(definition,[new_symbols(definition,[spl32_3])],[avatar_definition]) ).

fof(f407,plain,
    ( ! [X7] :
        ( ~ leq(X7,n4)
        | ~ leq(n0,X7)
        | init = a_select2(rhoold_init,X7) )
    | ~ spl32_3 ),
    inference(avatar_component_clause,[],[f406]) ).

fof(f408,plain,
    ( spl32_3
    | ~ spl32_2 ),
    inference(avatar_split_clause,[],[f317,f401,f406]) ).

fof(f413,plain,
    spl32_2,
    inference(avatar_split_clause,[],[f326,f401]) ).

fof(f425,plain,
    ( ~ leq(n0,sK31)
    | init = a_select2(rhoold_init,sK31)
    | ~ spl32_3 ),
    inference(resolution,[],[f407,f319]) ).

fof(f426,plain,
    ( init = a_select2(rhoold_init,sK31)
    | ~ spl32_3 ),
    inference(forward_subsumption_resolution,[],[f425,f320]) ).

fof(f427,plain,
    ( $false
    | ~ spl32_3 ),
    inference(forward_subsumption_resolution,[],[f426,f321]) ).

fof(f428,plain,
    ~ spl32_3,
    inference(avatar_contradiction_clause,[],[f427]) ).

cnf(s2,plain,
    ( ~ spl32_2
    | spl32_3 ),
    inference(sat_conversion,[],[f408]) ).

cnf(s4,plain,
    spl32_2,
    inference(sat_conversion,[],[f413]) ).

cnf(s5,plain,
    ~ spl32_3,
    inference(sat_conversion,[],[f428]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s2,s5,s4]) ).

fof(f429,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV185+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n011.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 10:08:15 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.26  % (3296646)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (3296655)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=881806608:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26  % (3296652)% WARNING: option uhcvi not known.
% 0.09/0.26  % (3296655) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3296646-3296655"...
% 0.09/0.26  % (3296651)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2969455314_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26  % (3296652)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3073465159:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26  % (3296653)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3926232217:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26  % (3296654)dis+10_1_sil=32000:sp=arity:random_seed=3460901007:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26  % (3296656)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1090186832:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26  % (3296655)...printing done.
% 0.09/0.26  % (3296657)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1279463271:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26  % (3296655)Refutation found. Thanks to Tanya!
% 0.09/0.26  % SZS status Theorem for theBenchmark
% 0.09/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26  % (3296655)------------------------------
% 0.09/0.26  % (3296655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (3296655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (3296655)CaDiCaL version: 2.1.3
% 0.09/0.26  % (3296655)Termination reason: Refutation
% 0.09/0.26  % (3296655)Time elapsed: 0.007 s
% 0.09/0.26  % (3296655)Peak memory usage: 13 MB
% 0.09/0.26  % (3296655)Instructions burned: 25 (million)
% 0.09/0.26  % (3296646)Success in time 0.035 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------