↑ 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  : SWC330+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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:05:34 PM UTC 2026

% Result   : Theorem 0.18s 0.32s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   96 (  21 unt;   8 def)
%            Number of atoms       :  274 (  39 equ)
%            Maximal formula atoms :   21 (   2 avg)
%            Number of connectives :  291 ( 113   ~; 124   |;  30   &)
%                                         (  10 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   16 (  14 usr;   9 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   53 (   0 sgn  38   !;  15   ?)

% 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/Axioms/SWC001+0.ax',ax7) ).

fof(f57,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,nil) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).

fof(f73,axiom,
    ! [X0] :
      ( ssItem(X0)
     => equalelemsP(cons(X0,nil)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).

fof(f74,axiom,
    equalelemsP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | ( ! [X4] :
                        ( ssItem(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ! [X6] :
                                ( ~ ssList(X6)
                                | cons(X4,nil) != X2
                                | app(app(X5,X2),X6) != X3
                                | ? [X7] :
                                    ( ssItem(X7)
                                    & memberP(X5,X7)
                                    & lt(X4,X7) )
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & memberP(X6,X8)
                                    & lt(X8,X4) ) ) ) )
                    & ( nil != X3
                      | nil != X2 ) )
                  | ( segmentP(X1,X0)
                    & equalelemsP(X0) ) ) ) ) ),
    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
                    | ( ! [X4] :
                          ( ssItem(X4)
                         => ! [X5] :
                              ( ssList(X5)
                             => ! [X6] :
                                  ( ~ ssList(X6)
                                  | cons(X4,nil) != X2
                                  | app(app(X5,X2),X6) != X3
                                  | ? [X7] :
                                      ( ssItem(X7)
                                      & memberP(X5,X7)
                                      & lt(X4,X7) )
                                  | ? [X8] :
                                      ( ssItem(X8)
                                      & memberP(X6,X8)
                                      & lt(X8,X4) ) ) ) )
                      & ( nil != X3
                        | nil != X2 ) )
                    | ( segmentP(X1,X0)
                      & equalelemsP(X0) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f103,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(f175,plain,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f185,plain,
    ! [X0] :
      ( equalelemsP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f73]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ( ? [X4] :
                        ( ? [X5] :
                            ( ? [X6] :
                                ( ssList(X6)
                                & cons(X4,nil) = X2
                                & app(app(X5,X2),X6) = X3
                                & ! [X7] :
                                    ( ~ ssItem(X7)
                                    | ~ memberP(X5,X7)
                                    | ~ lt(X4,X7) )
                                & ! [X8] :
                                    ( ~ ssItem(X8)
                                    | ~ memberP(X6,X8)
                                    | ~ lt(X8,X4) ) )
                            & ssList(X5) )
                        & ssItem(X4) )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ( ~ segmentP(X1,X0)
                    | ~ equalelemsP(X0) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f240,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X3)
      | ~ ssList(X2)
      | segmentP(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f358,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(X0,nil) ),
    inference(cnf_transformation,[],[f175]) ).

fof(f381,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | equalelemsP(cons(X0,nil)) ),
    inference(cnf_transformation,[],[f185]) ).

fof(f382,plain,
    equalelemsP(nil),
    inference(cnf_transformation,[],[f74]) ).

fof(f417,plain,
    ( nil = sK49
    | sK50 = app(app(sK52,sK49),sK53) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f418,plain,
    ( nil = sK49
    | sK49 = cons(sK51,nil) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f419,plain,
    ( nil = sK49
    | ssList(sK53) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f420,plain,
    ( nil = sK49
    | ssList(sK52) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f423,plain,
    ( nil = sK49
    | ssItem(sK51) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f424,plain,
    ( ~ equalelemsP(sK47)
    | ~ segmentP(sK48,sK47) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f425,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f221]) ).

fof(f426,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f221]) ).

fof(f429,plain,
    ssList(sK48),
    inference(cnf_transformation,[],[f221]) ).

fof(f430,plain,
    ssList(sK47),
    inference(cnf_transformation,[],[f221]) ).

fof(f431,plain,
    ssList(sK49),
    inference(definition_unfolding,[],[f430,f425]) ).

fof(f432,plain,
    ssList(sK50),
    inference(definition_unfolding,[],[f429,f426]) ).

fof(f433,plain,
    ( ~ equalelemsP(sK49)
    | ~ segmentP(sK50,sK49) ),
    inference(definition_unfolding,[],[f424,f425,f426,f425]) ).

fof(f439,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(app(X2,X1),X3))
      | ~ ssList(X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | segmentP(app(app(X2,X1),X3),X1) ),
    inference(equality_resolution,[],[f240]) ).

fof(f479,plain,
    ! [X2,X3,X1] :
      ( ~ segmentP(app(app(X2,X1),X3),X1)
      | ssList(X1)
      | ssList(X3)
      | ssList(X2)
      | ssList(app(app(X2,X1),X3)) ),
    inference(consistent_polarity_flipping,[],[f439]) ).

fof(f593,plain,
    ! [X0] :
      ( ~ segmentP(X0,nil)
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f358]) ).

fof(f612,plain,
    ! [X0] :
      ( ~ equalelemsP(cons(X0,nil))
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f381]) ).

fof(f613,plain,
    ~ equalelemsP(nil),
    inference(consistent_polarity_flipping,[],[f382]) ).

fof(f641,plain,
    ~ ssList(sK49),
    inference(consistent_polarity_flipping,[],[f431]) ).

fof(f642,plain,
    ~ ssList(sK50),
    inference(consistent_polarity_flipping,[],[f432]) ).

fof(f645,plain,
    ( equalelemsP(sK49)
    | segmentP(sK50,sK49) ),
    inference(consistent_polarity_flipping,[],[f433]) ).

fof(f646,plain,
    ( nil = sK49
    | ~ ssItem(sK51) ),
    inference(consistent_polarity_flipping,[],[f423]) ).

fof(f649,plain,
    ( nil = sK49
    | ~ ssList(sK52) ),
    inference(consistent_polarity_flipping,[],[f420]) ).

fof(f650,plain,
    ( nil = sK49
    | ~ ssList(sK53) ),
    inference(consistent_polarity_flipping,[],[f419]) ).

fof(f667,definition,
    ( spl54_2
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).

fof(f669,plain,
    ( nil = sK49
    | ~ spl54_2 ),
    inference(avatar_component_clause,[],[f667]) ).

fof(f682,definition,
    ( spl54_5
  <=> sK50 = app(app(sK52,sK49),sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).

fof(f684,plain,
    ( sK50 = app(app(sK52,sK49),sK53)
    | ~ spl54_5 ),
    inference(avatar_component_clause,[],[f682]) ).

fof(f687,definition,
    ( spl54_6
  <=> sK49 = cons(sK51,nil) ),
    introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).

fof(f689,plain,
    ( sK49 = cons(sK51,nil)
    | ~ spl54_6 ),
    inference(avatar_component_clause,[],[f687]) ).

fof(f692,definition,
    ( spl54_7
  <=> ssList(sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).

fof(f694,plain,
    ( ~ ssList(sK53)
    | spl54_7 ),
    inference(avatar_component_clause,[],[f692]) ).

fof(f696,plain,
    ( spl54_5
    | spl54_2 ),
    inference(avatar_split_clause,[],[f417,f667,f682]) ).

fof(f697,plain,
    ( spl54_6
    | spl54_2 ),
    inference(avatar_split_clause,[],[f418,f667,f687]) ).

fof(f698,plain,
    ( ~ spl54_7
    | spl54_2 ),
    inference(avatar_split_clause,[],[f650,f667,f692]) ).

fof(f700,definition,
    ( spl54_8
  <=> ssList(sK52) ),
    introduced(definition,[new_symbols(definition,[spl54_8])],[avatar_definition]) ).

fof(f702,plain,
    ( ~ ssList(sK52)
    | spl54_8 ),
    inference(avatar_component_clause,[],[f700]) ).

fof(f703,plain,
    ( ~ spl54_8
    | spl54_2 ),
    inference(avatar_split_clause,[],[f649,f667,f700]) ).

fof(f706,definition,
    ( spl54_9
  <=> ssItem(sK51) ),
    introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).

fof(f708,plain,
    ( ~ ssItem(sK51)
    | spl54_9 ),
    inference(avatar_component_clause,[],[f706]) ).

fof(f710,plain,
    ( ~ spl54_9
    | spl54_2 ),
    inference(avatar_split_clause,[],[f646,f667,f706]) ).

fof(f712,definition,
    ( spl54_10
  <=> segmentP(sK50,sK49) ),
    introduced(definition,[new_symbols(definition,[spl54_10])],[avatar_definition]) ).

fof(f714,plain,
    ( segmentP(sK50,sK49)
    | ~ spl54_10 ),
    inference(avatar_component_clause,[],[f712]) ).

fof(f716,definition,
    ( spl54_11
  <=> equalelemsP(sK49) ),
    introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).

fof(f718,plain,
    ( equalelemsP(sK49)
    | ~ spl54_11 ),
    inference(avatar_component_clause,[],[f716]) ).

fof(f719,plain,
    ( spl54_10
    | spl54_11 ),
    inference(avatar_split_clause,[],[f645,f716,f712]) ).

fof(f759,plain,
    ( segmentP(sK50,nil)
    | ~ spl54_2
    | ~ spl54_10 ),
    inference(forward_demodulation,[],[f714,f669]) ).

fof(f763,plain,
    ( equalelemsP(nil)
    | ~ spl54_2
    | ~ spl54_11 ),
    inference(forward_demodulation,[],[f718,f669]) ).

fof(f766,plain,
    ( $false
    | ~ spl54_2
    | ~ spl54_11 ),
    inference(forward_subsumption_resolution,[],[f613,f763]) ).

fof(f767,plain,
    ( ~ spl54_2
    | ~ spl54_11 ),
    inference(avatar_contradiction_clause,[],[f766]) ).

fof(f772,plain,
    ( ssList(sK50)
    | ~ spl54_2
    | ~ spl54_10 ),
    inference(resolution,[],[f593,f759]) ).

fof(f773,plain,
    ( $false
    | ~ spl54_2
    | ~ spl54_10 ),
    inference(forward_subsumption_resolution,[],[f772,f642]) ).

fof(f774,plain,
    ( ~ spl54_2
    | ~ spl54_10 ),
    inference(avatar_contradiction_clause,[],[f773]) ).

fof(f783,plain,
    ( ~ equalelemsP(sK49)
    | ssItem(sK51)
    | ~ spl54_6 ),
    inference(superposition,[],[f612,f689]) ).

fof(f3033,plain,
    ( ~ segmentP(sK50,sK49)
    | ssList(sK49)
    | ssList(sK53)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5 ),
    inference(superposition,[],[f479,f684]) ).

fof(f3057,plain,
    ( ~ equalelemsP(sK49)
    | ~ spl54_6
    | spl54_9 ),
    inference(forward_subsumption_resolution,[],[f783,f708]) ).

fof(f3059,plain,
    ( ~ segmentP(sK50,sK49)
    | ssList(sK53)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5 ),
    inference(forward_subsumption_resolution,[],[f3033,f641]) ).

fof(f3060,plain,
    ( ~ spl54_11
    | ~ spl54_6
    | spl54_9 ),
    inference(avatar_split_clause,[],[f3057,f706,f687,f716]) ).

fof(f3062,plain,
    ( ~ segmentP(sK50,sK49)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5
    | spl54_7 ),
    inference(forward_subsumption_resolution,[],[f3059,f694]) ).

fof(f3063,plain,
    ( ~ segmentP(sK50,sK49)
    | ssList(sK50)
    | ~ spl54_5
    | spl54_7
    | spl54_8 ),
    inference(forward_subsumption_resolution,[],[f3062,f702]) ).

fof(f3064,plain,
    ( ~ segmentP(sK50,sK49)
    | ~ spl54_5
    | spl54_7
    | spl54_8 ),
    inference(forward_subsumption_resolution,[],[f3063,f642]) ).

fof(f3065,plain,
    ( ~ spl54_10
    | ~ spl54_5
    | spl54_7
    | spl54_8 ),
    inference(avatar_split_clause,[],[f3064,f700,f692,f682,f712]) ).

cnf(s8,plain,
    ( spl54_2
    | spl54_5 ),
    inference(sat_conversion,[],[f696]) ).

cnf(s9,plain,
    ( spl54_2
    | spl54_6 ),
    inference(sat_conversion,[],[f697]) ).

cnf(s10,plain,
    ( spl54_2
    | ~ spl54_7 ),
    inference(sat_conversion,[],[f698]) ).

cnf(s11,plain,
    ( spl54_2
    | ~ spl54_8 ),
    inference(sat_conversion,[],[f703]) ).

cnf(s14,plain,
    ( spl54_2
    | ~ spl54_9 ),
    inference(sat_conversion,[],[f710]) ).

cnf(s15,plain,
    ( spl54_10
    | spl54_11 ),
    inference(sat_conversion,[],[f719]) ).

cnf(s29,plain,
    ( ~ spl54_2
    | ~ spl54_11 ),
    inference(sat_conversion,[],[f767]) ).

cnf(s30,plain,
    ( ~ spl54_2
    | ~ spl54_10 ),
    inference(sat_conversion,[],[f774]) ).

cnf(s114,plain,
    ( ~ spl54_6
    | spl54_9
    | ~ spl54_11 ),
    inference(sat_conversion,[],[f3060]) ).

cnf(s116,plain,
    ( ~ spl54_5
    | spl54_7
    | spl54_8
    | ~ spl54_10 ),
    inference(sat_conversion,[],[f3065]) ).

cnf(s121,plain,
    ~ spl54_2,
    inference(rat,[],[s15,s29,s30]) ).

cnf(s122,plain,
    ~ spl54_9,
    inference(rat,[],[s14,s121]) ).

cnf(s123,plain,
    ~ spl54_8,
    inference(rat,[],[s11,s121]) ).

cnf(s124,plain,
    ~ spl54_7,
    inference(rat,[],[s10,s121]) ).

cnf(s125,plain,
    spl54_6,
    inference(rat,[],[s9,s121]) ).

cnf(s126,plain,
    spl54_5,
    inference(rat,[],[s8,s121]) ).

cnf(s131,plain,
    ~ spl54_11,
    inference(rat,[],[s114,s122,s125]) ).

cnf(s133,plain,
    ~ spl54_10,
    inference(rat,[],[s116,s124,s123,s126]) ).

cnf(s146,plain,
    $false,
    inference(rat,[],[s15,s131,s133]) ).

fof(f3066,plain,
    $false,
    inference(avatar_sat_refutation,[],[s146]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC330+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n015.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 09:09:46 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.32  % (2487585)Will run a generic schedule for satisfiability detection.
% 0.18/0.32  % (2487595)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3221139793:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.32  % (2487591)% WARNING: option uhcvi not known.
% 0.18/0.32  % (2487591)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3251569710:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.32  % (2487590)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3764170604_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.32  % (2487592)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1595370222:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.32  % (2487593)dis+10_1_sil=32000:sp=arity:random_seed=1118879137:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.32  % (2487594)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1638253171:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.32  % (2487596)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1084644899:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.32  % TRYING [1]
% 0.18/0.32  % TRYING [2]
% 0.18/0.32  % TRYING [3]
% 0.18/0.32  % (2487595)Instruction limit reached! 
% 0.18/0.32  % (2487595)------------------------------
% 0.18/0.32  % (2487595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.32  % (2487595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.32  % (2487595)CaDiCaL version: 2.1.3
% 0.18/0.32  % (2487595)Termination reason: Instruction limit
% 0.18/0.32  % (2487595)Termination phase: Saturation
% 0.18/0.32  % (2487595)Time elapsed: 0.041 s
% 0.18/0.32  % (2487595)Peak memory usage: 14 MB
% 0.18/0.32  % (2487595)Instructions burned: 132 (million)
% 0.18/0.32  % TRYING [4]
% 0.18/0.32  % (2487604)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2205625197:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.32  % TRYING [1]
% 0.18/0.32  % TRYING [2]
% 0.18/0.32  % (2487591) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2487585-2487591"...
% 0.18/0.32  % TRYING [3]
% 0.18/0.32  % (2487591)...printing done.
% 0.18/0.32  % (2487591)Refutation found. Thanks to Tanya!
% 0.18/0.32  % SZS status Theorem for theBenchmark
% 0.18/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.32  % (2487591)------------------------------
% 0.18/0.32  % (2487591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.32  % (2487591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.32  % (2487591)CaDiCaL version: 2.1.3
% 0.18/0.32  % (2487591)Termination reason: Refutation
% 0.18/0.32  % (2487591)Time elapsed: 0.056 s
% 0.18/0.32  % (2487591)Peak memory usage: 14 MB
% 0.18/0.32  % (2487591)Instructions burned: 94 (million)
% 0.18/0.32  % (2487585)Success in time 0.091 s
% 0.18/0.32  % Vampire exiting
%------------------------------------------------------------------------------