↑ 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  : 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 SAT

% Computer : n007.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 0.44s 0.36s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   75 (  22 unt;   5 def)
%            Number of atoms       :  254 (  16 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  301 ( 122   ~; 119   |;  34   &)
%                                         (   9 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   6 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   64 (   0 sgn  48   !;  16   ?)

% 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(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/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/sandbox/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
                    | ~ 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(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(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
                  & 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(f222,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,[],[f221]) ).

fof(f242,plain,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ ssList(X1)
      | app(app(sK7(X0,X1),X1),sK8(X0,X1)) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f243,plain,
    ! [X0,X1] :
      ( ssList(sK8(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ segmentP(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f244,plain,
    ! [X0,X1] :
      ( ssList(sK7(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ segmentP(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

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

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

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

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

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

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

fof(f415,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    segmentP(sK50,sK49),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f420,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f222]) ).

fof(f425,plain,
    memberP(sK49,sK51),
    inference(definition_unfolding,[],[f414,f418]) ).

fof(f426,plain,
    ~ memberP(sK50,sK51),
    inference(definition_unfolding,[],[f413,f419]) ).

fof(f675,plain,
    ( ~ ssList(sK49)
    | sK50 = app(app(sK7(sK50,sK49),sK49),sK8(sK50,sK49))
    | ~ ssList(sK50) ),
    inference(resolution,[],[f242,f417]) ).

fof(f684,plain,
    ( sK50 = app(app(sK7(sK50,sK49),sK49),sK8(sK50,sK49))
    | ~ ssList(sK50) ),
    inference(forward_subsumption_resolution,[],[f675,f420]) ).

fof(f685,plain,
    sK50 = app(app(sK7(sK50,sK49),sK49),sK8(sK50,sK49)),
    inference(forward_subsumption_resolution,[],[f684,f415]) ).

fof(f687,plain,
    ! [X0] :
      ( memberP(sK50,X0)
      | ~ ssList(app(sK7(sK50,sK49),sK49))
      | ~ ssList(sK8(sK50,sK49))
      | ~ memberP(app(sK7(sK50,sK49),sK49),X0)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f332,f685]) ).

fof(f690,definition,
    ( spl52_25
  <=> ssList(sK8(sK50,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_25])],[avatar_definition]) ).

fof(f692,plain,
    ( ~ ssList(sK8(sK50,sK49))
    | spl52_25 ),
    inference(avatar_component_clause,[],[f690]) ).

fof(f694,definition,
    ( spl52_26
  <=> ssList(app(sK7(sK50,sK49),sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_26])],[avatar_definition]) ).

fof(f696,plain,
    ( ~ ssList(app(sK7(sK50,sK49),sK49))
    | spl52_26 ),
    inference(avatar_component_clause,[],[f694]) ).

fof(f702,definition,
    ( spl52_28
  <=> ! [X0] :
        ( memberP(sK50,X0)
        | ~ ssItem(X0)
        | ~ memberP(app(sK7(sK50,sK49),sK49),X0) ) ),
    introduced(definition,[new_symbols(definition,[spl52_28])],[avatar_definition]) ).

fof(f703,plain,
    ( ! [X0] :
        ( ~ memberP(app(sK7(sK50,sK49),sK49),X0)
        | ~ ssItem(X0)
        | memberP(sK50,X0) )
    | ~ spl52_28 ),
    inference(avatar_component_clause,[],[f702]) ).

fof(f704,plain,
    ( ~ spl52_25
    | ~ spl52_26
    | spl52_28 ),
    inference(avatar_split_clause,[],[f687,f702,f694,f690]) ).

fof(f709,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_25 ),
    inference(resolution,[],[f692,f243]) ).

fof(f710,plain,
    ( ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_25 ),
    inference(forward_subsumption_resolution,[],[f709,f420]) ).

fof(f711,plain,
    ( ~ segmentP(sK50,sK49)
    | spl52_25 ),
    inference(forward_subsumption_resolution,[],[f710,f415]) ).

fof(f712,plain,
    ( $false
    | spl52_25 ),
    inference(forward_subsumption_resolution,[],[f711,f417]) ).

fof(f713,plain,
    spl52_25,
    inference(avatar_contradiction_clause,[],[f712]) ).

fof(f1218,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK7(sK50,sK49))
    | spl52_26 ),
    inference(resolution,[],[f318,f696]) ).

fof(f1258,plain,
    ( ~ ssList(sK7(sK50,sK49))
    | spl52_26 ),
    inference(forward_subsumption_resolution,[],[f1218,f420]) ).

fof(f1272,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_26 ),
    inference(resolution,[],[f1258,f244]) ).

fof(f1273,plain,
    ( ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_26 ),
    inference(forward_subsumption_resolution,[],[f1272,f420]) ).

fof(f1274,plain,
    ( ~ segmentP(sK50,sK49)
    | spl52_26 ),
    inference(forward_subsumption_resolution,[],[f1273,f415]) ).

fof(f1275,plain,
    ( $false
    | spl52_26 ),
    inference(forward_subsumption_resolution,[],[f1274,f417]) ).

fof(f1276,plain,
    spl52_26,
    inference(avatar_contradiction_clause,[],[f1275]) ).

fof(f1328,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sK50,X0)
        | ~ ssList(sK7(sK50,sK49))
        | ~ ssList(sK49)
        | ~ memberP(sK49,X0)
        | ~ ssItem(X0) )
    | ~ spl52_28 ),
    inference(resolution,[],[f703,f331]) ).

fof(f1329,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sK50,X0)
        | ~ ssList(sK7(sK50,sK49))
        | ~ ssList(sK49)
        | ~ memberP(sK49,X0) )
    | ~ spl52_28 ),
    inference(duplicate_literal_removal,[],[f1328]) ).

fof(f1331,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sK50,X0)
        | ~ ssList(sK7(sK50,sK49))
        | ~ memberP(sK49,X0) )
    | ~ spl52_28 ),
    inference(forward_subsumption_resolution,[],[f1329,f420]) ).

fof(f1334,definition,
    ( spl52_76
  <=> ssList(sK7(sK50,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_76])],[avatar_definition]) ).

fof(f1336,plain,
    ( ~ ssList(sK7(sK50,sK49))
    | spl52_76 ),
    inference(avatar_component_clause,[],[f1334]) ).

fof(f1338,definition,
    ( spl52_77
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ memberP(sK49,X0)
        | memberP(sK50,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl52_77])],[avatar_definition]) ).

fof(f1339,plain,
    ( ! [X0] :
        ( ~ memberP(sK49,X0)
        | ~ ssItem(X0)
        | memberP(sK50,X0) )
    | ~ spl52_77 ),
    inference(avatar_component_clause,[],[f1338]) ).

fof(f1340,plain,
    ( ~ spl52_76
    | spl52_77
    | ~ spl52_28 ),
    inference(avatar_split_clause,[],[f1331,f702,f1338,f1334]) ).

fof(f1345,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_76 ),
    inference(resolution,[],[f1336,f244]) ).

fof(f1346,plain,
    ( ~ ssList(sK50)
    | ~ segmentP(sK50,sK49)
    | spl52_76 ),
    inference(forward_subsumption_resolution,[],[f1345,f420]) ).

fof(f1347,plain,
    ( ~ segmentP(sK50,sK49)
    | spl52_76 ),
    inference(forward_subsumption_resolution,[],[f1346,f415]) ).

fof(f1348,plain,
    ( $false
    | spl52_76 ),
    inference(forward_subsumption_resolution,[],[f1347,f417]) ).

fof(f1349,plain,
    spl52_76,
    inference(avatar_contradiction_clause,[],[f1348]) ).

fof(f1353,plain,
    ( ~ ssItem(sK51)
    | memberP(sK50,sK51)
    | ~ spl52_77 ),
    inference(resolution,[],[f1339,f425]) ).

fof(f1354,plain,
    ( memberP(sK50,sK51)
    | ~ spl52_77 ),
    inference(forward_subsumption_resolution,[],[f1353,f412]) ).

fof(f1355,plain,
    ( $false
    | ~ spl52_77 ),
    inference(forward_subsumption_resolution,[],[f1354,f426]) ).

fof(f1356,plain,
    ~ spl52_77,
    inference(avatar_contradiction_clause,[],[f1355]) ).

cnf(s20,plain,
    ( ~ spl52_25
    | ~ spl52_26
    | spl52_28 ),
    inference(sat_conversion,[],[f704]) ).

cnf(s22,plain,
    spl52_25,
    inference(sat_conversion,[],[f713]) ).

cnf(s62,plain,
    spl52_26,
    inference(sat_conversion,[],[f1276]) ).

cnf(s68,plain,
    ( ~ spl52_28
    | ~ spl52_76
    | spl52_77 ),
    inference(sat_conversion,[],[f1340]) ).

cnf(s70,plain,
    spl52_76,
    inference(sat_conversion,[],[f1349]) ).

cnf(s71,plain,
    ~ spl52_77,
    inference(sat_conversion,[],[f1356]) ).

cnf(s73,plain,
    ~ spl52_28,
    inference(rat,[],[s68,s71,s70]) ).

cnf(s100,plain,
    $false,
    inference(rat,[],[s20,s73,s62,s22]) ).

fof(f1357,plain,
    $false,
    inference(avatar_sat_refutation,[],[s100]) ).

%------------------------------------------------------------------------------
%----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 SAT
% 0.08/0.16  % Computer : n007.cluster.edu
% 0.08/0.16  % Model    : x86_64 x86_64
% 0.08/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16  % Memory   : 8046.5625MB
% 0.08/0.16  % OS       : Linux 6.8.0-71-generic
% 0.08/0.16  % CPULimit : 300
% 0.08/0.16  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 09:28:55 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  Running first-order model finding
% 0.08/0.20  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.44/0.36  % (2266583)Will run a generic schedule for satisfiability detection.
% 0.44/0.36  % (2266594)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1736361340:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.44/0.36  % (2266591)dis+10_1_sil=32000:sp=arity:random_seed=844075174:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.44/0.36  % (2266588)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3837715761_2999 on theBenchmark for (2999ds/0Mi)
% 0.44/0.36  % (2266590)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1415269076:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.44/0.36  % (2266592)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1158304477:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.44/0.36  % (2266589)% WARNING: option uhcvi not known.
% 0.44/0.36  % (2266593)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=113125430:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.44/0.36  % (2266589)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3881573882:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.44/0.36  % TRYING [1]
% 0.44/0.36  % TRYING [2]
% 0.44/0.36  % TRYING [3]
% 0.44/0.36  % TRYING [4]
% 0.44/0.36  % (2266591)Instruction limit reached! 
% 0.44/0.36  % (2266591)------------------------------
% 0.44/0.36  % (2266591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.36  % (2266591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.36  % (2266591)CaDiCaL version: 2.1.3
% 0.44/0.36  % (2266591)Termination reason: Instruction limit
% 0.44/0.36  % (2266591)Termination phase: Saturation
% 0.44/0.36  % (2266591)Time elapsed: 0.060 s
% 0.44/0.36  % (2266591)Peak memory usage: 13 MB
% 0.44/0.36  % (2266591)Instructions burned: 104 (million)
% 0.44/0.36  % (2266592)Instruction limit reached! 
% 0.44/0.36  % (2266592)------------------------------
% 0.44/0.36  % (2266592)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.36  % (2266592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.36  % (2266592)CaDiCaL version: 2.1.3
% 0.44/0.36  % (2266592)Termination reason: Instruction limit
% 0.44/0.36  % (2266592)Termination phase: Saturation
% 0.44/0.36  % (2266592)Time elapsed: 0.068 s
% 0.44/0.36  % (2266592)Peak memory usage: 13 MB
% 0.44/0.36  % (2266592)Instructions burned: 116 (million)
% 0.44/0.36  % (2266593)Instruction limit reached! 
% 0.44/0.36  % (2266593)------------------------------
% 0.44/0.36  % (2266593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.36  % (2266593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.36  % (2266593)CaDiCaL version: 2.1.3
% 0.44/0.36  % (2266593)Termination reason: Instruction limit
% 0.44/0.36  % (2266593)Termination phase: Saturation
% 0.44/0.36  % (2266593)Time elapsed: 0.074 s
% 0.44/0.36  % (2266593)Peak memory usage: 14 MB
% 0.44/0.36  % (2266593)Instructions burned: 132 (million)
% 0.44/0.36  % (2266602)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2943687999:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.44/0.36  % (2266603)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3239210751:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.44/0.36  % TRYING [5]
% 0.44/0.36  % (2266594)Instruction limit reached! 
% 0.44/0.36  % (2266594)------------------------------
% 0.44/0.36  % (2266594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.36  % (2266594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.36  % (2266594)CaDiCaL version: 2.1.3
% 0.44/0.36  % (2266594)Termination reason: Instruction limit
% 0.44/0.36  % (2266594)Termination phase: Saturation
% 0.44/0.36  % (2266594)Time elapsed: 0.094 s
% 0.44/0.36  % (2266594)Peak memory usage: 14 MB
% 0.44/0.36  % (2266594)Instructions burned: 160 (million)
% 0.44/0.36  % (2266604)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=3284125887:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.44/0.36  % TRYING [1]
% 0.44/0.36  % TRYING [2]
% 0.44/0.36  % TRYING [3]
% 0.44/0.36  % (2266608)ott-21_1_sil=16000:fs=off:random_seed=2582320843:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.44/0.36  % TRYING [4]
% 0.44/0.36  % (2266604) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2266583-2266604"...
% 0.44/0.36  % (2266604)...printing done.
% 0.44/0.36  % (2266604)Refutation found. Thanks to Tanya!
% 0.44/0.36  % SZS status Theorem for theBenchmark
% 0.44/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.44/0.37  % (2266604)------------------------------
% 0.44/0.37  % (2266604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37  % (2266604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37  % (2266604)CaDiCaL version: 2.1.3
% 0.44/0.37  % (2266604)Termination reason: Refutation
% 0.44/0.37  % (2266604)Time elapsed: 0.029 s
% 0.44/0.37  % (2266604)Peak memory usage: 13 MB
% 0.44/0.37  % (2266604)Instructions burned: 41 (million)
% 0.44/0.37  % (2266583)Success in time 0.162 s
% 0.44/0.37  % Vampire exiting
%------------------------------------------------------------------------------