↑ 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  : SWC271+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 : n016.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:05:20 PM UTC 2026

% Result   : Theorem 2.87s 0.68s
% Output   : Refutation 2.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   89 (  20 unt;   4 def)
%            Number of atoms       :  333 (  22 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  424 ( 180   ~; 180   |;  28   &)
%                                         (  12 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   5 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-2 aty)
%            Number of variables   :   94 (   0 sgn  84   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( totalorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => leq(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).

fof(f12,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( strictorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => lt(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).

fof(f93,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( lt(X0,X1)
          <=> ( X0 != X1
              & leq(X0,X1) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ frontsegP(X3,X2)
                    | ~ strictorderedP(X2)
                    | ? [X4] :
                        ( ssList(X4)
                        & neq(X2,X4)
                        & frontsegP(X3,X4)
                        & segmentP(X4,X2)
                        & strictorderedP(X4) )
                    | totalorderedP(X0) ) ) ) ) ),
    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
                      | ~ frontsegP(X3,X2)
                      | ~ strictorderedP(X2)
                      | ? [X4] :
                          ( ssList(X4)
                          & neq(X2,X4)
                          & frontsegP(X3,X4)
                          & segmentP(X4,X2)
                          & strictorderedP(X4) )
                      | totalorderedP(X0) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f110,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f111,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f110]) ).

fof(f112,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f113,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f112]) ).

fof(f216,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( lt(X0,X1)
          <=> ( X0 != X1
              & leq(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f93]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ frontsegP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ~ totalorderedP(X0)
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ frontsegP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ~ totalorderedP(X0)
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f273,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssList(sK28(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f274,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f275,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ leq(sK24(X0),sK25(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f276,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssList(sK27(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f277,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssList(sK26(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f278,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssItem(sK25(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f279,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssItem(sK24(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f280,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
      | lt(X1,X2)
      | ~ strictorderedP(X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f406,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ lt(X0,X1) ),
    inference(cnf_transformation,[],[f216]) ).

fof(f413,plain,
    ~ totalorderedP(sK47),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    strictorderedP(sK49),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f423,plain,
    ~ totalorderedP(sK49),
    inference(definition_unfolding,[],[f413,f416]) ).

fof(f434,plain,
    ! [X2,X3,X1,X4,X5] :
      ( ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
      | ~ ssItem(X1)
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | lt(X1,X2)
      | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
    inference(equality_resolution,[],[f280]) ).

fof(f486,plain,
    ! [X0] :
      ( ssItem(sK24(X0))
      | ~ ssList(X0)
      | ~ totalorderedP(X0) ),
    inference(consistent_polarity_flipping,[],[f279]) ).

fof(f487,plain,
    ! [X0] :
      ( ssItem(sK25(X0))
      | ~ ssList(X0)
      | ~ totalorderedP(X0) ),
    inference(consistent_polarity_flipping,[],[f278]) ).

fof(f488,plain,
    ! [X0] :
      ( ~ totalorderedP(X0)
      | ssList(sK26(X0))
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f277]) ).

fof(f489,plain,
    ! [X0] :
      ( ~ totalorderedP(X0)
      | ssList(sK27(X0))
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f276]) ).

fof(f490,plain,
    ! [X0] :
      ( leq(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | ~ totalorderedP(X0) ),
    inference(consistent_polarity_flipping,[],[f275]) ).

fof(f491,plain,
    ! [X0] :
      ( ~ totalorderedP(X0)
      | app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f274]) ).

fof(f492,plain,
    ! [X0] :
      ( ~ totalorderedP(X0)
      | ssList(sK28(X0))
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f273]) ).

fof(f501,plain,
    ! [X2,X3,X1,X4,X5] :
      ( ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
      | ~ ssItem(X1)
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | lt(X1,X2)
      | strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
    inference(consistent_polarity_flipping,[],[f434]) ).

fof(f555,plain,
    ! [X0,X1] :
      ( ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ leq(X0,X1)
      | ~ ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f406]) ).

fof(f558,plain,
    ~ strictorderedP(sK49),
    inference(consistent_polarity_flipping,[],[f414]) ).

fof(f559,plain,
    totalorderedP(sK49),
    inference(consistent_polarity_flipping,[],[f423]) ).

fof(f669,plain,
    ( ssList(sK26(sK49))
    | ~ ssList(sK49) ),
    inference(resolution,[],[f488,f559]) ).

fof(f670,plain,
    ssList(sK26(sK49)),
    inference(forward_subsumption_resolution,[],[f669,f418]) ).

fof(f671,plain,
    ( ssList(sK27(sK49))
    | ~ ssList(sK49) ),
    inference(resolution,[],[f489,f559]) ).

fof(f672,plain,
    ssList(sK27(sK49)),
    inference(forward_subsumption_resolution,[],[f671,f418]) ).

fof(f673,plain,
    ( ssList(sK28(sK49))
    | ~ ssList(sK49) ),
    inference(resolution,[],[f492,f559]) ).

fof(f674,plain,
    ssList(sK28(sK49)),
    inference(forward_subsumption_resolution,[],[f673,f418]) ).

fof(f1957,plain,
    ( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
    | ~ ssList(sK49) ),
    inference(resolution,[],[f491,f559]) ).

fof(f1958,plain,
    sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
    inference(forward_subsumption_resolution,[],[f1957,f418]) ).

fof(f3338,definition,
    ( spl51_207
  <=> ssItem(sK25(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl51_207])],[avatar_definition]) ).

fof(f3339,plain,
    ( ssItem(sK25(sK49))
    | ~ spl51_207 ),
    inference(avatar_component_clause,[],[f3338]) ).

fof(f3340,plain,
    ( ~ ssItem(sK25(sK49))
    | spl51_207 ),
    inference(avatar_component_clause,[],[f3338]) ).

fof(f3391,definition,
    ( spl51_218
  <=> leq(sK24(sK49),sK25(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl51_218])],[avatar_definition]) ).

fof(f3392,plain,
    ( ~ leq(sK24(sK49),sK25(sK49))
    | spl51_218 ),
    inference(avatar_component_clause,[],[f3391]) ).

fof(f3399,definition,
    ( spl51_220
  <=> ssItem(sK24(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl51_220])],[avatar_definition]) ).

fof(f3400,plain,
    ( ssItem(sK24(sK49))
    | ~ spl51_220 ),
    inference(avatar_component_clause,[],[f3399]) ).

fof(f3401,plain,
    ( ~ ssItem(sK24(sK49))
    | spl51_220 ),
    inference(avatar_component_clause,[],[f3399]) ).

fof(f3417,definition,
    ( spl51_224
  <=> lt(sK24(sK49),sK25(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl51_224])],[avatar_definition]) ).

fof(f3419,plain,
    ( lt(sK24(sK49),sK25(sK49))
    | ~ spl51_224 ),
    inference(avatar_component_clause,[],[f3417]) ).

fof(f5675,plain,
    ( ~ ssList(sK49)
    | ~ totalorderedP(sK49)
    | spl51_207 ),
    inference(resolution,[],[f3340,f487]) ).

fof(f5676,plain,
    ( ~ totalorderedP(sK49)
    | spl51_207 ),
    inference(forward_subsumption_resolution,[],[f5675,f418]) ).

fof(f5677,plain,
    ( $false
    | spl51_207 ),
    inference(forward_subsumption_resolution,[],[f5676,f559]) ).

fof(f5678,plain,
    spl51_207,
    inference(avatar_contradiction_clause,[],[f5677]) ).

fof(f6089,plain,
    ( ~ ssList(sK49)
    | ~ totalorderedP(sK49)
    | spl51_220 ),
    inference(resolution,[],[f3401,f486]) ).

fof(f6090,plain,
    ( ~ totalorderedP(sK49)
    | spl51_220 ),
    inference(forward_subsumption_resolution,[],[f6089,f418]) ).

fof(f6091,plain,
    ( $false
    | spl51_220 ),
    inference(forward_subsumption_resolution,[],[f6090,f559]) ).

fof(f6092,plain,
    spl51_220,
    inference(avatar_contradiction_clause,[],[f6091]) ).

fof(f6940,plain,
    ( ~ ssList(sK49)
    | ~ ssItem(sK24(sK49))
    | ~ ssItem(sK25(sK49))
    | ~ ssList(sK26(sK49))
    | ~ ssList(sK27(sK49))
    | ~ ssList(sK28(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49) ),
    inference(superposition,[],[f501,f1958]) ).

fof(f6993,plain,
    ( ~ ssItem(sK24(sK49))
    | ~ ssItem(sK25(sK49))
    | ~ ssList(sK26(sK49))
    | ~ ssList(sK27(sK49))
    | ~ ssList(sK28(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49) ),
    inference(forward_subsumption_resolution,[],[f6940,f418]) ).

fof(f7005,plain,
    ( ~ ssItem(sK24(sK49))
    | ~ ssList(sK26(sK49))
    | ~ ssList(sK27(sK49))
    | ~ ssList(sK28(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49)
    | ~ spl51_207 ),
    inference(forward_subsumption_resolution,[],[f6993,f3339]) ).

fof(f7016,plain,
    ( ~ ssItem(sK24(sK49))
    | ~ ssList(sK27(sK49))
    | ~ ssList(sK28(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49)
    | ~ spl51_207 ),
    inference(forward_subsumption_resolution,[],[f7005,f670]) ).

fof(f7020,plain,
    ( ~ ssItem(sK24(sK49))
    | ~ ssList(sK28(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49)
    | ~ spl51_207 ),
    inference(forward_subsumption_resolution,[],[f7016,f672]) ).

fof(f7023,plain,
    ( ~ ssItem(sK24(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | strictorderedP(sK49)
    | ~ spl51_207 ),
    inference(forward_subsumption_resolution,[],[f7020,f674]) ).

fof(f7026,plain,
    ( ~ ssItem(sK24(sK49))
    | lt(sK24(sK49),sK25(sK49))
    | ~ spl51_207 ),
    inference(forward_subsumption_resolution,[],[f7023,f558]) ).

fof(f7029,plain,
    ( spl51_224
    | ~ spl51_220
    | ~ spl51_207 ),
    inference(avatar_split_clause,[],[f7026,f3338,f3399,f3417]) ).

fof(f18310,plain,
    ( ~ ssItem(sK25(sK49))
    | ~ leq(sK24(sK49),sK25(sK49))
    | ~ ssItem(sK24(sK49))
    | ~ spl51_224 ),
    inference(resolution,[],[f3419,f555]) ).

fof(f18315,plain,
    ( ~ leq(sK24(sK49),sK25(sK49))
    | ~ ssItem(sK24(sK49))
    | ~ spl51_207
    | ~ spl51_224 ),
    inference(forward_subsumption_resolution,[],[f18310,f3339]) ).

fof(f18330,plain,
    ( ~ leq(sK24(sK49),sK25(sK49))
    | ~ spl51_207
    | ~ spl51_220
    | ~ spl51_224 ),
    inference(forward_subsumption_resolution,[],[f18315,f3400]) ).

fof(f18332,plain,
    ( ~ spl51_218
    | ~ spl51_207
    | ~ spl51_220
    | ~ spl51_224 ),
    inference(avatar_split_clause,[],[f18330,f3417,f3399,f3338,f3391]) ).

fof(f18411,plain,
    ( ~ ssList(sK49)
    | ~ totalorderedP(sK49)
    | spl51_218 ),
    inference(resolution,[],[f3392,f490]) ).

fof(f18412,plain,
    ( ~ totalorderedP(sK49)
    | spl51_218 ),
    inference(forward_subsumption_resolution,[],[f18411,f418]) ).

fof(f18413,plain,
    ( $false
    | spl51_218 ),
    inference(forward_subsumption_resolution,[],[f18412,f559]) ).

fof(f18414,plain,
    spl51_218,
    inference(avatar_contradiction_clause,[],[f18413]) ).

cnf(s481,plain,
    spl51_207,
    inference(sat_conversion,[],[f5678]) ).

cnf(s513,plain,
    spl51_220,
    inference(sat_conversion,[],[f6092]) ).

cnf(s737,plain,
    ( ~ spl51_207
    | ~ spl51_220
    | spl51_224 ),
    inference(sat_conversion,[],[f7029]) ).

cnf(s1456,plain,
    ( ~ spl51_207
    | ~ spl51_218
    | ~ spl51_220
    | ~ spl51_224 ),
    inference(sat_conversion,[],[f18332]) ).

cnf(s1461,plain,
    spl51_218,
    inference(sat_conversion,[],[f18414]) ).

cnf(s1462,plain,
    ( ~ spl51_207
    | ~ spl51_220
    | ~ spl51_224 ),
    inference(rat,[],[s1456,s1461]) ).

cnf(s1483,plain,
    ~ spl51_224,
    inference(rat,[],[s1462,s513,s481]) ).

cnf(s1484,plain,
    $false,
    inference(rat,[],[s737,s513,s1483,s481]) ).

fof(f18415,plain,
    $false,
    inference(avatar_sat_refutation,[],[s1484]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC271+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n016.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 08:53:18 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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
% 2.87/0.68  % (3487454)Will run a generic schedule for satisfiability detection.
% 2.87/0.68  % (3487463)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2129355545:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.87/0.68  % (3487460)% WARNING: option uhcvi not known.
% 2.87/0.68  % (3487459)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3598254614_2999 on theBenchmark for (2999ds/0Mi)
% 2.87/0.68  % (3487461)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3533247982:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.87/0.68  % (3487462)dis+10_1_sil=32000:sp=arity:random_seed=3707419175:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.87/0.68  % (3487460)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3838044057:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.87/0.68  % (3487464)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=293447610:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.87/0.68  % (3487465)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=148714947:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.87/0.68  % TRYING [1]
% 2.87/0.68  % TRYING [2]
% 2.87/0.68  % TRYING [3]
% 2.87/0.68  % (3487463)Instruction limit reached! 
% 2.87/0.68  % (3487463)------------------------------
% 2.87/0.68  % (3487463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487463)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487463)Termination reason: Instruction limit
% 2.87/0.68  % (3487463)Termination phase: Saturation
% 2.87/0.68  % (3487463)Time elapsed: 0.038 s
% 2.87/0.68  % (3487463)Peak memory usage: 13 MB
% 2.87/0.68  % (3487463)Instructions burned: 119 (million)
% 2.87/0.68  % TRYING [4]
% 2.87/0.68  % (3487473)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=106341703:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.87/0.68  % TRYING [1]
% 2.87/0.68  % TRYING [2]
% 2.87/0.68  % TRYING [3]
% 2.87/0.68  % (3487462)Instruction limit reached! 
% 2.87/0.68  % (3487462)------------------------------
% 2.87/0.68  % (3487462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487462)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487462)Termination reason: Instruction limit
% 2.87/0.68  % (3487462)Termination phase: Saturation
% 2.87/0.68  % (3487462)Time elapsed: 0.060 s
% 2.87/0.68  % (3487462)Peak memory usage: 13 MB
% 2.87/0.68  % (3487462)Instructions burned: 104 (million)
% 2.87/0.68  % TRYING [4]
% 2.87/0.68  % (3487464)Instruction limit reached! 
% 2.87/0.68  % (3487464)------------------------------
% 2.87/0.68  % (3487464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487464)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487464)Termination reason: Instruction limit
% 2.87/0.68  % (3487464)Termination phase: Saturation
% 2.87/0.68  % (3487464)Time elapsed: 0.074 s
% 2.87/0.68  % (3487464)Peak memory usage: 14 MB
% 2.87/0.68  % (3487464)Instructions burned: 132 (million)
% 2.87/0.68  % (3487475)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1326872349:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.87/0.68  % TRYING [5]
% 2.87/0.68  % TRYING [5]
% 2.87/0.68  % (3487476)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=815194931:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.87/0.68  % (3487465)Instruction limit reached! 
% 2.87/0.68  % (3487465)------------------------------
% 2.87/0.68  % (3487465)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487465)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487465)Termination reason: Instruction limit
% 2.87/0.68  % (3487465)Termination phase: Saturation
% 2.87/0.68  % (3487465)Time elapsed: 0.103 s
% 2.87/0.68  % (3487465)Peak memory usage: 15 MB
% 2.87/0.68  % (3487465)Instructions burned: 160 (million)
% 2.87/0.68  % (3487479)ott-21_1_sil=16000:fs=off:random_seed=372365417:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.87/0.68  % (3487475)Instruction limit reached! 
% 2.87/0.68  % (3487475)------------------------------
% 2.87/0.68  % (3487475)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487475)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487475)Termination reason: Instruction limit
% 2.87/0.68  % (3487475)Termination phase: Saturation
% 2.87/0.68  % (3487475)Time elapsed: 0.072 s
% 2.87/0.68  % (3487475)Peak memory usage: 13 MB
% 2.87/0.68  % (3487475)Instructions burned: 131 (million)
% 2.87/0.68  % TRYING [6]
% 2.87/0.68  % (3487481)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1510114463:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.87/0.68  % (3487473)Instruction limit reached! 
% 2.87/0.68  % (3487473)------------------------------
% 2.87/0.68  % (3487473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487473)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487473)Termination reason: Instruction limit
% 2.87/0.68  % (3487473)Termination phase: Finite model building constraint generation
% 2.87/0.68  % (3487473)Time elapsed: 0.156 s
% 2.87/0.68  % (3487473)Peak memory usage: 29 MB
% 2.87/0.68  % (3487473)Instructions burned: 716 (million)
% 2.87/0.68  % (3487483)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2837978695:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.87/0.68  % TRYING [6]
% 2.87/0.68  % (3487479)Instruction limit reached! 
% 2.87/0.68  % (3487479)------------------------------
% 2.87/0.68  % (3487479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487479)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487479)Termination reason: Instruction limit
% 2.87/0.68  % (3487479)Termination phase: Saturation
% 2.87/0.68  % (3487479)Time elapsed: 0.092 s
% 2.87/0.68  % (3487479)Peak memory usage: 13 MB
% 2.87/0.68  % (3487479)Instructions burned: 182 (million)
% 2.87/0.68  % TRYING [1]
% 2.87/0.68  % TRYING [2]
% 2.87/0.68  % TRYING [3]
% 2.87/0.68  % (3487485)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=882393679:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.87/0.68  % TRYING [4]
% 2.87/0.68  % TRYING [5]
% 2.87/0.68  % (3487483)Instruction limit reached! 
% 2.87/0.68  % (3487483)------------------------------
% 2.87/0.68  % (3487483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487483)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487483)Termination reason: Instruction limit
% 2.87/0.68  % (3487483)Termination phase: Finite model building SAT solving
% 2.87/0.68  % (3487483)Time elapsed: 0.182 s
% 2.87/0.68  % (3487483)Peak memory usage: 23 MB
% 2.87/0.68  % (3487483)Instructions burned: 867 (million)
% 2.87/0.68  % (3487460) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3487454-3487460"...
% 2.87/0.68  % (3487487)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2415985557:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.87/0.68  % (3487460)...printing done.
% 2.87/0.68  % (3487460)Refutation found. Thanks to Tanya!
% 2.87/0.68  % SZS status Theorem for theBenchmark
% 2.87/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 2.87/0.68  % (3487460)------------------------------
% 2.87/0.68  % (3487460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.87/0.68  % (3487460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/0.68  % (3487460)CaDiCaL version: 2.1.3
% 2.87/0.68  % (3487460)Termination reason: Refutation
% 2.87/0.68  % (3487460)Time elapsed: 0.406 s
% 2.87/0.68  % (3487460)Peak memory usage: 22 MB
% 2.87/0.68  % (3487460)Instructions burned: 728 (million)
% 2.87/0.68  % (3487454)Success in time 0.452 s
% 2.87/0.68  % Vampire exiting
%------------------------------------------------------------------------------