↑ 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  : SWC065+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 : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:04:30 PM UTC 2026

% Result   : Theorem 17.26s 3.02s
% Output   : Refutation 17.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  112 (  18 unt;   4 def)
%            Number of atoms       :  401 (  87 equ)
%            Maximal formula atoms :   23 (   3 avg)
%            Number of connectives :  490 ( 201   ~; 203   |;  52   &)
%                                         (  12 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :  105 (   0 sgn  81   !;  24   ?)

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

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

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

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

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

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

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

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

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

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

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

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

fof(f241,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X3)
      | ~ ssList(X2)
      | segmentP(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

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

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

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

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

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

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

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

fof(f412,plain,
    ! [X8] :
      ( ~ segmentP(sK47,X8)
      | ~ segmentP(sK48,X8)
      | ~ neq(X8,nil)
      | ~ ssList(X8)
      | nil = sK48 ),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    ssList(sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f416,plain,
    sK50 = app(sK49,sK51),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f420,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f222]) ).

fof(f421,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f422,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f423,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f222]) ).

fof(f429,plain,
    ( neq(sK50,nil)
    | nil != sK49 ),
    inference(definition_unfolding,[],[f417,f422,f421]) ).

fof(f431,plain,
    ! [X8] :
      ( ~ segmentP(sK49,X8)
      | ~ segmentP(sK50,X8)
      | ~ neq(X8,nil)
      | ~ ssList(X8)
      | nil = sK50 ),
    inference(definition_unfolding,[],[f412,f421,f422,f422]) ).

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

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

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

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

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

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

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

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

fof(f470,plain,
    ( nil = sK49
    | ~ spl52_2 ),
    inference(avatar_component_clause,[],[f469]) ).

fof(f471,plain,
    ( nil != sK49
    | spl52_2 ),
    inference(avatar_component_clause,[],[f469]) ).

fof(f472,plain,
    ( spl52_1
    | ~ spl52_2 ),
    inference(avatar_split_clause,[],[f419,f469,f465]) ).

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

fof(f475,plain,
    ( ~ neq(sK50,nil)
    | spl52_3 ),
    inference(avatar_component_clause,[],[f474]) ).

fof(f476,plain,
    ( neq(sK50,nil)
    | ~ spl52_3 ),
    inference(avatar_component_clause,[],[f474]) ).

fof(f500,plain,
    sK49 = app(nil,sK49),
    inference(resolution,[],[f320,f423]) ).

fof(f1044,plain,
    ( nil != sK50
    | ~ ssList(sK51)
    | nil = sK49
    | ~ ssList(sK49) ),
    inference(superposition,[],[f394,f416]) ).

fof(f1047,plain,
    ( ~ ssList(sK51)
    | nil = sK49
    | ~ ssList(sK49)
    | ~ spl52_1 ),
    inference(forward_subsumption_resolution,[],[f1044,f467]) ).

fof(f1048,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ spl52_1 ),
    inference(forward_subsumption_resolution,[],[f1047,f414]) ).

fof(f1049,plain,
    ( ~ ssList(sK49)
    | ~ spl52_1
    | spl52_2 ),
    inference(forward_subsumption_resolution,[],[f1048,f471]) ).

fof(f1050,plain,
    ( $false
    | ~ spl52_1
    | spl52_2 ),
    inference(forward_subsumption_resolution,[],[f1049,f423]) ).

fof(f1051,plain,
    ( ~ spl52_1
    | spl52_2 ),
    inference(avatar_contradiction_clause,[],[f1050]) ).

fof(f1209,plain,
    ! [X2,X1] :
      ( frontsegP(app(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f435,f318]) ).

fof(f1216,plain,
    ( frontsegP(sK50,sK49)
    | ~ ssList(sK51)
    | ~ ssList(sK49) ),
    inference(superposition,[],[f1209,f416]) ).

fof(f1222,plain,
    ( frontsegP(sK50,sK49)
    | ~ ssList(sK49) ),
    inference(forward_subsumption_resolution,[],[f1216,f414]) ).

fof(f1225,plain,
    frontsegP(sK50,sK49),
    inference(forward_subsumption_resolution,[],[f1222,f423]) ).

fof(f1260,plain,
    ( ~ ssList(sK49)
    | sK50 = app(sK49,sK5(sK50,sK49))
    | ~ ssList(sK50) ),
    inference(resolution,[],[f235,f1225]) ).

fof(f1264,plain,
    ( sK50 = app(sK49,sK5(sK50,sK49))
    | ~ ssList(sK50) ),
    inference(forward_subsumption_resolution,[],[f1260,f423]) ).

fof(f1267,plain,
    sK50 = app(sK49,sK5(sK50,sK49)),
    inference(forward_subsumption_resolution,[],[f1264,f420]) ).

fof(f2481,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(sK49)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(app(sK49,X0)) ),
    inference(superposition,[],[f437,f500]) ).

fof(f2500,plain,
    ! [X0] :
      ( segmentP(app(sK49,X0),sK49)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(app(sK49,X0)) ),
    inference(forward_subsumption_resolution,[],[f2481,f423]) ).

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

fof(f2522,plain,
    ( neq(nil,nil)
    | ~ spl52_1
    | ~ spl52_3 ),
    inference(superposition,[],[f476,f467]) ).

fof(f3068,plain,
    ( ~ ssList(nil)
    | ~ spl52_1
    | ~ spl52_3 ),
    inference(resolution,[],[f2522,f461]) ).

fof(f3069,plain,
    ( $false
    | ~ spl52_1
    | ~ spl52_3 ),
    inference(forward_subsumption_resolution,[],[f3068,f306]) ).

fof(f3070,plain,
    ( ~ spl52_1
    | ~ spl52_3 ),
    inference(avatar_contradiction_clause,[],[f3069]) ).

fof(f3074,plain,
    ( ~ neq(nil,nil)
    | ~ spl52_1
    | spl52_3 ),
    inference(forward_demodulation,[],[f475,f467]) ).

fof(f3075,plain,
    ( neq(sK50,nil)
    | ~ spl52_2 ),
    inference(forward_subsumption_resolution,[],[f429,f470]) ).

fof(f3076,plain,
    ( neq(nil,nil)
    | ~ spl52_1
    | ~ spl52_2 ),
    inference(forward_demodulation,[],[f3075,f467]) ).

fof(f3081,plain,
    ( $false
    | ~ spl52_1
    | ~ spl52_2
    | spl52_3 ),
    inference(forward_subsumption_resolution,[],[f3076,f3074]) ).

fof(f3082,plain,
    ( ~ spl52_1
    | ~ spl52_2
    | spl52_3 ),
    inference(avatar_contradiction_clause,[],[f3081]) ).

fof(f3088,plain,
    ( ! [X8] :
        ( ~ neq(X8,nil)
        | ~ segmentP(sK50,X8)
        | ~ segmentP(sK49,X8)
        | ~ ssList(X8) )
    | spl52_1 ),
    inference(forward_subsumption_resolution,[],[f431,f466]) ).

fof(f3173,plain,
    ( ! [X0] :
        ( ~ segmentP(sK50,X0)
        | ~ segmentP(sK49,X0)
        | ~ ssList(X0)
        | ~ ssList(nil)
        | nil = X0
        | ~ ssList(X0) )
    | spl52_1 ),
    inference(resolution,[],[f3088,f303]) ).

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

fof(f3177,plain,
    ( ! [X0] :
        ( ~ segmentP(sK50,X0)
        | ~ segmentP(sK49,X0)
        | ~ ssList(X0)
        | nil = X0 )
    | spl52_1 ),
    inference(forward_subsumption_resolution,[],[f3176,f306]) ).

fof(f24854,definition,
    ( spl52_43
  <=> ssList(sK5(sK50,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_43])],[avatar_definition]) ).

fof(f24855,plain,
    ( ssList(sK5(sK50,sK49))
    | ~ spl52_43 ),
    inference(avatar_component_clause,[],[f24854]) ).

fof(f24856,plain,
    ( ~ ssList(sK5(sK50,sK49))
    | spl52_43 ),
    inference(avatar_component_clause,[],[f24854]) ).

fof(f24864,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK50)
    | ~ frontsegP(sK50,sK49)
    | spl52_43 ),
    inference(resolution,[],[f24856,f236]) ).

fof(f24865,plain,
    ( ~ ssList(sK50)
    | ~ frontsegP(sK50,sK49)
    | spl52_43 ),
    inference(forward_subsumption_resolution,[],[f24864,f423]) ).

fof(f24866,plain,
    ( ~ frontsegP(sK50,sK49)
    | spl52_43 ),
    inference(forward_subsumption_resolution,[],[f24865,f420]) ).

fof(f24867,plain,
    ( $false
    | spl52_43 ),
    inference(forward_subsumption_resolution,[],[f24866,f1225]) ).

fof(f24868,plain,
    spl52_43,
    inference(avatar_contradiction_clause,[],[f24867]) ).

fof(f50362,plain,
    ( segmentP(sK50,sK49)
    | ~ ssList(sK5(sK50,sK49))
    | ~ ssList(sK50) ),
    inference(superposition,[],[f2506,f1267]) ).

fof(f50409,plain,
    ( segmentP(sK50,sK49)
    | ~ ssList(sK50)
    | ~ spl52_43 ),
    inference(forward_subsumption_resolution,[],[f50362,f24855]) ).

fof(f50456,plain,
    ( segmentP(sK50,sK49)
    | ~ spl52_43 ),
    inference(forward_subsumption_resolution,[],[f50409,f420]) ).

fof(f50459,plain,
    ( ~ segmentP(sK49,sK49)
    | ~ ssList(sK49)
    | nil = sK49
    | spl52_1
    | ~ spl52_43 ),
    inference(resolution,[],[f50456,f3177]) ).

fof(f50544,plain,
    ( ~ ssList(sK49)
    | nil = sK49
    | spl52_1
    | ~ spl52_43 ),
    inference(forward_subsumption_resolution,[],[f50459,f357]) ).

fof(f50584,plain,
    ( nil = sK49
    | spl52_1
    | ~ spl52_43 ),
    inference(forward_subsumption_resolution,[],[f50544,f423]) ).

fof(f50585,plain,
    ( $false
    | spl52_1
    | spl52_2
    | ~ spl52_43 ),
    inference(forward_subsumption_resolution,[],[f50584,f471]) ).

fof(f50586,plain,
    ( spl52_1
    | spl52_2
    | ~ spl52_43 ),
    inference(avatar_contradiction_clause,[],[f50585]) ).

cnf(s1,plain,
    ( spl52_1
    | ~ spl52_2 ),
    inference(sat_conversion,[],[f472]) ).

cnf(s6,plain,
    ( ~ spl52_1
    | spl52_2 ),
    inference(sat_conversion,[],[f1051]) ).

cnf(s13,plain,
    ( ~ spl52_1
    | ~ spl52_3 ),
    inference(sat_conversion,[],[f3070]) ).

cnf(s15,plain,
    ( ~ spl52_1
    | ~ spl52_2
    | spl52_3 ),
    inference(sat_conversion,[],[f3082]) ).

cnf(s50,plain,
    spl52_43,
    inference(sat_conversion,[],[f24868]) ).

cnf(s79,plain,
    ( spl52_1
    | spl52_2
    | ~ spl52_43 ),
    inference(sat_conversion,[],[f50586]) ).

cnf(s99,plain,
    spl52_1,
    inference(rat,[],[s1,s79,s50]) ).

cnf(s100,plain,
    ~ spl52_3,
    inference(rat,[],[s13,s99]) ).

cnf(s102,plain,
    spl52_2,
    inference(rat,[],[s6,s99]) ).

cnf(s103,plain,
    $false,
    inference(rat,[],[s15,s99,s100,s102]) ).

fof(f50587,plain,
    $false,
    inference(avatar_sat_refutation,[],[s103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC065+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 07:41:25 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.76/2.59  % (3803057)Will run a generic schedule for satisfiability detection.
% 14.76/2.59  % (3803062)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2767621018_2999 on theBenchmark for (2999ds/0Mi)
% 14.76/2.59  % (3803063)% WARNING: option uhcvi not known.
% 14.76/2.59  % (3803065)dis+10_1_sil=32000:sp=arity:random_seed=1944609346:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 14.76/2.59  % (3803063)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3073950413:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 14.76/2.59  % (3803064)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2859138205:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 14.76/2.59  % (3803066)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1311918744:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 14.76/2.59  % (3803068)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2104616904:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 14.76/2.59  % (3803067)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1443498278:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 14.76/2.59  % TRYING [1]
% 14.76/2.59  % TRYING [2]
% 14.76/2.59  % TRYING [3]
% 14.76/2.59  % TRYING [4]
% 14.76/2.59  % TRYING [5]
% 14.76/2.59  % (3803065)Instruction limit reached! 
% 14.76/2.59  % (3803065)------------------------------
% 14.76/2.59  % (3803065)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.76/2.59  % (3803065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.76/2.59  % (3803065)CaDiCaL version: 2.1.3
% 14.76/2.59  % (3803065)Termination reason: Instruction limit
% 14.76/2.59  % (3803065)Termination phase: Saturation
% 14.76/2.59  % (3803065)Time elapsed: 0.062 s
% 14.76/2.59  % (3803065)Peak memory usage: 13 MB
% 14.76/2.59  % (3803065)Instructions burned: 104 (million)
% 14.76/2.59  % (3803066)Instruction limit reached! 
% 14.76/2.59  % (3803066)------------------------------
% 14.76/2.59  % (3803066)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.76/2.59  % (3803066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.76/2.59  % (3803066)CaDiCaL version: 2.1.3
% 14.76/2.59  % (3803066)Termination reason: Instruction limit
% 14.76/2.59  % (3803066)Termination phase: Saturation
% 14.76/2.59  % (3803066)Time elapsed: 0.070 s
% 14.76/2.59  % (3803066)Peak memory usage: 13 MB
% 14.76/2.59  % (3803066)Instructions burned: 117 (million)
% 14.76/2.59  % (3803067)Instruction limit reached! 
% 14.76/2.59  % (3803067)------------------------------
% 14.76/2.59  % (3803067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.76/2.59  % (3803067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.76/2.59  % (3803067)CaDiCaL version: 2.1.3
% 14.76/2.59  % (3803067)Termination reason: Instruction limit
% 14.76/2.59  % (3803067)Termination phase: Saturation
% 14.76/2.59  % (3803067)Time elapsed: 0.075 s
% 14.76/2.59  % (3803067)Peak memory usage: 14 MB
% 14.76/2.59  % (3803067)Instructions burned: 132 (million)
% 14.76/2.59  % (3803076)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2956404858:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 14.76/2.59  % (3803077)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=570006255:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 14.76/2.59  % (3803078)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=3275966871:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 14.76/2.59  % TRYING [1]
% 14.76/2.59  % TRYING [2]
% 14.76/2.59  % (3803068)Instruction limit reached! 
% 14.76/2.59  % (3803068)------------------------------
% 14.76/2.59  % (3803068)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.76/2.59  % (3803068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.76/2.59  % (3803068)CaDiCaL version: 2.1.3
% 14.76/2.59  % (3803068)Termination reason: Instruction limit
% 14.76/2.59  % (3803068)Termination phase: Saturation
% 14.76/2.59  % (3803068)Time elapsed: 0.102 s
% 14.76/2.59  % (3803068)Peak memory usage: 15 MB
% 14.76/2.59  % (3803068)Instructions burned: 160 (million)
% 14.76/2.59  % TRYING [3]
% 14.76/2.59  % TRYING [6]
% 14.76/2.59  % TRYING [4]
% 14.76/2.59  % (3803082)ott-21_1_sil=16000:fs=off:random_seed=3001373532:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 14.76/2.59  % (3803077)Instruction limit reached! 
% 14.76/2.59  % (3803077)------------------------------
% 14.76/2.59  % (3803077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803077)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803077)Termination reason: Instruction limit
% 17.26/3.02  % (3803077)Termination phase: Saturation
% 17.26/3.02  % (3803077)Time elapsed: 0.070 s
% 17.26/3.02  % (3803077)Peak memory usage: 13 MB
% 17.26/3.02  % (3803077)Instructions burned: 132 (million)
% 17.26/3.02  % TRYING [5]
% 17.26/3.02  % (3803084)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=431538359:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 17.26/3.02  % (3803082)Instruction limit reached! 
% 17.26/3.02  % (3803082)------------------------------
% 17.26/3.02  % (3803082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803082)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803082)Termination reason: Instruction limit
% 17.26/3.02  % (3803082)Termination phase: Saturation
% 17.26/3.02  % (3803082)Time elapsed: 0.089 s
% 17.26/3.02  % (3803082)Peak memory usage: 14 MB
% 17.26/3.02  % (3803082)Instructions burned: 182 (million)
% 17.26/3.02  % (3803086)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1392772285:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 17.26/3.02  % TRYING [1]
% 17.26/3.02  % TRYING [2]
% 17.26/3.02  % TRYING [3]
% 17.26/3.02  % TRYING [7]
% 17.26/3.02  % TRYING [4]
% 17.26/3.02  % TRYING [6]
% 17.26/3.02  % (3803076)Instruction limit reached! 
% 17.26/3.02  % (3803076)------------------------------
% 17.26/3.02  % (3803076)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803076)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803076)Termination reason: Instruction limit
% 17.26/3.02  % (3803076)Termination phase: Finite model building constraint generation
% 17.26/3.02  % (3803076)Time elapsed: 0.291 s
% 17.26/3.02  % (3803076)Peak memory usage: 27 MB
% 17.26/3.02  % (3803076)Instructions burned: 715 (million)
% 17.26/3.02  % (3803088)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1731069307:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 17.26/3.02  % TRYING [5]
% 17.26/3.02  % (3803078)Instruction limit reached! 
% 17.26/3.02  % (3803078)------------------------------
% 17.26/3.02  % (3803078)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803078)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803078)Termination reason: Instruction limit
% 17.26/3.02  % (3803078)Termination phase: Saturation
% 17.26/3.02  % (3803078)Time elapsed: 0.367 s
% 17.26/3.02  % (3803078)Peak memory usage: 24 MB
% 17.26/3.02  % (3803078)Instructions burned: 686 (million)
% 17.26/3.02  % (3803090)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1393874818:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 17.26/3.02  % (3803084)Instruction limit reached! 
% 17.26/3.02  % (3803084)------------------------------
% 17.26/3.02  % (3803084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803084)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803084)Termination reason: Instruction limit
% 17.26/3.02  % (3803084)Termination phase: Saturation
% 17.26/3.02  % (3803084)Time elapsed: 0.320 s
% 17.26/3.02  % (3803084)Peak memory usage: 15 MB
% 17.26/3.02  % (3803084)Instructions burned: 478 (million)
% 17.26/3.02  % (3803092)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=873215040: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)
% 17.26/3.02  % (3803086)Instruction limit reached! 
% 17.26/3.02  % (3803086)------------------------------
% 17.26/3.02  % (3803086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803086)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803086)Termination reason: Instruction limit
% 17.26/3.02  % (3803086)Termination phase: Finite model building SAT solving
% 17.26/3.02  % (3803086)Time elapsed: 0.351 s
% 17.26/3.02  % (3803086)Peak memory usage: 22 MB
% 17.26/3.02  % (3803086)Instructions burned: 866 (million)
% 17.26/3.02  % TRYING [14]
% 17.26/3.02  % (3803094)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2092771310:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 17.26/3.02  % TRYING [8]
% 17.26/3.02  % (3803090)Instruction limit reached! 
% 17.26/3.02  % (3803090)------------------------------
% 17.26/3.02  % (3803090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803090)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803090)Termination reason: Instruction limit
% 17.26/3.02  % (3803090)Termination phase: Finite model building constraint generation
% 17.26/3.02  % (3803090)Time elapsed: 0.323 s
% 17.26/3.02  % (3803090)Peak memory usage: 70 MB
% 17.26/3.02  % (3803090)Instructions burned: 891 (million)
% 17.26/3.02  % (3803096)fmb+10_1_sil=64000:random_seed=1352150406:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 17.26/3.02  % TRYING [1]
% 17.26/3.02  % TRYING [2]
% 17.26/3.02  % TRYING [3]
% 17.26/3.02  % (3803092)Instruction limit reached! 
% 17.26/3.02  % (3803092)------------------------------
% 17.26/3.02  % (3803092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803092)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803092)Termination reason: Instruction limit
% 17.26/3.02  % (3803092)Termination phase: Saturation
% 17.26/3.02  % (3803092)Time elapsed: 0.378 s
% 17.26/3.02  % (3803092)Peak memory usage: 23 MB
% 17.26/3.02  % (3803092)Instructions burned: 693 (million)
% 17.26/3.02  % TRYING [4]
% 17.26/3.02  % (3803098)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=977002472:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 17.26/3.02  % TRYING [20]
% 17.26/3.02  % TRYING [5]
% 17.26/3.02  % (3803088)Instruction limit reached! 
% 17.26/3.02  % (3803088)------------------------------
% 17.26/3.02  % (3803088)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803088)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803088)Termination reason: Instruction limit
% 17.26/3.02  % (3803088)Termination phase: Saturation
% 17.26/3.02  % (3803088)Time elapsed: 0.659 s
% 17.26/3.02  % (3803088)Peak memory usage: 29 MB
% 17.26/3.02  % (3803088)Instructions burned: 1179 (million)
% 17.26/3.02  % (3803100)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2778047718:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 17.26/3.02  % (3803094)Instruction limit reached! 
% 17.26/3.02  % (3803094)------------------------------
% 17.26/3.02  % (3803094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803094)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803094)Termination reason: Instruction limit
% 17.26/3.02  % (3803094)Termination phase: Saturation
% 17.26/3.02  % (3803094)Time elapsed: 0.480 s
% 17.26/3.02  % (3803094)Peak memory usage: 21 MB
% 17.26/3.02  % (3803094)Instructions burned: 881 (million)
% 17.26/3.02  % TRYING [8]
% 17.26/3.02  % (3803102)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3140327774:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 17.26/3.02  % TRYING [6]
% 17.26/3.02  % TRYING [9]
% 17.26/3.02  % (3803100)Instruction limit reached! 
% 17.26/3.02  % (3803100)------------------------------
% 17.26/3.02  % (3803100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803100)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803100)Termination reason: Instruction limit
% 17.26/3.02  % (3803100)Termination phase: Finite model building constraint generation
% 17.26/3.02  % (3803100)Time elapsed: 0.349 s
% 17.26/3.02  % (3803100)Peak memory usage: 75 MB
% 17.26/3.02  % (3803100)Instructions burned: 921 (million)
% 17.26/3.02  % (3803104)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2034836265:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 17.26/3.02  % TRYING [7]
% 17.26/3.02  % (3803104)Instruction limit reached! 
% 17.26/3.02  % (3803104)------------------------------
% 17.26/3.02  % (3803104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803104)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803104)Termination reason: Instruction limit
% 17.26/3.02  % (3803104)Termination phase: Saturation
% 17.26/3.02  % (3803104)Time elapsed: 0.663 s
% 17.26/3.02  % (3803104)Peak memory usage: 24 MB
% 17.26/3.02  % (3803104)Instructions burned: 1474 (million)
% 17.26/3.02  % (3803106)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=660237921:i=6324_2978 on theBenchmark for (2978ds/6324Mi)
% 17.26/3.02  % TRYING [77]
% 17.26/3.02  % (3803102) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3803057-3803102"...
% 17.26/3.02  % (3803102)...printing done.
% 17.26/3.02  % (3803102)Refutation found. Thanks to Tanya!
% 17.26/3.02  % SZS status Theorem for theBenchmark
% 17.26/3.02  % SZS output start Proof for theBenchmark
% See solution above
% 17.26/3.02  % (3803102)------------------------------
% 17.26/3.02  % (3803102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.26/3.02  % (3803102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.26/3.02  % (3803102)CaDiCaL version: 2.1.3
% 17.26/3.02  % (3803102)Termination reason: Refutation
% 17.26/3.02  % (3803102)Time elapsed: 1.406 s
% 17.26/3.02  % (3803102)Peak memory usage: 34 MB
% 17.26/3.02  % (3803102)Instructions burned: 2626 (million)
% 17.26/3.02  % (3803057)Success in time 2.611 s
% 17.26/3.02  % Vampire exiting
%------------------------------------------------------------------------------