↑ 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  : SWV041+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 : n004.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:03 PM UTC 2026

% Result   : Theorem 0.21s 0.29s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  15 unt;   1 def)
%            Number of atoms       :   88 (  15 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   76 (  24   ~;  16   |;  26   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  10 con; 0-3 aty)
%            Number of variables   :   30 (   0 sgn  26   !;   4   ?)

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

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

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

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

fof(f53,conjecture,
    ( ( geq(minus(n330,n1),n0)
      & geq(minus(n410,n1),n0) )
   => ! [X0] :
        ( ( leq(n0,X0)
          & leq(X0,n2) )
       => ! [X1] :
            ( ( leq(n0,X1)
              & leq(X1,minus(n0,n1)) )
           => a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).

fof(f54,negated_conjecture,
    ~ ( ( geq(minus(n330,n1),n0)
        & geq(minus(n410,n1),n0) )
     => ! [X0] :
          ( ( leq(n0,X0)
            & leq(X0,n2) )
         => ! [X1] :
              ( ( leq(n0,X1)
                & leq(X1,minus(n0,n1)) )
             => a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

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

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

fof(f153,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init
            & leq(n0,X1)
            & leq(X1,minus(n0,n1)) )
        & leq(n0,X0)
        & leq(X0,n2) )
    & geq(minus(n330,n1),n0)
    & geq(minus(n410,n1),n0) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f154,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init
            & leq(n0,X1)
            & leq(X1,minus(n0,n1)) )
        & leq(n0,X0)
        & leq(X0,n2) )
    & geq(minus(n330,n1),n0)
    & geq(minus(n410,n1),n0) ),
    inference(flattening,[],[f153]) ).

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

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

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

fof(f207,plain,
    ( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK32,sK31)
    & leq(n0,sK32)
    & leq(sK32,minus(n0,n1))
    & leq(n0,sK31)
    & leq(sK31,n2)
    & geq(minus(n330,n1),n0)
    & geq(minus(n410,n1),n0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f154]) ).

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

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

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

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

fof(f323,plain,
    leq(sK32,minus(n0,n1)),
    inference(cnf_transformation,[],[f207]) ).

fof(f324,plain,
    leq(n0,sK32),
    inference(cnf_transformation,[],[f207]) ).

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

fof(f374,plain,
    ! [X0,X1] :
      ( ~ leq(X0,minus(X1,n1))
      | gt(X1,X0) ),
    inference(definition_unfolding,[],[f216,f299]) ).

fof(f470,plain,
    gt(n0,sK32),
    inference(resolution,[],[f374,f323]) ).

fof(f472,plain,
    leq(sK32,n0),
    inference(resolution,[],[f470,f214]) ).

fof(f696,definition,
    ( spl33_5
  <=> n0 = sK32 ),
    introduced(definition,[new_symbols(definition,[spl33_5])],[avatar_definition]) ).

fof(f698,plain,
    ( n0 = sK32
    | ~ spl33_5 ),
    inference(avatar_component_clause,[],[f696]) ).

fof(f753,plain,
    ( n0 = sK32
    | ~ leq(sK32,n0) ),
    inference(resolution,[],[f364,f324]) ).

fof(f757,plain,
    n0 = sK32,
    inference(forward_subsumption_resolution,[],[f753,f472]) ).

fof(f832,plain,
    spl33_5,
    inference(avatar_split_clause,[],[f757,f696]) ).

fof(f838,plain,
    ( gt(n0,n0)
    | ~ spl33_5 ),
    inference(superposition,[],[f470,f698]) ).

fof(f841,plain,
    ( $false
    | ~ spl33_5 ),
    inference(forward_subsumption_resolution,[],[f838,f210]) ).

fof(f842,plain,
    ~ spl33_5,
    inference(avatar_contradiction_clause,[],[f841]) ).

cnf(s16,plain,
    spl33_5,
    inference(sat_conversion,[],[f832]) ).

cnf(s18,plain,
    ~ spl33_5,
    inference(sat_conversion,[],[f842]) ).

cnf(s19,plain,
    $false,
    inference(rat,[],[s16,s18]) ).

fof(f844,plain,
    $false,
    inference(avatar_sat_refutation,[],[s19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV041+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.19  % Computer : n004.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 09:44:22 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.21/0.29  % (247423)Will run a generic schedule for satisfiability detection.
% 0.21/0.29  % (247432)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1496401652:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29  % (247429)% WARNING: option uhcvi not known.
% 0.21/0.29  % (247428)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4113683898_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29  % (247429)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3307892347:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29  % (247430)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=486801393:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29  % (247431)dis+10_1_sil=32000:sp=arity:random_seed=1963518206:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29  % (247433)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=396934780:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29  % (247434)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3930055478:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29  % (247431) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-247423-247431"...
% 0.21/0.29  % (247431)...printing done.
% 0.21/0.29  % (247431)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29  % (247431)------------------------------
% 0.21/0.29  % (247431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (247431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (247431)CaDiCaL version: 2.1.3
% 0.21/0.29  % (247431)Termination reason: Refutation
% 0.21/0.29  % (247431)Time elapsed: 0.013 s
% 0.21/0.29  % (247431)Peak memory usage: 13 MB
% 0.21/0.29  % (247431)Instructions burned: 21 (million)
% 0.21/0.29  % (247423)Success in time 0.048 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------