↑ 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  : SWC083+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 : n001.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:35 PM UTC 2026

% Result   : Theorem 5.94s 1.39s
% Output   : Refutation 5.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  138 (  30 unt;   8 def)
%            Number of atoms       :  444 (  75 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  573 ( 267   ~; 249   |;  22   &)
%                                         (  12 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :  111 (   0 sgn  98   !;  13   ?)

% 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(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).

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

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

fof(f79,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( app(X2,X1) = app(X0,X1)
               => X2 = X0 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax79) ).

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

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | ~ neq(X1,nil)
                  | ? [X4] :
                      ( ssList(X4)
                      & neq(X4,nil)
                      & segmentP(X1,X4)
                      & segmentP(X0,X4) )
                  | ! [X5] :
                      ( ssList(X5)
                     => ! [X6] :
                          ( ssList(X6)
                         => ! [X7] :
                              ( ~ ssList(X7)
                              | app(app(X5,X6),X7) != X2
                              | app(X5,X7) != X3 ) ) ) ) ) ) ),
    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
                    | ~ neq(X1,nil)
                    | ? [X4] :
                        ( ssList(X4)
                        & neq(X4,nil)
                        & segmentP(X1,X4)
                        & segmentP(X0,X4) )
                    | ! [X5] :
                        ( ssList(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ! [X7] :
                                ( ~ ssList(X7)
                                | app(app(X5,X6),X7) != X2
                                | app(X5,X7) != X3 ) ) ) ) ) ) ),
    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(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

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

fof(f134,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f172,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f194,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( X2 = X0
              | app(X2,X1) != app(X0,X1)
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f79]) ).

fof(f195,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( X2 = X0
              | app(X2,X1) != app(X0,X1)
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f194]) ).

fof(f201,plain,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f84]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X4,nil)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4) )
                  & ? [X5] :
                      ( ? [X6] :
                          ( ? [X7] :
                              ( ssList(X7)
                              & app(app(X5,X6),X7) = X2
                              & app(X5,X7) = X3 )
                          & ssList(X6) )
                      & ssList(X5) ) )
              & 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(f302,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 = X1
      | neq(X0,X1) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f305,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

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

fof(f319,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f134]) ).

fof(f356,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(X0,X0) ),
    inference(cnf_transformation,[],[f172]) ).

fof(f389,plain,
    ! [X2,X0,X1] :
      ( app(X2,X1) != app(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | X0 = X2 ),
    inference(cnf_transformation,[],[f195]) ).

fof(f396,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f201]) ).

fof(f410,plain,
    sK50 = app(sK51,sK53),
    inference(cnf_transformation,[],[f221]) ).

fof(f411,plain,
    sK49 = app(app(sK51,sK52),sK53),
    inference(cnf_transformation,[],[f221]) ).

fof(f412,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f221]) ).

fof(f413,plain,
    ssList(sK52),
    inference(cnf_transformation,[],[f221]) ).

fof(f414,plain,
    ! [X4] :
      ( ~ segmentP(sK47,X4)
      | ~ segmentP(sK48,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f415,plain,
    ssList(sK51),
    inference(cnf_transformation,[],[f221]) ).

fof(f416,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f221]) ).

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

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

fof(f419,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f221]) ).

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

fof(f425,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f416,f418]) ).

fof(f426,plain,
    ! [X4] :
      ( ~ segmentP(sK49,X4)
      | ~ segmentP(sK50,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4) ),
    inference(definition_unfolding,[],[f414,f417,f418]) ).

fof(f432,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(f468,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(app(X2,X1),X3))
      | ~ ssList(X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ segmentP(app(app(X2,X1),X3),X1) ),
    inference(consistent_polarity_flipping,[],[f432]) ).

fof(f505,plain,
    ! [X0,X1] :
      ( ~ neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f302]) ).

fof(f544,plain,
    ! [X0] :
      ( ~ segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f356]) ).

fof(f580,plain,
    ~ neq(sK50,nil),
    inference(consistent_polarity_flipping,[],[f425]) ).

fof(f581,plain,
    ! [X4] :
      ( neq(X4,nil)
      | segmentP(sK50,X4)
      | segmentP(sK49,X4)
      | ~ ssList(X4) ),
    inference(consistent_polarity_flipping,[],[f426]) ).

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

fof(f595,plain,
    ( ssList(nil)
    | ~ spl54_2 ),
    inference(avatar_component_clause,[],[f594]) ).

fof(f623,plain,
    spl54_2,
    inference(avatar_split_clause,[],[f305,f594]) ).

fof(f624,plain,
    ( segmentP(sK50,sK50)
    | segmentP(sK49,sK50)
    | ~ ssList(sK50) ),
    inference(resolution,[],[f581,f580]) ).

fof(f625,plain,
    ( segmentP(sK50,sK50)
    | segmentP(sK49,sK50) ),
    inference(forward_subsumption_resolution,[],[f624,f419]) ).

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

fof(f629,plain,
    ( segmentP(sK49,sK50)
    | ~ spl54_8 ),
    inference(avatar_component_clause,[],[f627]) ).

fof(f631,definition,
    ( spl54_9
  <=> segmentP(sK50,sK50) ),
    introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).

fof(f633,plain,
    ( segmentP(sK50,sK50)
    | ~ spl54_9 ),
    inference(avatar_component_clause,[],[f631]) ).

fof(f634,plain,
    ( spl54_8
    | spl54_9 ),
    inference(avatar_split_clause,[],[f625,f631,f627]) ).

fof(f635,plain,
    ( ~ ssList(sK50)
    | ~ spl54_9 ),
    inference(resolution,[],[f544,f633]) ).

fof(f636,plain,
    ( $false
    | ~ spl54_9 ),
    inference(forward_subsumption_resolution,[],[f635,f419]) ).

fof(f637,plain,
    ~ spl54_9,
    inference(avatar_contradiction_clause,[],[f636]) ).

fof(f652,plain,
    sK50 = app(nil,sK50),
    inference(resolution,[],[f319,f419]) ).

fof(f669,plain,
    sK49 = app(sK49,nil),
    inference(resolution,[],[f396,f420]) ).

fof(f670,plain,
    sK50 = app(sK50,nil),
    inference(resolution,[],[f396,f419]) ).

fof(f741,definition,
    ( spl54_11
  <=> nil = sK53 ),
    introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).

fof(f743,plain,
    ( nil = sK53
    | ~ spl54_11 ),
    inference(avatar_component_clause,[],[f741]) ).

fof(f865,plain,
    ! [X0] :
      ( ~ ssList(nil)
      | nil = X0
      | ~ ssList(X0)
      | segmentP(sK50,X0)
      | segmentP(sK49,X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f505,f581]) ).

fof(f870,plain,
    ! [X0] :
      ( ~ ssList(nil)
      | nil = X0
      | ~ ssList(X0)
      | segmentP(sK50,X0)
      | segmentP(sK49,X0) ),
    inference(duplicate_literal_removal,[],[f865]) ).

fof(f871,plain,
    ( ! [X0] :
        ( segmentP(sK49,X0)
        | ~ ssList(X0)
        | segmentP(sK50,X0)
        | nil = X0 )
    | ~ spl54_2 ),
    inference(forward_subsumption_resolution,[],[f870,f595]) ).

fof(f1131,definition,
    ( spl54_29
  <=> ssList(app(sK51,sK52)) ),
    introduced(definition,[new_symbols(definition,[spl54_29])],[avatar_definition]) ).

fof(f1132,plain,
    ( ssList(app(sK51,sK52))
    | ~ spl54_29 ),
    inference(avatar_component_clause,[],[f1131]) ).

fof(f1133,plain,
    ( ~ ssList(app(sK51,sK52))
    | spl54_29 ),
    inference(avatar_component_clause,[],[f1131]) ).

fof(f1286,plain,
    ( ~ ssList(sK52)
    | ~ ssList(sK51)
    | spl54_29 ),
    inference(resolution,[],[f1133,f317]) ).

fof(f1287,plain,
    ( ~ ssList(sK51)
    | spl54_29 ),
    inference(forward_subsumption_resolution,[],[f1286,f413]) ).

fof(f1288,plain,
    ( $false
    | spl54_29 ),
    inference(forward_subsumption_resolution,[],[f1287,f415]) ).

fof(f1289,plain,
    spl54_29,
    inference(avatar_contradiction_clause,[],[f1288]) ).

fof(f1650,plain,
    ! [X0] :
      ( sK50 != app(X0,sK53)
      | ~ ssList(sK53)
      | ~ ssList(X0)
      | ~ ssList(sK51)
      | sK51 = X0 ),
    inference(superposition,[],[f389,f410]) ).

fof(f1651,plain,
    ! [X0] :
      ( sK49 != app(X0,sK53)
      | ~ ssList(sK53)
      | ~ ssList(X0)
      | ~ ssList(app(sK51,sK52))
      | app(sK51,sK52) = X0 ),
    inference(superposition,[],[f389,f411]) ).

fof(f1658,plain,
    ! [X0] :
      ( sK49 != app(X0,sK53)
      | ~ ssList(X0)
      | ~ ssList(app(sK51,sK52))
      | app(sK51,sK52) = X0 ),
    inference(forward_subsumption_resolution,[],[f1651,f412]) ).

fof(f1659,plain,
    ! [X0] :
      ( sK50 != app(X0,sK53)
      | ~ ssList(X0)
      | ~ ssList(sK51)
      | sK51 = X0 ),
    inference(forward_subsumption_resolution,[],[f1650,f412]) ).

fof(f1682,plain,
    ( ! [X0] :
        ( sK49 != app(X0,sK53)
        | ~ ssList(X0)
        | app(sK51,sK52) = X0 )
    | ~ spl54_29 ),
    inference(forward_subsumption_resolution,[],[f1658,f1132]) ).

fof(f1683,plain,
    ! [X0] :
      ( sK50 != app(X0,sK53)
      | ~ ssList(X0)
      | sK51 = X0 ),
    inference(forward_subsumption_resolution,[],[f1659,f415]) ).

fof(f1707,plain,
    ( ! [X0] :
        ( app(X0,nil) != sK50
        | ~ ssList(X0)
        | sK51 = X0 )
    | ~ spl54_11 ),
    inference(forward_demodulation,[],[f1683,f743]) ).

fof(f2078,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ segmentP(app(app(X2,X0),X1),X0)
      | ~ ssList(X1)
      | ~ ssList(app(X2,X0)) ),
    inference(resolution,[],[f468,f317]) ).

fof(f2089,plain,
    ! [X0] :
      ( ~ ssList(app(sK50,X0))
      | ~ ssList(sK53)
      | ~ ssList(X0)
      | ~ ssList(sK51)
      | ~ segmentP(app(sK50,X0),sK53) ),
    inference(superposition,[],[f468,f410]) ).

fof(f2090,plain,
    ! [X0] :
      ( ~ ssList(app(sK49,X0))
      | ~ ssList(sK53)
      | ~ ssList(X0)
      | ~ ssList(app(sK51,sK52))
      | ~ segmentP(app(sK49,X0),sK53) ),
    inference(superposition,[],[f468,f411]) ).

fof(f2094,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ segmentP(app(app(X2,X0),X1),X0)
      | ~ ssList(app(X2,X0)) ),
    inference(duplicate_literal_removal,[],[f2078]) ).

fof(f2097,plain,
    ! [X0] :
      ( ~ ssList(app(sK49,X0))
      | ~ ssList(X0)
      | ~ ssList(app(sK51,sK52))
      | ~ segmentP(app(sK49,X0),sK53) ),
    inference(forward_subsumption_resolution,[],[f2090,f412]) ).

fof(f2098,plain,
    ! [X0] :
      ( ~ ssList(app(sK50,X0))
      | ~ ssList(X0)
      | ~ ssList(sK51)
      | ~ segmentP(app(sK50,X0),sK53) ),
    inference(forward_subsumption_resolution,[],[f2089,f412]) ).

fof(f2103,plain,
    ! [X2,X0,X1] :
      ( ~ segmentP(app(app(X2,X0),X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2094,f317]) ).

fof(f2106,plain,
    ( ! [X0] :
        ( ~ segmentP(app(sK49,X0),sK53)
        | ~ ssList(X0)
        | ~ ssList(app(sK49,X0)) )
    | ~ spl54_29 ),
    inference(forward_subsumption_resolution,[],[f2097,f1132]) ).

fof(f2107,plain,
    ! [X0] :
      ( ~ segmentP(app(sK50,X0),sK53)
      | ~ ssList(X0)
      | ~ ssList(app(sK50,X0)) ),
    inference(forward_subsumption_resolution,[],[f2098,f415]) ).

fof(f5491,definition,
    ( spl54_500
  <=> sK50 = sK51 ),
    introduced(definition,[new_symbols(definition,[spl54_500])],[avatar_definition]) ).

fof(f5493,plain,
    ( sK50 = sK51
    | ~ spl54_500 ),
    inference(avatar_component_clause,[],[f5491]) ).

fof(f5916,plain,
    ( sK50 != sK50
    | ~ ssList(sK50)
    | sK50 = sK51
    | ~ spl54_11 ),
    inference(superposition,[],[f1707,f670]) ).

fof(f5919,plain,
    ( ~ ssList(sK50)
    | sK50 = sK51
    | ~ spl54_11 ),
    inference(trivial_inequality_removal,[],[f5916]) ).

fof(f5921,plain,
    ( sK50 = sK51
    | ~ spl54_11 ),
    inference(forward_subsumption_resolution,[],[f5919,f419]) ).

fof(f5928,plain,
    ( spl54_500
    | ~ spl54_11 ),
    inference(avatar_split_clause,[],[f5921,f741,f5491]) ).

fof(f7711,definition,
    ( spl54_643
  <=> segmentP(sK49,sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_643])],[avatar_definition]) ).

fof(f7712,plain,
    ( ~ segmentP(sK49,sK53)
    | spl54_643 ),
    inference(avatar_component_clause,[],[f7711]) ).

fof(f7738,definition,
    ( spl54_649
  <=> segmentP(sK50,sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_649])],[avatar_definition]) ).

fof(f9016,plain,
    ( ! [X0] :
        ( app(X0,nil) != sK49
        | ~ ssList(X0)
        | app(sK51,sK52) = X0 )
    | ~ spl54_11
    | ~ spl54_29 ),
    inference(forward_demodulation,[],[f1682,f743]) ).

fof(f9282,plain,
    ( ! [X0] :
        ( app(X0,nil) != sK49
        | app(sK50,sK52) = X0
        | ~ ssList(X0) )
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(forward_demodulation,[],[f9016,f5493]) ).

fof(f9399,plain,
    ( sK49 != sK49
    | sK49 = app(sK50,sK52)
    | ~ ssList(sK49)
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(superposition,[],[f9282,f669]) ).

fof(f9404,plain,
    ( sK49 = app(sK50,sK52)
    | ~ ssList(sK49)
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(trivial_inequality_removal,[],[f9399]) ).

fof(f9408,plain,
    ( sK49 = app(sK50,sK52)
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(forward_subsumption_resolution,[],[f9404,f420]) ).

fof(f15411,plain,
    ( ~ segmentP(sK49,sK53)
    | ~ ssList(nil)
    | ~ ssList(sK49)
    | ~ spl54_29 ),
    inference(superposition,[],[f2106,f669]) ).

fof(f15413,plain,
    ( ~ segmentP(sK49,sK53)
    | ~ ssList(sK49)
    | ~ spl54_2
    | ~ spl54_29 ),
    inference(forward_subsumption_resolution,[],[f15411,f595]) ).

fof(f15415,plain,
    ( ~ segmentP(sK49,sK53)
    | ~ spl54_2
    | ~ spl54_29 ),
    inference(forward_subsumption_resolution,[],[f15413,f420]) ).

fof(f15416,plain,
    ( ~ spl54_643
    | ~ spl54_2
    | ~ spl54_29 ),
    inference(avatar_split_clause,[],[f15415,f1131,f594,f7711]) ).

fof(f15418,plain,
    ( ~ segmentP(sK50,sK53)
    | ~ ssList(nil)
    | ~ ssList(sK50) ),
    inference(superposition,[],[f2107,f670]) ).

fof(f15420,plain,
    ( ~ segmentP(sK50,sK53)
    | ~ ssList(sK50)
    | ~ spl54_2 ),
    inference(forward_subsumption_resolution,[],[f15418,f595]) ).

fof(f15422,plain,
    ( ~ segmentP(sK50,sK53)
    | ~ spl54_2 ),
    inference(forward_subsumption_resolution,[],[f15420,f419]) ).

fof(f15423,plain,
    ( ~ spl54_649
    | ~ spl54_2 ),
    inference(avatar_split_clause,[],[f15422,f594,f7738]) ).

fof(f18341,plain,
    ! [X0] :
      ( ~ segmentP(app(sK50,X0),sK50)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(sK50) ),
    inference(superposition,[],[f2103,f652]) ).

fof(f18356,plain,
    ( ! [X0] :
        ( ~ segmentP(app(sK50,X0),sK50)
        | ~ ssList(X0)
        | ~ ssList(sK50) )
    | ~ spl54_2 ),
    inference(forward_subsumption_resolution,[],[f18341,f595]) ).

fof(f18375,plain,
    ( ! [X0] :
        ( ~ segmentP(app(sK50,X0),sK50)
        | ~ ssList(X0) )
    | ~ spl54_2 ),
    inference(forward_subsumption_resolution,[],[f18356,f419]) ).

fof(f41254,plain,
    ( ~ ssList(sK53)
    | segmentP(sK50,sK53)
    | nil = sK53
    | ~ spl54_2
    | spl54_643 ),
    inference(resolution,[],[f7712,f871]) ).

fof(f41273,plain,
    ( segmentP(sK50,sK53)
    | nil = sK53
    | ~ spl54_2
    | spl54_643 ),
    inference(forward_subsumption_resolution,[],[f41254,f412]) ).

fof(f42048,plain,
    ( spl54_11
    | spl54_649
    | ~ spl54_2
    | spl54_643 ),
    inference(avatar_split_clause,[],[f41273,f7711,f594,f7738,f741]) ).

fof(f68243,plain,
    ( ~ segmentP(sK49,sK50)
    | ~ ssList(sK52)
    | ~ spl54_2
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(superposition,[],[f18375,f9408]) ).

fof(f68244,plain,
    ( ~ ssList(sK52)
    | ~ spl54_2
    | ~ spl54_8
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(forward_subsumption_resolution,[],[f68243,f629]) ).

fof(f68258,plain,
    ( $false
    | ~ spl54_2
    | ~ spl54_8
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(forward_subsumption_resolution,[],[f68244,f413]) ).

fof(f68259,plain,
    ( ~ spl54_2
    | ~ spl54_8
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(avatar_contradiction_clause,[],[f68258]) ).

cnf(s9,plain,
    spl54_2,
    inference(sat_conversion,[],[f623]) ).

cnf(s10,plain,
    ( spl54_8
    | spl54_9 ),
    inference(sat_conversion,[],[f634]) ).

cnf(s11,plain,
    ~ spl54_9,
    inference(sat_conversion,[],[f637]) ).

cnf(s32,plain,
    spl54_29,
    inference(sat_conversion,[],[f1289]) ).

cnf(s667,plain,
    ( ~ spl54_11
    | spl54_500 ),
    inference(sat_conversion,[],[f5928]) ).

cnf(s2093,plain,
    ( ~ spl54_2
    | ~ spl54_29
    | ~ spl54_643 ),
    inference(sat_conversion,[],[f15416]) ).

cnf(s2094,plain,
    ( ~ spl54_2
    | ~ spl54_649 ),
    inference(sat_conversion,[],[f15423]) ).

cnf(s7476,plain,
    ( ~ spl54_2
    | spl54_11
    | spl54_643
    | spl54_649 ),
    inference(sat_conversion,[],[f42048]) ).

cnf(s10806,plain,
    ( ~ spl54_2
    | ~ spl54_8
    | ~ spl54_11
    | ~ spl54_29
    | ~ spl54_500 ),
    inference(sat_conversion,[],[f68259]) ).

cnf(s10931,plain,
    spl54_8,
    inference(rat,[],[s10,s11]) ).

cnf(s10999,plain,
    ~ spl54_649,
    inference(rat,[],[s2094,s9]) ).

cnf(s11000,plain,
    ~ spl54_643,
    inference(rat,[],[s2093,s32,s9]) ).

cnf(s11003,plain,
    spl54_11,
    inference(rat,[],[s7476,s10999,s9,s11000]) ).

cnf(s11012,plain,
    spl54_500,
    inference(rat,[],[s667,s11003]) ).

cnf(s11013,plain,
    $false,
    inference(rat,[],[s10806,s9,s32,s10931,s11012,s11003]) ).

fof(f68260,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11013]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC083+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.37  % Computer : n001.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 07:52:17 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  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
% 5.94/1.39  % (194133)Will run a generic schedule for satisfiability detection.
% 5.94/1.39  % (194139)% WARNING: option uhcvi not known.
% 5.94/1.39  % (194139)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1018634002:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.94/1.39  % (194143)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2558410515:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.94/1.39  % (194140)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2014024833:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.94/1.39  % (194141)dis+10_1_sil=32000:sp=arity:random_seed=539163762:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.94/1.39  % (194138)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3496803294_2999 on theBenchmark for (2999ds/0Mi)
% 5.94/1.39  % (194142)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2767056246:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.94/1.39  % (194144)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2127555396:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.94/1.39  % TRYING [1]
% 5.94/1.39  % TRYING [2]
% 5.94/1.39  % TRYING [3]
% 5.94/1.39  % TRYING [4]
% 5.94/1.39  % (194141)Instruction limit reached! 
% 5.94/1.39  % (194141)------------------------------
% 5.94/1.39  % (194141)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194141)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194141)Termination reason: Instruction limit
% 5.94/1.39  % (194141)Termination phase: Saturation
% 5.94/1.39  % (194141)Time elapsed: 0.060 s
% 5.94/1.39  % (194141)Peak memory usage: 13 MB
% 5.94/1.39  % (194141)Instructions burned: 103 (million)
% 5.94/1.39  % (194142)Instruction limit reached! 
% 5.94/1.39  % (194142)------------------------------
% 5.94/1.39  % (194142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194142)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194142)Termination reason: Instruction limit
% 5.94/1.39  % (194142)Termination phase: Saturation
% 5.94/1.39  % (194142)Time elapsed: 0.070 s
% 5.94/1.39  % (194142)Peak memory usage: 13 MB
% 5.94/1.39  % (194142)Instructions burned: 117 (million)
% 5.94/1.39  % (194143)Instruction limit reached! 
% 5.94/1.39  % (194143)------------------------------
% 5.94/1.39  % (194143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194143)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194143)Termination reason: Instruction limit
% 5.94/1.39  % (194143)Termination phase: Saturation
% 5.94/1.39  % (194143)Time elapsed: 0.077 s
% 5.94/1.39  % (194143)Peak memory usage: 14 MB
% 5.94/1.39  % (194143)Instructions burned: 131 (million)
% 5.94/1.39  % (194152)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=302964332:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.94/1.39  % TRYING [5]
% 5.94/1.39  % (194153)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1790373003:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.94/1.39  % TRYING [1]
% 5.94/1.39  % (194154)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=923735940:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.94/1.39  % TRYING [2]
% 5.94/1.39  % (194144)Instruction limit reached! 
% 5.94/1.39  % (194144)------------------------------
% 5.94/1.39  % (194144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194144)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194144)Termination reason: Instruction limit
% 5.94/1.39  % (194144)Termination phase: Saturation
% 5.94/1.39  % (194144)Time elapsed: 0.099 s
% 5.94/1.39  % (194144)Peak memory usage: 15 MB
% 5.94/1.39  % (194144)Instructions burned: 160 (million)
% 5.94/1.39  % TRYING [3]
% 5.94/1.39  % TRYING [4]
% 5.94/1.39  % (194158)ott-21_1_sil=16000:fs=off:random_seed=520711819:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.94/1.39  % (194153)Instruction limit reached! 
% 5.94/1.39  % (194153)------------------------------
% 5.94/1.39  % (194153)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194153)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194153)Termination reason: Instruction limit
% 5.94/1.39  % (194153)Termination phase: Saturation
% 5.94/1.39  % (194153)Time elapsed: 0.071 s
% 5.94/1.39  % (194153)Peak memory usage: 13 MB
% 5.94/1.39  % (194153)Instructions burned: 133 (million)
% 5.94/1.39  % TRYING [5]
% 5.94/1.39  % (194160)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2326693063:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 5.94/1.39  % (194158)Instruction limit reached! 
% 5.94/1.39  % (194158)------------------------------
% 5.94/1.39  % (194158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194158)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194158)Termination reason: Instruction limit
% 5.94/1.39  % (194158)Termination phase: Saturation
% 5.94/1.39  % (194158)Time elapsed: 0.089 s
% 5.94/1.39  % (194158)Peak memory usage: 13 MB
% 5.94/1.39  % (194158)Instructions burned: 180 (million)
% 5.94/1.39  % TRYING [6]
% 5.94/1.39  % (194162)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=894582140:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 5.94/1.39  % TRYING [1]
% 5.94/1.39  % TRYING [2]
% 5.94/1.39  % TRYING [3]
% 5.94/1.39  % TRYING [4]
% 5.94/1.39  % TRYING [6]
% 5.94/1.39  % (194152)Instruction limit reached! 
% 5.94/1.39  % (194152)------------------------------
% 5.94/1.39  % (194152)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194152)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194152)Termination reason: Instruction limit
% 5.94/1.39  % (194152)Termination phase: Finite model building constraint generation
% 5.94/1.39  % (194152)Time elapsed: 0.294 s
% 5.94/1.39  % (194152)Peak memory usage: 27 MB
% 5.94/1.39  % (194152)Instructions burned: 715 (million)
% 5.94/1.39  % (194164)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3525705717:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 5.94/1.39  % TRYING [5]
% 5.94/1.39  % (194154)Instruction limit reached! 
% 5.94/1.39  % (194154)------------------------------
% 5.94/1.39  % (194154)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194154)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194154)Termination reason: Instruction limit
% 5.94/1.39  % (194154)Termination phase: Saturation
% 5.94/1.39  % (194154)Time elapsed: 0.365 s
% 5.94/1.39  % (194154)Peak memory usage: 22 MB
% 5.94/1.39  % (194154)Instructions burned: 685 (million)
% 5.94/1.39  % (194166)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2210118476:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 5.94/1.39  % (194160)Instruction limit reached! 
% 5.94/1.39  % (194160)------------------------------
% 5.94/1.39  % (194160)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194160)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194160)Termination reason: Instruction limit
% 5.94/1.39  % (194160)Termination phase: Saturation
% 5.94/1.39  % (194160)Time elapsed: 0.303 s
% 5.94/1.39  % (194160)Peak memory usage: 14 MB
% 5.94/1.39  % (194160)Instructions burned: 477 (million)
% 5.94/1.39  % (194168)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2816341052:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 5.94/1.39  % TRYING [7]
% 5.94/1.39  % (194162)Instruction limit reached! 
% 5.94/1.39  % (194162)------------------------------
% 5.94/1.39  % (194162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194162)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194162)Termination reason: Instruction limit
% 5.94/1.39  % (194162)Termination phase: Finite model building SAT solving
% 5.94/1.39  % (194162)Time elapsed: 0.350 s
% 5.94/1.39  % (194162)Peak memory usage: 23 MB
% 5.94/1.39  % (194162)Instructions burned: 866 (million)
% 5.94/1.39  % TRYING [14]
% 5.94/1.39  % (194170)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1852425521:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 5.94/1.39  % (194166)Instruction limit reached! 
% 5.94/1.39  % (194166)------------------------------
% 5.94/1.39  % (194166)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194166)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194166)Termination reason: Instruction limit
% 5.94/1.39  % (194166)Termination phase: Finite model building constraint generation
% 5.94/1.39  % (194166)Time elapsed: 0.320 s
% 5.94/1.39  % (194166)Peak memory usage: 70 MB
% 5.94/1.39  % (194166)Instructions burned: 891 (million)
% 5.94/1.39  % (194168)Instruction limit reached! 
% 5.94/1.39  % (194168)------------------------------
% 5.94/1.39  % (194168)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194168)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194168)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194168)Termination reason: Instruction limit
% 5.94/1.39  % (194168)Termination phase: Saturation
% 5.94/1.39  % (194168)Time elapsed: 0.320 s
% 5.94/1.39  % (194168)Peak memory usage: 23 MB
% 5.94/1.39  % (194168)Instructions burned: 692 (million)
% 5.94/1.39  % (194172)fmb+10_1_sil=64000:random_seed=3454204412:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 5.94/1.39  % TRYING [1]
% 5.94/1.39  % TRYING [2]
% 5.94/1.39  % (194173)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=60637734:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 5.94/1.39  % TRYING [3]
% 5.94/1.39  % TRYING [20]
% 5.94/1.39  % TRYING [4]
% 5.94/1.39  % (194139) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-194133-194139"...
% 5.94/1.39  % (194139)...printing done.
% 5.94/1.39  % (194139)Refutation found. Thanks to Tanya!
% 5.94/1.39  % SZS status Theorem for theBenchmark
% 5.94/1.39  % SZS output start Proof for theBenchmark
% See solution above
% 5.94/1.39  % (194139)------------------------------
% 5.94/1.39  % (194139)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.94/1.39  % (194139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.94/1.39  % (194139)CaDiCaL version: 2.1.3
% 5.94/1.39  % (194139)Termination reason: Refutation
% 5.94/1.39  % (194139)Time elapsed: 0.933 s
% 5.94/1.39  % (194139)Peak memory usage: 48 MB
% 5.94/1.39  % (194139)Instructions burned: 3269 (million)
% 5.94/1.39  % (194133)Success in time 0.982 s
% 5.94/1.39  % Vampire exiting
%------------------------------------------------------------------------------