↑ 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  : SWC025+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 : n004.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:04:20 PM UTC 2026

% Result   : Theorem 0.36s 0.47s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   97 (  11 unt;   8 def)
%            Number of atoms       :  328 (  79 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  367 ( 136   ~; 155   |;  53   &)
%                                         (  10 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   62 (   0 sgn  46   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil = X0
        | ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssItem(X2)
                & cons(X2,X1) = X0 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).

fof(f37,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ duplicatefreeP(X2)
                    | ? [X4] :
                        ( ssItem(X4)
                        & ( ( ~ memberP(X3,X4)
                            & memberP(X2,X4) )
                          | ( ~ memberP(X2,X4)
                            & memberP(X3,X4) ) ) )
                    | ( ( nil != X1
                        | nil = X0 )
                      & ( nil != X0
                        | nil = X1 ) ) ) ) ) ) ),
    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
                      | ~ duplicatefreeP(X2)
                      | ? [X4] :
                          ( ssItem(X4)
                          & ( ( ~ memberP(X3,X4)
                              & memberP(X2,X4) )
                            | ( ~ memberP(X2,X4)
                              & memberP(X3,X4) ) ) )
                      | ( ( nil != X1
                          | nil = X0 )
                        & ( nil != X0
                          | nil = X1 ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f123,plain,
    ! [X0] :
      ( nil = X0
      | ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssItem(X2)
              & cons(X2,X1) = X0 ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f124,plain,
    ! [X0] :
      ( nil = X0
      | ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssItem(X2)
              & cons(X2,X1) = X0 ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f123]) ).

fof(f147,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f148,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & duplicatefreeP(X2)
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ( ( memberP(X3,X4)
                          | ~ memberP(X2,X4) )
                        & ( memberP(X2,X4)
                          | ~ memberP(X3,X4) ) ) )
                  & ( ( nil = X1
                      & nil != X0 )
                    | ( nil = X0
                      & nil != X1 ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & duplicatefreeP(X2)
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ( ( memberP(X3,X4)
                          | ~ memberP(X2,X4) )
                        & ( memberP(X2,X4)
                          | ~ memberP(X3,X4) ) ) )
                  & ( ( nil = X1
                      & nil != X0 )
                    | ( nil = X0
                      & nil != X1 ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f274,plain,
    ! [X0] :
      ( nil = X0
      | ( ssList(sK49(X0))
        & ssItem(sK50(X0))
        & cons(sK50(X0),sK49(X0)) = X0 )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK49,sK50]),skolemize(X1,sK49(X0)),skolemize(X2,sK50(X0))],[f124]) ).

fof(f279,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( X0 != X1
                    & ~ memberP(X2,X0) ) )
                & ( X0 = X1
                  | memberP(X2,X0)
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f147]) ).

fof(f280,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( X0 != X1
                    & ~ memberP(X2,X0) ) )
                & ( X0 = X1
                  | memberP(X2,X0)
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f279]) ).

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & duplicatefreeP(sK55)
    & ! [X4] :
        ( ~ ssItem(X4)
        | ( ( memberP(sK56,X4)
            | ~ memberP(sK55,X4) )
          & ( memberP(sK55,X4)
            | ~ memberP(sK56,X4) ) ) )
    & ( ( nil = sK54
        & nil != sK53 )
      | ( nil = sK53
        & nil != sK54 ) )
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).

fof(f393,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sK50(X0),sK49(X0)) = X0
      | nil = X0 ),
    inference(cnf_transformation,[],[f274]) ).

fof(f394,plain,
    ! [X0] :
      ( ssItem(sK50(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f274]) ).

fof(f395,plain,
    ! [X0] :
      ( ssList(sK49(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f274]) ).

fof(f418,plain,
    ! [X2,X0,X1] :
      ( memberP(cons(X1,X2),X0)
      | X0 != X1
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f280]) ).

fof(f419,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f148]) ).

fof(f498,plain,
    ssList(sK55),
    inference(cnf_transformation,[],[f296]) ).

fof(f499,plain,
    ssList(sK56),
    inference(cnf_transformation,[],[f296]) ).

fof(f500,plain,
    ( nil != sK53
    | nil != sK54 ),
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    ( nil = sK54
    | nil = sK53 ),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    ! [X4] :
      ( ~ ssItem(X4)
      | memberP(sK55,X4)
      | ~ memberP(sK56,X4) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    ! [X4] :
      ( ~ ssItem(X4)
      | memberP(sK56,X4)
      | ~ memberP(sK55,X4) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f507,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f508,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f509,plain,
    ( nil = sK56
    | nil = sK55 ),
    inference(definition_unfolding,[],[f503,f508,f507]) ).

fof(f512,plain,
    ( nil != sK55
    | nil != sK56 ),
    inference(definition_unfolding,[],[f500,f507,f508]) ).

fof(f530,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X1) ),
    inference(equality_resolution,[],[f418]) ).

fof(f545,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssItem(X1) ),
    inference(duplicate_literal_removal,[],[f530]) ).

fof(f550,definition,
    ( spl57_1
  <=> nil = sK56 ),
    introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).

fof(f551,plain,
    ( nil = sK56
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f550]) ).

fof(f552,plain,
    ( nil != sK56
    | spl57_1 ),
    inference(avatar_component_clause,[],[f550]) ).

fof(f554,definition,
    ( spl57_2
  <=> nil = sK55 ),
    introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).

fof(f555,plain,
    ( nil = sK55
    | ~ spl57_2 ),
    inference(avatar_component_clause,[],[f554]) ).

fof(f556,plain,
    ( nil != sK55
    | spl57_2 ),
    inference(avatar_component_clause,[],[f554]) ).

fof(f557,plain,
    ( ~ spl57_1
    | ~ spl57_2 ),
    inference(avatar_split_clause,[],[f512,f554,f550]) ).

fof(f558,plain,
    ( spl57_2
    | spl57_1 ),
    inference(avatar_split_clause,[],[f509,f550,f554]) ).

fof(f1264,plain,
    ( sK55 = cons(sK50(sK55),sK49(sK55))
    | nil = sK55 ),
    inference(resolution,[],[f393,f498]) ).

fof(f1265,plain,
    ( sK56 = cons(sK50(sK56),sK49(sK56))
    | nil = sK56 ),
    inference(resolution,[],[f393,f499]) ).

fof(f1273,definition,
    ( spl57_18
  <=> ssList(sK49(sK56)) ),
    introduced(definition,[new_symbols(definition,[spl57_18])],[avatar_definition]) ).

fof(f1275,plain,
    ( ~ ssList(sK49(sK56))
    | spl57_18 ),
    inference(avatar_component_clause,[],[f1273]) ).

fof(f1277,definition,
    ( spl57_19
  <=> ssItem(sK50(sK56)) ),
    introduced(definition,[new_symbols(definition,[spl57_19])],[avatar_definition]) ).

fof(f1279,plain,
    ( ~ ssItem(sK50(sK56))
    | spl57_19 ),
    inference(avatar_component_clause,[],[f1277]) ).

fof(f1326,plain,
    ( nil = sK56
    | ~ ssList(sK56)
    | spl57_18 ),
    inference(resolution,[],[f1275,f395]) ).

fof(f1350,definition,
    ( spl57_26
  <=> sK55 = cons(sK50(sK55),sK49(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl57_26])],[avatar_definition]) ).

fof(f1352,plain,
    ( sK55 = cons(sK50(sK55),sK49(sK55))
    | ~ spl57_26 ),
    inference(avatar_component_clause,[],[f1350]) ).

fof(f1353,plain,
    ( spl57_2
    | spl57_26 ),
    inference(avatar_split_clause,[],[f1264,f1350,f554]) ).

fof(f1370,definition,
    ( spl57_30
  <=> sK56 = cons(sK50(sK56),sK49(sK56)) ),
    introduced(definition,[new_symbols(definition,[spl57_30])],[avatar_definition]) ).

fof(f1372,plain,
    ( sK56 = cons(sK50(sK56),sK49(sK56))
    | ~ spl57_30 ),
    inference(avatar_component_clause,[],[f1370]) ).

fof(f1373,plain,
    ( spl57_1
    | spl57_30 ),
    inference(avatar_split_clause,[],[f1265,f1370,f550]) ).

fof(f1379,plain,
    ( nil = sK56
    | spl57_18 ),
    inference(forward_subsumption_resolution,[],[f1326,f499]) ).

fof(f1380,plain,
    ( spl57_1
    | spl57_18 ),
    inference(avatar_split_clause,[],[f1379,f1273,f550]) ).

fof(f1451,plain,
    ( ! [X4] :
        ( memberP(nil,X4)
        | ~ ssItem(X4)
        | ~ memberP(sK55,X4) )
    | ~ spl57_1 ),
    inference(forward_demodulation,[],[f505,f551]) ).

fof(f1452,plain,
    ( ! [X4] :
        ( ~ memberP(sK55,X4)
        | ~ ssItem(X4) )
    | ~ spl57_1 ),
    inference(forward_subsumption_resolution,[],[f1451,f419]) ).

fof(f1634,plain,
    ( memberP(sK55,sK50(sK55))
    | ~ ssList(sK49(sK55))
    | ~ ssItem(sK50(sK55))
    | ~ spl57_26 ),
    inference(superposition,[],[f545,f1352]) ).

fof(f1635,plain,
    ( ~ ssList(sK49(sK55))
    | ~ ssItem(sK50(sK55))
    | ~ spl57_1
    | ~ spl57_26 ),
    inference(forward_subsumption_resolution,[],[f1634,f1452]) ).

fof(f1637,definition,
    ( spl57_38
  <=> ssItem(sK50(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl57_38])],[avatar_definition]) ).

fof(f1639,plain,
    ( ~ ssItem(sK50(sK55))
    | spl57_38 ),
    inference(avatar_component_clause,[],[f1637]) ).

fof(f1641,definition,
    ( spl57_39
  <=> ssList(sK49(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl57_39])],[avatar_definition]) ).

fof(f1643,plain,
    ( ~ ssList(sK49(sK55))
    | spl57_39 ),
    inference(avatar_component_clause,[],[f1641]) ).

fof(f1694,plain,
    ( nil = sK55
    | ~ ssList(sK55)
    | spl57_38 ),
    inference(resolution,[],[f1639,f394]) ).

fof(f1699,plain,
    ( nil = sK55
    | spl57_38 ),
    inference(forward_subsumption_resolution,[],[f1694,f498]) ).

fof(f1700,plain,
    ( spl57_2
    | spl57_38 ),
    inference(avatar_split_clause,[],[f1699,f1637,f554]) ).

fof(f2081,plain,
    ( ~ spl57_38
    | ~ spl57_39
    | ~ spl57_1
    | ~ spl57_26 ),
    inference(avatar_split_clause,[],[f1635,f1350,f550,f1641,f1637]) ).

fof(f2594,plain,
    ( nil = sK55
    | ~ ssList(sK55)
    | spl57_39 ),
    inference(resolution,[],[f1643,f395]) ).

fof(f2595,plain,
    ( ~ ssList(sK55)
    | spl57_2
    | spl57_39 ),
    inference(forward_subsumption_resolution,[],[f2594,f556]) ).

fof(f2596,plain,
    ( $false
    | spl57_2
    | spl57_39 ),
    inference(forward_subsumption_resolution,[],[f2595,f498]) ).

fof(f2597,plain,
    ( spl57_2
    | spl57_39 ),
    inference(avatar_contradiction_clause,[],[f2596]) ).

fof(f2702,plain,
    ( ! [X4] :
        ( memberP(nil,X4)
        | ~ ssItem(X4)
        | ~ memberP(sK56,X4) )
    | ~ spl57_2 ),
    inference(forward_demodulation,[],[f504,f555]) ).

fof(f2703,plain,
    ( ! [X4] :
        ( ~ memberP(sK56,X4)
        | ~ ssItem(X4) )
    | ~ spl57_2 ),
    inference(forward_subsumption_resolution,[],[f2702,f419]) ).

fof(f2744,plain,
    ( memberP(sK56,sK50(sK56))
    | ~ ssList(sK49(sK56))
    | ~ ssItem(sK50(sK56))
    | ~ spl57_30 ),
    inference(superposition,[],[f545,f1372]) ).

fof(f2755,plain,
    ( ~ ssList(sK49(sK56))
    | ~ ssItem(sK50(sK56))
    | ~ spl57_2
    | ~ spl57_30 ),
    inference(forward_subsumption_resolution,[],[f2744,f2703]) ).

fof(f2844,plain,
    ( ~ spl57_19
    | ~ spl57_18
    | ~ spl57_2
    | ~ spl57_30 ),
    inference(avatar_split_clause,[],[f2755,f1370,f554,f1273,f1277]) ).

fof(f3245,plain,
    ( nil = sK56
    | ~ ssList(sK56)
    | spl57_19 ),
    inference(resolution,[],[f1279,f394]) ).

fof(f3246,plain,
    ( ~ ssList(sK56)
    | spl57_1
    | spl57_19 ),
    inference(forward_subsumption_resolution,[],[f3245,f552]) ).

fof(f3247,plain,
    ( $false
    | spl57_1
    | spl57_19 ),
    inference(forward_subsumption_resolution,[],[f3246,f499]) ).

fof(f3248,plain,
    ( spl57_1
    | spl57_19 ),
    inference(avatar_contradiction_clause,[],[f3247]) ).

cnf(s1,plain,
    ( ~ spl57_1
    | ~ spl57_2 ),
    inference(sat_conversion,[],[f557]) ).

cnf(s2,plain,
    ( spl57_1
    | spl57_2 ),
    inference(sat_conversion,[],[f558]) ).

cnf(s26,plain,
    ( spl57_2
    | spl57_26 ),
    inference(sat_conversion,[],[f1353]) ).

cnf(s30,plain,
    ( spl57_1
    | spl57_30 ),
    inference(sat_conversion,[],[f1373]) ).

cnf(s32,plain,
    ( spl57_1
    | spl57_18 ),
    inference(sat_conversion,[],[f1380]) ).

cnf(s51,plain,
    ( spl57_2
    | spl57_38 ),
    inference(sat_conversion,[],[f1700]) ).

cnf(s64,plain,
    ( ~ spl57_1
    | ~ spl57_26
    | ~ spl57_38
    | ~ spl57_39 ),
    inference(sat_conversion,[],[f2081]) ).

cnf(s102,plain,
    ( spl57_2
    | spl57_39 ),
    inference(sat_conversion,[],[f2597]) ).

cnf(s141,plain,
    ( ~ spl57_2
    | ~ spl57_18
    | ~ spl57_19
    | ~ spl57_30 ),
    inference(sat_conversion,[],[f2844]) ).

cnf(s215,plain,
    ( spl57_1
    | spl57_19 ),
    inference(sat_conversion,[],[f3248]) ).

cnf(s220,plain,
    spl57_1,
    inference(rat,[],[s141,s2,s30,s32,s215]) ).

cnf(s224,plain,
    ~ spl57_2,
    inference(rat,[],[s1,s220]) ).

cnf(s228,plain,
    spl57_39,
    inference(rat,[],[s102,s224]) ).

cnf(s229,plain,
    spl57_38,
    inference(rat,[],[s51,s224]) ).

cnf(s231,plain,
    spl57_26,
    inference(rat,[],[s26,s224]) ).

cnf(s234,plain,
    $false,
    inference(rat,[],[s64,s228,s220,s229,s231]) ).

fof(f3249,plain,
    $false,
    inference(avatar_sat_refutation,[],[s234]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC025+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.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 07:29:37 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  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.36/0.47  % (179205)Will run a generic schedule for satisfiability detection.
% 0.36/0.47  % (179213)dis+10_1_sil=32000:sp=arity:random_seed=1131794812:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.47  % (179211)% WARNING: option uhcvi not known.
% 0.36/0.47  % (179210)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=519193487_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.47  % (179212)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2631187504:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.47  % (179216)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2059319958:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.47  % (179214)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1172206893:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.47  % (179215)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4260669505:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.47  % (179211)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1999631114:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.47  % TRYING [1]
% 0.36/0.47  % TRYING [2]
% 0.36/0.47  % TRYING [3]
% 0.36/0.47  % (179213) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-179205-179213"...
% 0.36/0.47  % (179213)...printing done.
% 0.36/0.47  % (179213)Refutation found. Thanks to Tanya!
% 0.36/0.47  % SZS status Theorem for theBenchmark
% 0.36/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.47  % (179213)------------------------------
% 0.36/0.47  % (179213)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.47  % (179213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.47  % (179213)CaDiCaL version: 2.1.3
% 0.36/0.47  % (179213)Termination reason: Refutation
% 0.36/0.47  % (179213)Time elapsed: 0.034 s
% 0.36/0.47  % (179213)Peak memory usage: 14 MB
% 0.36/0.47  % (179213)Instructions burned: 103 (million)
% 0.36/0.47  % (179205)Success in time 0.063 s
% 0.36/0.47  % Vampire exiting
%------------------------------------------------------------------------------