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

% Computer : n012.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 : Wed Sep 30 08:19:25 AM UTC 2026

% Result   : Theorem 8.55s 1.45s
% Output   : Refutation 8.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   77 (  58 unt;   0 typ;   7 def)
%            Number of atoms       :  219 (  85 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  677 (  22   ~;  17   |;   0   &; 629   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  16 usr;  12 con; 0-2 aty)
%            Number of variables   :   87 (   0   ^;  87   !;   0   ?;  87   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    frac: $tType ).

thf(type_def_6,type,
    nat: $tType ).

thf(type_def_7,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    x: frac ).

thf(func_def_1,type,
    y: frac ).

thf(func_def_2,type,
    z: frac ).

thf(func_def_3,type,
    less: nat > nat > $o ).

thf(func_def_4,type,
    ts: nat > nat > nat ).

thf(func_def_5,type,
    num: frac > nat ).

thf(func_def_6,type,
    den: frac > nat ).

thf(func_def_10,type,
    sF0: nat ).

thf(func_def_11,type,
    sF1: nat ).

thf(func_def_12,type,
    sF2: nat ).

thf(func_def_13,type,
    sF3: nat ).

thf(func_def_14,type,
    sF4: nat ).

thf(func_def_15,type,
    sF5: nat ).

thf(func_def_16,type,
    sF6: $o ).

thf(func_def_17,type,
    vNOT: $o > $o ).

thf(f1,axiom,
    less @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

thf(f2,axiom,
    less @ ( ts @ ( num @ y ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ y ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).

thf(f3,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X2 ) )
     => ( less @ X0 @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz33c) ).

thf(f4,axiom,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( less @ X0 @ X1 )
     => ( ( less @ X2 @ X3 )
       => ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz34a) ).

thf(f5,axiom,
    ! [X0: nat,X1: nat] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz29) ).

thf(f6,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( ts @ ( ts @ X0 @ X1 ) @ X2 )
      = ( ts @ X0 @ ( ts @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz31) ).

thf(f7,conjecture,
    less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz50) ).

thf(f8,negated_conjecture,
    ~ ( less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ) ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

thf(f9,plain,
    less @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
    inference(rectify,[],[f1]) ).

thf(f10,plain,
    ( ( less @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
    = $true ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    less @ ( ts @ ( num @ y ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ y ) ),
    inference(rectify,[],[f2]) ).

thf(f12,plain,
    ( ( less @ ( ts @ ( num @ y ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ y ) ) )
    = $true ),
    inference(fool_elimination,[],[f11]) ).

thf(f13,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X2 ) )
     => ( less @ X0 @ X1 ) ),
    inference(rectify,[],[f3]) ).

thf(f14,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X2 ) )
        = $true )
     => ( ( less @ X0 @ X1 )
        = $true ) ),
    inference(fool_elimination,[],[f13]) ).

thf(f15,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( less @ X0 @ X1 )
     => ( ( less @ X2 @ X3 )
       => ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) ) ) ),
    inference(rectify,[],[f4]) ).

thf(f16,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
     => ( ( ( less @ X2 @ X3 )
          = $true )
       => ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) )
          = $true ) ) ),
    inference(fool_elimination,[],[f15]) ).

thf(f17,plain,
    ~ ( less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ) ),
    inference(rectify,[],[f8]) ).

thf(f18,plain,
    ( ( less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ) )
   != $true ),
    inference(fool_elimination,[],[f17]) ).

thf(f19,plain,
    ( ( less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ) )
   != $true ),
    inference(flattening,[],[f18]) ).

thf(f20,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
      | ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X2 ) )
       != $true ) ),
    inference(ennf_transformation,[],[f14]) ).

thf(f21,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) )
        = $true )
      | ( ( less @ X2 @ X3 )
       != $true )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f16]) ).

thf(f22,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) )
        = $true )
      | ( ( less @ X2 @ X3 )
       != $true )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(flattening,[],[f21]) ).

thf(f23,plain,
    ( ( less @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) )
    = $true ),
    inference(cnf_transformation,[],[f10]) ).

thf(f24,plain,
    ( ( less @ ( ts @ ( num @ y ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ y ) ) )
    = $true ),
    inference(cnf_transformation,[],[f12]) ).

thf(f25,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X2 ) )
       != $true )
      | ( ( less @ X0 @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f26,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ( less @ X2 @ X3 )
       != $true )
      | ( ( less @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) )
        = $true )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(cnf_transformation,[],[f22]) ).

thf(f27,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f28,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( ts @ ( ts @ X0 @ X1 ) @ X2 )
      = ( ts @ X0 @ ( ts @ X1 @ X2 ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f29,plain,
    ( ( less @ ( ts @ ( num @ x ) @ ( den @ z ) ) @ ( ts @ ( num @ z ) @ ( den @ x ) ) )
   != $true ),
    inference(cnf_transformation,[],[f19]) ).

thf(f32,definition,
    ( sF0
    = ( num @ x ) ),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

thf(f33,plain,
    ( ( num @ x )
    = sF0 ),
    inference(reorient_equations,[],[f32]) ).

thf(f34,definition,
    ( sF1
    = ( den @ z ) ),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

thf(f35,plain,
    ( ( den @ z )
    = sF1 ),
    inference(reorient_equations,[],[f34]) ).

thf(f36,definition,
    ( sF2
    = ( ts @ sF0 @ sF1 ) ),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

thf(f37,plain,
    ( ( ts @ sF0 @ sF1 )
    = sF2 ),
    inference(reorient_equations,[],[f36]) ).

thf(f38,definition,
    ( sF3
    = ( num @ z ) ),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

thf(f39,plain,
    ( ( num @ z )
    = sF3 ),
    inference(reorient_equations,[],[f38]) ).

thf(f40,definition,
    ( sF4
    = ( den @ x ) ),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

thf(f41,plain,
    ( ( den @ x )
    = sF4 ),
    inference(reorient_equations,[],[f40]) ).

thf(f42,definition,
    ( sF5
    = ( ts @ sF3 @ sF4 ) ),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

thf(f43,plain,
    ( ( ts @ sF3 @ sF4 )
    = sF5 ),
    inference(reorient_equations,[],[f42]) ).

thf(f44,definition,
    ( sF6
    = ( less @ sF2 @ sF5 ) ),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

thf(f45,plain,
    ( ( less @ sF2 @ sF5 )
    = sF6 ),
    inference(reorient_equations,[],[f44]) ).

thf(f46,plain,
    $true != sF6,
    inference(definition_folding,[],[f29,f45,f43,f41,f39,f37,f35,f33]) ).

thf(f48,plain,
    ( ( $false
      = ( less @ sF2 @ sF5 ) )
    | ( $true = sF6 ) ),
    inference(iff_proxy_clausification,[],[f45]) ).

thf(f49,plain,
    ( $false
    = ( less @ sF2 @ sF5 ) ),
    inference(forward_subsumption_resolution,[],[f48,f46]) ).

thf(f69,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( ts @ ( ts @ X0 @ X1 ) @ X2 )
      = ( ts @ X1 @ ( ts @ X0 @ X2 ) ) ),
    inference(constrained_superposition,[],[f28,f27]) ).

thf(f71,plain,
    ! [X0: nat] :
      ( ( ts @ sF0 @ ( ts @ sF1 @ X0 ) )
      = ( ts @ sF2 @ X0 ) ),
    inference(constrained_superposition,[],[f28,f37]) ).

thf(f72,plain,
    ! [X0: nat] :
      ( ( ts @ sF3 @ ( ts @ sF4 @ X0 ) )
      = ( ts @ sF5 @ X0 ) ),
    inference(constrained_superposition,[],[f28,f43]) ).

thf(f80,plain,
    ! [X0: nat] :
      ( ( ts @ sF2 @ X0 )
      = ( ts @ sF0 @ ( ts @ X0 @ sF1 ) ) ),
    inference(constrained_superposition,[],[f71,f27]) ).

thf(f106,plain,
    ( $true
    = ( less @ ( ts @ sF0 @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) ),
    inference(constrained_superposition,[],[f23,f33]) ).

thf(f107,plain,
    ( $true
    = ( less @ ( ts @ sF0 @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ sF4 ) ) ),
    inference(forward_demodulation,[],[f106,f41]) ).

thf(f109,plain,
    ( $true
    = ( less @ ( ts @ sF0 @ ( den @ y ) ) @ ( ts @ sF4 @ ( num @ y ) ) ) ),
    inference(forward_demodulation,[],[f107,f27]) ).

thf(f117,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ ( ts @ sF2 @ X0 ) @ X1 )
      = ( ts @ sF0 @ ( ts @ ( ts @ X0 @ sF1 ) @ X1 ) ) ),
    inference(constrained_superposition,[],[f28,f80]) ).

thf(f118,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ ( ts @ sF2 @ X0 ) @ X1 )
      = ( ts @ sF0 @ ( ts @ X0 @ ( ts @ sF1 @ X1 ) ) ) ),
    inference(forward_demodulation,[],[f117,f28]) ).

thf(f119,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ sF2 @ ( ts @ X0 @ X1 ) )
      = ( ts @ sF0 @ ( ts @ X0 @ ( ts @ sF1 @ X1 ) ) ) ),
    inference(forward_demodulation,[],[f118,f28]) ).

thf(f139,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true != $true )
      | ( $true
        = ( less @ ( ts @ X0 @ ( ts @ ( num @ y ) @ ( den @ z ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ z ) @ ( den @ y ) ) ) ) )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(constrained_superposition,[],[f26,f24]) ).

thf(f140,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true
        = ( less @ ( ts @ X0 @ ( ts @ ( num @ y ) @ ( den @ z ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ z ) @ ( den @ y ) ) ) ) )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(trivial_inequality_removal,[],[f139]) ).

thf(f144,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true
        = ( less @ ( ts @ X0 @ ( ts @ ( num @ y ) @ sF1 ) ) @ ( ts @ X1 @ ( ts @ ( num @ z ) @ ( den @ y ) ) ) ) )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(forward_demodulation,[],[f140,f35]) ).

thf(f146,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true
        = ( less @ ( ts @ X0 @ ( ts @ sF1 @ ( num @ y ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ z ) @ ( den @ y ) ) ) ) )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(forward_demodulation,[],[f144,f27]) ).

thf(f148,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( less @ X0 @ X1 )
       != $true )
      | ( $true
        = ( less @ ( ts @ X0 @ ( ts @ sF1 @ ( num @ y ) ) ) @ ( ts @ X1 @ ( ts @ sF3 @ ( den @ y ) ) ) ) ) ),
    inference(forward_demodulation,[],[f146,f39]) ).

thf(f199,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ts @ ( ts @ X0 @ ( ts @ X1 @ X2 ) ) @ X3 )
      = ( ts @ X2 @ ( ts @ ( ts @ X0 @ X1 ) @ X3 ) ) ),
    inference(constrained_superposition,[],[f69,f28]) ).

thf(f228,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ts @ ( ts @ X0 @ ( ts @ X1 @ X2 ) ) @ X3 )
      = ( ts @ X2 @ ( ts @ X0 @ ( ts @ X1 @ X3 ) ) ) ),
    inference(forward_demodulation,[],[f199,f28]) ).

thf(f235,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ts @ X0 @ ( ts @ ( ts @ X1 @ X2 ) @ X3 ) )
      = ( ts @ X2 @ ( ts @ X0 @ ( ts @ X1 @ X3 ) ) ) ),
    inference(forward_demodulation,[],[f228,f28]) ).

thf(f240,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ts @ X0 @ ( ts @ X1 @ ( ts @ X2 @ X3 ) ) )
      = ( ts @ X2 @ ( ts @ X0 @ ( ts @ X1 @ X3 ) ) ) ),
    inference(forward_demodulation,[],[f235,f28]) ).

thf(f788,plain,
    ( ( $true != $true )
    | ( $true
      = ( less @ ( ts @ ( ts @ sF0 @ ( den @ y ) ) @ ( ts @ sF1 @ ( num @ y ) ) ) @ ( ts @ ( ts @ sF4 @ ( num @ y ) ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ) ),
    inference(constrained_superposition,[],[f148,f109]) ).

thf(f795,plain,
    ( $true
    = ( less @ ( ts @ ( ts @ sF0 @ ( den @ y ) ) @ ( ts @ sF1 @ ( num @ y ) ) ) @ ( ts @ ( ts @ sF4 @ ( num @ y ) ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ),
    inference(trivial_inequality_removal,[],[f788]) ).

thf(f801,plain,
    ( $true
    = ( less @ ( ts @ sF0 @ ( ts @ ( den @ y ) @ ( ts @ sF1 @ ( num @ y ) ) ) ) @ ( ts @ ( ts @ sF4 @ ( num @ y ) ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ),
    inference(forward_demodulation,[],[f795,f28]) ).

thf(f805,plain,
    ( $true
    = ( less @ ( ts @ sF2 @ ( ts @ ( den @ y ) @ ( num @ y ) ) ) @ ( ts @ ( ts @ sF4 @ ( num @ y ) ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ),
    inference(forward_demodulation,[],[f801,f119]) ).

thf(f809,plain,
    ( $true
    = ( less @ ( ts @ sF2 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) @ ( ts @ ( ts @ sF4 @ ( num @ y ) ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ),
    inference(forward_demodulation,[],[f805,f27]) ).

thf(f813,plain,
    ( $true
    = ( less @ ( ts @ sF2 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) @ ( ts @ sF4 @ ( ts @ ( num @ y ) @ ( ts @ sF3 @ ( den @ y ) ) ) ) ) ),
    inference(forward_demodulation,[],[f809,f28]) ).

thf(f816,plain,
    ( $true
    = ( less @ ( ts @ sF2 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) @ ( ts @ sF3 @ ( ts @ sF4 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) ) ) ),
    inference(forward_demodulation,[],[f813,f240]) ).

thf(f819,plain,
    ( $true
    = ( less @ ( ts @ sF2 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) @ ( ts @ sF5 @ ( ts @ ( num @ y ) @ ( den @ y ) ) ) ) ),
    inference(forward_demodulation,[],[f816,f72]) ).

thf(f27011,plain,
    ( ( $true != $true )
    | ( $true
      = ( less @ sF2 @ sF5 ) ) ),
    inference(constrained_superposition,[],[f25,f819]) ).

thf(f27012,plain,
    ( $true
    = ( less @ sF2 @ sF5 ) ),
    inference(trivial_inequality_removal,[],[f27011]) ).

thf(f27043,plain,
    $true = $false,
    inference(forward_demodulation,[],[f27012,f49]) ).

thf(f27044,plain,
    $false,
    inference(trivial_inequality_removal,[],[f27043]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NUM741^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Tue Sep 29 12:46:49 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.06/0.11  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.13  Running first-order model finding
% 0.06/0.13  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
% 2.68/0.54  % (57287)Will run a generic schedule for satisfiability detection.
% 2.68/0.54  % (57297)% WARNING: option uhcvi not known.
% 2.68/0.54  % (57299)dis+10_1_sil=32000:sp=arity:random_seed=444940350:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.68/0.54  % (57296)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1971880564_2999 on theBenchmark for (2999ds/0Mi)
% 2.68/0.54  % (57297)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=307016711:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.68/0.54  % (57298)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1189030425:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.68/0.54  % (57300)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=187656369:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.68/0.54  % (57301)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2930400753:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.68/0.54  % (57297)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.68/0.54  % (57302)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1339720992:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.68/0.54  % Exception at run slice level% (57297)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.68/0.54  
% 2.68/0.54  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.68/0.54  % (57300)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.68/0.54  % (57313)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=100715341:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.68/0.54  % Exception at run slice level
% 2.68/0.54  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.68/0.54  % (57317)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1902303901:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.68/0.54  % (57299)Instruction limit reached! 
% 2.68/0.54  % (57299)------------------------------
% 2.68/0.54  % (57299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.68/0.54  % (57299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/0.54  % (57299)CaDiCaL version: 2.1.3
% 2.68/0.54  % (57299)Termination reason: Instruction limit
% 2.68/0.54  % (57299)Termination phase: Saturation
% 2.68/0.54  % (57299)Time elapsed: 0.025 s
% 2.68/0.54  % (57299)Peak memory usage: 12 MB
% 2.68/0.54  % (57299)Instructions burned: 104 (million)
% 2.68/0.54  % (57300)Instruction limit reached! 
% 2.68/0.54  % (57300)------------------------------
% 2.68/0.54  % (57300)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.68/0.54  % (57300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/0.54  % (57300)CaDiCaL version: 2.1.3
% 2.68/0.54  % (57300)Termination reason: Instruction limit
% 2.68/0.54  % (57300)Termination phase: Saturation
% 2.68/0.54  % (57300)Time elapsed: 0.029 s
% 2.68/0.54  % (57300)Peak memory usage: 12 MB
% 2.68/0.54  % (57300)Instructions burned: 117 (million)
% 2.68/0.54  % (57301)Instruction limit reached! 
% 2.68/0.54  % (57301)------------------------------
% 2.68/0.54  % (57301)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.68/0.54  % (57301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/0.54  % (57301)CaDiCaL version: 2.1.3
% 2.68/0.54  % (57301)Termination reason: Instruction limit
% 2.68/0.54  % (57301)Termination phase: Saturation
% 2.68/0.54  % (57301)Time elapsed: 0.031 s
% 2.68/0.54  % (57301)Peak memory usage: 12 MB
% 2.68/0.54  % (57301)Instructions burned: 131 (million)
% 2.68/0.54  % (57323)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2579640622:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.68/0.54  % (57323)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.68/0.54  % (57323)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.68/0.54  % (57324)ott-21_1_sil=16000:fs=off:random_seed=68487777:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 2.68/0.54  % (57302)Instruction limit reached! 
% 2.68/0.54  % (57302)------------------------------
% 2.68/0.54  % (57302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57302)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57302)Termination reason: Instruction limit
% 8.55/1.45  % (57302)Termination phase: Saturation
% 8.55/1.45  % (57302)Time elapsed: 0.039 s
% 8.55/1.45  % (57302)Peak memory usage: 12 MB
% 8.55/1.45  % (57302)Instructions burned: 162 (million)
% 8.55/1.45  % (57325)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=658343063:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 8.55/1.45  % (57328)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3338449877:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57317)Instruction limit reached! 
% 8.55/1.45  % (57317)------------------------------
% 8.55/1.45  % (57317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57317)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57317)Termination reason: Instruction limit
% 8.55/1.45  % (57317)Termination phase: Saturation
% 8.55/1.45  % (57317)Time elapsed: 0.034 s
% 8.55/1.45  % (57317)Peak memory usage: 12 MB
% 8.55/1.45  % (57317)Instructions burned: 140 (million)
% 8.55/1.45  % (57331)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2798913727:i=1179_2999 on theBenchmark for (2999ds/1179Mi)
% 8.55/1.45  % (57332)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3256811500:i=889:ins=1_2999 on theBenchmark for (2999ds/889Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57324)Instruction limit reached! 
% 8.55/1.45  % (57324)------------------------------
% 8.55/1.45  % (57324)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57324)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57324)Termination reason: Instruction limit
% 8.55/1.45  % (57324)Termination phase: Saturation
% 8.55/1.45  % (57324)Time elapsed: 0.036 s
% 8.55/1.45  % (57324)Peak memory usage: 12 MB
% 8.55/1.45  % (57324)Instructions burned: 181 (million)
% 8.55/1.45  % (57335)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=576463644:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2999 on theBenchmark for (2999ds/692Mi)
% 8.55/1.45  % (57335)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.55/1.45  % (57336)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=739981540:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 8.55/1.45  % (57336)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.55/1.45  % (57325)Instruction limit reached! 
% 8.55/1.45  % (57325)------------------------------
% 8.55/1.45  % (57325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57325)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57325)Termination reason: Instruction limit
% 8.55/1.45  % (57325)Termination phase: Saturation
% 8.55/1.45  % (57325)Time elapsed: 0.115 s
% 8.55/1.45  % (57325)Peak memory usage: 13 MB
% 8.55/1.45  % (57325)Instructions burned: 481 (million)
% 8.55/1.45  % (57339)fmb+10_1_sil=64000:random_seed=3406355716:i=22061:nm=2:gsp=on_2998 on theBenchmark for (2998ds/22061Mi)
% 8.55/1.45  % (57339)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57341)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1821937472:i=9515:nm=5_2998 on theBenchmark for (2998ds/9515Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57343)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1134876104:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57323)Instruction limit reached! 
% 8.55/1.45  % (57323)------------------------------
% 8.55/1.45  % (57323)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57323)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57323)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57323)Termination reason: Instruction limit
% 8.55/1.45  % (57323)Termination phase: Saturation
% 8.55/1.45  % (57323)Time elapsed: 0.159 s
% 8.55/1.45  % (57323)Peak memory usage: 13 MB
% 8.55/1.45  % (57323)Instructions burned: 684 (million)
% 8.55/1.45  % (57345)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1287812279:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 8.55/1.45  % (57345)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.55/1.45  % (57346)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3626859848:i=1472:ins=7:fdi=8:gsp=on_2997 on theBenchmark for (2997ds/1472Mi)
% 8.55/1.45  % (57346)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.55/1.45  % (57346)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.55/1.45  % (57335)Instruction limit reached! 
% 8.55/1.45  % (57335)------------------------------
% 8.55/1.45  % (57335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57335)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57335)Termination reason: Instruction limit
% 8.55/1.45  % (57335)Termination phase: Saturation
% 8.55/1.45  % (57335)Time elapsed: 0.150 s
% 8.55/1.45  % (57335)Peak memory usage: 14 MB
% 8.55/1.45  % (57335)Instructions burned: 694 (million)
% 8.55/1.45  % (57349)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1268176814:i=6324_2997 on theBenchmark for (2997ds/6324Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57351)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=4281658650:fmbsr=2.30978:i=2174_2997 on theBenchmark for (2997ds/2174Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57353)ott-2_1_sil=16000:newcnf=on:random_seed=3291176119:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2997 on theBenchmark for (2997ds/869Mi)
% 8.55/1.45  % (57353)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.55/1.45  % (57336)Instruction limit reached! 
% 8.55/1.45  % (57336)------------------------------
% 8.55/1.45  % (57336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57336)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57336)Termination reason: Instruction limit
% 8.55/1.45  % (57336)Termination phase: Saturation
% 8.55/1.45  % (57336)Time elapsed: 0.200 s
% 8.55/1.45  % (57336)Peak memory usage: 14 MB
% 8.55/1.45  % (57336)Instructions burned: 882 (million)
% 8.55/1.45  % (57355)ott+10_1_sil=32000:tgt=ground:random_seed=2995782544:i=5114:av=off_2996 on theBenchmark for (2996ds/5114Mi)
% 8.55/1.45  % (57331)Instruction limit reached! 
% 8.55/1.45  % (57331)------------------------------
% 8.55/1.45  % (57331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57331)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57331)Termination reason: Instruction limit
% 8.55/1.45  % (57331)Termination phase: Saturation
% 8.55/1.45  % (57331)Time elapsed: 0.297 s
% 8.55/1.45  % (57331)Peak memory usage: 16 MB
% 8.55/1.45  % (57331)Instructions burned: 1193 (million)
% 8.55/1.45  % (57357)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1113563018:i=54282_2996 on theBenchmark for (2996ds/54282Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57359)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=4231037133:i=3512:aac=none_2996 on theBenchmark for (2996ds/3512Mi)
% 8.55/1.45  % (57359)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.55/1.45  % (57353)Instruction limit reached! 
% 8.55/1.45  % (57353)------------------------------
% 8.55/1.45  % (57353)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57353)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57353)Termination reason: Instruction limit
% 8.55/1.45  % (57353)Termination phase: Saturation
% 8.55/1.45  % (57353)Time elapsed: 0.203 s
% 8.55/1.45  % (57353)Peak memory usage: 13 MB
% 8.55/1.45  % (57353)Instructions burned: 872 (million)
% 8.55/1.45  % (57361)dis+21_1_sil=32000:sas=cadical:random_seed=2697036188:i=3773:amm=off_2995 on theBenchmark for (2995ds/3773Mi)
% 8.55/1.45  % (57346)Instruction limit reached! 
% 8.55/1.45  % (57346)------------------------------
% 8.55/1.45  % (57346)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57346)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57346)Termination reason: Instruction limit
% 8.55/1.45  % (57346)Termination phase: Saturation
% 8.55/1.45  % (57346)Time elapsed: 0.345 s
% 8.55/1.45  % (57346)Peak memory usage: 14 MB
% 8.55/1.45  % (57346)Instructions burned: 1472 (million)
% 8.55/1.45  % (57363)ott+11_1_sil=16000:gs=on:random_seed=2854902:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2994 on theBenchmark for (2994ds/2251Mi)
% 8.55/1.45  % (57363)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.55/1.45  % (57363)Instruction limit reached! 
% 8.55/1.45  % (57363)------------------------------
% 8.55/1.45  % (57363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57363)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57363)Termination reason: Instruction limit
% 8.55/1.45  % (57363)Termination phase: Saturation
% 8.55/1.45  % (57363)Time elapsed: 0.479 s
% 8.55/1.45  % (57363)Peak memory usage: 14 MB
% 8.55/1.45  % (57363)Instructions burned: 2255 (million)
% 8.55/1.45  % (57365)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=2649248417:fmbsr=1.6:i=67534_2989 on theBenchmark for (2989ds/67534Mi)
% 8.55/1.45  % Exception at run slice level
% 8.55/1.45  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.55/1.45  % (57367)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=3938997756:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2989 on theBenchmark for (2989ds/4591Mi)
% 8.55/1.45  % (57359)Instruction limit reached! 
% 8.55/1.45  % (57359)------------------------------
% 8.55/1.45  % (57359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57359)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57359)Termination reason: Instruction limit
% 8.55/1.45  % (57359)Termination phase: Saturation
% 8.55/1.45  % (57359)Time elapsed: 0.770 s
% 8.55/1.45  % (57359)Peak memory usage: 19 MB
% 8.55/1.45  % (57359)Instructions burned: 3513 (million)
% 8.55/1.45  % (57369)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=286832901:i=29340_2988 on theBenchmark for (2988ds/29340Mi)
% 8.55/1.45  % (57355) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-57287-57355"...
% 8.55/1.45  % (57355)...printing done.
% 8.55/1.45  % (57355)Refutation found. Thanks to Tanya!
% 8.55/1.45  % SZS status Theorem for theBenchmark
% 8.55/1.45  % SZS output start Proof for theBenchmark
% See solution above
% 8.55/1.45  % (57355)------------------------------
% 8.55/1.45  % (57355)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.55/1.45  % (57355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.55/1.45  % (57355)CaDiCaL version: 2.1.3
% 8.55/1.45  % (57355)Termination reason: Refutation
% 8.55/1.45  % (57355)Time elapsed: 0.984 s
% 8.55/1.45  % (57355)Peak memory usage: 21 MB
% 8.55/1.45  % (57355)Instructions burned: 4416 (million)
% 8.55/1.45  % (57287)Success in time 1.313 s
% 8.55/1.45  % Vampire exiting
%------------------------------------------------------------------------------