↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : DAT049_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n005.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 09:47:11 AM UTC 2026

% Result   : Theorem 0.99s 1.02s
% Output   : Refutation 3.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   81 (  22 unt;   0 typ;  18 def)
%            Number of atoms       :  177 (  66 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  167 (  71   ~;  70   |;   6   &)
%                                         (  20 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   81 (   0 atm;  32 fun;  25 num;  24 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;  14 prp; 0-2 aty)
%            Number of functors    :   16 (  11 usr;  10 con; 0-2 aty)
%            Number of variables   :   48 (  46   !;   2   ?;  48   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    collection: $tType ).

tff(func_def_0,type,
    empty: collection ).

tff(func_def_1,type,
    add: ( $int * collection ) > collection ).

tff(func_def_2,type,
    remove: ( $int * collection ) > collection ).

tff(func_def_3,type,
    count: collection > $int ).

tff(func_def_9,type,
    sK0: $int ).

tff(func_def_10,type,
    sK1: collection ).

tff(func_def_11,type,
    sF2: collection ).

tff(func_def_12,type,
    sF3: collection ).

tff(func_def_13,type,
    sF4: $int ).

tff(func_def_14,type,
    sF5: collection ).

tff(func_def_15,type,
    sF6: $int ).

tff(pred_def_1,type,
    in: ( $int * collection ) > $o ).

tff(f2,axiom,
    ! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

tff(f8,axiom,
    ! [X0: $int,X1: collection] :
      ( ( count(add(X0,X1)) = $sum(count(X1),1) )
    <=> ~ in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

tff(f9,axiom,
    ! [X1: collection,X0: $int] :
      ( ( count(add(X0,X1)) = count(X1) )
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

tff(f10,axiom,
    ! [X1: collection,X0: $int] :
      ( ( count(remove(X0,X1)) = $difference(count(X1),1) )
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

tff(f11,axiom,
    ! [X1: collection,X0: $int] :
      ( ( count(remove(X0,X1)) = count(X1) )
    <=> ~ in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

tff(f13,conjecture,
    ! [X1: $int,X0: collection] : ( count(remove(X1,add(X1,X0))) = count(remove(X1,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f14,negated_conjecture,
    ~ ! [X1: $int,X0: collection] : ( count(remove(X1,add(X1,X0))) = count(remove(X1,X0)) ),
    inference(negated_conjecture,[status(cth)],[f13]) ).

tff(f15,plain,
    ! [X1: collection,X0: $int] :
      ( ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) )
    <=> in(X0,X1) ),
    inference(theory_normalization,[],[f10]) ).

tff(f17,plain,
    ! [X1: $int,X0: collection] :
      ( ( count(remove(X1,X0)) = $sum(count(X0),$uminus(1)) )
    <=> in(X1,X0) ),
    inference(rectify,[],[f15]) ).

tff(f19,plain,
    ~ ! [X1: collection,X0: $int] : ( count(remove(X0,X1)) = count(remove(X0,add(X0,X1))) ),
    inference(rectify,[],[f14]) ).

tff(f21,plain,
    ! [X0: collection,X1: $int] :
      ( ( count(X0) = count(remove(X1,X0)) )
    <=> ~ in(X1,X0) ),
    inference(rectify,[],[f11]) ).

tff(f23,plain,
    ? [X0: $int,X1: collection] : ( count(remove(X0,X1)) != count(remove(X0,add(X0,X1))) ),
    inference(ennf_transformation,[],[f19]) ).

tff(f25,plain,
    ! [X0: $int,X1: collection] :
      ( ( ( count(add(X0,X1)) = $sum(count(X1),1) )
        | in(X0,X1) )
      & ( ~ in(X0,X1)
        | ( count(add(X0,X1)) != $sum(count(X1),1) ) ) ),
    inference(nnf_transformation,[],[f8]) ).

tff(f29,plain,
    ! [X0: collection,X1: $int] :
      ( ( ( count(X0) = count(remove(X1,X0)) )
        | in(X1,X0) )
      & ( ~ in(X1,X0)
        | ( count(X0) != count(remove(X1,X0)) ) ) ),
    inference(nnf_transformation,[],[f21]) ).

tff(f32,plain,
    ! [X1: collection,X0: $int] :
      ( ( ( count(add(X0,X1)) = count(X1) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( count(add(X0,X1)) != count(X1) ) ) ),
    inference(nnf_transformation,[],[f9]) ).

tff(f33,plain,
    ! [X0: collection,X1: $int] :
      ( ( ( count(X0) = count(add(X1,X0)) )
        | ~ in(X1,X0) )
      & ( in(X1,X0)
        | ( count(X0) != count(add(X1,X0)) ) ) ),
    inference(rectify,[],[f32]) ).

tff(f34,plain,
    count(remove(sK0,add(sK0,sK1))) != count(remove(sK0,sK1)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f23]) ).

tff(f35,plain,
    ! [X1: $int,X0: collection] :
      ( ( ( count(remove(X1,X0)) = $sum(count(X0),$uminus(1)) )
        | ~ in(X1,X0) )
      & ( in(X1,X0)
        | ( count(remove(X1,X0)) != $sum(count(X0),$uminus(1)) ) ) ),
    inference(nnf_transformation,[],[f17]) ).

tff(f36,plain,
    ! [X0: $int,X1: collection] :
      ( ( ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( count(remove(X0,X1)) != $sum(count(X1),$uminus(1)) ) ) ),
    inference(rectify,[],[f35]) ).

tff(f42,plain,
    ! [X0: $int,X1: collection] :
      ( ( count(add(X0,X1)) = $sum(count(X1),1) )
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f25]) ).

tff(f48,plain,
    ! [X0: collection,X1: $int] :
      ( ( count(X0) = count(remove(X1,X0)) )
      | in(X1,X0) ),
    inference(cnf_transformation,[],[f29]) ).

tff(f53,plain,
    ! [X0: collection,X1: $int] :
      ( ( count(X0) = count(add(X1,X0)) )
      | ~ in(X1,X0) ),
    inference(cnf_transformation,[],[f33]) ).

tff(f54,plain,
    count(remove(sK0,add(sK0,sK1))) != count(remove(sK0,sK1)),
    inference(cnf_transformation,[],[f34]) ).

tff(f56,plain,
    ! [X0: $int,X1: collection] :
      ( ( count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) )
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f36]) ).

tff(f58,plain,
    ! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
    inference(cnf_transformation,[],[f2]) ).

tff(f63,definition,
    sF2 = add(sK0,sK1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

tff(f64,definition,
    sF3 = remove(sK0,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

tff(f65,definition,
    sF4 = count(sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

tff(f66,definition,
    sF5 = remove(sK0,sK1),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

tff(f67,definition,
    sF6 = count(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

tff(f68,plain,
    count(sF5) = sF6,
    inference(reorient_equations,[],[f67]) ).

tff(f69,plain,
    sF6 != sF4,
    inference(definition_folding,[],[f54,f68,f66,f65,f64,f63]) ).

tff(f70,plain,
    ! [X0: $int,X1: collection] :
      ( ( count(remove(X0,X1)) = $sum(count(X1),-1) )
      | ~ in(X0,X1) ),
    inference(evaluation,[],[f56]) ).

tff(f73,definition,
    ( spl7_1
  <=> ( sF3 = remove(sK0,sF2) ) ),
    introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).

tff(f75,plain,
    ( ( sF3 = remove(sK0,sF2) )
    | ~ spl7_1 ),
    inference(avatar_component_clause,[],[f73]) ).

tff(f76,plain,
    spl7_1,
    inference(avatar_split_clause,[],[f64,f73]) ).

tff(f78,definition,
    ( spl7_2
  <=> ( sF4 = count(sF3) ) ),
    introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).

tff(f80,plain,
    ( ( sF4 = count(sF3) )
    | ~ spl7_2 ),
    inference(avatar_component_clause,[],[f78]) ).

tff(f81,plain,
    spl7_2,
    inference(avatar_split_clause,[],[f65,f78]) ).

tff(f83,definition,
    ( spl7_3
  <=> ( sF6 = sF4 ) ),
    introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).

tff(f86,plain,
    ~ spl7_3,
    inference(avatar_split_clause,[],[f69,f83]) ).

tff(f88,definition,
    ( spl7_4
  <=> ( sF2 = add(sK0,sK1) ) ),
    introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).

tff(f90,plain,
    ( ( sF2 = add(sK0,sK1) )
    | ~ spl7_4 ),
    inference(avatar_component_clause,[],[f88]) ).

tff(f91,plain,
    spl7_4,
    inference(avatar_split_clause,[],[f63,f88]) ).

tff(f93,definition,
    ( spl7_5
  <=> ( sF5 = remove(sK0,sK1) ) ),
    introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).

tff(f95,plain,
    ( ( sF5 = remove(sK0,sK1) )
    | ~ spl7_5 ),
    inference(avatar_component_clause,[],[f93]) ).

tff(f96,plain,
    spl7_5,
    inference(avatar_split_clause,[],[f66,f93]) ).

tff(f98,definition,
    ( spl7_6
  <=> ( count(sF5) = sF6 ) ),
    introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).

tff(f100,plain,
    ( ( count(sF5) = sF6 )
    | ~ spl7_6 ),
    inference(avatar_component_clause,[],[f98]) ).

tff(f101,plain,
    spl7_6,
    inference(avatar_split_clause,[],[f68,f98]) ).

tff(f126,plain,
    ( in(sK0,sF2)
    | ~ spl7_4 ),
    inference(superposition,[],[f58,f90]) ).

tff(f128,definition,
    ( spl7_11
  <=> in(sK0,sF2) ),
    introduced(definition,[new_symbols(definition,[spl7_11])],[avatar_definition]) ).

tff(f130,plain,
    ( in(sK0,sF2)
    | ~ spl7_11 ),
    inference(avatar_component_clause,[],[f128]) ).

tff(f131,plain,
    ( spl7_11
    | ~ spl7_4 ),
    inference(avatar_split_clause,[],[f126,f88,f128]) ).

tff(f166,definition,
    ( spl7_17
  <=> in(sK0,sK1) ),
    introduced(definition,[new_symbols(definition,[spl7_17])],[avatar_definition]) ).

tff(f167,plain,
    ( in(sK0,sK1)
    | ~ spl7_17 ),
    inference(avatar_component_clause,[],[f166]) ).

tff(f168,plain,
    ( ~ in(sK0,sK1)
    | spl7_17 ),
    inference(avatar_component_clause,[],[f166]) ).

tff(f170,definition,
    ( spl7_18
  <=> ( count(sK1) = sF6 ) ),
    introduced(definition,[new_symbols(definition,[spl7_18])],[avatar_definition]) ).

tff(f171,plain,
    ( ( count(sK1) = sF6 )
    | ~ spl7_18 ),
    inference(avatar_component_clause,[],[f170]) ).

tff(f181,plain,
    ( in(sK0,sK1)
    | ( count(sK1) = count(sF5) )
    | ~ spl7_5 ),
    inference(superposition,[],[f48,f95]) ).

tff(f198,plain,
    ( ~ in(sK0,sK1)
    | ( count(sK1) = count(sF2) )
    | ~ spl7_4 ),
    inference(superposition,[],[f53,f90]) ).

tff(f236,plain,
    ( ( $sum(count(sK1),1) = count(sF2) )
    | in(sK0,sK1)
    | ~ spl7_4 ),
    inference(superposition,[],[f42,f90]) ).

tff(f248,plain,
    ( ( $sum(count(sK1),1) = count(sF2) )
    | ~ spl7_4
    | spl7_17 ),
    inference(forward_subsumption_resolution,[],[f236,f168]) ).

tff(f250,plain,
    ( ( count(sF2) = $sum(sF6,1) )
    | ~ spl7_4
    | spl7_17
    | ~ spl7_18 ),
    inference(forward_demodulation,[],[f248,f171]) ).

tff(f257,definition,
    ( spl7_23
  <=> ( count(sF2) = $sum(sF6,1) ) ),
    introduced(definition,[new_symbols(definition,[spl7_23])],[avatar_definition]) ).

tff(f260,plain,
    ( spl7_23
    | ~ spl7_4
    | spl7_17
    | ~ spl7_18 ),
    inference(avatar_split_clause,[],[f250,f170,f166,f88,f257]) ).

tff(f267,definition,
    ( spl7_25
  <=> ( count(sK1) = count(sF2) ) ),
    introduced(definition,[new_symbols(definition,[spl7_25])],[avatar_definition]) ).

tff(f270,plain,
    ( ~ spl7_17
    | spl7_25
    | ~ spl7_4 ),
    inference(avatar_split_clause,[],[f198,f88,f267,f166]) ).

tff(f277,plain,
    ( in(sK0,sK1)
    | ( count(sK1) = sF6 )
    | ~ spl7_5
    | ~ spl7_6 ),
    inference(forward_demodulation,[],[f181,f100]) ).

tff(f279,plain,
    ( spl7_18
    | spl7_17
    | ~ spl7_5
    | ~ spl7_6 ),
    inference(avatar_split_clause,[],[f277,f98,f93,f166,f170]) ).

tff(f280,plain,
    ( ~ in(sK0,sF2)
    | ( $sum(count(sF2),-1) = count(sF3) )
    | ~ spl7_1 ),
    inference(superposition,[],[f70,f75]) ).

tff(f281,plain,
    ( ( count(sF5) = $sum(count(sK1),-1) )
    | ~ in(sK0,sK1)
    | ~ spl7_5 ),
    inference(superposition,[],[f70,f95]) ).

tff(f288,plain,
    ( ( $sum(count(sF2),-1) = count(sF3) )
    | ~ spl7_1
    | ~ spl7_11 ),
    inference(forward_subsumption_resolution,[],[f280,f130]) ).

tff(f289,plain,
    ( ( count(sF5) = $sum(count(sK1),-1) )
    | ~ spl7_5
    | ~ spl7_17 ),
    inference(forward_subsumption_resolution,[],[f281,f167]) ).

tff(f290,plain,
    ( ( $sum(count(sF2),-1) = sF4 )
    | ~ spl7_1
    | ~ spl7_2
    | ~ spl7_11 ),
    inference(forward_demodulation,[],[f288,f80]) ).

tff(f291,plain,
    ( ( sF6 = $sum(count(sK1),-1) )
    | ~ spl7_5
    | ~ spl7_6
    | ~ spl7_17 ),
    inference(forward_demodulation,[],[f289,f100]) ).

tff(f293,definition,
    ( spl7_27
  <=> ( $sum(count(sF2),-1) = sF4 ) ),
    introduced(definition,[new_symbols(definition,[spl7_27])],[avatar_definition]) ).

tff(f296,plain,
    ( spl7_27
    | ~ spl7_1
    | ~ spl7_2
    | ~ spl7_11 ),
    inference(avatar_split_clause,[],[f290,f128,f78,f73,f293]) ).

tff(f298,definition,
    ( spl7_28
  <=> ( sF6 = $sum(count(sK1),-1) ) ),
    introduced(definition,[new_symbols(definition,[spl7_28])],[avatar_definition]) ).

tff(f301,plain,
    ( spl7_28
    | ~ spl7_5
    | ~ spl7_6
    | ~ spl7_17 ),
    inference(avatar_split_clause,[],[f291,f166,f98,f93,f298]) ).

tff(f302,plain,
    $false,
    inference(avatar_smt_refutation,[],[f301,f296,f279,f270,f260,f131,f101,f96,f91,f86,f81,f76]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT049_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n005.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 00:07:02 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.01  % (1300187)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 0.99/1.01  % (1300193)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2681116632:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 0.99/1.01  % (1300193)First to succeed.
% 0.99/1.01  % (1300193)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1300187"
% 0.99/1.01  % (1300194)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2009386835:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 0.99/1.01  % (1300192)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1779167216:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 0.99/1.01  % (1300195)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1094325957:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 0.99/1.01  % (1300196)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=923904996:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 0.99/1.02  % (1300196)Instruction limit reached! 
% 0.99/1.02  % (1300196)------------------------------
% 0.99/1.02  % (1300196)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.99/1.02  % (1300196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/1.02  % (1300196)CaDiCaL version: 2.1.3
% 0.99/1.02  % (1300196)Termination reason: Instruction limit
% 0.99/1.02  % (1300196)Termination phase: Saturation
% 0.99/1.02  % (1300196)Time elapsed: 0.004 s
% 0.99/1.02  % (1300196)Peak memory usage: 88 MB
% 0.99/1.02  % (1300196)Instructions burned: 5 (million)
% 0.99/1.02  % (1300195)Instruction limit reached! 
% 0.99/1.02  % (1300195)------------------------------
% 0.99/1.02  % (1300195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.99/1.02  % (1300195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/1.02  % (1300195)CaDiCaL version: 2.1.3
% 0.99/1.02  % (1300195)Termination reason: Instruction limit
% 0.99/1.02  % (1300195)Termination phase: Saturation
% 0.99/1.02  % (1300195)Time elapsed: 0.005 s
% 0.99/1.02  % (1300195)Peak memory usage: 88 MB
% 0.99/1.02  % (1300195)Instructions burned: 7 (million)
% 0.99/1.02  % (1300197)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=706172789:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 0.99/1.02  % (1300198)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1895423659:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 0.99/1.02  % (1300192)Refutation not found, incomplete strategy
% 0.99/1.02  % (1300192)------------------------------
% 0.99/1.02  % (1300192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.99/1.02  % (1300192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/1.02  % (1300192)CaDiCaL version: 2.1.3
% 0.99/1.02  % (1300192)Termination reason: Refutation not found, incomplete strategy
% 0.99/1.02  % (1300192)Time elapsed: 0.031 s
% 0.99/1.02  % (1300192)Peak memory usage: 115 MB
% 0.99/1.02  % (1300192)Instructions burned: 7 (million)
% 0.99/1.02  % (1300197)Also succeeded, but the first one will report.
% 0.99/1.02  % (1300198)Instruction limit reached! 
% 0.99/1.02  % (1300198)------------------------------
% 0.99/1.02  % (1300198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.99/1.02  % (1300198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/1.02  % (1300198)CaDiCaL version: 2.1.3
% 0.99/1.02  % (1300198)Termination reason: Instruction limit
% 0.99/1.02  % (1300198)Termination phase: Saturation
% 0.99/1.02  % (1300198)Time elapsed: 0.048 s
% 0.99/1.02  % (1300198)Peak memory usage: 115 MB
% 0.99/1.02  % (1300198)Instructions burned: 34 (million)
% 0.99/1.02  % (1300194)Instruction limit reached! 
% 0.99/1.02  % (1300194)------------------------------
% 0.99/1.02  % (1300194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.99/1.02  % (1300194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/1.02  % (1300194)CaDiCaL version: 2.1.3
% 0.99/1.02  % (1300194)Termination reason: Instruction limit
% 0.99/1.02  % (1300194)Termination phase: Saturation
% 0.99/1.02  % (1300194)Time elapsed: 0.154 s
% 0.99/1.02  % (1300194)Peak memory usage: 117 MB
% 0.99/1.02  % (1300194)Instructions burned: 201 (million)
% 0.99/1.02  % (1300193)Refutation found. Thanks to Tanya!
% 0.99/1.02  % SZS status Theorem for theBenchmark
% 0.99/1.02  % SZS output start Proof for theBenchmark
% See solution above
% 3.07/1.22  % (1300193)------------------------------
% 3.07/1.22  % (1300193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.22  % (1300193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.22  % (1300193)CaDiCaL version: 2.1.3
% 3.07/1.22  % (1300193)Termination reason: Refutation
% 3.07/1.22  % (1300193)Time elapsed: 0.032 s
% 3.07/1.22  % (1300193)Peak memory usage: 117 MB
% 3.07/1.22  % (1300193)Instructions burned: 34 (million)
% 3.07/1.22  % (1300193)------------------------------
% 3.07/1.22  % (1300193)------------------------------
% 3.07/1.22  % (1300187)Success in time 0.337 s
% 3.07/1.22  % Vampire exiting
%------------------------------------------------------------------------------