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

% Result   : Theorem 0.17s 0.32s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   11
% Syntax   : Number of formulae    :  102 (  25 unt;   7 def)
%            Number of atoms       :  357 (  35 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  413 ( 158   ~; 191   |;  27   &)
%                                         (  15 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   8 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :  101 (   0 sgn  88   !;  13   ?)

% 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/sandbox/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/sandbox/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/sandbox/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
                  | ! [X4] :
                      ( ~ ssList(X4)
                      | app(X2,X4) != X3
                      | ~ strictorderedP(X2)
                      | ? [X5] :
                          ( ssItem(X5)
                          & ? [X6] :
                              ( ssList(X6)
                              & app(cons(X5,nil),X6) = X4
                              & ? [X7] :
                                  ( ssItem(X7)
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & app(X8,cons(X7,nil)) = X2
                                      & lt(X7,X5) ) ) ) ) )
                  | totalorderedP(X0)
                  | ( nil != X3
                    & nil = X2 ) ) ) ) ),
    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
                        | ~ strictorderedP(X2)
                        | ? [X5] :
                            ( ssItem(X5)
                            & ? [X6] :
                                ( ssList(X6)
                                & app(cons(X5,nil),X6) = X4
                                & ? [X7] :
                                    ( ssItem(X7)
                                    & ? [X8] :
                                        ( ssList(X8)
                                        & app(X8,cons(X7,nil)) = X2
                                        & lt(X7,X5) ) ) ) ) )
                    | totalorderedP(X0)
                    | ( nil != X3
                      & nil = X2 ) ) ) ) ),
    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] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ssList(X4)
                      & app(X2,X4) = X3
                      & strictorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ lt(X7,X5) ) ) ) ) )
                  & ~ totalorderedP(X0)
                  & ( nil = X3
                    | nil != X2 ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

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

fof(f273,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(f274,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ leq(sK24(X0),sK25(X0))
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f111]) ).

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

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

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

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

fof(f279,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(f405,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ lt(X0,X1) ),
    inference(cnf_transformation,[],[f216]) ).

fof(f411,plain,
    strictorderedP(sK49),
    inference(cnf_transformation,[],[f221]) ).

fof(f415,plain,
    ~ totalorderedP(sK47),
    inference(cnf_transformation,[],[f221]) ).

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

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

fof(f422,plain,
    ssList(sK49),
    inference(definition_unfolding,[],[f421,f416]) ).

fof(f424,plain,
    ~ totalorderedP(sK49),
    inference(definition_unfolding,[],[f415,f416]) ).

fof(f435,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,[],[f279]) ).

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

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

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

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

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

fof(f503,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,[],[f273]) ).

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

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

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

fof(f635,plain,
    ~ ssList(sK49),
    inference(consistent_polarity_flipping,[],[f422]) ).

fof(f639,plain,
    totalorderedP(sK49),
    inference(consistent_polarity_flipping,[],[f424]) ).

fof(f641,plain,
    ~ strictorderedP(sK49),
    inference(consistent_polarity_flipping,[],[f411]) ).

fof(f2454,plain,
    ( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
    | ssList(sK49) ),
    inference(resolution,[],[f503,f639]) ).

fof(f2459,plain,
    sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
    inference(forward_subsumption_resolution,[],[f2454,f635]) ).

fof(f5269,plain,
    ( strictorderedP(sK49)
    | ssItem(sK24(sK49))
    | ssItem(sK25(sK49))
    | ssList(sK26(sK49))
    | ssList(sK27(sK49))
    | ssList(sK28(sK49))
    | ~ lt(sK24(sK49),sK25(sK49))
    | ssList(sK49) ),
    inference(superposition,[],[f513,f2459]) ).

fof(f5343,definition,
    ( spl52_303
  <=> ssList(sK28(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_303])],[avatar_definition]) ).

fof(f5345,plain,
    ( ssList(sK28(sK49))
    | ~ spl52_303 ),
    inference(avatar_component_clause,[],[f5343]) ).

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

fof(f5348,plain,
    ( ~ ssItem(sK25(sK49))
    | spl52_304 ),
    inference(avatar_component_clause,[],[f5347]) ).

fof(f5349,plain,
    ( ssItem(sK25(sK49))
    | ~ spl52_304 ),
    inference(avatar_component_clause,[],[f5347]) ).

fof(f5380,definition,
    ( spl52_312
  <=> ssList(sK26(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_312])],[avatar_definition]) ).

fof(f5382,plain,
    ( ssList(sK26(sK49))
    | ~ spl52_312 ),
    inference(avatar_component_clause,[],[f5380]) ).

fof(f5388,plain,
    ( ssItem(sK24(sK49))
    | ssItem(sK25(sK49))
    | ssList(sK26(sK49))
    | ssList(sK27(sK49))
    | ssList(sK28(sK49))
    | ~ lt(sK24(sK49),sK25(sK49))
    | ssList(sK49) ),
    inference(forward_subsumption_resolution,[],[f5269,f641]) ).

fof(f5402,plain,
    ( ssItem(sK24(sK49))
    | ssItem(sK25(sK49))
    | ssList(sK26(sK49))
    | ssList(sK27(sK49))
    | ssList(sK28(sK49))
    | ~ lt(sK24(sK49),sK25(sK49)) ),
    inference(forward_subsumption_resolution,[],[f5388,f635]) ).

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

fof(f5405,plain,
    ( ~ leq(sK24(sK49),sK25(sK49))
    | spl52_316 ),
    inference(avatar_component_clause,[],[f5404]) ).

fof(f5406,plain,
    ( leq(sK24(sK49),sK25(sK49))
    | ~ spl52_316 ),
    inference(avatar_component_clause,[],[f5404]) ).

fof(f5412,definition,
    ( spl52_318
  <=> ssList(sK27(sK49)) ),
    introduced(definition,[new_symbols(definition,[spl52_318])],[avatar_definition]) ).

fof(f5414,plain,
    ( ssList(sK27(sK49))
    | ~ spl52_318 ),
    inference(avatar_component_clause,[],[f5412]) ).

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

fof(f5417,plain,
    ( ~ ssItem(sK24(sK49))
    | spl52_319 ),
    inference(avatar_component_clause,[],[f5416]) ).

fof(f5418,plain,
    ( ssItem(sK24(sK49))
    | ~ spl52_319 ),
    inference(avatar_component_clause,[],[f5416]) ).

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

fof(f5432,plain,
    ( ~ lt(sK24(sK49),sK25(sK49))
    | spl52_322 ),
    inference(avatar_component_clause,[],[f5430]) ).

fof(f5442,plain,
    ( ~ spl52_322
    | spl52_303
    | spl52_318
    | spl52_312
    | spl52_304
    | spl52_319 ),
    inference(avatar_split_clause,[],[f5402,f5416,f5347,f5380,f5412,f5343,f5430]) ).

fof(f5443,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | ~ spl52_303 ),
    inference(resolution,[],[f5345,f504]) ).

fof(f5444,plain,
    ( ~ totalorderedP(sK49)
    | ~ spl52_303 ),
    inference(forward_subsumption_resolution,[],[f5443,f635]) ).

fof(f5445,plain,
    ( $false
    | ~ spl52_303 ),
    inference(forward_subsumption_resolution,[],[f5444,f639]) ).

fof(f5446,plain,
    ~ spl52_303,
    inference(avatar_contradiction_clause,[],[f5445]) ).

fof(f5745,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | ~ spl52_304 ),
    inference(resolution,[],[f5349,f499]) ).

fof(f5746,plain,
    ( ~ totalorderedP(sK49)
    | ~ spl52_304 ),
    inference(forward_subsumption_resolution,[],[f5745,f635]) ).

fof(f5747,plain,
    ( $false
    | ~ spl52_304 ),
    inference(forward_subsumption_resolution,[],[f5746,f639]) ).

fof(f5748,plain,
    ~ spl52_304,
    inference(avatar_contradiction_clause,[],[f5747]) ).

fof(f5795,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | ~ spl52_312 ),
    inference(resolution,[],[f5382,f500]) ).

fof(f5796,plain,
    ( ~ totalorderedP(sK49)
    | ~ spl52_312 ),
    inference(forward_subsumption_resolution,[],[f5795,f635]) ).

fof(f5797,plain,
    ( $false
    | ~ spl52_312 ),
    inference(forward_subsumption_resolution,[],[f5796,f639]) ).

fof(f5798,plain,
    ~ spl52_312,
    inference(avatar_contradiction_clause,[],[f5797]) ).

fof(f6560,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | spl52_316 ),
    inference(resolution,[],[f5405,f502]) ).

fof(f6561,plain,
    ( ~ totalorderedP(sK49)
    | spl52_316 ),
    inference(forward_subsumption_resolution,[],[f6560,f635]) ).

fof(f6562,plain,
    ( $false
    | spl52_316 ),
    inference(forward_subsumption_resolution,[],[f6561,f639]) ).

fof(f6563,plain,
    spl52_316,
    inference(avatar_contradiction_clause,[],[f6562]) ).

fof(f6569,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | ~ spl52_319 ),
    inference(resolution,[],[f5418,f498]) ).

fof(f6570,plain,
    ( ~ totalorderedP(sK49)
    | ~ spl52_319 ),
    inference(forward_subsumption_resolution,[],[f6569,f635]) ).

fof(f6571,plain,
    ( $false
    | ~ spl52_319 ),
    inference(forward_subsumption_resolution,[],[f6570,f639]) ).

fof(f6572,plain,
    ~ spl52_319,
    inference(avatar_contradiction_clause,[],[f6571]) ).

fof(f6632,plain,
    ( ssItem(sK25(sK49))
    | ~ leq(sK24(sK49),sK25(sK49))
    | ssItem(sK24(sK49))
    | spl52_322 ),
    inference(resolution,[],[f5432,f632]) ).

fof(f6633,plain,
    ( ~ leq(sK24(sK49),sK25(sK49))
    | ssItem(sK24(sK49))
    | spl52_304
    | spl52_322 ),
    inference(forward_subsumption_resolution,[],[f6632,f5348]) ).

fof(f6635,plain,
    ( ssItem(sK24(sK49))
    | spl52_304
    | ~ spl52_316
    | spl52_322 ),
    inference(forward_subsumption_resolution,[],[f6633,f5406]) ).

fof(f6637,plain,
    ( $false
    | spl52_304
    | ~ spl52_316
    | spl52_319
    | spl52_322 ),
    inference(forward_subsumption_resolution,[],[f6635,f5417]) ).

fof(f6638,plain,
    ( spl52_304
    | ~ spl52_316
    | spl52_319
    | spl52_322 ),
    inference(avatar_contradiction_clause,[],[f6637]) ).

fof(f6641,plain,
    ( ssList(sK49)
    | ~ totalorderedP(sK49)
    | ~ spl52_318 ),
    inference(resolution,[],[f5414,f501]) ).

fof(f6642,plain,
    ( ~ totalorderedP(sK49)
    | ~ spl52_318 ),
    inference(forward_subsumption_resolution,[],[f6641,f635]) ).

fof(f6643,plain,
    ( $false
    | ~ spl52_318 ),
    inference(forward_subsumption_resolution,[],[f6642,f639]) ).

fof(f6644,plain,
    ~ spl52_318,
    inference(avatar_contradiction_clause,[],[f6643]) ).

cnf(s329,plain,
    ( spl52_303
    | spl52_304
    | spl52_312
    | spl52_318
    | spl52_319
    | ~ spl52_322 ),
    inference(sat_conversion,[],[f5442]) ).

cnf(s330,plain,
    ~ spl52_303,
    inference(sat_conversion,[],[f5446]) ).

cnf(s356,plain,
    ~ spl52_304,
    inference(sat_conversion,[],[f5748]) ).

cnf(s357,plain,
    ~ spl52_312,
    inference(sat_conversion,[],[f5798]) ).

cnf(s373,plain,
    spl52_316,
    inference(sat_conversion,[],[f6563]) ).

cnf(s376,plain,
    ~ spl52_319,
    inference(sat_conversion,[],[f6572]) ).

cnf(s378,plain,
    ( spl52_304
    | ~ spl52_316
    | spl52_319
    | spl52_322 ),
    inference(sat_conversion,[],[f6638]) ).

cnf(s380,plain,
    ~ spl52_318,
    inference(sat_conversion,[],[f6644]) ).

cnf(s384,plain,
    spl52_322,
    inference(rat,[],[s378,s373,s376,s356]) ).

cnf(s386,plain,
    $false,
    inference(rat,[],[s329,s384,s376,s380,s357,s356,s330]) ).

fof(f6645,plain,
    $false,
    inference(avatar_sat_refutation,[],[s386]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC272+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n008.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 08:49:24 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  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
% 0.17/0.32  % (2107172)Will run a generic schedule for satisfiability detection.
% 0.17/0.32  % (2107178)% WARNING: option uhcvi not known.
% 0.17/0.32  % (2107178)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1537175695:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.32  % (2107179)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1100627074:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.32  % (2107177)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2257983464_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.32  % (2107180)dis+10_1_sil=32000:sp=arity:random_seed=1913338988:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.32  % (2107181)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1480891323:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.32  % (2107182)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=557752387:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.32  % (2107183)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1291370391:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.32  % TRYING [1]
% 0.17/0.32  % TRYING [2]
% 0.17/0.32  % TRYING [3]
% 0.17/0.32  % TRYING [4]
% 0.17/0.32  % (2107180)Instruction limit reached! 
% 0.17/0.32  % (2107180)------------------------------
% 0.17/0.32  % (2107180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.32  % (2107180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.32  % (2107180)CaDiCaL version: 2.1.3
% 0.17/0.32  % (2107180)Termination reason: Instruction limit
% 0.17/0.32  % (2107180)Termination phase: Saturation
% 0.17/0.32  % (2107180)Time elapsed: 0.061 s
% 0.17/0.32  % (2107180)Peak memory usage: 13 MB
% 0.17/0.32  % (2107180)Instructions burned: 103 (million)
% 0.17/0.32  % (2107178) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2107172-2107178"...
% 0.17/0.32  % (2107178)...printing done.
% 0.17/0.32  % (2107178)Refutation found. Thanks to Tanya!
% 0.17/0.32  % SZS status Theorem for theBenchmark
% 0.17/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.32  % (2107178)------------------------------
% 0.17/0.32  % (2107178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.32  % (2107178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.32  % (2107178)CaDiCaL version: 2.1.3
% 0.17/0.32  % (2107178)Termination reason: Refutation
% 0.17/0.32  % (2107178)Time elapsed: 0.072 s
% 0.17/0.32  % (2107178)Peak memory usage: 16 MB
% 0.17/0.32  % (2107178)Instructions burned: 233 (million)
% 0.17/0.32  % (2107172)Success in time 0.104 s
% 0.17/0.32  % Vampire exiting
%------------------------------------------------------------------------------