↑ 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  : SWC402+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 : n003.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:53 PM UTC 2026

% Result   : Theorem 3.00s 0.68s
% Output   : Refutation 3.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   45 (  22 unt;   2 def)
%            Number of atoms       :  220 (  45 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  279 ( 104   ~; 100   |;  60   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;  10 con; 0-2 aty)
%            Number of variables   :   83 (  60   !;  23   ?)

% 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
                          | ~ totalorderedP(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
                                          & leq(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
                                          & leq(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
                            | ~ totalorderedP(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
                                            & leq(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
                                            & leq(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] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ? [X5] :
                          ( ssList(X5)
                          & app(app(X4,X2),X5) = X3
                          & totalorderedP(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
                                          | ~ leq(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
                                          | ~ leq(X12,X10) ) ) ) ) )
                      & ssList(X4) )
                  & ? [X14] :
                      ( ssItem(X14)
                      & memberP(X0,X14)
                      & ~ memberP(X1,X14) )
                  & ( nil = X3
                    | nil != X2 ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f276,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,[],[f146]) ).

fof(f277,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,[],[f276]) ).

fof(f295,plain,
    ( ssList(sK56)
    & sK54 = sK56
    & sK53 = sK55
    & ssList(sK58)
    & sK56 = app(app(sK57,sK55),sK58)
    & totalorderedP(sK55)
    & ! [X6] :
        ( ~ ssItem(X6)
        | ! [X7] :
            ( ~ ssList(X7)
            | app(X7,cons(X6,nil)) != sK57
            | ! [X8] :
                ( ~ ssItem(X8)
                | ! [X9] :
                    ( ~ ssList(X9)
                    | app(cons(X8,nil),X9) != sK55
                    | ~ leq(X6,X8) ) ) ) )
    & ! [X10] :
        ( ~ ssItem(X10)
        | ! [X11] :
            ( ~ ssList(X11)
            | app(cons(X10,nil),X11) != sK58
            | ! [X12] :
                ( ~ ssItem(X12)
                | ! [X13] :
                    ( ~ ssList(X13)
                    | app(X13,cons(X12,nil)) != sK55
                    | ~ leq(X12,X10) ) ) ) )
    & ssList(sK57)
    & ssItem(sK59)
    & memberP(sK53,sK59)
    & ~ memberP(sK54,sK59)
    & ( nil = sK56
      | nil != sK55 )
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58),skolemize(X14,sK59)],[f221]) ).

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

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

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

fof(f495,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f295]) ).

fof(f499,plain,
    ~ memberP(sK54,sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f500,plain,
    memberP(sK53,sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f501,plain,
    ssItem(sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f502,plain,
    ssList(sK57),
    inference(cnf_transformation,[],[f295]) ).

fof(f506,plain,
    sK56 = app(app(sK57,sK55),sK58),
    inference(cnf_transformation,[],[f295]) ).

fof(f507,plain,
    ssList(sK58),
    inference(cnf_transformation,[],[f295]) ).

fof(f508,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f295]) ).

fof(f509,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f295]) ).

fof(f511,plain,
    memberP(sK55,sK59),
    inference(definition_unfolding,[],[f500,f508]) ).

fof(f512,plain,
    ~ memberP(sK56,sK59),
    inference(definition_unfolding,[],[f499,f509]) ).

fof(f514,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f495,f508]) ).

fof(f542,definition,
    sF60 = app(sK57,sK55),
    introduced(definition,[new_symbols(definition,[sF60])],[function_definition]) ).

fof(f543,plain,
    app(sK57,sK55) = sF60,
    inference(reorient_equations,[],[f542]) ).

fof(f544,definition,
    sF61 = app(sF60,sK58),
    introduced(definition,[new_symbols(definition,[sF61])],[function_definition]) ).

fof(f545,plain,
    app(sF60,sK58) = sF61,
    inference(reorient_equations,[],[f544]) ).

fof(f546,plain,
    sK56 = sF61,
    inference(definition_folding,[],[f506,f545,f543]) ).

fof(f603,plain,
    sK56 = app(sF60,sK58),
    inference(forward_demodulation,[],[f545,f546]) ).

fof(f1709,plain,
    ( ssList(sF60)
    | ~ ssList(sK55)
    | ~ ssList(sK57) ),
    inference(superposition,[],[f400,f543]) ).

fof(f1710,plain,
    ( ssList(sF60)
    | ~ ssList(sK57) ),
    inference(forward_subsumption_resolution,[],[f1709,f514]) ).

fof(f1711,plain,
    ssList(sF60),
    inference(forward_subsumption_resolution,[],[f1710,f502]) ).

fof(f3239,plain,
    ! [X0] :
      ( memberP(sF60,X0)
      | ~ memberP(sK55,X0)
      | ~ ssList(sK55)
      | ~ ssList(sK57)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f413,f543]) ).

fof(f3242,plain,
    ! [X0] :
      ( memberP(sF60,X0)
      | ~ memberP(sK55,X0)
      | ~ ssList(sK57)
      | ~ ssItem(X0) ),
    inference(forward_subsumption_resolution,[],[f3239,f514]) ).

fof(f3246,plain,
    ! [X0] :
      ( ~ memberP(sK55,X0)
      | memberP(sF60,X0)
      | ~ ssItem(X0) ),
    inference(forward_subsumption_resolution,[],[f3242,f502]) ).

fof(f3250,plain,
    ! [X0] :
      ( memberP(sK56,X0)
      | ~ memberP(sF60,X0)
      | ~ ssList(sK58)
      | ~ ssList(sF60)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f414,f603]) ).

fof(f3255,plain,
    ! [X0] :
      ( memberP(sK56,X0)
      | ~ memberP(sF60,X0)
      | ~ ssList(sF60)
      | ~ ssItem(X0) ),
    inference(forward_subsumption_resolution,[],[f3250,f507]) ).

fof(f3259,plain,
    ! [X0] :
      ( ~ memberP(sF60,X0)
      | memberP(sK56,X0)
      | ~ ssItem(X0) ),
    inference(forward_subsumption_resolution,[],[f3255,f1711]) ).

fof(f6300,plain,
    ( memberP(sF60,sK59)
    | ~ ssItem(sK59) ),
    inference(resolution,[],[f3246,f511]) ).

fof(f6426,plain,
    memberP(sF60,sK59),
    inference(forward_subsumption_resolution,[],[f6300,f501]) ).

fof(f11029,plain,
    ( memberP(sK56,sK59)
    | ~ ssItem(sK59) ),
    inference(resolution,[],[f6426,f3259]) ).

fof(f11036,plain,
    ~ ssItem(sK59),
    inference(forward_subsumption_resolution,[],[f11029,f512]) ).

fof(f11040,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f11036,f501]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC402+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.07/0.17  % Computer : n003.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Mon Sep 28 09:32:27 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20  Running first-order model finding
% 0.07/0.20  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
% 3.00/0.68  % (1460332)Will run a generic schedule for satisfiability detection.
% 3.00/0.68  % (1460340)dis+10_1_sil=32000:sp=arity:random_seed=2720850486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.00/0.68  % (1460338)% WARNING: option uhcvi not known.
% 3.00/0.68  % (1460337)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=666607677_2999 on theBenchmark for (2999ds/0Mi)
% 3.00/0.68  % (1460339)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2744707000:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.00/0.68  % (1460341)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1249599672:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.00/0.68  % (1460342)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2883030751:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.00/0.68  % (1460338)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2796667299:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.00/0.68  % (1460343)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3657634081:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.00/0.68  % TRYING [1]
% 3.00/0.68  % TRYING [2]
% 3.00/0.68  % TRYING [3]
% 3.00/0.68  % (1460340)Instruction limit reached! 
% 3.00/0.68  % (1460340)------------------------------
% 3.00/0.68  % (1460340)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460340)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460340)Termination reason: Instruction limit
% 3.00/0.68  % (1460340)Termination phase: Saturation
% 3.00/0.68  % (1460340)Time elapsed: 0.032 s
% 3.00/0.68  % (1460340)Peak memory usage: 13 MB
% 3.00/0.68  % (1460340)Instructions burned: 105 (million)
% 3.00/0.68  % (1460351)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3027863695:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.00/0.68  % TRYING [4]
% 3.00/0.68  % TRYING [1]
% 3.00/0.68  % TRYING [2]
% 3.00/0.68  % TRYING [3]
% 3.00/0.68  % TRYING [4]
% 3.00/0.68  % (1460341)Instruction limit reached! 
% 3.00/0.68  % (1460341)------------------------------
% 3.00/0.68  % (1460341)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460341)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460341)Termination reason: Instruction limit
% 3.00/0.68  % (1460341)Termination phase: Saturation
% 3.00/0.68  % (1460341)Time elapsed: 0.069 s
% 3.00/0.68  % (1460341)Peak memory usage: 13 MB
% 3.00/0.68  % (1460341)Instructions burned: 117 (million)
% 3.00/0.68  % (1460342)Instruction limit reached! 
% 3.00/0.68  % (1460342)------------------------------
% 3.00/0.68  % (1460342)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460342)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460342)Termination reason: Instruction limit
% 3.00/0.68  % (1460342)Termination phase: Saturation
% 3.00/0.68  % (1460342)Time elapsed: 0.077 s
% 3.00/0.68  % (1460342)Peak memory usage: 14 MB
% 3.00/0.68  % (1460342)Instructions burned: 132 (million)
% 3.00/0.68  % TRYING [5]
% 3.00/0.68  % TRYING [5]
% 3.00/0.68  % (1460353)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3076018083:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.00/0.68  % (1460354)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=2229053374:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.00/0.68  % (1460343)Instruction limit reached! 
% 3.00/0.68  % (1460343)------------------------------
% 3.00/0.68  % (1460343)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460343)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460343)Termination reason: Instruction limit
% 3.00/0.68  % (1460343)Termination phase: Saturation
% 3.00/0.68  % (1460343)Time elapsed: 0.098 s
% 3.00/0.68  % (1460343)Peak memory usage: 14 MB
% 3.00/0.68  % (1460343)Instructions burned: 159 (million)
% 3.00/0.68  % (1460357)ott-21_1_sil=16000:fs=off:random_seed=2555839247:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.00/0.68  % (1460353)Instruction limit reached! 
% 3.00/0.68  % (1460353)------------------------------
% 3.00/0.68  % (1460353)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460353)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460353)Termination reason: Instruction limit
% 3.00/0.68  % (1460353)Termination phase: Saturation
% 3.00/0.68  % (1460353)Time elapsed: 0.071 s
% 3.00/0.68  % (1460353)Peak memory usage: 13 MB
% 3.00/0.68  % (1460353)Instructions burned: 132 (million)
% 3.00/0.68  % TRYING [6]
% 3.00/0.68  % (1460359)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=198830635:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.00/0.68  % (1460351)Instruction limit reached! 
% 3.00/0.68  % (1460351)------------------------------
% 3.00/0.68  % (1460351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460351)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460351)Termination reason: Instruction limit
% 3.00/0.68  % (1460351)Termination phase: Finite model building constraint generation
% 3.00/0.68  % (1460351)Time elapsed: 0.156 s
% 3.00/0.68  % (1460351)Peak memory usage: 28 MB
% 3.00/0.68  % (1460351)Instructions burned: 714 (million)
% 3.00/0.68  % (1460361)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3193135480:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 3.00/0.68  % (1460357)Instruction limit reached! 
% 3.00/0.68  % (1460357)------------------------------
% 3.00/0.68  % (1460357)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460357)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460357)Termination reason: Instruction limit
% 3.00/0.68  % (1460357)Termination phase: Saturation
% 3.00/0.68  % (1460357)Time elapsed: 0.090 s
% 3.00/0.68  % (1460357)Peak memory usage: 13 MB
% 3.00/0.68  % (1460357)Instructions burned: 180 (million)
% 3.00/0.68  % TRYING [1]
% 3.00/0.68  % TRYING [2]
% 3.00/0.68  % TRYING [6]
% 3.00/0.68  % TRYING [3]
% 3.00/0.68  % (1460363)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3102552128:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 3.00/0.68  % TRYING [4]
% 3.00/0.68  % TRYING [5]
% 3.00/0.68  % (1460361)Instruction limit reached! 
% 3.00/0.68  % (1460361)------------------------------
% 3.00/0.68  % (1460361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460361)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460361)Termination reason: Instruction limit
% 3.00/0.68  % (1460361)Termination phase: Finite model building SAT solving
% 3.00/0.68  % (1460361)Time elapsed: 0.183 s
% 3.00/0.68  % (1460361)Peak memory usage: 23 MB
% 3.00/0.68  % (1460361)Instructions burned: 870 (million)
% 3.00/0.68  % (1460365)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2176500844:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 3.00/0.68  % (1460363) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1460332-1460363"...
% 3.00/0.68  % (1460363)...printing done.
% 3.00/0.68  % (1460363)Refutation found. Thanks to Tanya!
% 3.00/0.68  % SZS status Theorem for theBenchmark
% 3.00/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 3.00/0.68  % (1460363)------------------------------
% 3.00/0.68  % (1460363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.00/0.68  % (1460363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/0.68  % (1460363)CaDiCaL version: 2.1.3
% 3.00/0.68  % (1460363)Termination reason: Refutation
% 3.00/0.68  % (1460363)Time elapsed: 0.197 s
% 3.00/0.68  % (1460363)Peak memory usage: 17 MB
% 3.00/0.68  % (1460363)Instructions burned: 362 (million)
% 3.00/0.68  % (1460332)Success in time 0.47 s
% 3.00/0.68  % Vampire exiting
%------------------------------------------------------------------------------