↑ 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  : SWC120+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 : n006.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:45 PM UTC 2026

% Result   : Theorem 7.71s 1.63s
% Output   : Refutation 7.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   18
% Syntax   : Number of formulae    :  135 (  21 unt;   8 def)
%            Number of atoms       :  436 (  86 equ)
%            Maximal formula atoms :   17 (   3 avg)
%            Number of connectives :  523 ( 222   ~; 230   |;  36   &)
%                                         (  12 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   85 (   0 sgn  69   !;  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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

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

fof(f18,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) != X0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).

fof(f24,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssList(tl(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).

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

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

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).

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)
                            & X3 != X4
                            & ? [X5] :
                                ( ssList(X5)
                                & tl(X3) = X5
                                & app(X2,X5) = X4
                                & neq(nil,X3) ) )
                        | ( neq(X0,nil)
                          & segmentP(X1,X0) ) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) ) ) ) ) ) ),
    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
                      | ( ( ~ neq(X1,nil)
                          | ? [X4] :
                              ( ssList(X4)
                              & X3 != X4
                              & ? [X5] :
                                  ( ssList(X5)
                                  & tl(X3) = X5
                                  & app(X2,X5) = X4
                                  & neq(nil,X3) ) )
                          | ( neq(X0,nil)
                            & segmentP(X1,X0) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) ) ) ) ) ) ),
    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(f120,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) != X0
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f126,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f127,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f126]) ).

fof(f129,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f130,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f129]) ).

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(f192,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f193,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f192]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ! [X4] :
                          ( ~ ssList(X4)
                          | X3 = X4
                          | ! [X5] :
                              ( ~ ssList(X5)
                              | tl(X3) != X5
                              | app(X2,X5) != X4
                              | ~ neq(nil,X3) ) )
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ! [X4] :
                          ( ~ ssList(X4)
                          | X3 = X4
                          | ! [X5] :
                              ( ~ ssList(X5)
                              | tl(X3) != X5
                              | app(X2,X5) != X4
                              | ~ neq(nil,X3) ) )
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f241,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(f303,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f304,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 != X1
      | ~ neq(X0,X1) ),
    inference(cnf_transformation,[],[f118]) ).

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

fof(f307,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | cons(X1,X0) != X0 ),
    inference(cnf_transformation,[],[f120]) ).

fof(f314,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f316,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f130]) ).

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

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

fof(f389,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = X0
      | cons(hd(X0),tl(X0)) = X0 ),
    inference(cnf_transformation,[],[f193]) ).

fof(f412,plain,
    ! [X4,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | app(sK49,X5) != X4
      | tl(sK50) != X5
      | ~ ssList(X5)
      | sK50 = X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f413,plain,
    ( ~ neq(sK50,nil)
    | ~ segmentP(sK48,sK47)
    | ~ neq(sK47,nil) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    ssList(sK50),
    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(f426,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f415,f419]) ).

fof(f428,plain,
    ( ~ neq(sK50,nil)
    | ~ segmentP(sK50,sK49)
    | ~ neq(sK49,nil) ),
    inference(definition_unfolding,[],[f413,f419,f418,f418]) ).

fof(f435,plain,
    ! [X2,X3,X1] :
      ( segmentP(app(app(X2,X1),X3),X1)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(app(app(X2,X1),X3)) ),
    inference(equality_resolution,[],[f241]) ).

fof(f444,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f304]) ).

fof(f455,plain,
    ! [X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | tl(sK50) != X5
      | ~ ssList(X5)
      | sK50 = app(sK49,X5)
      | ~ ssList(app(sK49,X5)) ),
    inference(equality_resolution,[],[f412]) ).

fof(f456,plain,
    ( ~ neq(sK50,nil)
    | ~ neq(nil,sK50)
    | ~ ssList(tl(sK50))
    | sK50 = app(sK49,tl(sK50))
    | ~ ssList(app(sK49,tl(sK50))) ),
    inference(equality_resolution,[],[f455]) ).

fof(f463,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f444]) ).

fof(f466,plain,
    ( ~ segmentP(sK50,sK49)
    | ~ neq(sK49,nil) ),
    inference(forward_subsumption_resolution,[],[f428,f426]) ).

fof(f468,definition,
    ( spl51_1
  <=> neq(sK49,nil) ),
    introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).

fof(f470,plain,
    ( ~ neq(sK49,nil)
    | spl51_1 ),
    inference(avatar_component_clause,[],[f468]) ).

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

fof(f474,plain,
    ( ~ segmentP(sK50,sK49)
    | spl51_2 ),
    inference(avatar_component_clause,[],[f472]) ).

fof(f475,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f466,f472,f468]) ).

fof(f476,plain,
    ( ~ neq(nil,sK50)
    | ~ ssList(tl(sK50))
    | sK50 = app(sK49,tl(sK50))
    | ~ ssList(app(sK49,tl(sK50))) ),
    inference(forward_subsumption_resolution,[],[f456,f426]) ).

fof(f478,definition,
    ( spl51_3
  <=> ssList(app(sK49,tl(sK50))) ),
    introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).

fof(f479,plain,
    ( ssList(app(sK49,tl(sK50)))
    | ~ spl51_3 ),
    inference(avatar_component_clause,[],[f478]) ).

fof(f480,plain,
    ( ~ ssList(app(sK49,tl(sK50)))
    | spl51_3 ),
    inference(avatar_component_clause,[],[f478]) ).

fof(f482,definition,
    ( spl51_4
  <=> sK50 = app(sK49,tl(sK50)) ),
    introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).

fof(f484,plain,
    ( sK50 = app(sK49,tl(sK50))
    | ~ spl51_4 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f486,definition,
    ( spl51_5
  <=> ssList(tl(sK50)) ),
    introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).

fof(f487,plain,
    ( ssList(tl(sK50))
    | ~ spl51_5 ),
    inference(avatar_component_clause,[],[f486]) ).

fof(f488,plain,
    ( ~ ssList(tl(sK50))
    | spl51_5 ),
    inference(avatar_component_clause,[],[f486]) ).

fof(f490,definition,
    ( spl51_6
  <=> neq(nil,sK50) ),
    introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).

fof(f492,plain,
    ( ~ neq(nil,sK50)
    | spl51_6 ),
    inference(avatar_component_clause,[],[f490]) ).

fof(f493,plain,
    ( ~ spl51_3
    | spl51_4
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(avatar_split_clause,[],[f476,f490,f486,f482,f478]) ).

fof(f515,plain,
    sK49 = app(nil,sK49),
    inference(resolution,[],[f320,f420]) ).

fof(f546,plain,
    ( ~ ssList(tl(sK50))
    | ~ ssList(sK49)
    | spl51_3 ),
    inference(resolution,[],[f318,f480]) ).

fof(f555,plain,
    ( ~ ssList(tl(sK50))
    | spl51_3 ),
    inference(forward_subsumption_resolution,[],[f546,f420]) ).

fof(f556,plain,
    ( ~ spl51_5
    | spl51_3 ),
    inference(avatar_split_clause,[],[f555,f478,f486]) ).

fof(f557,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_5 ),
    inference(resolution,[],[f488,f316]) ).

fof(f558,plain,
    ( nil = sK50
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f557,f417]) ).

fof(f560,plain,
    ( neq(nil,nil)
    | spl51_5 ),
    inference(superposition,[],[f426,f558]) ).

fof(f570,plain,
    ( ~ ssList(nil)
    | spl51_5 ),
    inference(resolution,[],[f560,f463]) ).

fof(f571,plain,
    ( $false
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f570,f306]) ).

fof(f572,plain,
    spl51_5,
    inference(avatar_contradiction_clause,[],[f571]) ).

fof(f574,plain,
    ( tl(sK50) = app(nil,tl(sK50))
    | ~ spl51_5 ),
    inference(resolution,[],[f487,f320]) ).

fof(f593,plain,
    ( ! [X0] :
        ( app(sK49,tl(sK50)) != cons(X0,app(sK49,tl(sK50)))
        | ~ ssItem(X0) )
    | ~ spl51_3 ),
    inference(resolution,[],[f307,f479]) ).

fof(f649,definition,
    ( spl51_8
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).

fof(f651,plain,
    ( nil = sK49
    | ~ spl51_8 ),
    inference(avatar_component_clause,[],[f649]) ).

fof(f657,plain,
    ( ~ ssList(nil)
    | nil = sK49
    | ~ ssList(sK49)
    | spl51_1 ),
    inference(resolution,[],[f303,f470]) ).

fof(f660,plain,
    ( ~ ssList(sK50)
    | nil = sK50
    | ~ ssList(nil)
    | spl51_6 ),
    inference(resolution,[],[f303,f492]) ).

fof(f663,plain,
    ( nil = sK50
    | ~ ssList(nil)
    | spl51_6 ),
    inference(forward_subsumption_resolution,[],[f660,f417]) ).

fof(f664,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl51_1 ),
    inference(forward_subsumption_resolution,[],[f657,f306]) ).

fof(f665,plain,
    ( nil = sK50
    | spl51_6 ),
    inference(forward_subsumption_resolution,[],[f663,f306]) ).

fof(f666,plain,
    ( nil = sK49
    | spl51_1 ),
    inference(forward_subsumption_resolution,[],[f664,f420]) ).

fof(f668,plain,
    ( neq(nil,nil)
    | spl51_6 ),
    inference(superposition,[],[f426,f665]) ).

fof(f729,plain,
    ( spl51_8
    | spl51_1 ),
    inference(avatar_split_clause,[],[f666,f468,f649]) ).

fof(f781,plain,
    ( ~ ssList(nil)
    | spl51_6 ),
    inference(resolution,[],[f668,f463]) ).

fof(f782,plain,
    ( $false
    | spl51_6 ),
    inference(forward_subsumption_resolution,[],[f781,f306]) ).

fof(f783,plain,
    spl51_6,
    inference(avatar_contradiction_clause,[],[f782]) ).

fof(f784,plain,
    ( ! [X0] :
        ( sK50 != cons(X0,sK50)
        | ~ ssItem(X0) )
    | ~ spl51_3
    | ~ spl51_4 ),
    inference(superposition,[],[f593,f484]) ).

fof(f915,plain,
    ( sK50 = app(nil,tl(sK50))
    | ~ spl51_4
    | ~ spl51_8 ),
    inference(superposition,[],[f484,f651]) ).

fof(f939,plain,
    ( ~ neq(nil,nil)
    | spl51_1
    | ~ spl51_8 ),
    inference(forward_demodulation,[],[f470,f651]) ).

fof(f948,plain,
    ( sK50 = tl(sK50)
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8 ),
    inference(superposition,[],[f915,f574]) ).

fof(f1024,definition,
    ( spl51_12
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl51_12])],[avatar_definition]) ).

fof(f1025,plain,
    ( nil != sK50
    | spl51_12 ),
    inference(avatar_component_clause,[],[f1024]) ).

fof(f1026,plain,
    ( nil = sK50
    | ~ spl51_12 ),
    inference(avatar_component_clause,[],[f1024]) ).

fof(f1105,plain,
    ( nil = sK50
    | sK50 = cons(hd(sK50),tl(sK50)) ),
    inference(resolution,[],[f389,f417]) ).

fof(f1106,plain,
    ( sK50 = cons(hd(sK50),sK50)
    | nil = sK50
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8 ),
    inference(forward_demodulation,[],[f1105,f948]) ).

fof(f1236,plain,
    ( sK50 = cons(hd(sK50),sK50)
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(forward_subsumption_resolution,[],[f1106,f1025]) ).

fof(f1254,plain,
    ( sK50 != sK50
    | ~ ssItem(hd(sK50))
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(superposition,[],[f784,f1236]) ).

fof(f1260,plain,
    ( ~ ssItem(hd(sK50))
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(trivial_inequality_removal,[],[f1254]) ).

fof(f1262,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(resolution,[],[f1260,f314]) ).

fof(f1263,plain,
    ( ~ ssList(sK50)
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(forward_subsumption_resolution,[],[f1262,f1025]) ).

fof(f1264,plain,
    ( $false
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(forward_subsumption_resolution,[],[f1263,f417]) ).

fof(f1265,plain,
    ( ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(avatar_contradiction_clause,[],[f1264]) ).

fof(f2417,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(sK49)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(app(sK49,X0)) ),
    inference(superposition,[],[f435,f515]) ).

fof(f2434,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(sK49)
      | ~ ssList(X0)
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f2417,f318]) ).

fof(f2441,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(X0)
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f2434,f420]) ).

fof(f2446,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2441,f306]) ).

fof(f2474,plain,
    ( segmentP(sK50,sK49)
    | ~ ssList(tl(sK50))
    | ~ spl51_4 ),
    inference(superposition,[],[f2446,f484]) ).

fof(f2477,plain,
    ( ~ ssList(tl(sK50))
    | spl51_2
    | ~ spl51_4 ),
    inference(forward_subsumption_resolution,[],[f2474,f474]) ).

fof(f2482,plain,
    ( $false
    | spl51_2
    | ~ spl51_4
    | ~ spl51_5 ),
    inference(forward_subsumption_resolution,[],[f2477,f487]) ).

fof(f2483,plain,
    ( spl51_2
    | ~ spl51_4
    | ~ spl51_5 ),
    inference(avatar_contradiction_clause,[],[f2482]) ).

fof(f2539,plain,
    ( neq(nil,nil)
    | ~ spl51_12 ),
    inference(superposition,[],[f426,f1026]) ).

fof(f2584,plain,
    ( $false
    | spl51_1
    | ~ spl51_8
    | ~ spl51_12 ),
    inference(forward_subsumption_resolution,[],[f2539,f939]) ).

fof(f2585,plain,
    ( spl51_1
    | ~ spl51_8
    | ~ spl51_12 ),
    inference(avatar_contradiction_clause,[],[f2584]) ).

cnf(s1,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(sat_conversion,[],[f475]) ).

cnf(s2,plain,
    ( ~ spl51_3
    | spl51_4
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(sat_conversion,[],[f493]) ).

cnf(s3,plain,
    ( spl51_3
    | ~ spl51_5 ),
    inference(sat_conversion,[],[f556]) ).

cnf(s4,plain,
    spl51_5,
    inference(sat_conversion,[],[f572]) ).

cnf(s6,plain,
    ( spl51_1
    | spl51_8 ),
    inference(sat_conversion,[],[f729]) ).

cnf(s7,plain,
    spl51_6,
    inference(sat_conversion,[],[f783]) ).

cnf(s14,plain,
    ( ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_8
    | spl51_12 ),
    inference(sat_conversion,[],[f1265]) ).

cnf(s19,plain,
    ( spl51_2
    | ~ spl51_4
    | ~ spl51_5 ),
    inference(sat_conversion,[],[f2483]) ).

cnf(s22,plain,
    ( spl51_1
    | ~ spl51_8
    | ~ spl51_12 ),
    inference(sat_conversion,[],[f2585]) ).

cnf(s23,plain,
    spl51_3,
    inference(rat,[],[s3,s4]) ).

cnf(s24,plain,
    spl51_4,
    inference(rat,[],[s2,s7,s4,s23]) ).

cnf(s25,plain,
    spl51_2,
    inference(rat,[],[s19,s4,s24]) ).

cnf(s26,plain,
    ~ spl51_1,
    inference(rat,[],[s1,s25]) ).

cnf(s27,plain,
    spl51_8,
    inference(rat,[],[s6,s26]) ).

cnf(s28,plain,
    ~ spl51_12,
    inference(rat,[],[s22,s26,s27]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s14,s24,s23,s4,s28,s27]) ).

fof(f2587,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC120+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 28 07:59:25 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  Running first-order model finding
% 0.12/0.38  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
% 7.71/1.63  % (3812010)Will run a generic schedule for satisfiability detection.
% 7.71/1.63  % (3812015)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4060769414_2999 on theBenchmark for (2999ds/0Mi)
% 7.71/1.63  % (3812016)% WARNING: option uhcvi not known.
% 7.71/1.63  % (3812016)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2009495362:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.71/1.63  % (3812017)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1980699020:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.71/1.63  % TRYING [1]
% 7.71/1.63  % (3812018)dis+10_1_sil=32000:sp=arity:random_seed=3783803714:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.71/1.63  % (3812019)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=128470332:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.71/1.63  % (3812020)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3278608524:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.71/1.63  % (3812021)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3478910108:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.71/1.63  % TRYING [2]
% 7.71/1.63  % TRYING [3]
% 7.71/1.63  % TRYING [4]
% 7.71/1.63  % TRYING [5]
% 7.71/1.63  % (3812018)Instruction limit reached! 
% 7.71/1.63  % (3812018)------------------------------
% 7.71/1.63  % (3812018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812018)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812018)Termination reason: Instruction limit
% 7.71/1.63  % (3812018)Termination phase: Saturation
% 7.71/1.63  % (3812018)Time elapsed: 0.062 s
% 7.71/1.63  % (3812018)Peak memory usage: 13 MB
% 7.71/1.63  % (3812018)Instructions burned: 103 (million)
% 7.71/1.63  % (3812019)Instruction limit reached! 
% 7.71/1.63  % (3812019)------------------------------
% 7.71/1.63  % (3812019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812019)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812019)Termination reason: Instruction limit
% 7.71/1.63  % (3812019)Termination phase: Saturation
% 7.71/1.63  % (3812019)Time elapsed: 0.072 s
% 7.71/1.63  % (3812019)Peak memory usage: 13 MB
% 7.71/1.63  % (3812019)Instructions burned: 117 (million)
% 7.71/1.63  % (3812020)Instruction limit reached! 
% 7.71/1.63  % (3812020)------------------------------
% 7.71/1.63  % (3812020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812020)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812020)Termination reason: Instruction limit
% 7.71/1.63  % (3812020)Termination phase: Saturation
% 7.71/1.63  % (3812020)Time elapsed: 0.076 s
% 7.71/1.63  % (3812020)Peak memory usage: 14 MB
% 7.71/1.63  % (3812020)Instructions burned: 132 (million)
% 7.71/1.63  % (3812029)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1595131708:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 7.71/1.63  % (3812030)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=513293782:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.71/1.63  % TRYING [1]
% 7.71/1.63  % (3812031)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=667701261:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.71/1.63  % TRYING [2]
% 7.71/1.63  % TRYING [3]
% 7.71/1.63  % TRYING [6]
% 7.71/1.63  % (3812021)Instruction limit reached! 
% 7.71/1.63  % (3812021)------------------------------
% 7.71/1.63  % (3812021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812021)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812021)Termination reason: Instruction limit
% 7.71/1.63  % (3812021)Termination phase: Saturation
% 7.71/1.63  % (3812021)Time elapsed: 0.109 s
% 7.71/1.63  % (3812021)Peak memory usage: 14 MB
% 7.71/1.63  % (3812021)Instructions burned: 160 (million)
% 7.71/1.63  % TRYING [4]
% 7.71/1.63  % (3812035)ott-21_1_sil=16000:fs=off:random_seed=160794382:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.71/1.63  % (3812030)Instruction limit reached! 
% 7.71/1.63  % (3812030)------------------------------
% 7.71/1.63  % (3812030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812030)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812030)Termination reason: Instruction limit
% 7.71/1.63  % (3812030)Termination phase: Saturation
% 7.71/1.63  % (3812030)Time elapsed: 0.075 s
% 7.71/1.63  % (3812030)Peak memory usage: 13 MB
% 7.71/1.63  % (3812030)Instructions burned: 133 (million)
% 7.71/1.63  % TRYING [5]
% 7.71/1.63  % (3812037)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=415479781:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 7.71/1.63  % (3812035)Instruction limit reached! 
% 7.71/1.63  % (3812035)------------------------------
% 7.71/1.63  % (3812035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812035)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812035)Termination reason: Instruction limit
% 7.71/1.63  % (3812035)Termination phase: Saturation
% 7.71/1.63  % (3812035)Time elapsed: 0.092 s
% 7.71/1.63  % (3812035)Peak memory usage: 14 MB
% 7.71/1.63  % (3812035)Instructions burned: 181 (million)
% 7.71/1.63  % TRYING [7]
% 7.71/1.63  % (3812039)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1858939494:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.71/1.63  % TRYING [1]
% 7.71/1.63  % TRYING [2]
% 7.71/1.63  % TRYING [3]
% 7.71/1.63  % TRYING [4]
% 7.71/1.63  % TRYING [6]
% 7.71/1.63  % (3812029)Instruction limit reached! 
% 7.71/1.63  % (3812029)------------------------------
% 7.71/1.63  % (3812029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812029)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812029)Termination reason: Instruction limit
% 7.71/1.63  % (3812029)Termination phase: Finite model building constraint generation
% 7.71/1.63  % (3812029)Time elapsed: 0.296 s
% 7.71/1.63  % (3812029)Peak memory usage: 28 MB
% 7.71/1.63  % (3812029)Instructions burned: 714 (million)
% 7.71/1.63  % (3812041)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2587614452:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 7.71/1.63  % TRYING [5]
% 7.71/1.63  % (3812031)Instruction limit reached! 
% 7.71/1.63  % (3812031)------------------------------
% 7.71/1.63  % (3812031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812031)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812031)Termination reason: Instruction limit
% 7.71/1.63  % (3812031)Termination phase: Saturation
% 7.71/1.63  % (3812031)Time elapsed: 0.371 s
% 7.71/1.63  % (3812031)Peak memory usage: 22 MB
% 7.71/1.63  % (3812031)Instructions burned: 684 (million)
% 7.71/1.63  % (3812043)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2440928766:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 7.71/1.63  % (3812037)Instruction limit reached! 
% 7.71/1.63  % (3812037)------------------------------
% 7.71/1.63  % (3812037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812037)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812037)Termination reason: Instruction limit
% 7.71/1.63  % (3812037)Termination phase: Saturation
% 7.71/1.63  % (3812037)Time elapsed: 0.310 s
% 7.71/1.63  % (3812037)Peak memory usage: 14 MB
% 7.71/1.63  % (3812037)Instructions burned: 478 (million)
% 7.71/1.63  % (3812045)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=1296354160: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)
% 7.71/1.63  % TRYING [8]
% 7.71/1.63  % TRYING [14]
% 7.71/1.63  % (3812039)Instruction limit reached! 
% 7.71/1.63  % (3812039)------------------------------
% 7.71/1.63  % (3812039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812039)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812039)Termination reason: Instruction limit
% 7.71/1.63  % (3812039)Termination phase: Finite model building SAT solving
% 7.71/1.63  % (3812039)Time elapsed: 0.353 s
% 7.71/1.63  % (3812039)Peak memory usage: 23 MB
% 7.71/1.63  % (3812039)Instructions burned: 866 (million)
% 7.71/1.63  % (3812047)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=650110923:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 7.71/1.63  % (3812043)Instruction limit reached! 
% 7.71/1.63  % (3812043)------------------------------
% 7.71/1.63  % (3812043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812043)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812043)Termination reason: Instruction limit
% 7.71/1.63  % (3812043)Termination phase: Finite model building constraint generation
% 7.71/1.63  % (3812043)Time elapsed: 0.320 s
% 7.71/1.63  % (3812043)Peak memory usage: 70 MB
% 7.71/1.63  % (3812043)Instructions burned: 889 (million)
% 7.71/1.63  % (3812049)fmb+10_1_sil=64000:random_seed=1344768462:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 7.71/1.63  % TRYING [1]
% 7.71/1.63  % TRYING [2]
% 7.71/1.63  % TRYING [3]
% 7.71/1.63  % (3812045)Instruction limit reached! 
% 7.71/1.63  % (3812045)------------------------------
% 7.71/1.63  % (3812045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812045)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812045)Termination reason: Instruction limit
% 7.71/1.63  % (3812045)Termination phase: Saturation
% 7.71/1.63  % (3812045)Time elapsed: 0.381 s
% 7.71/1.63  % (3812045)Peak memory usage: 21 MB
% 7.71/1.63  % (3812045)Instructions burned: 693 (million)
% 7.71/1.63  % TRYING [4]
% 7.71/1.63  % (3812051)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=915714968:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 7.71/1.63  % TRYING [20]
% 7.71/1.63  % TRYING [5]
% 7.71/1.63  % (3812041)Instruction limit reached! 
% 7.71/1.63  % (3812041)------------------------------
% 7.71/1.63  % (3812041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812041)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812041)Termination reason: Instruction limit
% 7.71/1.63  % (3812041)Termination phase: Saturation
% 7.71/1.63  % (3812041)Time elapsed: 0.643 s
% 7.71/1.63  % (3812041)Peak memory usage: 29 MB
% 7.71/1.63  % (3812041)Instructions burned: 1179 (million)
% 7.71/1.63  % (3812053)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2950851839:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 7.71/1.63  % TRYING [8]
% 7.71/1.63  % (3812047)Instruction limit reached! 
% 7.71/1.63  % (3812047)------------------------------
% 7.71/1.63  % (3812047)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812047)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812047)Termination reason: Instruction limit
% 7.71/1.63  % (3812047)Termination phase: Saturation
% 7.71/1.63  % (3812047)Time elapsed: 0.483 s
% 7.71/1.63  % (3812047)Peak memory usage: 21 MB
% 7.71/1.63  % (3812047)Instructions burned: 880 (million)
% 7.71/1.63  % TRYING [9]
% 7.71/1.63  % (3812055)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4025027998:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 7.71/1.63  % (3812055) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3812010-3812055"...
% 7.71/1.63  % (3812055)...printing done.
% 7.71/1.63  % (3812055)Refutation found. Thanks to Tanya!
% 7.71/1.63  % SZS status Theorem for theBenchmark
% 7.71/1.63  % SZS output start Proof for theBenchmark
% See solution above
% 7.71/1.63  % (3812055)------------------------------
% 7.71/1.63  % (3812055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.71/1.63  % (3812055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.71/1.63  % (3812055)CaDiCaL version: 2.1.3
% 7.71/1.63  % (3812055)Termination reason: Refutation
% 7.71/1.63  % (3812055)Time elapsed: 0.053 s
% 7.71/1.63  % (3812055)Peak memory usage: 13 MB
% 7.71/1.63  % (3812055)Instructions burned: 96 (million)
% 7.71/1.63  % (3812010)Success in time 1.232 s
% 7.71/1.63  % Vampire exiting
%------------------------------------------------------------------------------