↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n020.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:16 AM UTC 2026

% Result   : Theorem 4.02s 1.34s
% Output   : Refutation 4.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   54 (  15 unt;   0 typ;   3 def)
%            Number of atoms       :  144 (  73 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  156 (  66   ~;  57   |;  21   &)
%                                         (   8 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  100 (   7 atm;   7 fun;  33 num;  53 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  :    9 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :   16 (  13 usr;   3 con; 0-2 aty)
%            Number of variables   :  119 (  99   !;  20   ?; 119   :)

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

tff(func_def_0,type,
    nil: list ).

tff(func_def_1,type,
    cons: ( $int * list ) > list ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(func_def_5,type,
    length: list > $int ).

tff(func_def_8,type,
    count: ( $int * list ) > $int ).

tff(func_def_9,type,
    append: ( list * list ) > list ).

tff(func_def_10,type,
    sK0: ( list * $int ) > $int ).

tff(func_def_11,type,
    sK1: ( list * $int ) > list ).

tff(func_def_12,type,
    sK2: ( $int * list ) > list ).

tff(func_def_13,type,
    sK3: ( $int * list ) > $int ).

tff(func_def_14,type,
    sK4: ( $int * list ) > list ).

tff(func_def_15,type,
    sK5: ( $int * list ) > $int ).

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

tff(pred_def_2,type,
    inRange: ( $int * list ) > $o ).

tff(f1,axiom,
    ! [X1: list,X0: $int] : ( head(cons(X0,X1)) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).

tff(f5,axiom,
    ! [X0: $int,X1: list] :
      ( ( ? [X3: list,X2: $int] :
            ( in(X0,X3)
            & ( X1 = cons(X2,X3) ) )
        | ? [X3: list,X2: $int] :
            ( ( X0 = X2 )
            & ( X1 = cons(X2,X3) ) ) )
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).

tff(f7,axiom,
    length(nil) = 0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

tff(f8,axiom,
    ! [X1: list,X0: $int] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).

tff(f9,axiom,
    ! [X0: $int] : ( count(X0,nil) = 0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).

tff(f14,axiom,
    ! [X1: list,X0: $int] :
      ( in(X0,X1)
    <=> $greater(count(X0,X1),0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_8) ).

tff(f15,conjecture,
    ~ ! [X1: list,X0: list] :
        ( ( length(X0) = length(X1) )
       => ( X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).

tff(f16,negated_conjecture,
    ~ ~ ! [X1: list,X0: list] :
          ( ( length(X0) = length(X1) )
         => ( X0 = X1 ) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

tff(f17,plain,
    ! [X1: list,X0: $int] :
      ( in(X0,X1)
    <=> $less(0,count(X0,X1)) ),
    inference(theory_normalization,[],[f14]) ).

tff(f19,plain,
    ! [X0: list,X1: $int] :
      ( $less(0,count(X1,X0))
    <=> in(X1,X0) ),
    inference(rectify,[],[f17]) ).

tff(f22,plain,
    ! [X0: $int,X1: list] :
      ( ( ? [X4: list,X5: $int] :
            ( ( cons(X5,X4) = X1 )
            & ( X0 = X5 ) )
        | ? [X3: list,X2: $int] :
            ( in(X0,X3)
            & ( X1 = cons(X2,X3) ) ) )
    <=> in(X0,X1) ),
    inference(rectify,[],[f5]) ).

tff(f24,plain,
    ! [X0: list,X1: $int] : ( length(cons(X1,X0)) = $sum(1,length(X0)) ),
    inference(rectify,[],[f8]) ).

tff(f26,plain,
    ~ ~ ! [X0: list,X1: list] :
          ( ( length(X0) = length(X1) )
         => ( X0 = X1 ) ),
    inference(rectify,[],[f16]) ).

tff(f27,plain,
    ! [X0: list,X1: list] :
      ( ( length(X0) = length(X1) )
     => ( X0 = X1 ) ),
    inference(flattening,[],[f26]) ).

tff(f30,plain,
    ! [X0: list,X1: list] :
      ( ( length(X1) != length(X0) )
      | ( X0 = X1 ) ),
    inference(ennf_transformation,[],[f27]) ).

tff(f36,plain,
    ! [X0: $int,X1: list] :
      ( ( ? [X4: list,X5: $int] :
            ( ( cons(X5,X4) = X1 )
            & ( X0 = X5 ) )
        | ? [X3: list,X2: $int] :
            ( in(X0,X3)
            & ( X1 = cons(X2,X3) ) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( ! [X4: list,X5: $int] :
              ( ( cons(X5,X4) != X1 )
              | ( X0 != X5 ) )
          & ! [X3: list,X2: $int] :
              ( ~ in(X0,X3)
              | ( cons(X2,X3) != X1 ) ) ) ) ),
    inference(nnf_transformation,[],[f22]) ).

tff(f37,plain,
    ! [X0: $int,X1: list] :
      ( ( ? [X4: list,X5: $int] :
            ( ( cons(X5,X4) = X1 )
            & ( X0 = X5 ) )
        | ? [X3: list,X2: $int] :
            ( in(X0,X3)
            & ( X1 = cons(X2,X3) ) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( ! [X4: list,X5: $int] :
              ( ( cons(X5,X4) != X1 )
              | ( X0 != X5 ) )
          & ! [X3: list,X2: $int] :
              ( ~ in(X0,X3)
              | ( cons(X2,X3) != X1 ) ) ) ) ),
    inference(flattening,[],[f36]) ).

tff(f38,plain,
    ! [X0: $int,X1: list] :
      ( ( ? [X2: list,X3: $int] :
            ( ( cons(X3,X2) = X1 )
            & ( X0 = X3 ) )
        | ? [X4: list,X5: $int] :
            ( in(X0,X4)
            & ( cons(X5,X4) = X1 ) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( ! [X6: list,X7: $int] :
              ( ( cons(X7,X6) != X1 )
              | ( X0 != X7 ) )
          & ! [X8: list,X9: $int] :
              ( ~ in(X0,X8)
              | ( cons(X9,X8) != X1 ) ) ) ) ),
    inference(rectify,[],[f37]) ).

tff(f39,plain,
    ! [X0: $int,X1: list] :
      ( ( ( ( cons(sK3(X0,X1),sK2(X0,X1)) = X1 )
          & ( sK3(X0,X1) = X0 ) )
        | ( in(X0,sK4(X0,X1))
          & ( cons(sK5(X0,X1),sK4(X0,X1)) = X1 ) )
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ( ! [X6: list,X7: $int] :
              ( ( cons(X7,X6) != X1 )
              | ( X0 != X7 ) )
          & ! [X8: list,X9: $int] :
              ( ~ in(X0,X8)
              | ( cons(X9,X8) != X1 ) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1)),skolemize(X4,sK4(X0,X1)),skolemize(X5,sK5(X0,X1))],[f38]) ).

tff(f40,plain,
    ! [X0: list,X1: $int] :
      ( ( $less(0,count(X1,X0))
        | ~ in(X1,X0) )
      & ( in(X1,X0)
        | ~ $less(0,count(X1,X0)) ) ),
    inference(nnf_transformation,[],[f19]) ).

tff(f42,plain,
    ! [X0: list,X1: $int] : ( head(cons(X1,X0)) = X1 ),
    inference(rectify,[],[f1]) ).

tff(f46,plain,
    ! [X0: $int] : ( 0 = count(X0,nil) ),
    inference(cnf_transformation,[],[f9]) ).

tff(f55,plain,
    ! [X0: $int,X1: list,X6: list,X7: $int] :
      ( in(X0,X1)
      | ( cons(X7,X6) != X1 )
      | ( X0 != X7 ) ),
    inference(cnf_transformation,[],[f39]) ).

tff(f61,plain,
    ! [X0: list,X1: $int] :
      ( $less(0,count(X1,X0))
      | ~ in(X1,X0) ),
    inference(cnf_transformation,[],[f40]) ).

tff(f63,plain,
    ! [X0: list,X1: $int] : ( head(cons(X1,X0)) = X1 ),
    inference(cnf_transformation,[],[f42]) ).

tff(f67,plain,
    0 = length(nil),
    inference(cnf_transformation,[],[f7]) ).

tff(f68,plain,
    ! [X0: list,X1: $int] : ( length(cons(X1,X0)) = $sum(1,length(X0)) ),
    inference(cnf_transformation,[],[f24]) ).

tff(f69,plain,
    ! [X0: list,X1: list] :
      ( ( length(X1) != length(X0) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f30]) ).

tff(f73,plain,
    ! [X0: $int,X6: list,X7: $int] :
      ( in(X0,cons(X7,X6))
      | ( X0 != X7 ) ),
    inference(equality_resolution,[],[f55]) ).

tff(f74,plain,
    ! [X6: list,X7: $int] : in(X7,cons(X7,X6)),
    inference(equality_resolution,[],[f73]) ).

tff(f78,definition,
    ( spl6_1
  <=> ( 0 = length(nil) ) ),
    introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).

tff(f80,plain,
    ( ( 0 = length(nil) )
    | ~ spl6_1 ),
    inference(avatar_component_clause,[],[f78]) ).

tff(f81,plain,
    spl6_1,
    inference(avatar_split_clause,[],[f67,f78]) ).

tff(f87,plain,
    ! [X0: $int] :
      ( $less(0,0)
      | ~ in(X0,nil) ),
    inference(superposition,[],[f61,f46]) ).

tff(f88,plain,
    ! [X0: $int] : ~ in(X0,nil),
    inference(evaluation,[],[f87]) ).

tff(f93,plain,
    ! [X2: $int,X0: list,X1: list] :
      ( ( length(X1) != $sum(1,length(X0)) )
      | ( cons(X2,X0) = X1 ) ),
    inference(superposition,[],[f69,f68]) ).

tff(f119,plain,
    ( ! [X0: list,X1: $int] :
        ( ( length(X0) != $sum(1,0) )
        | ( cons(X1,nil) = X0 ) )
    | ~ spl6_1 ),
    inference(superposition,[],[f93,f80]) ).

tff(f122,plain,
    ( ! [X0: list,X1: $int] :
        ( ( cons(X1,nil) = X0 )
        | ( 1 != length(X0) ) )
    | ~ spl6_1 ),
    inference(evaluation,[],[f119]) ).

tff(f127,plain,
    ( ! [X0: list,X1: $int] :
        ( ( head(X0) = X1 )
        | ( 1 != length(X0) ) )
    | ~ spl6_1 ),
    inference(superposition,[],[f63,f122]) ).

tff(f130,plain,
    ( ! [X0: list,X1: $int] :
        ( ( 1 != length(X0) )
        | in(X1,X0) )
    | ~ spl6_1 ),
    inference(superposition,[],[f74,f122]) ).

tff(f174,plain,
    ( ! [X2: $int,X0: list,X1: list] :
        ( ( 1 != length(X0) )
        | in(X2,X1)
        | ( head(X0) != 1 ) )
    | ~ spl6_1 ),
    inference(superposition,[],[f130,f127]) ).

tff(f207,definition,
    ( spl6_4
  <=> ! [X2: list,X1: $int] : in(X1,X2) ),
    introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).

tff(f208,plain,
    ( ! [X2: list,X1: $int] : in(X1,X2)
    | ~ spl6_4 ),
    inference(avatar_component_clause,[],[f207]) ).

tff(f217,plain,
    ( ! [X2: $int,X0: list,X1: list] :
        ( ( 1 != length(X0) )
        | in(X2,X1) )
    | ~ spl6_1 ),
    inference(forward_subsumption_resolution,[],[f174,f127]) ).

tff(f233,definition,
    ( spl6_9
  <=> ! [X1: list] : ( 1 != length(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).

tff(f234,plain,
    ( ! [X1: list] : ( 1 != length(X1) )
    | ~ spl6_9 ),
    inference(avatar_component_clause,[],[f233]) ).

tff(f254,plain,
    ( spl6_9
    | spl6_4
    | ~ spl6_1 ),
    inference(avatar_split_clause,[],[f217,f78,f207,f233]) ).

tff(f259,plain,
    ( $false
    | ~ spl6_4 ),
    inference(resolution,[],[f208,f88]) ).

tff(f260,plain,
    ~ spl6_4,
    inference(avatar_contradiction_clause,[],[f259]) ).

tff(f275,plain,
    ( ! [X0: list] : ( 1 != $sum(1,length(X0)) )
    | ~ spl6_9 ),
    inference(superposition,[],[f234,f68]) ).

tff(f305,plain,
    ( ( 1 != $sum(1,0) )
    | ~ spl6_1
    | ~ spl6_9 ),
    inference(superposition,[],[f275,f80]) ).

tff(f310,plain,
    ( $false
    | ~ spl6_1
    | ~ spl6_9 ),
    inference(evaluation,[],[f305]) ).

tff(f311,plain,
    ( ~ spl6_1
    | ~ spl6_9 ),
    inference(avatar_contradiction_clause,[],[f310]) ).

tff(f312,plain,
    $false,
    inference(avatar_smt_refutation,[],[f311,f260,f254,f81]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : DAT085_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16  % Computer : n020.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Sep 29 00:09:04 UTC 2026
% 0.10/0.16  % CPUTime  : 
% 0.10/0.16  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  Running first-order theorem proving
% 0.10/0.20  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
% 2.54/1.14  % (701455)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.54/1.14  % (701543)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1949008732:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.54/1.14  % (701543)Instruction limit reached! 
% 2.54/1.14  % (701543)------------------------------
% 2.54/1.14  % (701543)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.14  % (701543)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.14  % (701543)CaDiCaL version: 2.1.3
% 2.54/1.14  % (701543)Termination reason: Instruction limit
% 2.54/1.14  % (701543)Termination phase: Saturation
% 2.54/1.14  % (701543)Time elapsed: 0.020 s
% 2.54/1.14  % (701543)Peak memory usage: 115 MB
% 2.54/1.14  % (701543)Instructions burned: 15 (million)
% 2.54/1.14  % (701546)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=600462494:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.54/1.14  % (701547)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3914087174:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.54/1.14  % (701544)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2392080066:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.54/1.14  % (701545)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2027617570:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.54/1.14  % (701547)Instruction limit reached! 
% 2.54/1.14  % (701547)------------------------------
% 2.54/1.14  % (701547)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.14  % (701547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.14  % (701547)CaDiCaL version: 2.1.3
% 2.54/1.14  % (701547)Termination reason: Instruction limit
% 2.54/1.14  % (701547)Termination phase: Saturation
% 2.54/1.14  % (701547)Time elapsed: 0.004 s
% 2.54/1.14  % (701547)Peak memory usage: 88 MB
% 2.54/1.14  % (701547)Instructions burned: 4 (million)
% 2.54/1.14  % (701546)Instruction limit reached! 
% 2.54/1.14  % (701546)------------------------------
% 2.54/1.14  % (701546)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.14  % (701546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.14  % (701546)CaDiCaL version: 2.1.3
% 2.54/1.14  % (701546)Termination reason: Instruction limit
% 2.54/1.14  % (701546)Termination phase: Saturation
% 2.54/1.14  % (701546)Time elapsed: 0.006 s
% 2.54/1.14  % (701546)Peak memory usage: 88 MB
% 2.54/1.14  % (701546)Instructions burned: 7 (million)
% 2.54/1.14  % (701549)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1587450507:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.54/1.14  % (701548)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2570474729:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.54/1.14  % (701544)First to succeed.
% 2.54/1.14  % (701545)Also succeeded, but the first one will report.
% 2.54/1.14  % (701544)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-701455"
% 2.54/1.14  % (701548)Also succeeded, but the first one will report.
% 2.54/1.14  % (701549)Also succeeded, but the first one will report.
% 2.54/1.14  % (701575)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1534839760:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 2.54/1.14  % (701575)Also succeeded, but the first one will report.
% 2.54/1.14  % (701587)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=1788328584:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 2.54/1.14  % (701587)Also succeeded, but the first one will report.
% 2.54/1.14  % (701588)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=76381090:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 2.54/1.14  % (701588)Instruction limit reached! 
% 2.54/1.14  % (701588)------------------------------
% 2.54/1.14  % (701588)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.14  % (701588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.14  % (701588)CaDiCaL version: 2.1.3
% 2.54/1.14  % (701588)Termination reason: Instruction limit
% 4.02/1.34  % (701588)Termination phase: Saturation
% 4.02/1.34  % (701588)Time elapsed: 0.013 s
% 4.02/1.34  % (701588)Peak memory usage: 90 MB
% 4.02/1.34  % (701588)Instructions burned: 17 (million)
% 4.02/1.34  % (701544)Refutation found. Thanks to Tanya!
% 4.02/1.34  % SZS status Theorem for theBenchmark
% 4.02/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 4.02/1.34  % (701544)------------------------------
% 4.02/1.34  % (701544)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.34  % (701544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.34  % (701544)CaDiCaL version: 2.1.3
% 4.02/1.34  % (701544)Termination reason: Refutation
% 4.02/1.34  % (701544)Time elapsed: 0.046 s
% 4.02/1.34  % (701544)Peak memory usage: 116 MB
% 4.02/1.34  % (701544)Instructions burned: 22 (million)
% 4.02/1.34  % (701544)------------------------------
% 4.02/1.34  % (701544)------------------------------
% 4.02/1.34  % (701455)Success in time 0.499 s
% 4.02/1.34  % Vampire exiting
%------------------------------------------------------------------------------