↑ 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  : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n018.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:45:16 PM UTC 2026

% Result   : Theorem 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   70 (  21 unt;   6 def)
%            Number of atoms       :  185 (   0 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  235 ( 120   ~;  96   |;   7   &)
%                                         (   6 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    9 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;   5 con; 0-3 aty)
%            Number of variables   :   78 (   0 sgn  78   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f84,axiom,
    ! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).

fof(f110,axiom,
    ! [X0] :
      ( pred_attacker(tuple_client_A_out_9(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax109) ).

fof(f121,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_client_A_in_8(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax120) ).

fof(f123,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_client_A_in_6(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax122) ).

fof(f125,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_client_A_in_4(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax124) ).

fof(f127,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_client_A_in_2(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax126) ).

fof(f147,axiom,
    pred_attacker(constr_CONST_0x30),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax146) ).

fof(f172,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
        & pred_attacker(tuple_client_A_in_8(X4))
        & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        & pred_attacker(tuple_client_A_in_6(X1))
        & pred_attacker(tuple_client_A_in_4(X3))
        & pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
        & pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
        & pred_attacker(tuple_client_A_in_2(X2)) )
     => pred_attacker(tuple_client_A_out_9(name_objective)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax171) ).

fof(f175,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).

fof(f176,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(negated_conjecture,[status(cth)],[f175]) ).

fof(f177,plain,
    ~ pred_attacker(name_objective),
    inference(flattening,[],[f176]) ).

fof(f205,plain,
    ! [X0] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_client_A_out_9(X0)) ),
    inference(ennf_transformation,[],[f110]) ).

fof(f217,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_8(X0))
      | ~ pred_attacker(X0) ),
    inference(ennf_transformation,[],[f121]) ).

fof(f219,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_6(X0))
      | ~ pred_attacker(X0) ),
    inference(ennf_transformation,[],[f123]) ).

fof(f221,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_4(X0))
      | ~ pred_attacker(X0) ),
    inference(ennf_transformation,[],[f125]) ).

fof(f223,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_2(X0))
      | ~ pred_attacker(X0) ),
    inference(ennf_transformation,[],[f127]) ).

fof(f272,plain,
    ! [X0,X1,X2,X3,X4] :
      ( pred_attacker(tuple_client_A_out_9(name_objective))
      | ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
      | ~ pred_attacker(tuple_client_A_in_8(X4))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_6(X1))
      | ~ pred_attacker(tuple_client_A_in_4(X3))
      | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(ennf_transformation,[],[f172]) ).

fof(f273,plain,
    ! [X0,X1,X2,X3,X4] :
      ( pred_attacker(tuple_client_A_out_9(name_objective))
      | ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
      | ~ pred_attacker(tuple_client_A_in_8(X4))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_6(X1))
      | ~ pred_attacker(tuple_client_A_in_4(X3))
      | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(flattening,[],[f272]) ).

fof(f360,plain,
    ! [X0,X1] : pred_eq_bitstring_bitstring(X0,X1),
    inference(cnf_transformation,[],[f84]) ).

fof(f386,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_client_A_out_9(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f205]) ).

fof(f397,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_8(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f217]) ).

fof(f399,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_6(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f219]) ).

fof(f401,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_4(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f403,plain,
    ! [X0] :
      ( pred_attacker(tuple_client_A_in_2(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f223]) ).

fof(f423,plain,
    pred_attacker(constr_CONST_0x30),
    inference(cnf_transformation,[],[f147]) ).

fof(f447,plain,
    ! [X2,X3,X0,X1,X4] :
      ( pred_attacker(tuple_client_A_out_9(name_objective))
      | ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
      | ~ pred_attacker(tuple_client_A_in_8(X4))
      | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_6(X1))
      | ~ pred_attacker(tuple_client_A_in_4(X3))
      | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
      | ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    inference(cnf_transformation,[],[f273]) ).

fof(f450,plain,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f177]) ).

fof(f452,definition,
    ( spl0_1
  <=> ! [X2,X4,X0,X3,X1] :
        ( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
        | ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f453,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X3,X2,X0)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X1,name_Kas))))
        | ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f452]) ).

fof(f455,definition,
    ( spl0_2
  <=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f457,plain,
    ( pred_attacker(tuple_client_A_out_9(name_objective))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f455]) ).

fof(f458,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f447,f455,f452]) ).

fof(f464,plain,
    ( pred_attacker(name_objective)
    | ~ spl0_2 ),
    inference(resolution,[],[f386,f457]) ).

fof(f466,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f464,f450]) ).

fof(f467,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f466]) ).

fof(f468,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_eq_bitstring_bitstring(name_Na(X0),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f453,f360]) ).

fof(f469,plain,
    ( ! [X2,X3,X1,X4] :
        ( ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f468,f360]) ).

fof(f470,plain,
    ( ! [X2,X3,X1,X4] :
        ( ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X1,name_Kas)))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f469,f360]) ).

fof(f471,plain,
    ( ! [X2,X3,X1,X4] :
        ( ~ pred_attacker(tuple_client_A_in_2(X2))
        | ~ pred_attacker(tuple_client_A_in_4(X3))
        | ~ pred_attacker(tuple_client_A_in_6(X1))
        | ~ pred_attacker(tuple_client_A_in_8(X4)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f470,f360]) ).

fof(f473,definition,
    ( spl0_3
  <=> ! [X4] : ~ pred_attacker(tuple_client_A_in_8(X4)) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f474,plain,
    ( ! [X4] : ~ pred_attacker(tuple_client_A_in_8(X4))
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f473]) ).

fof(f476,definition,
    ( spl0_4
  <=> ! [X1] : ~ pred_attacker(tuple_client_A_in_6(X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f477,plain,
    ( ! [X1] : ~ pred_attacker(tuple_client_A_in_6(X1))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f476]) ).

fof(f479,definition,
    ( spl0_5
  <=> ! [X3] : ~ pred_attacker(tuple_client_A_in_4(X3)) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f480,plain,
    ( ! [X3] : ~ pred_attacker(tuple_client_A_in_4(X3))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f479]) ).

fof(f482,definition,
    ( spl0_6
  <=> ! [X2] : ~ pred_attacker(tuple_client_A_in_2(X2)) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f483,plain,
    ( ! [X2] : ~ pred_attacker(tuple_client_A_in_2(X2))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f484,plain,
    ( spl0_3
    | spl0_4
    | spl0_5
    | spl0_6
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f471,f452,f482,f479,f476,f473]) ).

fof(f490,plain,
    ( ! [X0] : ~ pred_attacker(X0)
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f399,f477]) ).

fof(f491,plain,
    ( $false
    | ~ spl0_4 ),
    inference(resolution,[],[f490,f423]) ).

fof(f530,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f491]) ).

fof(f532,plain,
    ( ! [X0] : ~ pred_attacker(X0)
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f401,f480]) ).

fof(f533,plain,
    ( $false
    | ~ spl0_5 ),
    inference(resolution,[],[f532,f423]) ).

fof(f573,plain,
    ~ spl0_5,
    inference(avatar_contradiction_clause,[],[f533]) ).

fof(f575,plain,
    ( ! [X0] : ~ pred_attacker(X0)
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f403,f483]) ).

fof(f576,plain,
    ( $false
    | ~ spl0_6 ),
    inference(resolution,[],[f575,f423]) ).

fof(f617,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f576]) ).

fof(f618,plain,
    ( ! [X0] : ~ pred_attacker(X0)
    | ~ spl0_3 ),
    inference(resolution,[],[f474,f397]) ).

fof(f619,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f618,f423]) ).

fof(f660,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f619]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f458]) ).

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f467]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_3
    | spl0_4
    | spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f484]) ).

cnf(s15,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f530]) ).

cnf(s27,plain,
    ~ spl0_5,
    inference(sat_conversion,[],[f573]) ).

cnf(s39,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f617]) ).

cnf(s51,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f660]) ).

cnf(s52,plain,
    ~ spl0_1,
    inference(rat,[],[s3,s39,s27,s15,s51]) ).

cnf(s53,plain,
    $false,
    inference(rat,[],[s1,s2,s52]) ).

fof(f661,plain,
    $false,
    inference(avatar_sat_refutation,[],[s53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n018.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 14:51:25 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/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.21/0.26  % (3446607)Will run a generic schedule for satisfiability detection.
% 0.21/0.26  % (3446624)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=801642807:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.26  % (3446619)% WARNING: option uhcvi not known.
% 0.21/0.26  % (3446622)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2539715202:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.26  % (3446618)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2989428377_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.26  % (3446621)dis+10_1_sil=32000:sp=arity:random_seed=1225799432:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.26  % (3446619)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1751022335:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.26  % (3446620)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1318182661:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.26  % (3446623)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1524290180:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.26  % (3446621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3446607-3446621"...
% 0.21/0.26  % (3446622) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3446607-3446622"...
% 0.21/0.26  % (3446621)...printing done.
% 0.21/0.26  % (3446621)Refutation found. Thanks to Tanya!
% 0.21/0.26  % SZS status Theorem for theBenchmark
% 0.21/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (3446621)------------------------------
% 0.21/0.27  % (3446621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (3446621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (3446621)CaDiCaL version: 2.1.3
% 0.21/0.27  % (3446621)Termination reason: Refutation
% 0.21/0.27  % (3446621)Time elapsed: 0.006 s
% 0.21/0.27  % (3446621)Peak memory usage: 12 MB
% 0.21/0.27  % (3446621)Instructions burned: 9 (million)
% 0.21/0.27  % (3446607)Success in time 0.043 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------