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

% 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:05:54 PM UTC 2026

% Result   : Theorem 2.07s 0.61s
% Output   : Refutation 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   54 (  24 unt;   1 def)
%            Number of atoms       :  232 (  39 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  258 (  80   ~; 100   |;  56   &)
%                                         (   3 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn  59   !;  30   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X4,X2),X5) != X3
                              | ~ strictorderedP(X2)
                              | ? [X6] :
                                  ( ssItem(X6)
                                  & ? [X7] :
                                      ( ssList(X7)
                                      & app(X7,cons(X6,nil)) = X4
                                      & ? [X8] :
                                          ( ssItem(X8)
                                          & ? [X9] :
                                              ( ssList(X9)
                                              & app(cons(X8,nil),X9) = X2
                                              & lt(X6,X8) ) ) ) )
                              | ? [X10] :
                                  ( ssItem(X10)
                                  & ? [X11] :
                                      ( ssList(X11)
                                      & app(cons(X10,nil),X11) = X5
                                      & ? [X12] :
                                          ( ssItem(X12)
                                          & ? [X13] :
                                              ( ssList(X13)
                                              & app(X13,cons(X12,nil)) = X2
                                              & lt(X12,X10) ) ) ) ) ) ) )
                    | ! [X14] :
                        ( ssItem(X14)
                       => ( ~ memberP(X0,X14)
                          | memberP(X1,X14) ) )
                    | ( nil != X3
                      & nil = X2 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/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] :
                          ( ssList(X4)
                         => ! [X5] :
                              ( ssList(X5)
                             => ( app(app(X4,X2),X5) != X3
                                | ~ strictorderedP(X2)
                                | ? [X6] :
                                    ( ssItem(X6)
                                    & ? [X7] :
                                        ( ssList(X7)
                                        & app(X7,cons(X6,nil)) = X4
                                        & ? [X8] :
                                            ( ssItem(X8)
                                            & ? [X9] :
                                                ( ssList(X9)
                                                & app(cons(X8,nil),X9) = X2
                                                & lt(X6,X8) ) ) ) )
                                | ? [X10] :
                                    ( ssItem(X10)
                                    & ? [X11] :
                                        ( ssList(X11)
                                        & app(cons(X10,nil),X11) = X5
                                        & ? [X12] :
                                            ( ssItem(X12)
                                            & ? [X13] :
                                                ( ssList(X13)
                                                & app(X13,cons(X12,nil)) = X2
                                                & lt(X12,X10) ) ) ) ) ) ) )
                      | ! [X14] :
                          ( ssItem(X14)
                         => ( ~ memberP(X0,X14)
                            | memberP(X1,X14) ) )
                      | ( nil != X3
                        & nil = X2 ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f146,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(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ? [X5] :
                          ( app(app(X4,X2),X5) = X3
                          & strictorderedP(X2)
                          & ! [X6] :
                              ( ~ ssItem(X6)
                              | ! [X7] :
                                  ( ~ ssList(X7)
                                  | app(X7,cons(X6,nil)) != X4
                                  | ! [X8] :
                                      ( ~ ssItem(X8)
                                      | ! [X9] :
                                          ( ~ ssList(X9)
                                          | app(cons(X8,nil),X9) != X2
                                          | ~ lt(X6,X8) ) ) ) )
                          & ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(cons(X10,nil),X11) != X5
                                  | ! [X12] :
                                      ( ~ ssItem(X12)
                                      | ! [X13] :
                                          ( ~ ssList(X13)
                                          | app(X13,cons(X12,nil)) != X2
                                          | ~ lt(X12,X10) ) ) ) )
                          & ssList(X5) )
                      & ssList(X4) )
                  & ? [X14] :
                      ( memberP(X0,X14)
                      & ~ memberP(X1,X14)
                      & ssItem(X14) )
                  & ( nil = X3
                    | nil != X2 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ? [X5] :
                          ( app(app(X4,X2),X5) = X3
                          & strictorderedP(X2)
                          & ! [X6] :
                              ( ~ ssItem(X6)
                              | ! [X7] :
                                  ( ~ ssList(X7)
                                  | app(X7,cons(X6,nil)) != X4
                                  | ! [X8] :
                                      ( ~ ssItem(X8)
                                      | ! [X9] :
                                          ( ~ ssList(X9)
                                          | app(cons(X8,nil),X9) != X2
                                          | ~ lt(X6,X8) ) ) ) )
                          & ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(cons(X10,nil),X11) != X5
                                  | ! [X12] :
                                      ( ~ ssItem(X12)
                                      | ! [X13] :
                                          ( ~ ssList(X13)
                                          | app(X13,cons(X12,nil)) != X2
                                          | ~ lt(X12,X10) ) ) ) )
                          & ssList(X5) )
                      & ssList(X4) )
                  & ? [X14] :
                      ( memberP(X0,X14)
                      & ~ memberP(X1,X14)
                      & ssItem(X14) )
                  & ( nil = X3
                    | nil != X2 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

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

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

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

fof(f413,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    sK50 = app(app(sK52,sK49),sK53),
    inference(cnf_transformation,[],[f222]) ).

fof(f416,plain,
    ssList(sK52),
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    ssItem(sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f418,plain,
    ~ memberP(sK48,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f419,plain,
    memberP(sK47,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f422,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f423,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f426,plain,
    ssList(sK47),
    inference(cnf_transformation,[],[f222]) ).

fof(f427,plain,
    ssList(sK49),
    inference(definition_unfolding,[],[f426,f422]) ).

fof(f429,plain,
    memberP(sK49,sK51),
    inference(definition_unfolding,[],[f419,f422]) ).

fof(f430,plain,
    ~ memberP(sK50,sK51),
    inference(definition_unfolding,[],[f418,f423]) ).

fof(f550,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ssList(X1)
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f318]) ).

fof(f562,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(app(X1,X2),X0)
      | ssList(X1)
      | ssList(X2)
      | memberP(X1,X0)
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f332]) ).

fof(f563,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(app(X1,X2),X0)
      | ssList(X1)
      | ssList(X2)
      | memberP(X2,X0)
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f331]) ).

fof(f640,plain,
    ~ ssList(sK49),
    inference(consistent_polarity_flipping,[],[f427]) ).

fof(f644,plain,
    ~ memberP(sK49,sK51),
    inference(consistent_polarity_flipping,[],[f429]) ).

fof(f645,plain,
    memberP(sK50,sK51),
    inference(consistent_polarity_flipping,[],[f430]) ).

fof(f646,plain,
    ~ ssItem(sK51),
    inference(consistent_polarity_flipping,[],[f417]) ).

fof(f647,plain,
    ~ ssList(sK52),
    inference(consistent_polarity_flipping,[],[f416]) ).

fof(f648,plain,
    ~ ssList(sK53),
    inference(consistent_polarity_flipping,[],[f413]) ).

fof(f1288,definition,
    ( spl54_25
  <=> ssList(app(sK52,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl54_25])],[avatar_definition]) ).

fof(f1289,plain,
    ( ~ ssList(app(sK52,sK49))
    | spl54_25 ),
    inference(avatar_component_clause,[],[f1288]) ).

fof(f1290,plain,
    ( ssList(app(sK52,sK49))
    | ~ spl54_25 ),
    inference(avatar_component_clause,[],[f1288]) ).

fof(f1358,plain,
    ( ssList(sK49)
    | ssList(sK52)
    | ~ spl54_25 ),
    inference(resolution,[],[f1290,f550]) ).

fof(f1359,plain,
    ( ssList(sK52)
    | ~ spl54_25 ),
    inference(forward_subsumption_resolution,[],[f1358,f640]) ).

fof(f1360,plain,
    ( $false
    | ~ spl54_25 ),
    inference(forward_subsumption_resolution,[],[f1359,f647]) ).

fof(f1361,plain,
    ~ spl54_25,
    inference(avatar_contradiction_clause,[],[f1360]) ).

fof(f1570,plain,
    ! [X0] :
      ( ~ memberP(sK50,X0)
      | ssList(app(sK52,sK49))
      | ssList(sK53)
      | memberP(app(sK52,sK49),X0)
      | ssItem(X0) ),
    inference(superposition,[],[f562,f415]) ).

fof(f1581,plain,
    ( ! [X0] :
        ( ~ memberP(sK50,X0)
        | ssList(sK53)
        | memberP(app(sK52,sK49),X0)
        | ssItem(X0) )
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f1570,f1289]) ).

fof(f1582,plain,
    ( ! [X0] :
        ( ~ memberP(sK50,X0)
        | memberP(app(sK52,sK49),X0)
        | ssItem(X0) )
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f1581,f648]) ).

fof(f4626,plain,
    ( memberP(app(sK52,sK49),sK51)
    | ssItem(sK51)
    | spl54_25 ),
    inference(resolution,[],[f1582,f645]) ).

fof(f4630,plain,
    ( memberP(app(sK52,sK49),sK51)
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f4626,f646]) ).

fof(f8729,plain,
    ( ssList(sK52)
    | ssList(sK49)
    | memberP(sK49,sK51)
    | ssItem(sK51)
    | spl54_25 ),
    inference(resolution,[],[f4630,f563]) ).

fof(f8738,plain,
    ( ssList(sK49)
    | memberP(sK49,sK51)
    | ssItem(sK51)
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f8729,f647]) ).

fof(f8742,plain,
    ( memberP(sK49,sK51)
    | ssItem(sK51)
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f8738,f640]) ).

fof(f8744,plain,
    ( ssItem(sK51)
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f8742,f644]) ).

fof(f8745,plain,
    ( $false
    | spl54_25 ),
    inference(forward_subsumption_resolution,[],[f8744,f646]) ).

fof(f8746,plain,
    spl54_25,
    inference(avatar_contradiction_clause,[],[f8745]) ).

cnf(s35,plain,
    ~ spl54_25,
    inference(sat_conversion,[],[f1361]) ).

cnf(s588,plain,
    spl54_25,
    inference(sat_conversion,[],[f8746]) ).

cnf(s610,plain,
    $false,
    inference(rat,[],[s35,s588]) ).

fof(f8747,plain,
    $false,
    inference(avatar_sat_refutation,[],[s610]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC404+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  % Computer : n017.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Mon Sep 28 09:26:21 UTC 2026
% 0.09/0.23  % CPUTime  : 
% 0.09/0.23  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.28  Running first-order model finding
% 0.09/0.28  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.07/0.60  % (3423923)Will run a generic schedule for satisfiability detection.
% 2.07/0.60  % (3423930)% WARNING: option uhcvi not known.
% 2.07/0.60  % (3423932)dis+10_1_sil=32000:sp=arity:random_seed=80379534:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.07/0.60  % (3423930)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2334796256:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.07/0.60  % (3423931)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1827664815:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.07/0.60  % (3423929)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2204789211_2999 on theBenchmark for (2999ds/0Mi)
% 2.07/0.60  % (3423935)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2407077789:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.07/0.60  % (3423933)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2738162715:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.07/0.60  % (3423934)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1629126396:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.07/0.60  % TRYING [1]
% 2.07/0.60  % TRYING [2]
% 2.07/0.60  % TRYING [3]
% 2.07/0.60  % TRYING [4]
% 2.07/0.60  % (3423932)Instruction limit reached! 
% 2.07/0.60  % (3423932)------------------------------
% 2.07/0.60  % (3423932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.07/0.60  % (3423932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.60  % (3423932)CaDiCaL version: 2.1.3
% 2.07/0.60  % (3423932)Termination reason: Instruction limit
% 2.07/0.60  % (3423932)Termination phase: Saturation
% 2.07/0.60  % (3423932)Time elapsed: 0.086 s
% 2.07/0.60  % (3423932)Peak memory usage: 13 MB
% 2.07/0.60  % (3423932)Instructions burned: 104 (million)
% 2.07/0.60  % (3423944)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2321887410:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.07/0.60  % (3423935)Instruction limit reached! 
% 2.07/0.60  % (3423935)------------------------------
% 2.07/0.60  % (3423935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.07/0.60  % (3423935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.60  % (3423935)CaDiCaL version: 2.1.3
% 2.07/0.60  % (3423935)Termination reason: Instruction limit
% 2.07/0.60  % (3423935)Termination phase: Saturation
% 2.07/0.60  % (3423935)Time elapsed: 0.092 s
% 2.07/0.60  % (3423935)Peak memory usage: 14 MB
% 2.07/0.60  % (3423935)Instructions burned: 159 (million)
% 2.07/0.60  % (3423933)Instruction limit reached! 
% 2.07/0.60  % (3423933)------------------------------
% 2.07/0.60  % (3423933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.07/0.60  % (3423933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.60  % (3423933)CaDiCaL version: 2.1.3
% 2.07/0.60  % (3423933)Termination reason: Instruction limit
% 2.07/0.60  % (3423933)Termination phase: Saturation
% 2.07/0.60  % (3423933)Time elapsed: 0.106 s
% 2.07/0.60  % (3423933)Peak memory usage: 13 MB
% 2.07/0.60  % (3423933)Instructions burned: 116 (million)
% 2.07/0.60  % TRYING [1]
% 2.07/0.60  % TRYING [2]
% 2.07/0.60  % (3423946)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2612920111:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.07/0.60  % TRYING [3]
% 2.07/0.60  % (3423947)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=3070689121:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.07/0.60  % (3423934)Instruction limit reached! 
% 2.07/0.60  % (3423934)------------------------------
% 2.07/0.60  % (3423934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.07/0.60  % (3423934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.60  % TRYING [5]
% 2.07/0.60  % (3423934)CaDiCaL version: 2.1.3
% 2.07/0.60  % (3423934)Termination reason: Instruction limit
% 2.07/0.60  % (3423934)Termination phase: Saturation
% 2.07/0.60  % (3423934)Time elapsed: 0.135 s
% 2.07/0.60  % (3423934)Peak memory usage: 14 MB
% 2.07/0.60  % (3423934)Instructions burned: 131 (million)
% 2.07/0.60  % TRYING [4]
% 2.07/0.60  % (3423950)ott-21_1_sil=16000:fs=off:random_seed=4120365595:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.07/0.60  % (3423930) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3423923-3423930"...
% 2.07/0.60  % (3423930)...printing done.
% 2.07/0.60  % (3423930)Refutation found. Thanks to Tanya!
% 2.07/0.61  % SZS status Theorem for theBenchmark
% 2.07/0.61  % SZS output start Proof for theBenchmark
% See solution above
% 2.07/0.61  % (3423930)------------------------------
% 2.07/0.61  % (3423930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.07/0.61  % (3423930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.61  % (3423930)CaDiCaL version: 2.1.3
% 2.07/0.61  % (3423930)Termination reason: Refutation
% 2.07/0.61  % (3423930)Time elapsed: 0.266 s
% 2.07/0.61  % (3423930)Peak memory usage: 17 MB
% 2.07/0.61  % (3423930)Instructions burned: 309 (million)
% 2.07/0.61  % (3423923)Success in time 0.313 s
% 2.07/0.61  % Vampire exiting
%------------------------------------------------------------------------------