↑ 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  : SWC061+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 : n008.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:30 PM UTC 2026

% Result   : Theorem 18.47s 3.11s
% Output   : Refutation 18.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   19
% Syntax   : Number of formulae    :  167 (  17 unt;   7 def)
%            Number of atoms       :  598 (  99 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  785 ( 354   ~; 358   |;  33   &)
%                                         (  15 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   8 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  105 (   0 sgn  91   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).

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

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(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(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).

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

fof(f84,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(X0,nil) = X0 ),
    file('/export/starexec/sandbox2/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
                  | ( nil != X2
                    & nil = X3 )
                  | ( ! [X4] :
                        ( ssItem(X4)
                       => ! [X5] :
                            ( ~ ssList(X5)
                            | app(cons(X4,nil),X5) != X3
                            | app(X5,cons(X4,nil)) != X2 ) )
                    & neq(X3,nil) )
                  | ( ( nil != X1
                      | nil = X0 )
                    & ( ~ neq(X1,nil)
                      | ? [X6] :
                          ( ssList(X6)
                          & neq(X6,nil)
                          & segmentP(X1,X6)
                          & segmentP(X0,X6) ) ) ) ) ) ) ),
    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
                    | ( nil != X2
                      & nil = X3 )
                    | ( ! [X4] :
                          ( ssItem(X4)
                         => ! [X5] :
                              ( ~ ssList(X5)
                              | app(cons(X4,nil),X5) != X3
                              | app(X5,cons(X4,nil)) != X2 ) )
                      & neq(X3,nil) )
                    | ( ( nil != X1
                        | nil = X0 )
                      & ( ~ neq(X1,nil)
                        | ? [X6] :
                            ( ssList(X6)
                            & neq(X6,nil)
                            & segmentP(X1,X6)
                            & segmentP(X0,X6) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f101,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f5]) ).

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(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(f200,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( nil = app(X0,X1)
          <=> ( nil = X1
              & nil = X0 ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f83]) ).

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

fof(f234,plain,
    ! [X0,X1] :
      ( ~ frontsegP(X0,X1)
      | ~ ssList(X1)
      | app(X1,sK5(X0,X1)) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( ssList(sK5(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ frontsegP(X0,X1) ),
    inference(cnf_transformation,[],[f101]) ).

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

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(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] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f172]) ).

fof(f394,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X1)
      | nil = X1
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f200]) ).

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

fof(f410,plain,
    ( ~ neq(sK50,nil)
    | sK49 = app(sK52,cons(sK51,nil)) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f411,plain,
    ( ~ neq(sK50,nil)
    | sK50 = app(cons(sK51,nil),sK52) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f412,plain,
    ( ~ neq(sK50,nil)
    | ssList(sK52) ),
    inference(cnf_transformation,[],[f221]) ).

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

fof(f415,plain,
    ( ~ neq(sK50,nil)
    | ssItem(sK51) ),
    inference(cnf_transformation,[],[f221]) ).

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

fof(f417,plain,
    ( neq(sK48,nil)
    | nil = sK48 ),
    inference(cnf_transformation,[],[f221]) ).

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

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

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

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

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

fof(f427,plain,
    ( neq(sK50,nil)
    | nil = sK50 ),
    inference(definition_unfolding,[],[f417,f420,f420]) ).

fof(f428,plain,
    ( neq(sK50,nil)
    | nil != sK49 ),
    inference(definition_unfolding,[],[f416,f420,f419]) ).

fof(f430,plain,
    ! [X6] :
      ( ~ segmentP(sK49,X6)
      | ~ segmentP(sK50,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6)
      | nil = sK50 ),
    inference(definition_unfolding,[],[f413,f419,f420,f420]) ).

fof(f434,plain,
    ! [X2,X1] :
      ( ~ ssList(app(X1,X2))
      | ~ ssList(X1)
      | ~ ssList(X2)
      | frontsegP(app(X1,X2),X1) ),
    inference(equality_resolution,[],[f236]) ).

fof(f436,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(f464,definition,
    ( spl53_1
  <=> ssList(sK52) ),
    introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).

fof(f466,plain,
    ( ssList(sK52)
    | ~ spl53_1 ),
    inference(avatar_component_clause,[],[f464]) ).

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

fof(f469,plain,
    ( neq(sK50,nil)
    | ~ spl53_2 ),
    inference(avatar_component_clause,[],[f468]) ).

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

fof(f471,plain,
    ( spl53_1
    | ~ spl53_2 ),
    inference(avatar_split_clause,[],[f412,f468,f464]) ).

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

fof(f475,plain,
    ( nil = sK49
    | ~ spl53_3 ),
    inference(avatar_component_clause,[],[f473]) ).

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

fof(f479,plain,
    ( nil != sK50
    | spl53_4 ),
    inference(avatar_component_clause,[],[f477]) ).

fof(f480,plain,
    ( spl53_3
    | ~ spl53_4 ),
    inference(avatar_split_clause,[],[f418,f477,f473]) ).

fof(f481,plain,
    ( nil = sK50
    | spl53_2 ),
    inference(forward_subsumption_resolution,[],[f427,f470]) ).

fof(f482,plain,
    ( $false
    | spl53_2
    | spl53_4 ),
    inference(forward_subsumption_resolution,[],[f481,f479]) ).

fof(f483,plain,
    ( spl53_2
    | spl53_4 ),
    inference(avatar_contradiction_clause,[],[f482]) ).

fof(f484,plain,
    ( ssList(nil)
    | ~ spl53_3 ),
    inference(superposition,[],[f422,f475]) ).

fof(f487,plain,
    ( nil != sK49
    | spl53_2 ),
    inference(forward_subsumption_resolution,[],[f428,f470]) ).

fof(f488,plain,
    ( $false
    | spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f487,f475]) ).

fof(f489,plain,
    ( spl53_2
    | ~ spl53_3 ),
    inference(avatar_contradiction_clause,[],[f488]) ).

fof(f510,plain,
    ( nil = app(sK52,cons(sK51,nil))
    | ~ neq(sK50,nil)
    | ~ spl53_3 ),
    inference(forward_demodulation,[],[f410,f475]) ).

fof(f512,plain,
    ( ssItem(sK51)
    | ~ spl53_2 ),
    inference(forward_subsumption_resolution,[],[f415,f469]) ).

fof(f513,plain,
    ( sK50 = app(cons(sK51,nil),sK52)
    | ~ spl53_2 ),
    inference(forward_subsumption_resolution,[],[f411,f469]) ).

fof(f514,plain,
    ( nil = app(sK52,cons(sK51,nil))
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f510,f469]) ).

fof(f540,plain,
    sK50 = app(nil,sK50),
    inference(resolution,[],[f319,f421]) ).

fof(f541,plain,
    ( sK52 = app(nil,sK52)
    | ~ spl53_1 ),
    inference(resolution,[],[f319,f466]) ).

fof(f565,plain,
    sK50 = app(sK50,nil),
    inference(resolution,[],[f396,f421]) ).

fof(f643,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | cons(sK51,X0) != X0 )
    | ~ spl53_2 ),
    inference(resolution,[],[f306,f512]) ).

fof(f646,plain,
    ( nil != cons(sK51,nil)
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(resolution,[],[f643,f484]) ).

fof(f938,definition,
    ( spl53_6
  <=> nil = sK52 ),
    introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).

fof(f939,plain,
    ( nil != sK52
    | spl53_6 ),
    inference(avatar_component_clause,[],[f938]) ).

fof(f940,plain,
    ( nil = sK52
    | ~ spl53_6 ),
    inference(avatar_component_clause,[],[f938]) ).

fof(f979,plain,
    ( sK50 = app(cons(sK51,nil),nil)
    | ~ spl53_2
    | ~ spl53_6 ),
    inference(superposition,[],[f513,f940]) ).

fof(f1099,plain,
    ( nil != nil
    | ~ ssList(cons(sK51,nil))
    | nil = cons(sK51,nil)
    | ~ ssList(sK52)
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(superposition,[],[f394,f514]) ).

fof(f1100,plain,
    ( ~ ssList(cons(sK51,nil))
    | nil = cons(sK51,nil)
    | ~ ssList(sK52)
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(trivial_inequality_removal,[],[f1099]) ).

fof(f1102,plain,
    ( ~ ssList(cons(sK51,nil))
    | ~ ssList(sK52)
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f1100,f646]) ).

fof(f1104,plain,
    ( ~ ssList(cons(sK51,nil))
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f1102,f466]) ).

fof(f1106,plain,
    ( ~ ssItem(sK51)
    | ~ ssList(nil)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(resolution,[],[f1104,f304]) ).

fof(f1107,plain,
    ( ~ ssList(nil)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f1106,f512]) ).

fof(f1108,plain,
    ( $false
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(forward_subsumption_resolution,[],[f1107,f484]) ).

fof(f1109,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(avatar_contradiction_clause,[],[f1108]) ).

fof(f1110,plain,
    ( sK49 = app(sK52,cons(sK51,nil))
    | ~ spl53_2 ),
    inference(forward_subsumption_resolution,[],[f410,f469]) ).

fof(f1111,plain,
    ( ! [X6] :
        ( ~ neq(X6,nil)
        | ~ segmentP(sK50,X6)
        | ~ segmentP(sK49,X6)
        | ~ ssList(X6) )
    | spl53_4 ),
    inference(forward_subsumption_resolution,[],[f430,f479]) ).

fof(f1112,plain,
    ( sK49 = app(nil,cons(sK51,nil))
    | ~ spl53_2
    | ~ spl53_6 ),
    inference(forward_demodulation,[],[f1110,f940]) ).

fof(f1126,plain,
    ( ~ segmentP(sK50,sK50)
    | ~ segmentP(sK49,sK50)
    | ~ ssList(sK50)
    | ~ spl53_2
    | spl53_4 ),
    inference(resolution,[],[f1111,f469]) ).

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

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

fof(f1131,plain,
    ( ~ segmentP(sK49,sK50)
    | ~ ssList(sK50)
    | ~ spl53_2
    | spl53_4 ),
    inference(forward_subsumption_resolution,[],[f1126,f356]) ).

fof(f1132,plain,
    ( ~ segmentP(sK49,sK50)
    | ~ spl53_2
    | spl53_4 ),
    inference(forward_subsumption_resolution,[],[f1131,f421]) ).

fof(f1252,plain,
    ! [X2,X1] :
      ( frontsegP(app(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f434,f317]) ).

fof(f1275,definition,
    ( spl53_8
  <=> ssList(cons(sK51,nil)) ),
    introduced(definition,[new_symbols(definition,[spl53_8])],[avatar_definition]) ).

fof(f1276,plain,
    ( ssList(cons(sK51,nil))
    | ~ spl53_8 ),
    inference(avatar_component_clause,[],[f1275]) ).

fof(f1277,plain,
    ( ~ ssList(cons(sK51,nil))
    | spl53_8 ),
    inference(avatar_component_clause,[],[f1275]) ).

fof(f1304,plain,
    ( ~ ssItem(sK51)
    | ~ ssList(nil)
    | spl53_8 ),
    inference(resolution,[],[f1277,f304]) ).

fof(f1338,plain,
    ( cons(sK51,nil) = app(cons(sK51,nil),nil)
    | ~ spl53_8 ),
    inference(resolution,[],[f1276,f396]) ).

fof(f1342,plain,
    ( sK50 = cons(sK51,nil)
    | ~ spl53_2
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_demodulation,[],[f1338,f979]) ).

fof(f1372,plain,
    ( sK49 = app(nil,sK50)
    | ~ spl53_2
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(superposition,[],[f1112,f1342]) ).

fof(f1394,plain,
    ( sK49 = sK50
    | ~ spl53_2
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_demodulation,[],[f1372,f540]) ).

fof(f1625,plain,
    ( ~ segmentP(sK50,sK50)
    | ~ spl53_2
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(superposition,[],[f1132,f1394]) ).

fof(f1644,plain,
    ( ~ ssList(sK50)
    | ~ spl53_2
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(resolution,[],[f1625,f356]) ).

fof(f1648,plain,
    ( $false
    | ~ spl53_2
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1644,f421]) ).

fof(f1649,plain,
    ( ~ spl53_2
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(avatar_contradiction_clause,[],[f1648]) ).

fof(f1659,plain,
    ( frontsegP(sK49,sK52)
    | ~ ssList(cons(sK51,nil))
    | ~ ssList(sK52)
    | ~ spl53_2 ),
    inference(superposition,[],[f1252,f1110]) ).

fof(f1662,plain,
    ( frontsegP(sK49,sK52)
    | ~ ssList(sK52)
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1659,f1276]) ).

fof(f1668,plain,
    ( frontsegP(sK49,sK52)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1662,f466]) ).

fof(f1691,plain,
    ( ~ ssList(sK52)
    | sK49 = app(sK52,sK5(sK49,sK52))
    | ~ ssList(sK49)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(resolution,[],[f1668,f234]) ).

fof(f1692,plain,
    ( sK49 = app(sK52,sK5(sK49,sK52))
    | ~ ssList(sK49)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1691,f466]) ).

fof(f1693,plain,
    ( sK49 = app(sK52,sK5(sK49,sK52))
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1692,f422]) ).

fof(f2365,plain,
    ( ! [X0] :
        ( segmentP(app(sK50,X0),sK52)
        | ~ ssList(sK52)
        | ~ ssList(X0)
        | ~ ssList(cons(sK51,nil))
        | ~ ssList(app(sK50,X0)) )
    | ~ spl53_2 ),
    inference(superposition,[],[f436,f513]) ).

fof(f2368,plain,
    ( ! [X0] :
        ( segmentP(app(sK52,X0),sK52)
        | ~ ssList(sK52)
        | ~ ssList(X0)
        | ~ ssList(nil)
        | ~ ssList(app(sK52,X0)) )
    | ~ spl53_1 ),
    inference(superposition,[],[f436,f541]) ).

fof(f2383,plain,
    ( ! [X0] :
        ( segmentP(app(sK52,X0),sK52)
        | ~ ssList(X0)
        | ~ ssList(nil)
        | ~ ssList(app(sK52,X0)) )
    | ~ spl53_1 ),
    inference(forward_subsumption_resolution,[],[f2368,f466]) ).

fof(f2386,plain,
    ( ! [X0] :
        ( segmentP(app(sK50,X0),sK52)
        | ~ ssList(X0)
        | ~ ssList(cons(sK51,nil))
        | ~ ssList(app(sK50,X0)) )
    | ~ spl53_1
    | ~ spl53_2 ),
    inference(forward_subsumption_resolution,[],[f2365,f466]) ).

fof(f2390,plain,
    ( ! [X0] :
        ( segmentP(app(sK52,X0),sK52)
        | ~ ssList(X0)
        | ~ ssList(app(sK52,X0)) )
    | ~ spl53_1 ),
    inference(forward_subsumption_resolution,[],[f2383,f305]) ).

fof(f2393,plain,
    ( ! [X0] :
        ( segmentP(app(sK50,X0),sK52)
        | ~ ssList(X0)
        | ~ ssList(app(sK50,X0)) )
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f2386,f1276]) ).

fof(f3162,plain,
    ( segmentP(sK50,sK52)
    | ~ ssList(nil)
    | ~ ssList(sK50)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(superposition,[],[f2393,f565]) ).

fof(f3166,plain,
    ( segmentP(sK50,sK52)
    | ~ ssList(sK50)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f3162,f305]) ).

fof(f3170,plain,
    ( segmentP(sK50,sK52)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f3166,f421]) ).

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

fof(f27456,definition,
    ( spl53_40
  <=> ssList(sK5(sK49,sK52)) ),
    introduced(definition,[new_symbols(definition,[spl53_40])],[avatar_definition]) ).

fof(f27457,plain,
    ( ssList(sK5(sK49,sK52))
    | ~ spl53_40 ),
    inference(avatar_component_clause,[],[f27456]) ).

fof(f27458,plain,
    ( ~ ssList(sK5(sK49,sK52))
    | spl53_40 ),
    inference(avatar_component_clause,[],[f27456]) ).

fof(f27470,plain,
    ( ~ ssList(sK52)
    | ~ ssList(sK49)
    | ~ frontsegP(sK49,sK52)
    | spl53_40 ),
    inference(resolution,[],[f27458,f235]) ).

fof(f27471,plain,
    ( ~ ssList(sK49)
    | ~ frontsegP(sK49,sK52)
    | ~ spl53_1
    | spl53_40 ),
    inference(forward_subsumption_resolution,[],[f27470,f466]) ).

fof(f27472,plain,
    ( ~ frontsegP(sK49,sK52)
    | ~ spl53_1
    | spl53_40 ),
    inference(forward_subsumption_resolution,[],[f27471,f422]) ).

fof(f27473,plain,
    ( $false
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8
    | spl53_40 ),
    inference(forward_subsumption_resolution,[],[f27472,f1668]) ).

fof(f27474,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8
    | spl53_40 ),
    inference(avatar_contradiction_clause,[],[f27473]) ).

fof(f55191,plain,
    ( segmentP(sK49,sK52)
    | ~ ssList(sK5(sK49,sK52))
    | ~ ssList(sK49)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8 ),
    inference(superposition,[],[f2390,f1693]) ).

fof(f55239,plain,
    ( segmentP(sK49,sK52)
    | ~ ssList(sK49)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(forward_subsumption_resolution,[],[f55191,f27457]) ).

fof(f55286,plain,
    ( segmentP(sK49,sK52)
    | ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(forward_subsumption_resolution,[],[f55239,f422]) ).

fof(f55289,plain,
    ( ~ segmentP(sK50,sK52)
    | ~ ssList(sK52)
    | nil = sK52
    | ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(resolution,[],[f55286,f3413]) ).

fof(f55367,plain,
    ( ~ ssList(sK52)
    | nil = sK52
    | ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(forward_subsumption_resolution,[],[f55289,f3170]) ).

fof(f55406,plain,
    ( nil = sK52
    | ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(forward_subsumption_resolution,[],[f55367,f466]) ).

fof(f55407,plain,
    ( $false
    | ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | spl53_6
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(forward_subsumption_resolution,[],[f55406,f939]) ).

fof(f55408,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | spl53_6
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(avatar_contradiction_clause,[],[f55407]) ).

fof(f55409,plain,
    ( ~ ssList(nil)
    | ~ spl53_2
    | spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1304,f512]) ).

fof(f55586,plain,
    ( $false
    | ~ spl53_2
    | spl53_8 ),
    inference(forward_subsumption_resolution,[],[f55409,f305]) ).

fof(f55587,plain,
    ( ~ spl53_2
    | spl53_8 ),
    inference(avatar_contradiction_clause,[],[f55586]) ).

cnf(s1,plain,
    ( spl53_1
    | ~ spl53_2 ),
    inference(sat_conversion,[],[f471]) ).

cnf(s2,plain,
    ( spl53_3
    | ~ spl53_4 ),
    inference(sat_conversion,[],[f480]) ).

cnf(s3,plain,
    ( spl53_2
    | spl53_4 ),
    inference(sat_conversion,[],[f483]) ).

cnf(s4,plain,
    ( spl53_2
    | ~ spl53_3 ),
    inference(sat_conversion,[],[f489]) ).

cnf(s8,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3 ),
    inference(sat_conversion,[],[f1109]) ).

cnf(s11,plain,
    ( ~ spl53_2
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(sat_conversion,[],[f1649]) ).

cnf(s45,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | ~ spl53_8
    | spl53_40 ),
    inference(sat_conversion,[],[f27474]) ).

cnf(s68,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | spl53_4
    | spl53_6
    | ~ spl53_8
    | ~ spl53_40 ),
    inference(sat_conversion,[],[f55408]) ).

cnf(s70,plain,
    ( ~ spl53_2
    | spl53_8 ),
    inference(sat_conversion,[],[f55587]) ).

cnf(s82,plain,
    spl53_2,
    inference(rat,[],[s2,s3,s4]) ).

cnf(s83,plain,
    spl53_8,
    inference(rat,[],[s70,s82]) ).

cnf(s84,plain,
    spl53_1,
    inference(rat,[],[s1,s82]) ).

cnf(s85,plain,
    spl53_40,
    inference(rat,[],[s45,s83,s84,s82]) ).

cnf(s95,plain,
    ~ spl53_3,
    inference(rat,[],[s8,s82,s84]) ).

cnf(s104,plain,
    ~ spl53_4,
    inference(rat,[],[s2,s95]) ).

cnf(s109,plain,
    ~ spl53_6,
    inference(rat,[],[s11,s83,s82,s104]) ).

cnf(s110,plain,
    $false,
    inference(rat,[],[s68,s85,s83,s82,s84,s109,s104]) ).

fof(f55648,plain,
    $false,
    inference(avatar_sat_refutation,[],[s110]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC061+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n008.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 28 07:40:40 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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
% 13.96/2.43  % (2082576)Will run a generic schedule for satisfiability detection.
% 13.96/2.43  % (2082586)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3712491371:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 13.96/2.43  % (2082582)% WARNING: option uhcvi not known.
% 13.96/2.43  % (2082581)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1731806167_2999 on theBenchmark for (2999ds/0Mi)
% 13.96/2.43  % (2082582)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=947093209:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 13.96/2.43  % (2082583)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=547498475:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 13.96/2.43  % (2082584)dis+10_1_sil=32000:sp=arity:random_seed=3780910972:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 13.96/2.43  % (2082585)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=155020143:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 13.96/2.43  % (2082587)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=919709425:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 13.96/2.43  % TRYING [1]
% 13.96/2.43  % TRYING [2]
% 13.96/2.43  % TRYING [3]
% 13.96/2.43  % (2082586)Instruction limit reached! 
% 13.96/2.43  % (2082586)------------------------------
% 13.96/2.43  % (2082586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.96/2.43  % (2082586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.96/2.43  % (2082586)CaDiCaL version: 2.1.3
% 13.96/2.43  % (2082586)Termination reason: Instruction limit
% 13.96/2.43  % (2082586)Termination phase: Saturation
% 13.96/2.43  % (2082586)Time elapsed: 0.043 s
% 13.96/2.43  % (2082586)Peak memory usage: 14 MB
% 13.96/2.43  % (2082586)Instructions burned: 132 (million)
% 13.96/2.43  % TRYING [4]
% 13.96/2.43  % (2082595)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1913945442:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 13.96/2.43  % TRYING [1]
% 13.96/2.43  % TRYING [2]
% 13.96/2.43  % TRYING [3]
% 13.96/2.43  % (2082584)Instruction limit reached! 
% 13.96/2.43  % (2082584)------------------------------
% 13.96/2.43  % (2082584)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.96/2.43  % (2082584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.96/2.43  % (2082584)CaDiCaL version: 2.1.3
% 13.96/2.43  % (2082584)Termination reason: Instruction limit
% 13.96/2.43  % (2082584)Termination phase: Saturation
% 13.96/2.43  % (2082584)Time elapsed: 0.062 s
% 13.96/2.43  % (2082584)Peak memory usage: 13 MB
% 13.96/2.43  % (2082584)Instructions burned: 104 (million)
% 13.96/2.43  % TRYING [4]
% 13.96/2.43  % (2082585)Instruction limit reached! 
% 13.96/2.43  % (2082585)------------------------------
% 13.96/2.43  % (2082585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.96/2.43  % (2082585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.96/2.43  % (2082585)CaDiCaL version: 2.1.3
% 13.96/2.43  % (2082585)Termination reason: Instruction limit
% 13.96/2.43  % (2082585)Termination phase: Saturation
% 13.96/2.43  % (2082585)Time elapsed: 0.069 s
% 13.96/2.43  % (2082585)Peak memory usage: 13 MB
% 13.96/2.43  % (2082585)Instructions burned: 116 (million)
% 13.96/2.43  % (2082597)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3444567512:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 13.96/2.43  % (2082598)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=3835141343:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 13.96/2.43  % TRYING [5]
% 13.96/2.43  % TRYING [5]
% 13.96/2.43  % (2082587)Instruction limit reached! 
% 13.96/2.43  % (2082587)------------------------------
% 13.96/2.43  % (2082587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.96/2.43  % (2082587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.96/2.43  % (2082587)CaDiCaL version: 2.1.3
% 13.96/2.43  % (2082587)Termination reason: Instruction limit
% 13.96/2.43  % (2082587)Termination phase: Saturation
% 13.96/2.43  % (2082587)Time elapsed: 0.103 s
% 13.96/2.43  % (2082587)Peak memory usage: 15 MB
% 13.96/2.43  % (2082587)Instructions burned: 160 (million)
% 13.96/2.43  % (2082601)ott-21_1_sil=16000:fs=off:random_seed=769840470:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 13.96/2.43  % (2082597)Instruction limit reached! 
% 13.96/2.43  % (2082597)------------------------------
% 13.96/2.43  % (2082597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082597)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082597)Termination reason: Instruction limit
% 18.47/3.11  % (2082597)Termination phase: Saturation
% 18.47/3.11  % (2082597)Time elapsed: 0.074 s
% 18.47/3.11  % (2082597)Peak memory usage: 13 MB
% 18.47/3.11  % (2082597)Instructions burned: 131 (million)
% 18.47/3.11  % (2082603)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1612036921:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 18.47/3.11  % TRYING [6]
% 18.47/3.11  % (2082595)Instruction limit reached! 
% 18.47/3.11  % (2082595)------------------------------
% 18.47/3.11  % (2082595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082595)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082595)Termination reason: Instruction limit
% 18.47/3.11  % (2082595)Termination phase: Finite model building constraint generation
% 18.47/3.11  % (2082595)Time elapsed: 0.160 s
% 18.47/3.11  % (2082595)Peak memory usage: 29 MB
% 18.47/3.11  % (2082595)Instructions burned: 716 (million)
% 18.47/3.11  % TRYING [6]
% 18.47/3.11  % (2082601)Instruction limit reached! 
% 18.47/3.11  % (2082601)------------------------------
% 18.47/3.11  % (2082601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082601)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082601)Termination reason: Instruction limit
% 18.47/3.11  % (2082601)Termination phase: Saturation
% 18.47/3.11  % (2082601)Time elapsed: 0.093 s
% 18.47/3.11  % (2082601)Peak memory usage: 13 MB
% 18.47/3.11  % (2082601)Instructions burned: 182 (million)
% 18.47/3.11  % (2082605)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2289488401:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 18.47/3.11  % TRYING [1]
% 18.47/3.11  % TRYING [2]
% 18.47/3.11  % TRYING [3]
% 18.47/3.11  % (2082606)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1632298376:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 18.47/3.11  % TRYING [4]
% 18.47/3.11  % TRYING [5]
% 18.47/3.11  % (2082605)Instruction limit reached! 
% 18.47/3.11  % (2082605)------------------------------
% 18.47/3.11  % (2082605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082605)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082605)Termination reason: Instruction limit
% 18.47/3.11  % (2082605)Termination phase: Finite model building SAT solving
% 18.47/3.11  % (2082605)Time elapsed: 0.183 s
% 18.47/3.11  % (2082605)Peak memory usage: 23 MB
% 18.47/3.11  % (2082605)Instructions burned: 869 (million)
% 18.47/3.11  % (2082609)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=690243888:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 18.47/3.11  % (2082598)Instruction limit reached! 
% 18.47/3.11  % (2082598)------------------------------
% 18.47/3.11  % (2082598)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082598)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082598)Termination reason: Instruction limit
% 18.47/3.11  % (2082598)Termination phase: Saturation
% 18.47/3.11  % (2082598)Time elapsed: 0.369 s
% 18.47/3.11  % (2082598)Peak memory usage: 21 MB
% 18.47/3.11  % (2082598)Instructions burned: 685 (million)
% 18.47/3.11  % (2082611)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=3328596369:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 18.47/3.11  % TRYING [14]
% 18.47/3.11  % (2082603)Instruction limit reached! 
% 18.47/3.11  % (2082603)------------------------------
% 18.47/3.11  % (2082603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082603)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082603)Termination reason: Instruction limit
% 18.47/3.11  % (2082603)Termination phase: Saturation
% 18.47/3.11  % (2082603)Time elapsed: 0.322 s
% 18.47/3.11  % (2082603)Peak memory usage: 15 MB
% 18.47/3.11  % (2082603)Instructions burned: 478 (million)
% 18.47/3.11  % TRYING [7]
% 18.47/3.11  % (2082613)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1564774622:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 18.47/3.11  % (2082609)Instruction limit reached! 
% 18.47/3.11  % (2082609)------------------------------
% 18.47/3.11  % (2082609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082609)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082609)Termination reason: Instruction limit
% 18.47/3.11  % (2082609)Termination phase: Finite model building constraint generation
% 18.47/3.11  % (2082609)Time elapsed: 0.176 s
% 18.47/3.11  % (2082609)Peak memory usage: 70 MB
% 18.47/3.11  % (2082609)Instructions burned: 892 (million)
% 18.47/3.11  % (2082615)fmb+10_1_sil=64000:random_seed=346139690:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 18.47/3.11  % TRYING [1]
% 18.47/3.11  % TRYING [2]
% 18.47/3.11  % TRYING [3]
% 18.47/3.11  % TRYING [4]
% 18.47/3.11  % TRYING [5]
% 18.47/3.11  % (2082611)Instruction limit reached! 
% 18.47/3.11  % (2082611)------------------------------
% 18.47/3.11  % (2082611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082611)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082611)Termination reason: Instruction limit
% 18.47/3.11  % (2082611)Termination phase: Saturation
% 18.47/3.11  % (2082611)Time elapsed: 0.357 s
% 18.47/3.11  % (2082611)Peak memory usage: 24 MB
% 18.47/3.11  % (2082611)Instructions burned: 692 (million)
% 18.47/3.11  % (2082617)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3046863863:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 18.47/3.11  % TRYING [20]
% 18.47/3.11  % (2082606)Instruction limit reached! 
% 18.47/3.11  % (2082606)------------------------------
% 18.47/3.11  % (2082606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082606)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082606)Termination reason: Instruction limit
% 18.47/3.11  % (2082606)Termination phase: Saturation
% 18.47/3.11  % (2082606)Time elapsed: 0.645 s
% 18.47/3.11  % (2082606)Peak memory usage: 29 MB
% 18.47/3.11  % (2082606)Instructions burned: 1180 (million)
% 18.47/3.11  % TRYING [6]
% 18.47/3.11  % (2082619)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2013547217:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 18.47/3.11  % TRYING [8]
% 18.47/3.11  % (2082613)Instruction limit reached! 
% 18.47/3.11  % (2082613)------------------------------
% 18.47/3.11  % (2082613)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082613)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082613)Termination reason: Instruction limit
% 18.47/3.11  % (2082613)Termination phase: Saturation
% 18.47/3.11  % (2082613)Time elapsed: 0.465 s
% 18.47/3.11  % (2082613)Peak memory usage: 21 MB
% 18.47/3.11  % (2082613)Instructions burned: 879 (million)
% 18.47/3.11  % (2082621)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2772752826:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 18.47/3.11  % TRYING [8]
% 18.47/3.11  % (2082619)Instruction limit reached! 
% 18.47/3.11  % (2082619)------------------------------
% 18.47/3.11  % (2082619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082619)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082619)Termination reason: Instruction limit
% 18.47/3.11  % (2082619)Termination phase: Finite model building constraint generation
% 18.47/3.11  % (2082619)Time elapsed: 0.338 s
% 18.47/3.11  % (2082619)Peak memory usage: 70 MB
% 18.47/3.11  % (2082619)Instructions burned: 920 (million)
% 18.47/3.11  % (2082623)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3666286389:i=1472:ins=7:fdi=8:gsp=on_2987 on theBenchmark for (2987ds/1472Mi)
% 18.47/3.11  % TRYING [7]
% 18.47/3.11  % (2082623)Instruction limit reached! 
% 18.47/3.11  % (2082623)------------------------------
% 18.47/3.11  % (2082623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082623)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082623)Termination reason: Instruction limit
% 18.47/3.11  % (2082623)Termination phase: Saturation
% 18.47/3.11  % (2082623)Time elapsed: 0.676 s
% 18.47/3.11  % (2082623)Peak memory usage: 24 MB
% 18.47/3.11  % (2082623)Instructions burned: 1473 (million)
% 18.47/3.11  % (2082625)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1429412836:i=6324_2980 on theBenchmark for (2980ds/6324Mi)
% 18.47/3.11  % TRYING [77]
% 18.47/3.11  % TRYING [8]
% 18.47/3.11  % (2082621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2082576-2082621"...
% 18.47/3.11  % (2082621)...printing done.
% 18.47/3.11  % (2082621)Refutation found. Thanks to Tanya!
% 18.47/3.11  % SZS status Theorem for theBenchmark
% 18.47/3.11  % SZS output start Proof for theBenchmark
% See solution above
% 18.47/3.11  % (2082621)------------------------------
% 18.47/3.11  % (2082621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.47/3.11  % (2082621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.47/3.11  % (2082621)CaDiCaL version: 2.1.3
% 18.47/3.11  % (2082621)Termination reason: Refutation
% 18.47/3.11  % (2082621)Time elapsed: 1.584 s
% 18.47/3.11  % (2082621)Peak memory usage: 37 MB
% 18.47/3.11  % (2082621)Instructions burned: 2949 (million)
% 18.47/3.11  % (2082576)Success in time 2.681 s
% 18.47/3.11  % Vampire exiting
%------------------------------------------------------------------------------