↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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:04:00 PM UTC 2026

% Result   : Theorem 4.45s 1.65s
% Output   : Refutation 6.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   64 (  17 unt;   0 typ;   4 def)
%            Number of atoms       :  137 (  72 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  117 (  44   ~;  48   |;  11   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number arithmetic     :  279 (  24 atm; 109 fun; 102 num;  44 var)
%            Number of types       :    1 (   0 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :   14 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   44 (  41   !;   3   ?;  44   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    v0: $int > $int ).

tff(func_def_1,type,
    f0: $int ).

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

tff(func_def_3,type,
    g0: $int > $int ).

tff(func_def_4,type,
    fast: $int > $int ).

tff(func_def_5,type,
    'mod:(Int*Int)>Int': ( $int * $int ) > $int ).

tff(func_def_6,type,
    h0: $int > $int ).

tff(func_def_7,type,
    small: $int > $int ).

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

tff(f1,axiom,
    ! [X0: $int] :
      ( ( $lesseq('mod:(Int*Int)>Int'(X0,2),0)
       => ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) ) )
      & ( ~ $lesseq('mod:(Int*Int)>Int'(X0,2),0)
       => ( small(X0) = $sum(1,$sum($product(0,X0),X0)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_1) ).

tff(f2,axiom,
    f0 = 0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_2) ).

tff(f3,axiom,
    ! [X0: $int] : ( g0(X0) = 'mod:(Int*Int)>Int'(X0,2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_3) ).

tff(f4,axiom,
    ! [X0: $int] : ( h0(X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_4) ).

tff(f5,axiom,
    ! [X1: $int,X0: $int] :
      ( ( $lesseq(X0,0)
       => ( u0(X0,X1) = X1 ) )
      & ( ~ $lesseq(X0,0)
       => ( u0(X0,X1) = f0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_5) ).

tff(f6,axiom,
    ! [X0: $int] : ( v0(X0) = u0(g0(X0),h0(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_6) ).

tff(f7,axiom,
    ! [X0: $int] : ( fast(X0) = $sum(1,$sum($product(v0(X0),X0),X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_7) ).

tff(f8,conjecture,
    ~ ? [X0: $int] :
        ( $greatereq(X0,0)
        & ( small(X0) != fast(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1) ).

tff(f9,negated_conjecture,
    ~ ~ ? [X0: $int] :
          ( $greatereq(X0,0)
          & ( small(X0) != fast(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f8]) ).

tff(f10,plain,
    ! [X1: $int,X0: $int] :
      ( ( ~ $less(0,X0)
       => ( u0(X0,X1) = X1 ) )
      & ( $less(0,X0)
       => ( u0(X0,X1) = f0 ) ) ),
    inference(theory_normalization,[],[f5]) ).

tff(f11,plain,
    ? [X0: $int] :
      ( ( small(X0) != fast(X0) )
      & ~ $less(X0,0) ),
    inference(theory_normalization,[],[f9]) ).

tff(f12,plain,
    ! [X0: $int] :
      ( ( ~ $less(0,'mod:(Int*Int)>Int'(X0,2))
       => ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) ) )
      & ( $less(0,'mod:(Int*Int)>Int'(X0,2))
       => ( small(X0) = $sum(1,$sum($product(0,X0),X0)) ) ) ),
    inference(theory_normalization,[],[f1]) ).

tff(f13,plain,
    ! [X0: $int,X1: $int] :
      ( ( $less(0,X1)
       => ( f0 = u0(X1,X0) ) )
      & ( ~ $less(0,X1)
       => ( u0(X1,X0) = X0 ) ) ),
    inference(rectify,[],[f10]) ).

tff(f14,plain,
    ! [X0: $int,X1: $int] :
      ( ( ( f0 = u0(X1,X0) )
        | ~ $less(0,X1) )
      & ( $less(0,X1)
        | ( u0(X1,X0) = X0 ) ) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f15,plain,
    ! [X0: $int] :
      ( ( $less(0,'mod:(Int*Int)>Int'(X0,2))
        | ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) ) )
      & ( ~ $less(0,'mod:(Int*Int)>Int'(X0,2))
        | ( small(X0) = $sum(1,$sum($product(0,X0),X0)) ) ) ),
    inference(ennf_transformation,[],[f12]) ).

tff(f16,plain,
    ( ( fast(sK0) != small(sK0) )
    & ~ $less(sK0,0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f11]) ).

tff(f17,plain,
    ! [X0: $int] : ( 'mod:(Int*Int)>Int'(X0,2) = g0(X0) ),
    inference(cnf_transformation,[],[f3]) ).

tff(f18,plain,
    ! [X0: $int,X1: $int] :
      ( $less(0,X1)
      | ( u0(X1,X0) = X0 ) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f19,plain,
    ! [X0: $int,X1: $int] :
      ( ( f0 = u0(X1,X0) )
      | ~ $less(0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f20,plain,
    ! [X0: $int] :
      ( ( small(X0) = $sum(1,$sum($product(0,X0),X0)) )
      | ~ $less(0,'mod:(Int*Int)>Int'(X0,2)) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f21,plain,
    ! [X0: $int] :
      ( $less(0,'mod:(Int*Int)>Int'(X0,2))
      | ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) ) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f22,plain,
    ! [X0: $int] : ( fast(X0) = $sum(1,$sum($product(v0(X0),X0),X0)) ),
    inference(cnf_transformation,[],[f7]) ).

tff(f23,plain,
    0 = f0,
    inference(cnf_transformation,[],[f2]) ).

tff(f24,plain,
    ! [X0: $int] : ( h0(X0) = X0 ),
    inference(cnf_transformation,[],[f4]) ).

tff(f25,plain,
    ! [X0: $int] : ( v0(X0) = u0(g0(X0),h0(X0)) ),
    inference(cnf_transformation,[],[f6]) ).

tff(f27,plain,
    fast(sK0) != small(sK0),
    inference(cnf_transformation,[],[f16]) ).

tff(f28,plain,
    ! [X0: $int] : ( v0(X0) = u0('mod:(Int*Int)>Int'(X0,2),h0(X0)) ),
    inference(definition_unfolding,[],[f25,f17]) ).

tff(f29,plain,
    ! [X0: $int] : ( fast(X0) = $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(X0,2),h0(X0)),X0),X0)) ),
    inference(definition_unfolding,[],[f22,f28]) ).

tff(f30,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(0,X1)
      | ( 0 = u0(X1,X0) ) ),
    inference(definition_unfolding,[],[f19,f23]) ).

tff(f31,plain,
    small(sK0) != $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),h0(sK0)),sK0),sK0)),
    inference(definition_unfolding,[],[f27,f29]) ).

tff(f32,plain,
    ! [X0: $int] :
      ( ~ $less(0,'mod:(Int*Int)>Int'(X0,2))
      | ( small(X0) = $sum(1,X0) ) ),
    inference(evaluation,[],[f20]) ).

tff(f38,plain,
    $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),sK0),sK0),sK0)) != small(sK0),
    inference(forward_demodulation,[],[f31,f24]) ).

tff(f40,definition,
    ( spl1_2
  <=> ( $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),sK0),sK0),sK0)) = small(sK0) ) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

tff(f42,plain,
    ( ( $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),sK0),sK0),sK0)) != small(sK0) )
    | spl1_2 ),
    inference(avatar_component_clause,[],[f40]) ).

tff(f43,plain,
    ~ spl1_2,
    inference(avatar_split_clause,[],[f38,f40]) ).

tff(f44,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( ( u0(X0,X2) = X2 )
      | ( 0 = u0(X0,X1) ) ),
    inference(resolution,[],[f30,f18]) ).

tff(f45,plain,
    ! [X0: $int,X1: $int] :
      ( ( u0('mod:(Int*Int)>Int'(X0,2),X1) = X1 )
      | ( small(X0) = $sum(1,X0) ) ),
    inference(resolution,[],[f32,f18]) ).

tff(f49,plain,
    ( ! [X0: $int] :
        ( ( u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0 )
        | ( small(sK0) != $sum(1,$sum($product(0,sK0),sK0)) ) )
    | spl1_2 ),
    inference(superposition,[],[f42,f44]) ).

tff(f52,plain,
    ( ! [X0: $int] :
        ( ( u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0 )
        | ( $sum(1,sK0) != small(sK0) ) )
    | spl1_2 ),
    inference(evaluation,[],[f49]) ).

tff(f54,definition,
    ( spl1_3
  <=> ( $sum(1,$sum($product(sK0,sK0),sK0)) = small(sK0) ) ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

tff(f55,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) = small(sK0) )
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f54]) ).

tff(f56,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) != small(sK0) )
    | spl1_3 ),
    inference(avatar_component_clause,[],[f54]) ).

tff(f61,plain,
    ( ! [X0: $int] : ( u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0 )
    | spl1_2 ),
    inference(forward_subsumption_resolution,[],[f52,f45]) ).

tff(f62,plain,
    ! [X0: $int] :
      ( ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) )
      | ( small(X0) = $sum(1,X0) ) ),
    inference(resolution,[],[f21,f32]) ).

tff(f63,plain,
    ! [X0: $int,X1: $int] :
      ( ( 0 = u0('mod:(Int*Int)>Int'(X0,2),X1) )
      | ( small(X0) = $sum(1,$sum($product(X0,X0),X0)) ) ),
    inference(resolution,[],[f21,f30]) ).

tff(f65,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) != small(sK0) )
    | spl1_2 ),
    inference(superposition,[],[f42,f61]) ).

tff(f70,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) != $sum(1,$sum($product(sK0,sK0),sK0)) )
    | ( $sum(1,sK0) = small(sK0) )
    | spl1_3 ),
    inference(superposition,[],[f56,f62]) ).

tff(f72,plain,
    ( ( $sum(1,sK0) = small(sK0) )
    | spl1_3 ),
    inference(trivial_inequality_removal,[],[f70]) ).

tff(f74,definition,
    ( spl1_5
  <=> ( $sum(1,sK0) = small(sK0) ) ),
    introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).

tff(f76,plain,
    ( ( $sum(1,sK0) = small(sK0) )
    | ~ spl1_5 ),
    inference(avatar_component_clause,[],[f74]) ).

tff(f77,plain,
    ( spl1_5
    | spl1_3 ),
    inference(avatar_split_clause,[],[f72,f54,f74]) ).

tff(f78,plain,
    ( $false
    | spl1_2
    | ~ spl1_3 ),
    inference(forward_subsumption_resolution,[],[f65,f55]) ).

tff(f79,plain,
    ( spl1_2
    | ~ spl1_3 ),
    inference(avatar_contradiction_clause,[],[f78]) ).

tff(f83,plain,
    ( ( $sum(1,sK0) != $sum(1,$sum($product(sK0,sK0),sK0)) )
    | spl1_2
    | ~ spl1_5 ),
    inference(forward_demodulation,[],[f65,f76]) ).

tff(f85,definition,
    ( spl1_6
  <=> ( $sum(1,sK0) = $sum(1,$sum($product(sK0,sK0),sK0)) ) ),
    introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).

tff(f87,plain,
    ( ( $sum(1,sK0) != $sum(1,$sum($product(sK0,sK0),sK0)) )
    | spl1_6 ),
    inference(avatar_component_clause,[],[f85]) ).

tff(f89,plain,
    ( ~ spl1_6
    | spl1_2
    | ~ spl1_5 ),
    inference(avatar_split_clause,[],[f83,f74,f40,f85]) ).

tff(f94,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) = small(sK0) )
    | ( small(sK0) != $sum(1,$sum($product(0,sK0),sK0)) )
    | spl1_2 ),
    inference(superposition,[],[f42,f63]) ).

tff(f98,plain,
    ( ( $sum(1,sK0) != small(sK0) )
    | ( $sum(1,$sum($product(sK0,sK0),sK0)) = small(sK0) )
    | spl1_2 ),
    inference(evaluation,[],[f94]) ).

tff(f101,plain,
    ( ( $sum(1,$sum($product(sK0,sK0),sK0)) = small(sK0) )
    | spl1_2 ),
    inference(forward_subsumption_resolution,[],[f98,f62]) ).

tff(f104,plain,
    ( ( $sum(1,sK0) = $sum(1,$sum($product(sK0,sK0),sK0)) )
    | spl1_2
    | ~ spl1_5 ),
    inference(forward_demodulation,[],[f101,f76]) ).

tff(f105,plain,
    ( $false
    | spl1_2
    | ~ spl1_5
    | spl1_6 ),
    inference(forward_subsumption_resolution,[],[f104,f87]) ).

tff(f106,plain,
    ( spl1_2
    | ~ spl1_5
    | spl1_6 ),
    inference(avatar_contradiction_clause,[],[f105]) ).

tff(f107,plain,
    $false,
    inference(avatar_smt_refutation,[],[f106,f89,f79,f77,f43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC473_1 : TPTP v9.3.1. Released v9.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.24  % Computer : n008.cluster.edu
% 0.11/0.24  % Model    : x86_64 x86_64
% 0.11/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24  % Memory   : 8046.5625MB
% 0.11/0.24  % OS       : Linux 6.8.0-71-generic
% 0.11/0.25  % CPULimit : 300
% 0.11/0.25  % WCLimit  : 300
% 0.11/0.25  % DateTime : Mon Sep 28 09:40:39 UTC 2026
% 0.11/0.25  % CPUTime  : 
% 0.11/0.25  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.30  Running first-order theorem proving
% 0.24/0.30  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.45/1.65  % (2130288)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 4.45/1.65  % (2130297)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2080118270:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 4.45/1.65  % (2130301)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1716196654:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 4.45/1.65  % (2130298)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=583829187:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 4.45/1.65  % (2130296)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=3559132508:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 4.45/1.65  % (2130299)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3080667477:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 4.45/1.65  % (2130300)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=287419533:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 4.45/1.65  % (2130295)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3658123092:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 4.45/1.65  % (2130299)Instruction limit reached! 
% 4.45/1.65  % (2130299)------------------------------
% 4.45/1.65  % (2130299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130299)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130299)Termination reason: Instruction limit
% 4.45/1.65  % (2130299)Termination phase: Saturation
% 4.45/1.65  % (2130299)Time elapsed: 0.005 s
% 4.45/1.65  % (2130299)Peak memory usage: 89 MB
% 4.45/1.65  % (2130299)Instructions burned: 4 (million)
% 4.45/1.65  % (2130298)Instruction limit reached! 
% 4.45/1.65  % (2130298)------------------------------
% 4.45/1.65  % (2130298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130298)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130298)Termination reason: Instruction limit
% 4.45/1.65  % (2130298)Termination phase: Saturation
% 4.45/1.65  % (2130298)Time elapsed: 0.008 s
% 4.45/1.65  % (2130298)Peak memory usage: 88 MB
% 4.45/1.65  % (2130298)Instructions burned: 7 (million)
% 4.45/1.65  % (2130301)Instruction limit reached! 
% 4.45/1.65  % (2130301)------------------------------
% 4.45/1.65  % (2130301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130301)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130301)Termination reason: Instruction limit
% 4.45/1.65  % (2130301)Termination phase: Saturation
% 4.45/1.65  % (2130301)Time elapsed: 0.066 s
% 4.45/1.65  % (2130301)Peak memory usage: 118 MB
% 4.45/1.65  % (2130301)Instructions burned: 37 (million)
% 4.45/1.65  % (2130295)Instruction limit reached! 
% 4.45/1.65  % (2130295)------------------------------
% 4.45/1.65  % (2130295)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130295)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130295)Termination reason: Instruction limit
% 4.45/1.65  % (2130295)Termination phase: Saturation
% 4.45/1.65  % (2130295)Time elapsed: 0.043 s
% 4.45/1.65  % (2130295)Peak memory usage: 116 MB
% 4.45/1.65  % (2130295)Instructions burned: 12 (million)
% 4.45/1.65  % (2130300)First to succeed.
% 4.45/1.65  % (2130300)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2130288"
% 4.45/1.65  % (2130297)Instruction limit reached! 
% 4.45/1.65  % (2130297)------------------------------
% 4.45/1.65  % (2130297)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130297)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130297)Termination reason: Instruction limit
% 4.45/1.65  % (2130297)Termination phase: Saturation
% 4.45/1.65  % (2130297)Time elapsed: 0.114 s
% 4.45/1.65  % (2130297)Peak memory usage: 117 MB
% 4.45/1.65  % (2130297)Instructions burned: 202 (million)
% 4.45/1.65  % (2130296)Also succeeded, but the first one will report.
% 4.45/1.65  % (2130310)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=882126824:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2997 on theBenchmark for (2997ds/14Mi)
% 4.45/1.65  % (2130315)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=2202723813:i=27:canc=cautious:fsr=off:rtra=on_2996 on theBenchmark for (2996ds/27Mi)
% 4.45/1.65  % (2130310)Also succeeded, but the first one will report.
% 4.45/1.65  % (2130315)Instruction limit reached! 
% 4.45/1.65  % (2130315)------------------------------
% 4.45/1.65  % (2130315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130315)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130315)Termination reason: Instruction limit
% 4.45/1.65  % (2130315)Termination phase: Saturation
% 4.45/1.65  % (2130315)Time elapsed: 0.011 s
% 4.45/1.65  % (2130315)Peak memory usage: 89 MB
% 4.45/1.65  % (2130315)Instructions burned: 30 (million)
% 4.45/1.65  % (2130311)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=2320620242:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2997 on theBenchmark for (2997ds/29Mi)
% 4.45/1.65  % (2130311)Also succeeded, but the first one will report.
% 4.45/1.65  % (2130312)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=1035840166:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2997 on theBenchmark for (2997ds/16Mi)
% 4.45/1.65  % (2130312)Instruction limit reached! 
% 4.45/1.65  % (2130312)------------------------------
% 4.45/1.65  % (2130312)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130312)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130312)Termination reason: Instruction limit
% 4.45/1.65  % (2130312)Termination phase: Saturation
% 4.45/1.65  % (2130312)Time elapsed: 0.017 s
% 4.45/1.65  % (2130312)Peak memory usage: 90 MB
% 4.45/1.65  % (2130312)Instructions burned: 16 (million)
% 4.45/1.65  % (2130313)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=2883554731:i=24:canc=force:rtra=on_2996 on theBenchmark for (2996ds/24Mi)
% 4.45/1.65  % (2130313)Instruction limit reached! 
% 4.45/1.65  % (2130313)------------------------------
% 4.45/1.65  % (2130313)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.65  % (2130313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.65  % (2130313)CaDiCaL version: 2.1.3
% 4.45/1.65  % (2130313)Termination reason: Instruction limit
% 4.45/1.65  % (2130313)Termination phase: Saturation
% 4.45/1.65  % (2130313)Time elapsed: 0.025 s
% 4.45/1.65  % (2130313)Peak memory usage: 89 MB
% 4.45/1.65  % (2130313)Instructions burned: 24 (million)
% 4.45/1.65  % (2130320)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=3862185530:i=85:gtgl=4:rtra=on:gtg=exists_sym_2994 on theBenchmark for (2994ds/85Mi)
% 4.45/1.65  % (2130320)Also succeeded, but the first one will report.
% 4.45/1.65  % (2130300)Refutation found. Thanks to Tanya!
% 4.45/1.65  % SZS status Theorem for theBenchmark
% 4.45/1.65  % SZS output start Proof for theBenchmark
% See solution above
% 6.15/1.83  % (2130300)------------------------------
% 6.15/1.83  % (2130300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.15/1.83  % (2130300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.83  % (2130300)CaDiCaL version: 2.1.3
% 6.15/1.83  % (2130300)Termination reason: Refutation
% 6.15/1.83  % (2130300)Time elapsed: 0.060 s
% 6.15/1.83  % (2130300)Peak memory usage: 118 MB
% 6.15/1.83  % (2130300)Instructions burned: 21 (million)
% 6.15/1.83  % (2130300)------------------------------
% 6.15/1.83  % (2130300)------------------------------
% 6.15/1.83  % (2130288)Success in time 0.753 s
% 6.15/1.83  % Vampire exiting
%------------------------------------------------------------------------------