↑ 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  : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:25 PM UTC 2026

% Result   : Theorem 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   38 (  14 unt;   1 def)
%            Number of atoms       :   94 (  14 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   88 (  32   ~;  26   |;  18   &)
%                                         (   1 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-3 aty)
%            Number of variables   :   37 (   0 sgn  33   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X0,X1)
        & leq(X1,X2) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( gt(X1,X0)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).

fof(f53,conjecture,
    ( ! [X0] :
        ( ( leq(n0,X0)
          & leq(X0,n4) )
       => a_select3(center_init,X0,n0) = init )
   => ! [X1] :
        ( ( leq(n0,X1)
          & leq(X1,tptp_minus_1) )
       => ! [X2] :
            ( ( leq(n0,X2)
              & leq(X2,n4) )
           => a_select3(q_init,X1,X2) = init ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).

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

fof(f58,axiom,
    gt(n0,tptp_minus_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).

fof(f78,axiom,
    ! [X0] :
      ( ( leq(n0,X0)
        & leq(X0,n0) )
     => X0 = n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).

fof(f98,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X0,X1)
      | ~ leq(X1,X2) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f99,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X0,X1)
      | ~ leq(X1,X2) ),
    inference(flattening,[],[f98]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f136,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( init != a_select3(q_init,X1,X2)
            & leq(n0,X2)
            & leq(X2,n4) )
        & leq(n0,X1)
        & leq(X1,tptp_minus_1) )
    & ! [X0] :
        ( a_select3(center_init,X0,n0) = init
        | ~ leq(n0,X0)
        | ~ leq(X0,n4) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f137,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( init != a_select3(q_init,X1,X2)
            & leq(n0,X2)
            & leq(X2,n4) )
        & leq(n0,X1)
        & leq(X1,tptp_minus_1) )
    & ! [X0] :
        ( a_select3(center_init,X0,n0) = init
        | ~ leq(n0,X0)
        | ~ leq(X0,n4) ) ),
    inference(flattening,[],[f136]) ).

fof(f142,plain,
    ! [X0] :
      ( X0 = n0
      | ~ leq(n0,X0)
      | ~ leq(X0,n0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f143,plain,
    ! [X0] :
      ( X0 = n0
      | ~ leq(n0,X0)
      | ~ leq(X0,n0) ),
    inference(flattening,[],[f142]) ).

fof(f152,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f154,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X1,X2)
      | ~ leq(X0,X1)
      | leq(X0,X2) ),
    inference(cnf_transformation,[],[f99]) ).

fof(f155,plain,
    ! [X0,X1] :
      ( ~ gt(X1,X0)
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f100]) ).

fof(f311,plain,
    leq(sK31,tptp_minus_1),
    inference(cnf_transformation,[],[f137]) ).

fof(f312,plain,
    leq(n0,sK31),
    inference(cnf_transformation,[],[f137]) ).

fof(f317,plain,
    gt(n0,tptp_minus_1),
    inference(cnf_transformation,[],[f58]) ).

fof(f337,plain,
    ! [X0] :
      ( ~ leq(X0,n0)
      | ~ leq(n0,X0)
      | n0 = X0 ),
    inference(cnf_transformation,[],[f143]) ).

fof(f393,plain,
    leq(tptp_minus_1,n0),
    inference(resolution,[],[f155,f317]) ).

fof(f449,definition,
    ( spl33_4
  <=> leq(n0,tptp_minus_1) ),
    introduced(definition,[new_symbols(definition,[spl33_4])],[avatar_definition]) ).

fof(f450,plain,
    ( leq(n0,tptp_minus_1)
    | ~ spl33_4 ),
    inference(avatar_component_clause,[],[f449]) ).

fof(f451,plain,
    ( ~ leq(n0,tptp_minus_1)
    | spl33_4 ),
    inference(avatar_component_clause,[],[f449]) ).

fof(f600,plain,
    ! [X0] :
      ( ~ leq(X0,sK31)
      | leq(X0,tptp_minus_1) ),
    inference(resolution,[],[f154,f311]) ).

fof(f636,plain,
    ( ~ leq(n0,tptp_minus_1)
    | n0 = tptp_minus_1 ),
    inference(resolution,[],[f337,f393]) ).

fof(f643,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[],[f600,f312]) ).

fof(f646,plain,
    ( $false
    | spl33_4 ),
    inference(forward_subsumption_resolution,[],[f643,f451]) ).

fof(f647,plain,
    spl33_4,
    inference(avatar_contradiction_clause,[],[f646]) ).

fof(f648,plain,
    ( n0 = tptp_minus_1
    | ~ spl33_4 ),
    inference(forward_subsumption_resolution,[],[f636,f450]) ).

fof(f701,plain,
    ( gt(n0,n0)
    | ~ spl33_4 ),
    inference(superposition,[],[f317,f648]) ).

fof(f713,plain,
    ( $false
    | ~ spl33_4 ),
    inference(forward_subsumption_resolution,[],[f701,f152]) ).

fof(f714,plain,
    ~ spl33_4,
    inference(avatar_contradiction_clause,[],[f713]) ).

cnf(s4,plain,
    spl33_4,
    inference(sat_conversion,[],[f647]) ).

cnf(s5,plain,
    ~ spl33_4,
    inference(sat_conversion,[],[f714]) ).

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

fof(f716,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

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