↑ 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  : SWC072+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 : n010.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:32 PM UTC 2026

% Result   : Theorem 22.69s 3.68s
% Output   : Refutation 22.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  149 (   9 unt;   9 def)
%            Number of atoms       :  552 ( 119 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  701 ( 298   ~; 319   |;  45   &)
%                                         (  13 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :  111 (   0 sgn  93   !;  18   ?)

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

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

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

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

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

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(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).

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

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

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(f198,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f81]) ).

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
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X4,nil)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4) )
                  & ( nil = X2
                    | nil != X3 )
                  & ( nil != X1
                    | nil != X0 )
                  & ( ! [X5] :
                        ( ~ ssList(X5)
                        | X2 = X5
                        | ! [X6] :
                            ( ~ ssList(X6)
                            | ! [X7] :
                                ( ~ ssList(X7)
                                | tl(X3) != X6
                                | app(X6,X7) != X5
                                | ! [X8] :
                                    ( ~ ssItem(X8)
                                    | cons(X8,nil) != X7
                                    | hd(X3) != X8
                                    | ~ neq(nil,X3) )
                                | ~ neq(nil,X3) ) ) )
                    | ~ neq(X3,nil) ) )
              & 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] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f304,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f119]) ).

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

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

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

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

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

fof(f391,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | cons(X1,X0) = app(cons(X1,nil),X0) ),
    inference(cnf_transformation,[],[f198]) ).

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

fof(f410,plain,
    ! [X8,X6,X7,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | hd(sK50) != X8
      | cons(X8,nil) != X7
      | ~ ssItem(X8)
      | app(X6,X7) != X5
      | tl(sK50) != X6
      | ~ ssList(X7)
      | ~ ssList(X6)
      | sK49 = X5
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f221]) ).

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

fof(f412,plain,
    ( nil != sK50
    | nil = sK49 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f413,plain,
    ( nil != sK47
    | nil != sK48 ),
    inference(cnf_transformation,[],[f221]) ).

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

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

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

fof(f422,plain,
    ( nil != sK49
    | nil != sK50 ),
    inference(definition_unfolding,[],[f413,f414,f415]) ).

fof(f423,plain,
    ! [X4] :
      ( ~ neq(X4,nil)
      | ~ segmentP(sK50,X4)
      | ~ segmentP(sK49,X4)
      | ~ ssList(X4) ),
    inference(definition_unfolding,[],[f411,f414,f415]) ).

fof(f429,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,[],[f240]) ).

fof(f449,plain,
    ! [X6,X7,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | cons(hd(sK50),nil) != X7
      | ~ ssItem(hd(sK50))
      | app(X6,X7) != X5
      | tl(sK50) != X6
      | ~ ssList(X7)
      | ~ ssList(X6)
      | sK49 = X5
      | ~ ssList(X5) ),
    inference(equality_resolution,[],[f410]) ).

fof(f450,plain,
    ! [X6,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | ~ ssItem(hd(sK50))
      | app(X6,cons(hd(sK50),nil)) != X5
      | tl(sK50) != X6
      | ~ ssList(cons(hd(sK50),nil))
      | ~ ssList(X6)
      | sK49 = X5
      | ~ ssList(X5) ),
    inference(equality_resolution,[],[f449]) ).

fof(f451,plain,
    ! [X6] :
      ( ~ neq(sK50,nil)
      | ~ neq(nil,sK50)
      | ~ ssItem(hd(sK50))
      | tl(sK50) != X6
      | ~ ssList(cons(hd(sK50),nil))
      | ~ ssList(X6)
      | sK49 = app(X6,cons(hd(sK50),nil))
      | ~ ssList(app(X6,cons(hd(sK50),nil))) ),
    inference(equality_resolution,[],[f450]) ).

fof(f452,plain,
    ( ~ neq(sK50,nil)
    | ~ neq(nil,sK50)
    | ~ ssItem(hd(sK50))
    | ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
    inference(equality_resolution,[],[f451]) ).

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

fof(f463,plain,
    ( nil = sK49
    | ~ spl51_1 ),
    inference(avatar_component_clause,[],[f461]) ).

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

fof(f466,plain,
    ( nil = sK50
    | ~ spl51_2 ),
    inference(avatar_component_clause,[],[f465]) ).

fof(f467,plain,
    ( nil != sK50
    | spl51_2 ),
    inference(avatar_component_clause,[],[f465]) ).

fof(f468,plain,
    ( spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f412,f465,f461]) ).

fof(f470,definition,
    ( spl51_3
  <=> ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
    introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).

fof(f471,plain,
    ( ssList(app(tl(sK50),cons(hd(sK50),nil)))
    | ~ spl51_3 ),
    inference(avatar_component_clause,[],[f470]) ).

fof(f472,plain,
    ( ~ ssList(app(tl(sK50),cons(hd(sK50),nil)))
    | spl51_3 ),
    inference(avatar_component_clause,[],[f470]) ).

fof(f474,definition,
    ( spl51_4
  <=> sK49 = app(tl(sK50),cons(hd(sK50),nil)) ),
    introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).

fof(f476,plain,
    ( sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | ~ spl51_4 ),
    inference(avatar_component_clause,[],[f474]) ).

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

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

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

fof(f482,definition,
    ( spl51_6
  <=> ssList(cons(hd(sK50),nil)) ),
    introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).

fof(f483,plain,
    ( ssList(cons(hd(sK50),nil))
    | ~ spl51_6 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f484,plain,
    ( ~ ssList(cons(hd(sK50),nil))
    | spl51_6 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f486,definition,
    ( spl51_7
  <=> ssItem(hd(sK50)) ),
    introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).

fof(f487,plain,
    ( ssItem(hd(sK50))
    | ~ spl51_7 ),
    inference(avatar_component_clause,[],[f486]) ).

fof(f488,plain,
    ( ~ ssItem(hd(sK50))
    | spl51_7 ),
    inference(avatar_component_clause,[],[f486]) ).

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

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

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

fof(f496,plain,
    ( ~ neq(sK50,nil)
    | spl51_9 ),
    inference(avatar_component_clause,[],[f494]) ).

fof(f497,plain,
    ( ~ spl51_3
    | spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7
    | ~ spl51_8
    | ~ spl51_9 ),
    inference(avatar_split_clause,[],[f452,f494,f490,f486,f482,f478,f474,f470]) ).

fof(f550,plain,
    ( ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | spl51_3 ),
    inference(resolution,[],[f317,f472]) ).

fof(f563,plain,
    ( ~ spl51_5
    | ~ spl51_6
    | spl51_3 ),
    inference(avatar_split_clause,[],[f550,f470,f482,f478]) ).

fof(f564,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_5 ),
    inference(resolution,[],[f480,f315]) ).

fof(f565,plain,
    ( ~ ssList(sK50)
    | spl51_2
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f564,f467]) ).

fof(f566,plain,
    ( $false
    | spl51_2
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f565,f416]) ).

fof(f567,plain,
    ( spl51_2
    | spl51_5 ),
    inference(avatar_contradiction_clause,[],[f566]) ).

fof(f570,plain,
    ( ~ ssItem(hd(sK50))
    | ~ ssList(nil)
    | spl51_6 ),
    inference(resolution,[],[f484,f304]) ).

fof(f571,plain,
    ( ~ ssItem(hd(sK50))
    | spl51_6 ),
    inference(forward_subsumption_resolution,[],[f570,f305]) ).

fof(f572,plain,
    ( ~ spl51_7
    | spl51_6 ),
    inference(avatar_split_clause,[],[f571,f482,f486]) ).

fof(f573,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_7 ),
    inference(resolution,[],[f488,f313]) ).

fof(f574,plain,
    ( ~ ssList(sK50)
    | spl51_2
    | spl51_7 ),
    inference(forward_subsumption_resolution,[],[f573,f467]) ).

fof(f575,plain,
    ( $false
    | spl51_2
    | spl51_7 ),
    inference(forward_subsumption_resolution,[],[f574,f416]) ).

fof(f576,plain,
    ( spl51_2
    | spl51_7 ),
    inference(avatar_contradiction_clause,[],[f575]) ).

fof(f588,plain,
    ( nil != sK50
    | ~ spl51_1 ),
    inference(forward_subsumption_resolution,[],[f422,f463]) ).

fof(f589,plain,
    ( $false
    | ~ spl51_1
    | ~ spl51_2 ),
    inference(forward_subsumption_resolution,[],[f588,f466]) ).

fof(f590,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(avatar_contradiction_clause,[],[f589]) ).

fof(f592,plain,
    ( cons(hd(sK50),nil) = app(nil,cons(hd(sK50),nil))
    | ~ spl51_6 ),
    inference(resolution,[],[f483,f319]) ).

fof(f593,plain,
    ( app(tl(sK50),cons(hd(sK50),nil)) = app(app(tl(sK50),cons(hd(sK50),nil)),nil)
    | ~ spl51_3 ),
    inference(resolution,[],[f471,f396]) ).

fof(f640,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | cons(hd(sK50),X0) != X0 )
    | ~ spl51_7 ),
    inference(resolution,[],[f306,f487]) ).

fof(f664,plain,
    ( nil != cons(hd(sK50),nil)
    | ~ spl51_7 ),
    inference(resolution,[],[f640,f305]) ).

fof(f709,plain,
    ! [X0] :
      ( ~ ssList(nil)
      | nil = X0
      | ~ ssList(X0)
      | ~ segmentP(sK50,X0)
      | ~ segmentP(sK49,X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f302,f423]) ).

fof(f712,plain,
    ( ~ ssList(sK50)
    | nil = sK50
    | ~ ssList(nil)
    | spl51_8 ),
    inference(resolution,[],[f302,f492]) ).

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

fof(f716,plain,
    ( nil = sK50
    | ~ ssList(nil)
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f712,f416]) ).

fof(f717,plain,
    ! [X0] :
      ( ~ segmentP(sK49,X0)
      | ~ ssList(X0)
      | ~ segmentP(sK50,X0)
      | nil = X0 ),
    inference(forward_subsumption_resolution,[],[f715,f305]) ).

fof(f718,plain,
    ( ~ ssList(nil)
    | spl51_2
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f716,f467]) ).

fof(f720,plain,
    ( $false
    | spl51_2
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f718,f305]) ).

fof(f721,plain,
    ( spl51_2
    | spl51_8 ),
    inference(avatar_contradiction_clause,[],[f720]) ).

fof(f722,plain,
    ( ~ ssList(nil)
    | nil = sK50
    | ~ ssList(sK50)
    | spl51_9 ),
    inference(resolution,[],[f496,f302]) ).

fof(f724,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_9 ),
    inference(forward_subsumption_resolution,[],[f722,f305]) ).

fof(f725,plain,
    ( ~ ssList(sK50)
    | spl51_2
    | spl51_9 ),
    inference(forward_subsumption_resolution,[],[f724,f467]) ).

fof(f726,plain,
    ( $false
    | spl51_2
    | spl51_9 ),
    inference(forward_subsumption_resolution,[],[f725,f416]) ).

fof(f727,plain,
    ( spl51_2
    | spl51_9 ),
    inference(avatar_contradiction_clause,[],[f726]) ).

fof(f1160,plain,
    ( nil = sK50
    | sK50 = cons(hd(sK50),tl(sK50)) ),
    inference(resolution,[],[f388,f416]) ).

fof(f1161,plain,
    ( sK50 = cons(hd(sK50),tl(sK50))
    | spl51_2 ),
    inference(forward_subsumption_resolution,[],[f1160,f467]) ).

fof(f1262,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | cons(X0,tl(sK50)) = app(cons(X0,nil),tl(sK50)) )
    | ~ spl51_5 ),
    inference(resolution,[],[f391,f479]) ).

fof(f2635,plain,
    ( ! [X0] :
        ( segmentP(app(cons(hd(sK50),nil),X0),cons(hd(sK50),nil))
        | ~ ssList(cons(hd(sK50),nil))
        | ~ ssList(X0)
        | ~ ssList(nil)
        | ~ ssList(app(cons(hd(sK50),nil),X0)) )
    | ~ spl51_6 ),
    inference(superposition,[],[f429,f592]) ).

fof(f2647,plain,
    ( segmentP(app(tl(sK50),cons(hd(sK50),nil)),cons(hd(sK50),nil))
    | ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(nil)
    | ~ ssList(tl(sK50))
    | ~ ssList(app(tl(sK50),cons(hd(sK50),nil)))
    | ~ spl51_3 ),
    inference(superposition,[],[f429,f593]) ).

fof(f2654,plain,
    ( segmentP(app(tl(sK50),cons(hd(sK50),nil)),cons(hd(sK50),nil))
    | ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(nil)
    | ~ ssList(tl(sK50))
    | ~ spl51_3 ),
    inference(forward_subsumption_resolution,[],[f2647,f317]) ).

fof(f2662,plain,
    ( ! [X0] :
        ( segmentP(app(cons(hd(sK50),nil),X0),cons(hd(sK50),nil))
        | ~ ssList(cons(hd(sK50),nil))
        | ~ ssList(X0)
        | ~ ssList(nil) )
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2635,f317]) ).

fof(f2665,plain,
    ( segmentP(app(tl(sK50),cons(hd(sK50),nil)),cons(hd(sK50),nil))
    | ~ ssList(nil)
    | ~ ssList(tl(sK50))
    | ~ spl51_3
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2654,f483]) ).

fof(f2672,plain,
    ( ! [X0] :
        ( segmentP(app(cons(hd(sK50),nil),X0),cons(hd(sK50),nil))
        | ~ ssList(X0)
        | ~ ssList(nil) )
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2662,f483]) ).

fof(f2673,plain,
    ( segmentP(app(tl(sK50),cons(hd(sK50),nil)),cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | ~ spl51_3
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2665,f305]) ).

fof(f2678,plain,
    ( ! [X0] :
        ( segmentP(app(cons(hd(sK50),nil),X0),cons(hd(sK50),nil))
        | ~ ssList(X0) )
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2672,f305]) ).

fof(f2679,plain,
    ( segmentP(app(tl(sK50),cons(hd(sK50),nil)),cons(hd(sK50),nil))
    | ~ spl51_3
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f2673,f479]) ).

fof(f2681,plain,
    ( segmentP(sK49,cons(hd(sK50),nil))
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(forward_demodulation,[],[f2679,f476]) ).

fof(f3047,plain,
    ( ~ ssList(cons(hd(sK50),nil))
    | ~ segmentP(sK50,cons(hd(sK50),nil))
    | nil = cons(hd(sK50),nil)
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(resolution,[],[f717,f2681]) ).

fof(f3059,plain,
    ( ~ segmentP(sK50,cons(hd(sK50),nil))
    | nil = cons(hd(sK50),nil)
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f3047,f483]) ).

fof(f3062,plain,
    ( ~ segmentP(sK50,cons(hd(sK50),nil))
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f3059,f664]) ).

fof(f3572,plain,
    ( cons(hd(sK50),tl(sK50)) = app(cons(hd(sK50),nil),tl(sK50))
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(resolution,[],[f1262,f487]) ).

fof(f3592,plain,
    ( sK50 = app(cons(hd(sK50),nil),tl(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(forward_demodulation,[],[f3572,f1161]) ).

fof(f66721,plain,
    ( segmentP(sK50,cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(superposition,[],[f2678,f3592]) ).

fof(f66726,plain,
    ( ~ ssList(tl(sK50))
    | spl51_2
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f66721,f3062]) ).

fof(f66774,plain,
    ( $false
    | spl51_2
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f66726,f479]) ).

fof(f66775,plain,
    ( spl51_2
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(avatar_contradiction_clause,[],[f66774]) ).

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

cnf(s2,plain,
    ( ~ spl51_3
    | spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7
    | ~ spl51_8
    | ~ spl51_9 ),
    inference(sat_conversion,[],[f497]) ).

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

cnf(s4,plain,
    ( spl51_2
    | spl51_5 ),
    inference(sat_conversion,[],[f567]) ).

cnf(s5,plain,
    ( spl51_6
    | ~ spl51_7 ),
    inference(sat_conversion,[],[f572]) ).

cnf(s6,plain,
    ( spl51_2
    | spl51_7 ),
    inference(sat_conversion,[],[f576]) ).

cnf(s7,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(sat_conversion,[],[f590]) ).

cnf(s9,plain,
    ( spl51_2
    | spl51_8 ),
    inference(sat_conversion,[],[f721]) ).

cnf(s10,plain,
    ( spl51_2
    | spl51_9 ),
    inference(sat_conversion,[],[f727]) ).

cnf(s74,plain,
    ( spl51_2
    | ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(sat_conversion,[],[f66775]) ).

cnf(s87,plain,
    spl51_2,
    inference(rat,[],[s2,s74,s3,s5,s4,s6,s9,s10]) ).

cnf(s88,plain,
    ~ spl51_1,
    inference(rat,[],[s7,s87]) ).

cnf(s89,plain,
    $false,
    inference(rat,[],[s1,s87,s88]) ).

fof(f66823,plain,
    $false,
    inference(avatar_sat_refutation,[],[s89]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC072+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.35  % Computer : n010.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 28 07:43:47 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39  Running first-order model finding
% 0.14/0.39  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
% 14.88/2.58  % (1750287)Will run a generic schedule for satisfiability detection.
% 14.88/2.58  % (1750292)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3972306082_2999 on theBenchmark for (2999ds/0Mi)
% 14.88/2.58  % (1750293)% WARNING: option uhcvi not known.
% 14.88/2.58  % (1750294)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1216717022:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 14.88/2.58  % (1750297)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2402776800:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 14.88/2.58  % (1750295)dis+10_1_sil=32000:sp=arity:random_seed=325074596:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 14.88/2.58  % (1750296)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1463860239:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 14.88/2.58  % TRYING [1]
% 14.88/2.58  % (1750293)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4215614506:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 14.88/2.58  % (1750298)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2929892365:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 14.88/2.58  % TRYING [2]
% 14.88/2.58  % TRYING [3]
% 14.88/2.58  % TRYING [4]
% 14.88/2.58  % TRYING [5]
% 14.88/2.58  % (1750295)Instruction limit reached! 
% 14.88/2.58  % (1750295)------------------------------
% 14.88/2.58  % (1750295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.88/2.58  % (1750295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.88/2.58  % (1750295)CaDiCaL version: 2.1.3
% 14.88/2.58  % (1750295)Termination reason: Instruction limit
% 14.88/2.58  % (1750295)Termination phase: Saturation
% 14.88/2.58  % (1750295)Time elapsed: 0.062 s
% 14.88/2.58  % (1750295)Peak memory usage: 13 MB
% 14.88/2.58  % (1750295)Instructions burned: 105 (million)
% 14.88/2.58  % (1750296)Instruction limit reached! 
% 14.88/2.58  % (1750296)------------------------------
% 14.88/2.58  % (1750296)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.88/2.58  % (1750296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.88/2.58  % (1750296)CaDiCaL version: 2.1.3
% 14.88/2.58  % (1750296)Termination reason: Instruction limit
% 14.88/2.58  % (1750296)Termination phase: Saturation
% 14.88/2.58  % (1750296)Time elapsed: 0.071 s
% 14.88/2.58  % (1750296)Peak memory usage: 13 MB
% 14.88/2.58  % (1750296)Instructions burned: 118 (million)
% 14.88/2.58  % (1750297)Instruction limit reached! 
% 14.88/2.58  % (1750297)------------------------------
% 14.88/2.58  % (1750297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.88/2.58  % (1750297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.88/2.58  % (1750297)CaDiCaL version: 2.1.3
% 14.88/2.58  % (1750297)Termination reason: Instruction limit
% 14.88/2.58  % (1750297)Termination phase: Saturation
% 14.88/2.58  % (1750297)Time elapsed: 0.076 s
% 14.88/2.58  % (1750297)Peak memory usage: 14 MB
% 14.88/2.58  % (1750297)Instructions burned: 131 (million)
% 14.88/2.58  % (1750306)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2905142307:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 14.88/2.58  % (1750307)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2427345635:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 14.88/2.58  % (1750308)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=2878461706:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 14.88/2.58  % TRYING [1]
% 14.88/2.58  % TRYING [2]
% 14.88/2.58  % (1750298)Instruction limit reached! 
% 14.88/2.58  % (1750298)------------------------------
% 14.88/2.58  % (1750298)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.88/2.58  % (1750298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.88/2.58  % (1750298)CaDiCaL version: 2.1.3
% 14.88/2.58  % (1750298)Termination reason: Instruction limit
% 14.88/2.58  % (1750298)Termination phase: Saturation
% 14.88/2.58  % (1750298)Time elapsed: 0.103 s
% 14.88/2.58  % (1750298)Peak memory usage: 15 MB
% 14.88/2.58  % (1750298)Instructions burned: 164 (million)
% 14.88/2.58  % TRYING [3]
% 14.88/2.58  % TRYING [6]
% 14.88/2.58  % TRYING [4]
% 14.88/2.58  % (1750312)ott-21_1_sil=16000:fs=off:random_seed=1786836689:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 14.88/2.58  % (1750307)Instruction limit reached! 
% 14.88/2.58  % (1750307)------------------------------
% 14.88/2.58  % (1750307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750307)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750307)Termination reason: Instruction limit
% 22.69/3.68  % (1750307)Termination phase: Saturation
% 22.69/3.68  % (1750307)Time elapsed: 0.071 s
% 22.69/3.68  % (1750307)Peak memory usage: 13 MB
% 22.69/3.68  % (1750307)Instructions burned: 131 (million)
% 22.69/3.68  % TRYING [5]
% 22.69/3.68  % (1750314)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3307625632:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 22.69/3.68  % (1750312)Instruction limit reached! 
% 22.69/3.68  % (1750312)------------------------------
% 22.69/3.68  % (1750312)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750312)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750312)Termination reason: Instruction limit
% 22.69/3.68  % (1750312)Termination phase: Saturation
% 22.69/3.68  % (1750312)Time elapsed: 0.093 s
% 22.69/3.68  % (1750312)Peak memory usage: 14 MB
% 22.69/3.68  % (1750312)Instructions burned: 182 (million)
% 22.69/3.68  % (1750316)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2864183715:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 22.69/3.68  % TRYING [1]
% 22.69/3.68  % TRYING [2]
% 22.69/3.68  % TRYING [7]
% 22.69/3.68  % TRYING [3]
% 22.69/3.68  % TRYING [4]
% 22.69/3.68  % TRYING [6]
% 22.69/3.68  % (1750306)Instruction limit reached! 
% 22.69/3.68  % (1750306)------------------------------
% 22.69/3.68  % (1750306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750306)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750306)Termination reason: Instruction limit
% 22.69/3.68  % (1750306)Termination phase: Finite model building constraint generation
% 22.69/3.68  % (1750306)Time elapsed: 0.295 s
% 22.69/3.68  % (1750306)Peak memory usage: 27 MB
% 22.69/3.68  % (1750306)Instructions burned: 715 (million)
% 22.69/3.68  % (1750318)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4011430109:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 22.69/3.68  % TRYING [5]
% 22.69/3.68  % (1750308)Instruction limit reached! 
% 22.69/3.68  % (1750308)------------------------------
% 22.69/3.68  % (1750308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750308)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750308)Termination reason: Instruction limit
% 22.69/3.68  % (1750308)Termination phase: Saturation
% 22.69/3.68  % (1750308)Time elapsed: 0.394 s
% 22.69/3.68  % (1750308)Peak memory usage: 20 MB
% 22.69/3.68  % (1750308)Instructions burned: 685 (million)
% 22.69/3.68  % (1750320)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=501968673:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 22.69/3.68  % (1750314)Instruction limit reached! 
% 22.69/3.68  % (1750314)------------------------------
% 22.69/3.68  % (1750314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750314)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750314)Termination reason: Instruction limit
% 22.69/3.68  % (1750314)Termination phase: Saturation
% 22.69/3.68  % (1750314)Time elapsed: 0.333 s
% 22.69/3.68  % (1750314)Peak memory usage: 14 MB
% 22.69/3.68  % (1750314)Instructions burned: 478 (million)
% 22.69/3.68  % (1750322)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=1331282096: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)
% 22.69/3.68  % (1750316)Instruction limit reached! 
% 22.69/3.68  % (1750316)------------------------------
% 22.69/3.68  % (1750316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750316)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750316)Termination reason: Instruction limit
% 22.69/3.68  % (1750316)Termination phase: Finite model building SAT solving
% 22.69/3.68  % (1750316)Time elapsed: 0.352 s
% 22.69/3.68  % (1750316)Peak memory usage: 23 MB
% 22.69/3.68  % (1750316)Instructions burned: 866 (million)
% 22.69/3.68  % (1750324)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3202071797:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 22.69/3.68  % TRYING [14]
% 22.69/3.68  % TRYING [8]
% 22.69/3.68  % (1750320)Instruction limit reached! 
% 22.69/3.68  % (1750320)------------------------------
% 22.69/3.68  % (1750320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750320)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750320)Termination reason: Instruction limit
% 22.69/3.68  % (1750320)Termination phase: Finite model building constraint generation
% 22.69/3.68  % (1750320)Time elapsed: 0.322 s
% 22.69/3.68  % (1750320)Peak memory usage: 70 MB
% 22.69/3.68  % (1750320)Instructions burned: 889 (million)
% 22.69/3.68  % (1750326)fmb+10_1_sil=64000:random_seed=1632294792:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 22.69/3.68  % TRYING [1]
% 22.69/3.68  % TRYING [2]
% 22.69/3.68  % TRYING [3]
% 22.69/3.68  % (1750322)Instruction limit reached! 
% 22.69/3.68  % (1750322)------------------------------
% 22.69/3.68  % (1750322)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750322)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750322)Termination reason: Instruction limit
% 22.69/3.68  % (1750322)Termination phase: Saturation
% 22.69/3.68  % (1750322)Time elapsed: 0.388 s
% 22.69/3.68  % (1750322)Peak memory usage: 21 MB
% 22.69/3.68  % (1750322)Instructions burned: 692 (million)
% 22.69/3.68  % TRYING [4]
% 22.69/3.68  % (1750328)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2928688602:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 22.69/3.68  % TRYING [20]
% 22.69/3.68  % (1750318)Instruction limit reached! 
% 22.69/3.68  % (1750318)------------------------------
% 22.69/3.68  % (1750318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750318)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750318)Termination reason: Instruction limit
% 22.69/3.68  % (1750318)Termination phase: Saturation
% 22.69/3.68  % (1750318)Time elapsed: 0.639 s
% 22.69/3.68  % (1750318)Peak memory usage: 29 MB
% 22.69/3.68  % (1750318)Instructions burned: 1179 (million)
% 22.69/3.68  % TRYING [5]
% 22.69/3.68  % (1750330)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1307012325:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 22.69/3.68  % (1750324)Instruction limit reached! 
% 22.69/3.68  % (1750324)------------------------------
% 22.69/3.68  % (1750324)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750324)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750324)Termination reason: Instruction limit
% 22.69/3.68  % (1750324)Termination phase: Saturation
% 22.69/3.68  % (1750324)Time elapsed: 0.464 s
% 22.69/3.68  % (1750324)Peak memory usage: 21 MB
% 22.69/3.68  % (1750324)Instructions burned: 879 (million)
% 22.69/3.68  % TRYING [8]
% 22.69/3.68  % (1750332)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2931852886:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 22.69/3.68  % TRYING [6]
% 22.69/3.68  % (1750330)Instruction limit reached! 
% 22.69/3.68  % (1750330)------------------------------
% 22.69/3.68  % (1750330)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750330)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750330)Termination reason: Instruction limit
% 22.69/3.68  % (1750330)Termination phase: Finite model building constraint generation
% 22.69/3.68  % (1750330)Time elapsed: 0.341 s
% 22.69/3.68  % (1750330)Peak memory usage: 69 MB
% 22.69/3.68  % (1750330)Instructions burned: 920 (million)
% 22.69/3.68  % (1750334)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=614702720:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 22.69/3.68  % TRYING [9]
% 22.69/3.68  % TRYING [7]
% 22.69/3.68  % (1750334)Instruction limit reached! 
% 22.69/3.68  % (1750334)------------------------------
% 22.69/3.68  % (1750334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750334)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750334)Termination reason: Instruction limit
% 22.69/3.68  % (1750334)Termination phase: Saturation
% 22.69/3.68  % (1750334)Time elapsed: 0.688 s
% 22.69/3.68  % (1750334)Peak memory usage: 19 MB
% 22.69/3.68  % (1750334)Instructions burned: 1472 (million)
% 22.69/3.68  % (1750336)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3119898863:i=6324_2978 on theBenchmark for (2978ds/6324Mi)
% 22.69/3.68  % TRYING [77]
% 22.69/3.68  % TRYING [10]
% 22.69/3.68  % (1750332) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1750287-1750332"...
% 22.69/3.68  % (1750332)...printing done.
% 22.69/3.68  % (1750332)Refutation found. Thanks to Tanya!
% 22.69/3.68  % SZS status Theorem for theBenchmark
% 22.69/3.68  % SZS output start Proof for theBenchmark
% See solution above
% 22.69/3.68  % (1750332)------------------------------
% 22.69/3.68  % (1750332)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.69/3.68  % (1750332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.69/3.68  % (1750332)CaDiCaL version: 2.1.3
% 22.69/3.68  % (1750332)Termination reason: Refutation
% 22.69/3.68  % (1750332)Time elapsed: 2.075 s
% 22.69/3.68  % (1750332)Peak memory usage: 40 MB
% 22.69/3.68  % (1750332)Instructions burned: 3775 (million)
% 22.69/3.68  % (1750287)Success in time 3.281 s
% 22.69/3.68  % Vampire exiting
%------------------------------------------------------------------------------