↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n017.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:03:50 PM UTC 2026

% Result   : Theorem 4.87s 1.42s
% Output   : Refutation 5.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   79 (  22 unt;   4 def)
%            Number of atoms       :  301 (  24 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  371 ( 149   ~; 139   |;  58   &)
%                                         (   8 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   82 (   0 sgn  62   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(app(X2,X1),X3) = X0 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).

fof(f36,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ segmentP(X3,X2)
                    | ~ strictorderedP(X2)
                    | ? [X4] :
                        ( ssList(X4)
                        & neq(X2,X4)
                        & segmentP(X3,X4)
                        & segmentP(X4,X2)
                        & strictorderedP(X4) )
                    | ! [X5] :
                        ( ssItem(X5)
                       => ( ~ memberP(X0,X5)
                          | memberP(X1,X5) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X1 != X3
                      | X0 != X2
                      | ~ segmentP(X3,X2)
                      | ~ strictorderedP(X2)
                      | ? [X4] :
                          ( ssList(X4)
                          & neq(X2,X4)
                          & segmentP(X3,X4)
                          & segmentP(X4,X2)
                          & strictorderedP(X4) )
                      | ! [X5] :
                          ( ssItem(X5)
                         => ( ~ memberP(X0,X5)
                            | memberP(X1,X5) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & segmentP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ segmentP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ? [X5] :
                      ( memberP(X0,X5)
                      & ~ memberP(X1,X5)
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & segmentP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ segmentP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ? [X5] :
                      ( memberP(X0,X5)
                      & ~ memberP(X1,X5)
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f104,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f115,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(app(X2,X1),X3) = X0 ) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f137,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f183,plain,
    ( sK1 = sK3
    & sK0 = sK2
    & segmentP(sK3,sK2)
    & strictorderedP(sK2)
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(sK2,X4)
        | ~ segmentP(sK3,X4)
        | ~ segmentP(X4,sK2)
        | ~ strictorderedP(X4) )
    & memberP(sK0,sK4)
    & ~ memberP(sK1,sK4)
    & ssItem(sK4)
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).

fof(f189,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f104]) ).

fof(f190,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f189]) ).

fof(f195,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( ssList(X3)
                      & app(app(X2,X1),X3) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f115]) ).

fof(f196,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(app(X4,X1),X5) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f195]) ).

fof(f197,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ( ssList(sK9(X0,X1))
                & ssList(sK10(X0,X1))
                & app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0 )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f196]) ).

fof(f219,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f183]) ).

fof(f220,plain,
    ssList(sK1),
    inference(cnf_transformation,[],[f183]) ).

fof(f223,plain,
    ssItem(sK4),
    inference(cnf_transformation,[],[f183]) ).

fof(f224,plain,
    ~ memberP(sK1,sK4),
    inference(cnf_transformation,[],[f183]) ).

fof(f225,plain,
    memberP(sK0,sK4),
    inference(cnf_transformation,[],[f183]) ).

fof(f228,plain,
    segmentP(sK3,sK2),
    inference(cnf_transformation,[],[f183]) ).

fof(f229,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f183]) ).

fof(f230,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f183]) ).

fof(f243,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ memberP(X2,X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f190]) ).

fof(f244,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ memberP(X1,X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f190]) ).

fof(f256,plain,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f197]) ).

fof(f257,plain,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | ssList(sK10(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f197]) ).

fof(f258,plain,
    ! [X0,X1] :
      ( ssList(sK9(X0,X1))
      | ~ segmentP(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f197]) ).

fof(f294,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f348,plain,
    memberP(sK2,sK4),
    inference(definition_unfolding,[],[f225,f229]) ).

fof(f349,plain,
    ~ memberP(sK3,sK4),
    inference(definition_unfolding,[],[f224,f230]) ).

fof(f350,plain,
    ssList(sK3),
    inference(definition_unfolding,[],[f220,f230]) ).

fof(f351,plain,
    ssList(sK2),
    inference(definition_unfolding,[],[f219,f229]) ).

fof(f371,plain,
    ( sK3 = app(app(sK9(sK3,sK2),sK2),sK10(sK3,sK2))
    | ~ ssList(sK2)
    | ~ ssList(sK3) ),
    inference(resolution,[],[f256,f228]) ).

fof(f372,plain,
    ( sK3 = app(app(sK9(sK3,sK2),sK2),sK10(sK3,sK2))
    | ~ ssList(sK3) ),
    inference(forward_subsumption_resolution,[],[f371,f351]) ).

fof(f373,plain,
    sK3 = app(app(sK9(sK3,sK2),sK2),sK10(sK3,sK2)),
    inference(forward_subsumption_resolution,[],[f372,f350]) ).

fof(f374,plain,
    ! [X0] :
      ( memberP(sK3,X0)
      | ~ memberP(app(sK9(sK3,sK2),sK2),X0)
      | ~ ssList(sK10(sK3,sK2))
      | ~ ssList(app(sK9(sK3,sK2),sK2))
      | ~ ssItem(X0) ),
    inference(superposition,[],[f244,f373]) ).

fof(f377,definition,
    ( spl30_1
  <=> ssList(app(sK9(sK3,sK2),sK2)) ),
    introduced(definition,[new_symbols(definition,[spl30_1])],[avatar_definition]) ).

fof(f378,plain,
    ( ~ ssList(app(sK9(sK3,sK2),sK2))
    | spl30_1 ),
    inference(avatar_component_clause,[],[f377]) ).

fof(f380,definition,
    ( spl30_2
  <=> ssList(sK10(sK3,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition]) ).

fof(f381,plain,
    ( ~ ssList(sK10(sK3,sK2))
    | spl30_2 ),
    inference(avatar_component_clause,[],[f380]) ).

fof(f387,definition,
    ( spl30_4
  <=> ! [X0] :
        ( memberP(sK3,X0)
        | ~ ssItem(X0)
        | ~ memberP(app(sK9(sK3,sK2),sK2),X0) ) ),
    introduced(definition,[new_symbols(definition,[spl30_4])],[avatar_definition]) ).

fof(f388,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sK3,X0)
        | ~ memberP(app(sK9(sK3,sK2),sK2),X0) )
    | ~ spl30_4 ),
    inference(avatar_component_clause,[],[f387]) ).

fof(f389,plain,
    ( ~ spl30_1
    | ~ spl30_2
    | spl30_4 ),
    inference(avatar_split_clause,[],[f374,f387,f380,f377]) ).

fof(f393,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK9(sK3,sK2))
    | spl30_1 ),
    inference(resolution,[],[f294,f378]) ).

fof(f396,plain,
    ( ~ ssList(sK9(sK3,sK2))
    | spl30_1 ),
    inference(forward_subsumption_resolution,[],[f393,f351]) ).

fof(f398,plain,
    ( ~ segmentP(sK3,sK2)
    | ~ ssList(sK2)
    | ~ ssList(sK3)
    | spl30_1 ),
    inference(resolution,[],[f396,f258]) ).

fof(f400,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK3)
    | spl30_1 ),
    inference(forward_subsumption_resolution,[],[f398,f228]) ).

fof(f401,plain,
    ( ~ ssList(sK3)
    | spl30_1 ),
    inference(forward_subsumption_resolution,[],[f400,f351]) ).

fof(f402,plain,
    ( $false
    | spl30_1 ),
    inference(forward_subsumption_resolution,[],[f401,f350]) ).

fof(f403,plain,
    spl30_1,
    inference(avatar_contradiction_clause,[],[f402]) ).

fof(f412,plain,
    ( ssList(sK10(sK3,sK2))
    | ~ ssList(sK2)
    | ~ ssList(sK3) ),
    inference(resolution,[],[f257,f228]) ).

fof(f414,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK3)
    | spl30_2 ),
    inference(forward_subsumption_resolution,[],[f412,f381]) ).

fof(f415,plain,
    ( ~ ssList(sK3)
    | spl30_2 ),
    inference(forward_subsumption_resolution,[],[f414,f351]) ).

fof(f416,plain,
    ( $false
    | spl30_2 ),
    inference(forward_subsumption_resolution,[],[f415,f350]) ).

fof(f417,plain,
    spl30_2,
    inference(avatar_contradiction_clause,[],[f416]) ).

fof(f420,plain,
    ( memberP(sK3,sK4)
    | ~ memberP(app(sK9(sK3,sK2),sK2),sK4)
    | ~ spl30_4 ),
    inference(resolution,[],[f388,f223]) ).

fof(f421,plain,
    ( ~ memberP(app(sK9(sK3,sK2),sK2),sK4)
    | ~ spl30_4 ),
    inference(forward_subsumption_resolution,[],[f420,f349]) ).

fof(f423,plain,
    ( ~ memberP(sK2,sK4)
    | ~ ssList(sK2)
    | ~ ssList(sK9(sK3,sK2))
    | ~ ssItem(sK4)
    | ~ spl30_4 ),
    inference(resolution,[],[f421,f243]) ).

fof(f424,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK9(sK3,sK2))
    | ~ ssItem(sK4)
    | ~ spl30_4 ),
    inference(forward_subsumption_resolution,[],[f423,f348]) ).

fof(f426,plain,
    ( ~ ssList(sK9(sK3,sK2))
    | ~ ssItem(sK4)
    | ~ spl30_4 ),
    inference(forward_subsumption_resolution,[],[f424,f351]) ).

fof(f428,plain,
    ( ~ ssList(sK9(sK3,sK2))
    | ~ spl30_4 ),
    inference(forward_subsumption_resolution,[],[f426,f223]) ).

fof(f430,definition,
    ( spl30_5
  <=> ssList(sK9(sK3,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl30_5])],[avatar_definition]) ).

fof(f431,plain,
    ( ~ ssList(sK9(sK3,sK2))
    | spl30_5 ),
    inference(avatar_component_clause,[],[f430]) ).

fof(f436,plain,
    ( ~ spl30_5
    | ~ spl30_4 ),
    inference(avatar_split_clause,[],[f428,f387,f430]) ).

fof(f438,plain,
    ( ~ segmentP(sK3,sK2)
    | ~ ssList(sK2)
    | ~ ssList(sK3)
    | spl30_5 ),
    inference(resolution,[],[f431,f258]) ).

fof(f440,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK3)
    | spl30_5 ),
    inference(forward_subsumption_resolution,[],[f438,f228]) ).

fof(f441,plain,
    ( ~ ssList(sK3)
    | spl30_5 ),
    inference(forward_subsumption_resolution,[],[f440,f351]) ).

fof(f442,plain,
    ( $false
    | spl30_5 ),
    inference(forward_subsumption_resolution,[],[f441,f350]) ).

fof(f443,plain,
    spl30_5,
    inference(avatar_contradiction_clause,[],[f442]) ).

cnf(s2,plain,
    ( ~ spl30_1
    | ~ spl30_2
    | spl30_4 ),
    inference(sat_conversion,[],[f389]) ).

cnf(s4,plain,
    spl30_1,
    inference(sat_conversion,[],[f403]) ).

cnf(s6,plain,
    spl30_2,
    inference(sat_conversion,[],[f417]) ).

cnf(s8,plain,
    ( ~ spl30_4
    | ~ spl30_5 ),
    inference(sat_conversion,[],[f436]) ).

cnf(s10,plain,
    spl30_5,
    inference(sat_conversion,[],[f443]) ).

cnf(s11,plain,
    ~ spl30_4,
    inference(rat,[],[s8,s10]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s2,s11,s6,s4]) ).

fof(f444,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC403+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n017.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 09:26:21 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running first-order theorem proving
% 0.09/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
% 4.87/1.42  % (3423777)Detected formulas, will run a generic FOF schedule.
% 4.87/1.42  % (3423865)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3272408055:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.87/1.42  % (3423871)dis-21_1_sil=8000:lcm=predicate:random_seed=776234098:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.87/1.42  % (3423866)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3149885035:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.87/1.42  % (3423869)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2797714893:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.87/1.42  % (3423863)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1626732875:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.87/1.42  % (3423867)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3298048131:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.87/1.42  % (3423870)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1120526311:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.87/1.42  % (3423869)Instruction limit reached! 
% 4.87/1.42  % (3423869)------------------------------
% 4.87/1.42  % (3423869)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423869)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423869)Termination reason: Instruction limit
% 4.87/1.42  % (3423869)Termination phase: Saturation
% 4.87/1.42  % (3423869)Time elapsed: 0.058 s
% 4.87/1.42  % (3423869)Peak memory usage: 88 MB
% 4.87/1.42  % (3423869)Instructions burned: 121 (million)
% 4.87/1.42  % (3423867)Instruction limit reached! 
% 4.87/1.42  % (3423867)------------------------------
% 4.87/1.42  % (3423867)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423867)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423867)Termination reason: Instruction limit
% 4.87/1.42  % (3423867)Termination phase: Saturation
% 4.87/1.42  % (3423867)Time elapsed: 0.068 s
% 4.87/1.42  % (3423867)Peak memory usage: 89 MB
% 4.87/1.42  % (3423867)Instructions burned: 110 (million)
% 4.87/1.42  % (3423871)Instruction limit reached! 
% 4.87/1.42  % (3423871)------------------------------
% 4.87/1.42  % (3423871)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423871)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423871)Termination reason: Instruction limit
% 4.87/1.42  % (3423871)Termination phase: Saturation
% 4.87/1.42  % (3423871)Time elapsed: 0.073 s
% 4.87/1.42  % (3423871)Peak memory usage: 90 MB
% 4.87/1.42  % (3423871)Instructions burned: 129 (million)
% 4.87/1.42  % (3423870)Instruction limit reached! 
% 4.87/1.42  % (3423870)------------------------------
% 4.87/1.42  % (3423870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423870)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423870)Termination reason: Instruction limit
% 4.87/1.42  % (3423870)Termination phase: Saturation
% 4.87/1.42  % (3423870)Time elapsed: 0.105 s
% 4.87/1.42  % (3423870)Peak memory usage: 90 MB
% 4.87/1.42  % (3423870)Instructions burned: 139 (million)
% 4.87/1.42  % (3423927)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1658655168:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.87/1.42  % (3423919)lrs+10_1_sil=8000:sp=occurrence:random_seed=608418148:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.87/1.42  % (3423922)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3221990691:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.87/1.42  % (3423865)First to succeed.
% 4.87/1.42  % (3423865)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3423777"
% 4.87/1.42  % (3423940)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1182185025:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.87/1.42  % (3423922)Instruction limit reached! 
% 4.87/1.42  % (3423922)------------------------------
% 4.87/1.42  % (3423922)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423922)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423922)Termination reason: Instruction limit
% 4.87/1.42  % (3423922)Termination phase: Saturation
% 4.87/1.42  % (3423922)Time elapsed: 0.121 s
% 4.87/1.42  % (3423922)Peak memory usage: 91 MB
% 4.87/1.42  % (3423922)Instructions burned: 157 (million)
% 4.87/1.42  % (3423919)Instruction limit reached! 
% 4.87/1.42  % (3423919)------------------------------
% 4.87/1.42  % (3423919)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423919)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423919)Termination reason: Instruction limit
% 4.87/1.42  % (3423919)Termination phase: Saturation
% 4.87/1.42  % (3423919)Time elapsed: 0.203 s
% 4.87/1.42  % (3423919)Peak memory usage: 93 MB
% 4.87/1.42  % (3423919)Instructions burned: 285 (million)
% 4.87/1.42  % (3423940)Instruction limit reached! 
% 4.87/1.42  % (3423940)------------------------------
% 4.87/1.42  % (3423940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423940)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423940)Termination reason: Instruction limit
% 4.87/1.42  % (3423940)Termination phase: Saturation
% 4.87/1.42  % (3423940)Time elapsed: 0.124 s
% 4.87/1.42  % (3423940)Peak memory usage: 93 MB
% 4.87/1.42  % (3423940)Instructions burned: 250 (million)
% 4.87/1.42  % (3423927)Instruction limit reached! 
% 4.87/1.42  % (3423927)------------------------------
% 4.87/1.42  % (3423927)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.42  % (3423927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.42  % (3423927)CaDiCaL version: 2.1.3
% 4.87/1.42  % (3423927)Termination reason: Instruction limit
% 4.87/1.42  % (3423927)Termination phase: Saturation
% 4.87/1.42  % (3423927)Time elapsed: 0.258 s
% 4.87/1.42  % (3423927)Peak memory usage: 94 MB
% 4.87/1.42  % (3423927)Instructions burned: 325 (million)
% 4.87/1.42  % (3423865)Refutation found. Thanks to Tanya!
% 4.87/1.42  % SZS status Theorem for theBenchmark
% 4.87/1.42  % SZS output start Proof for theBenchmark
% See solution above
% 5.85/1.62  % (3423865)------------------------------
% 5.85/1.62  % (3423865)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.85/1.62  % (3423865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.85/1.62  % (3423865)CaDiCaL version: 2.1.3
% 5.85/1.62  % (3423865)Termination reason: Refutation
% 5.85/1.62  % (3423865)Time elapsed: 0.448 s
% 5.85/1.62  % (3423865)Peak memory usage: 131 MB
% 5.85/1.62  % (3423865)Instructions burned: 953 (million)
% 5.85/1.62  % (3423865)------------------------------
% 5.85/1.62  % (3423865)------------------------------
% 5.85/1.62  % (3423777)Success in time 0.728 s
% 5.85/1.62  % Vampire exiting
%------------------------------------------------------------------------------