↑ 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  : SWV174+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 : n017.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:23 PM UTC 2026

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :  135 (  26 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :  159 (  49   ~;  42   |;  55   &)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-3 aty)
%            Number of variables   :   44 (  38   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1] :
      ( leq(X0,pred(X1))
    <=> gt(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

fof(f53,conjecture,
    ( ( leq(n0,pv10)
      & leq(pv10,n135299)
      & ! [X0] :
          ( ( leq(n0,X0)
            & leq(X0,pred(pv10)) )
         => ! [X1] :
              ( ( leq(n0,X1)
                & leq(X1,n4) )
             => a_select3(q_init,X0,X1) = init ) )
      & ! [X2] :
          ( ( leq(n0,X2)
            & leq(X2,n4) )
         => a_select3(center_init,X2,n0) = init ) )
   => ! [X3,X4] :
        ( ( leq(n0,X3)
          & leq(n0,X4)
          & leq(X3,n135299)
          & leq(X4,n4) )
       => ( gt(pv10,X3)
         => a_select3(q_init,X3,X4) = init ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0046) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(pv10,n135299)
        & ! [X0] :
            ( ( leq(n0,X0)
              & leq(X0,pred(pv10)) )
           => ! [X1] :
                ( ( leq(n0,X1)
                  & leq(X1,n4) )
               => a_select3(q_init,X0,X1) = init ) )
        & ! [X2] :
            ( ( leq(n0,X2)
              & leq(X2,n4) )
           => a_select3(center_init,X2,n0) = init ) )
     => ! [X3,X4] :
          ( ( leq(n0,X3)
            & leq(n0,X4)
            & leq(X3,n135299)
            & leq(X4,n4) )
         => ( gt(pv10,X3)
           => a_select3(q_init,X3,X4) = init ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f143,plain,
    ( ? [X3,X4] :
        ( init != a_select3(q_init,X3,X4)
        & gt(pv10,X3)
        & leq(n0,X3)
        & leq(n0,X4)
        & leq(X3,n135299)
        & leq(X4,n4) )
    & leq(n0,pv10)
    & leq(pv10,n135299)
    & ! [X0] :
        ( ! [X1] :
            ( a_select3(q_init,X0,X1) = init
            | ~ leq(n0,X1)
            | ~ leq(X1,n4) )
        | ~ leq(n0,X0)
        | ~ leq(X0,pred(pv10)) )
    & ! [X2] :
        ( a_select3(center_init,X2,n0) = init
        | ~ leq(n0,X2)
        | ~ leq(X2,n4) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ( ? [X3,X4] :
        ( init != a_select3(q_init,X3,X4)
        & gt(pv10,X3)
        & leq(n0,X3)
        & leq(n0,X4)
        & leq(X3,n135299)
        & leq(X4,n4) )
    & leq(n0,pv10)
    & leq(pv10,n135299)
    & ! [X0] :
        ( ! [X1] :
            ( a_select3(q_init,X0,X1) = init
            | ~ leq(n0,X1)
            | ~ leq(X1,n4) )
        | ~ leq(n0,X0)
        | ~ leq(X0,pred(pv10)) )
    & ! [X2] :
        ( a_select3(center_init,X2,n0) = init
        | ~ leq(n0,X2)
        | ~ leq(X2,n4) ) ),
    inference(flattening,[],[f143]) ).

fof(f164,plain,
    ! [X0,X1] :
      ( ( leq(X0,pred(X1))
        | ~ gt(X1,X0) )
      & ( gt(X1,X0)
        | ~ leq(X0,pred(X1)) ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f197,plain,
    ( ? [X0,X1] :
        ( a_select3(q_init,X0,X1) != init
        & gt(pv10,X0)
        & leq(n0,X0)
        & leq(n0,X1)
        & leq(X0,n135299)
        & leq(X1,n4) )
    & leq(n0,pv10)
    & leq(pv10,n135299)
    & ! [X2] :
        ( ! [X3] :
            ( init = a_select3(q_init,X2,X3)
            | ~ leq(n0,X3)
            | ~ leq(X3,n4) )
        | ~ leq(n0,X2)
        | ~ leq(X2,pred(pv10)) )
    & ! [X4] :
        ( init = a_select3(center_init,X4,n0)
        | ~ leq(n0,X4)
        | ~ leq(X4,n4) ) ),
    inference(rectify,[],[f144]) ).

fof(f198,plain,
    ( init != a_select3(q_init,sK31,sK32)
    & gt(pv10,sK31)
    & leq(n0,sK31)
    & leq(n0,sK32)
    & leq(sK31,n135299)
    & leq(sK32,n4)
    & leq(n0,pv10)
    & leq(pv10,n135299)
    & ! [X2] :
        ( ! [X3] :
            ( init = a_select3(q_init,X2,X3)
            | ~ leq(n0,X3)
            | ~ leq(X3,n4) )
        | ~ leq(n0,X2)
        | ~ leq(X2,pred(pv10)) )
    & ! [X4] :
        ( init = a_select3(center_init,X4,n0)
        | ~ leq(n0,X4)
        | ~ leq(X4,n4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f197]) ).

fof(f207,plain,
    ! [X0,X1] :
      ( leq(X0,pred(X1))
      | ~ gt(X1,X0) ),
    inference(cnf_transformation,[],[f164]) ).

fof(f289,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f310,plain,
    ! [X2,X3] :
      ( init = a_select3(q_init,X2,X3)
      | ~ leq(n0,X3)
      | ~ leq(X3,n4)
      | ~ leq(n0,X2)
      | ~ leq(X2,pred(pv10)) ),
    inference(cnf_transformation,[],[f198]) ).

fof(f313,plain,
    leq(sK32,n4),
    inference(cnf_transformation,[],[f198]) ).

fof(f315,plain,
    leq(n0,sK32),
    inference(cnf_transformation,[],[f198]) ).

fof(f316,plain,
    leq(n0,sK31),
    inference(cnf_transformation,[],[f198]) ).

fof(f317,plain,
    gt(pv10,sK31),
    inference(cnf_transformation,[],[f198]) ).

fof(f318,plain,
    init != a_select3(q_init,sK31,sK32),
    inference(cnf_transformation,[],[f198]) ).

fof(f358,plain,
    ! [X0,X1] :
      ( ~ gt(X1,X0)
      | leq(X0,minus(X1,n1)) ),
    inference(definition_unfolding,[],[f207,f289]) ).

fof(f379,plain,
    ! [X2,X3] :
      ( ~ leq(n0,X3)
      | init = a_select3(q_init,X2,X3)
      | ~ leq(X3,n4)
      | ~ leq(n0,X2)
      | ~ leq(X2,minus(pv10,n1)) ),
    inference(definition_unfolding,[],[f310,f289]) ).

fof(f525,plain,
    ! [X0] :
      ( init = a_select3(q_init,X0,sK32)
      | ~ leq(sK32,n4)
      | ~ leq(n0,X0)
      | ~ leq(X0,minus(pv10,n1)) ),
    inference(resolution,[],[f379,f315]) ).

fof(f528,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | init = a_select3(q_init,X0,sK32)
      | ~ leq(X0,minus(pv10,n1)) ),
    inference(forward_subsumption_resolution,[],[f525,f313]) ).

fof(f549,plain,
    ( init = a_select3(q_init,sK31,sK32)
    | ~ leq(sK31,minus(pv10,n1)) ),
    inference(resolution,[],[f528,f316]) ).

fof(f560,plain,
    ~ leq(sK31,minus(pv10,n1)),
    inference(forward_subsumption_resolution,[],[f549,f318]) ).

fof(f802,plain,
    leq(sK31,minus(pv10,n1)),
    inference(resolution,[],[f358,f317]) ).

fof(f812,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f802,f560]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV174+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n017.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:03:22 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.22  Running first-order model finding
% 0.09/0.22  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.20/0.27  % (3446734)Will run a generic schedule for satisfiability detection.
% 0.20/0.27  % (3446744)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4007048304:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27  % (3446740)% WARNING: option uhcvi not known.
% 0.20/0.27  % (3446739)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=531460143_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27  % (3446741)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3197681682:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27  % (3446740)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1823815738:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27  % (3446742)dis+10_1_sil=32000:sp=arity:random_seed=3291654058:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27  % (3446743)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3179475700:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27  % (3446745)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3845044364:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27  % (3446744) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3446734-3446744"...
% 0.20/0.27  % (3446744)...printing done.
% 0.20/0.27  % (3446744)Refutation found. Thanks to Tanya!
% 0.20/0.27  % SZS status Theorem for theBenchmark
% 0.20/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27  % (3446744)------------------------------
% 0.20/0.27  % (3446744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (3446744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (3446744)CaDiCaL version: 2.1.3
% 0.20/0.27  % (3446744)Termination reason: Refutation
% 0.20/0.27  % (3446744)Time elapsed: 0.010 s
% 0.20/0.27  % (3446744)Peak memory usage: 12 MB
% 0.20/0.27  % (3446744)Instructions burned: 31 (million)
% 0.20/0.27  % (3446734)Success in time 0.036 s
% 0.20/0.27  % Vampire exiting
%------------------------------------------------------------------------------