↑ 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  : SEU145+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n026.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 12:52:05 PM UTC 2026

% Result   : Theorem 6.85s 1.55s
% Output   : Refutation 6.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   18
% Syntax   : Number of formulae    :  118 (  29 unt;   8 def)
%            Number of atoms       :  371 (  77 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  414 ( 161   ~; 167   |;  66   &)
%                                         (  16 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :  149 (   0 sgn 131   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0,X1] :
      ( X1 = singleton(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X2 = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

fof(f8,axiom,
    ! [X0] :
      ( X0 = empty_set
    <=> ! [X1] : ~ in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f10,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_union2(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            | in(X3,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

fof(f11,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(f13,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_difference(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & ~ in(X3,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).

fof(f28,axiom,
    ! [X0] : singleton(X0) != empty_set,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).

fof(f29,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f31,conjecture,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( in(X2,X0)
        | subset(X0,set_difference(X1,singleton(X2))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).

fof(f32,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( subset(X0,X1)
       => ( in(X2,X0)
          | subset(X0,set_difference(X1,singleton(X2))) ) ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f37,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f61,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f77,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f82,plain,
    ? [X0,X1,X2] :
      ( ~ in(X2,X0)
      & ~ subset(X0,set_difference(X1,singleton(X2)))
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f83,plain,
    ? [X0,X1,X2] :
      ( ~ in(X2,X0)
      & ~ subset(X0,set_difference(X1,singleton(X2)))
      & subset(X0,X1) ),
    inference(flattening,[],[f82]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X2 = X0
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | X0 != X2 )
            & ( X2 = X0
              | ~ in(X2,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f109,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X2 = X0
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(rectify,[],[f108]) ).

fof(f110,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ( ( sK0(X0,X1) != X0
            | ~ in(sK0(X0,X1),X1) )
          & ( sK0(X0,X1) = X0
            | in(sK0(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f109]) ).

fof(f111,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | ? [X1] : in(X1,X0) )
      & ( ! [X1] : ~ in(X1,X0)
        | empty_set != X0 ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f112,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | ? [X1] : in(X1,X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(rectify,[],[f111]) ).

fof(f113,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | in(sK1(X0),X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f112]) ).

fof(f118,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X0)
                & ~ in(X3,X1) ) )
            & ( in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f119,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X0)
                & ~ in(X3,X1) ) )
            & ( in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(flattening,[],[f118]) ).

fof(f120,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X0)
                & ~ in(X4,X1) ) )
            & ( in(X4,X0)
              | in(X4,X1)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(rectify,[],[f119]) ).

fof(f121,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ( ( ( ~ in(sK3(X0,X1,X2),X0)
              & ~ in(sK3(X0,X1,X2),X1) )
            | ~ in(sK3(X0,X1,X2),X2) )
          & ( in(sK3(X0,X1,X2),X0)
            | in(sK3(X0,X1,X2),X1)
            | in(sK3(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X0)
                & ~ in(X4,X1) ) )
            & ( in(X4,X0)
              | in(X4,X1)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f120]) ).

fof(f122,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f77]) ).

fof(f123,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f122]) ).

fof(f124,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK4(X0,X1),X1)
          & in(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f123]) ).

fof(f129,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | in(X3,X1) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f130,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | in(X3,X1) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(flattening,[],[f129]) ).

fof(f131,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | in(X4,X1) )
            & ( ( in(X4,X0)
                & ~ in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(rectify,[],[f130]) ).

fof(f132,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ( ( ~ in(sK6(X0,X1,X2),X0)
            | in(sK6(X0,X1,X2),X1)
            | ~ in(sK6(X0,X1,X2),X2) )
          & ( ( in(sK6(X0,X1,X2),X0)
              & ~ in(sK6(X0,X1,X2),X1) )
            | in(sK6(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | in(X4,X1) )
            & ( ( in(X4,X0)
                & ~ in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X3,sK6(X0,X1,X2))],[f131]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( ( subset(singleton(X0),X1)
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ~ subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f29]) ).

fof(f136,plain,
    ( ~ in(sK9,sK7)
    & ~ subset(sK7,set_difference(sK8,singleton(sK9)))
    & subset(sK7,sK8) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X0,sK7),skolemize(X1,sK8),skolemize(X2,sK9)],[f83]) ).

fof(f153,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,X1)
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f110]) ).

fof(f158,plain,
    ! [X0] :
      ( in(sK1(X0),X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f113]) ).

fof(f167,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f121]) ).

fof(f172,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK4(X0,X1),X0) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f173,plain,
    ! [X0,X1] :
      ( ~ in(sK4(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f182,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | in(X4,X1)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f132]) ).

fof(f195,plain,
    ! [X0] : singleton(X0) != empty_set,
    inference(cnf_transformation,[],[f28]) ).

fof(f196,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | ~ subset(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f200,plain,
    subset(sK7,sK8),
    inference(cnf_transformation,[],[f136]) ).

fof(f201,plain,
    ~ subset(sK7,set_difference(sK8,singleton(sK9))),
    inference(cnf_transformation,[],[f136]) ).

fof(f202,plain,
    ~ in(sK9,sK7),
    inference(cnf_transformation,[],[f136]) ).

fof(f207,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_union2(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f85]) ).

fof(f236,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f61]) ).

fof(f248,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,X1)
      | unordered_pair(X0,X0) != X1 ),
    inference(definition_unfolding,[],[f153,f236]) ).

fof(f258,plain,
    ! [X0] : empty_set != unordered_pair(X0,X0),
    inference(definition_unfolding,[],[f195,f236]) ).

fof(f260,plain,
    ! [X0,X1] :
      ( ~ subset(unordered_pair(X0,X0),X1)
      | in(X0,X1) ),
    inference(definition_unfolding,[],[f196,f236]) ).

fof(f261,plain,
    ~ subset(sK7,set_difference(sK8,unordered_pair(sK9,sK9))),
    inference(definition_unfolding,[],[f201,f236]) ).

fof(f273,plain,
    ! [X3,X0] :
      ( ~ in(X3,unordered_pair(X0,X0))
      | X0 = X3 ),
    inference(equality_resolution,[],[f248]) ).

fof(f280,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f167]) ).

fof(f286,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_difference(X0,X1))
      | ~ in(X4,X0)
      | in(X4,X1) ),
    inference(equality_resolution,[],[f182]) ).

fof(f289,definition,
    sF15 = unordered_pair(sK9,sK9),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f290,plain,
    unordered_pair(sK9,sK9) = sF15,
    inference(reorient_equations,[],[f289]) ).

fof(f291,definition,
    sF16 = set_difference(sK8,sF15),
    introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).

fof(f292,plain,
    set_difference(sK8,sF15) = sF16,
    inference(reorient_equations,[],[f291]) ).

fof(f293,plain,
    ~ subset(sK7,sF16),
    inference(definition_folding,[],[f261,f292,f290]) ).

fof(f305,plain,
    empty_set != sF15,
    inference(superposition,[],[f258,f290]) ).

fof(f378,plain,
    sK8 = set_union2(sK7,sK8),
    inference(resolution,[],[f207,f200]) ).

fof(f471,plain,
    ! [X0] :
      ( ~ subset(sF15,X0)
      | in(sK9,X0) ),
    inference(superposition,[],[f260,f290]) ).

fof(f480,plain,
    ! [X0] :
      ( ~ in(X0,sF15)
      | sK9 = X0 ),
    inference(superposition,[],[f273,f290]) ).

fof(f485,plain,
    in(sK4(sK7,sF16),sK7),
    inference(resolution,[],[f172,f293]) ).

fof(f503,plain,
    ! [X0] :
      ( ~ in(X0,sK7)
      | in(X0,sK8) ),
    inference(superposition,[],[f280,f378]) ).

fof(f514,plain,
    in(sK4(sK7,sF16),sK8),
    inference(resolution,[],[f503,f485]) ).

fof(f1028,plain,
    ! [X0] :
      ( ~ in(X0,sK8)
      | in(X0,sF16)
      | in(X0,sF15) ),
    inference(superposition,[],[f286,f292]) ).

fof(f1668,definition,
    ( spl17_17
  <=> in(sK4(sF15,sK7),sF15) ),
    introduced(definition,[new_symbols(definition,[spl17_17])],[avatar_definition]) ).

fof(f1669,plain,
    ( ~ in(sK4(sF15,sK7),sF15)
    | spl17_17 ),
    inference(avatar_component_clause,[],[f1668]) ).

fof(f1670,plain,
    ( in(sK4(sF15,sK7),sF15)
    | ~ spl17_17 ),
    inference(avatar_component_clause,[],[f1668]) ).

fof(f1679,plain,
    ( sK9 = sK4(sF15,sK7)
    | ~ spl17_17 ),
    inference(resolution,[],[f480,f1670]) ).

fof(f1680,plain,
    ( sK9 = sK1(sF15)
    | empty_set = sF15 ),
    inference(resolution,[],[f480,f158]) ).

fof(f1702,definition,
    ( spl17_20
  <=> sK9 = sK4(sF15,sK7) ),
    introduced(definition,[new_symbols(definition,[spl17_20])],[avatar_definition]) ).

fof(f1704,plain,
    ( sK9 = sK4(sF15,sK7)
    | ~ spl17_20 ),
    inference(avatar_component_clause,[],[f1702]) ).

fof(f1706,plain,
    sK9 = sK1(sF15),
    inference(forward_subsumption_resolution,[],[f1680,f305]) ).

fof(f1707,plain,
    ( spl17_20
    | ~ spl17_17 ),
    inference(avatar_split_clause,[],[f1679,f1668,f1702]) ).

fof(f3574,plain,
    ( in(sK4(sK7,sF16),sF16)
    | in(sK4(sK7,sF16),sF15) ),
    inference(resolution,[],[f1028,f514]) ).

fof(f3711,definition,
    ( spl17_57
  <=> in(sK4(sK7,sF16),sF15) ),
    introduced(definition,[new_symbols(definition,[spl17_57])],[avatar_definition]) ).

fof(f3713,plain,
    ( in(sK4(sK7,sF16),sF15)
    | ~ spl17_57 ),
    inference(avatar_component_clause,[],[f3711]) ).

fof(f3715,definition,
    ( spl17_58
  <=> in(sK4(sK7,sF16),sF16) ),
    introduced(definition,[new_symbols(definition,[spl17_58])],[avatar_definition]) ).

fof(f3717,plain,
    ( in(sK4(sK7,sF16),sF16)
    | ~ spl17_58 ),
    inference(avatar_component_clause,[],[f3715]) ).

fof(f3718,plain,
    ( spl17_57
    | spl17_58 ),
    inference(avatar_split_clause,[],[f3574,f3715,f3711]) ).

fof(f3740,plain,
    ( sK4(sF15,sK7) = sK1(sF15)
    | ~ spl17_20 ),
    inference(forward_demodulation,[],[f1704,f1706]) ).

fof(f15982,plain,
    ( subset(sK7,sF16)
    | ~ spl17_58 ),
    inference(resolution,[],[f3717,f173]) ).

fof(f16003,plain,
    ( $false
    | ~ spl17_58 ),
    inference(forward_subsumption_resolution,[],[f15982,f293]) ).

fof(f16004,plain,
    ~ spl17_58,
    inference(avatar_contradiction_clause,[],[f16003]) ).

fof(f16005,plain,
    ( sK9 = sK4(sK7,sF16)
    | ~ spl17_57 ),
    inference(resolution,[],[f3713,f480]) ).

fof(f16024,plain,
    ( sK4(sK7,sF16) = sK1(sF15)
    | ~ spl17_57 ),
    inference(forward_demodulation,[],[f16005,f1706]) ).

fof(f18605,plain,
    ( ~ in(sK1(sF15),sK7)
    | subset(sF15,sK7)
    | ~ spl17_20 ),
    inference(superposition,[],[f173,f3740]) ).

fof(f18607,definition,
    ( spl17_169
  <=> subset(sF15,sK7) ),
    introduced(definition,[new_symbols(definition,[spl17_169])],[avatar_definition]) ).

fof(f18608,plain,
    ( ~ subset(sF15,sK7)
    | spl17_169 ),
    inference(avatar_component_clause,[],[f18607]) ).

fof(f18609,plain,
    ( subset(sF15,sK7)
    | ~ spl17_169 ),
    inference(avatar_component_clause,[],[f18607]) ).

fof(f18611,definition,
    ( spl17_170
  <=> in(sK1(sF15),sK7) ),
    introduced(definition,[new_symbols(definition,[spl17_170])],[avatar_definition]) ).

fof(f18613,plain,
    ( ~ in(sK1(sF15),sK7)
    | spl17_170 ),
    inference(avatar_component_clause,[],[f18611]) ).

fof(f18614,plain,
    ( spl17_169
    | ~ spl17_170
    | ~ spl17_20 ),
    inference(avatar_split_clause,[],[f18605,f1702,f18611,f18607]) ).

fof(f19064,plain,
    ( in(sK1(sF15),sK7)
    | ~ spl17_57 ),
    inference(superposition,[],[f485,f16024]) ).

fof(f19084,plain,
    ( $false
    | ~ spl17_57
    | spl17_170 ),
    inference(forward_subsumption_resolution,[],[f19064,f18613]) ).

fof(f19085,plain,
    ( ~ spl17_57
    | spl17_170 ),
    inference(avatar_contradiction_clause,[],[f19084]) ).

fof(f19949,plain,
    ( in(sK9,sK7)
    | ~ spl17_169 ),
    inference(resolution,[],[f18609,f471]) ).

fof(f19998,plain,
    ( $false
    | ~ spl17_169 ),
    inference(forward_subsumption_resolution,[],[f19949,f202]) ).

fof(f19999,plain,
    ~ spl17_169,
    inference(avatar_contradiction_clause,[],[f19998]) ).

fof(f20268,plain,
    ( in(sK4(sF15,sK7),sF15)
    | spl17_169 ),
    inference(resolution,[],[f18608,f172]) ).

fof(f20269,plain,
    ( $false
    | spl17_17
    | spl17_169 ),
    inference(forward_subsumption_resolution,[],[f20268,f1669]) ).

fof(f20270,plain,
    ( spl17_17
    | spl17_169 ),
    inference(avatar_contradiction_clause,[],[f20269]) ).

cnf(s15,plain,
    ( ~ spl17_17
    | spl17_20 ),
    inference(sat_conversion,[],[f1707]) ).

cnf(s38,plain,
    ( spl17_57
    | spl17_58 ),
    inference(sat_conversion,[],[f3718]) ).

cnf(s185,plain,
    ~ spl17_58,
    inference(sat_conversion,[],[f16004]) ).

cnf(s189,plain,
    ( ~ spl17_20
    | spl17_169
    | ~ spl17_170 ),
    inference(sat_conversion,[],[f18614]) ).

cnf(s190,plain,
    ( ~ spl17_57
    | spl17_170 ),
    inference(sat_conversion,[],[f19085]) ).

cnf(s197,plain,
    ~ spl17_169,
    inference(sat_conversion,[],[f19999]) ).

cnf(s198,plain,
    ( spl17_17
    | spl17_169 ),
    inference(sat_conversion,[],[f20270]) ).

cnf(s199,plain,
    spl17_17,
    inference(rat,[],[s198,s197]) ).

cnf(s200,plain,
    ( ~ spl17_20
    | ~ spl17_170 ),
    inference(rat,[],[s189,s197]) ).

cnf(s211,plain,
    spl17_57,
    inference(rat,[],[s38,s185]) ).

cnf(s212,plain,
    spl17_170,
    inference(rat,[],[s190,s211]) ).

cnf(s213,plain,
    ~ spl17_20,
    inference(rat,[],[s200,s212]) ).

cnf(s225,plain,
    $false,
    inference(rat,[],[s15,s213,s199]) ).

fof(f20271,plain,
    $false,
    inference(avatar_sat_refutation,[],[s225]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU145+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  % Computer : n026.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Mon Sep 28 03:46:42 UTC 2026
% 0.12/0.41  % CPUTime  : 
% 0.12/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44  Running first-order model finding
% 0.12/0.44  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
% 6.85/1.55  % (3441356)Will run a generic schedule for satisfiability detection.
% 6.85/1.55  % (3441361)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2133285677_2999 on theBenchmark for (2999ds/0Mi)
% 6.85/1.55  % TRYING [1]
% 6.85/1.55  % TRYING [2]
% 6.85/1.55  % (3441362)% WARNING: option uhcvi not known.
% 6.85/1.55  % TRYING [3]
% 6.85/1.55  % (3441365)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1733502214:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.85/1.55  % (3441362)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2080250602:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.85/1.55  % (3441363)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1962025705:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.85/1.55  % (3441364)dis+10_1_sil=32000:sp=arity:random_seed=3044338406:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.85/1.55  % (3441366)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2377763231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.85/1.55  % (3441367)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=94898436:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.85/1.55  % TRYING [4]
% 6.85/1.55  % TRYING [5]
% 6.85/1.55  % TRYING [6]
% 6.85/1.55  % (3441364)Instruction limit reached! 
% 6.85/1.55  % (3441364)------------------------------
% 6.85/1.55  % (3441364)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441364)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441364)Termination reason: Instruction limit
% 6.85/1.55  % (3441364)Termination phase: Saturation
% 6.85/1.55  % (3441364)Time elapsed: 0.067 s
% 6.85/1.55  % (3441364)Peak memory usage: 12 MB
% 6.85/1.55  % (3441364)Instructions burned: 103 (million)
% 6.85/1.55  % (3441365)Instruction limit reached! 
% 6.85/1.55  % (3441365)------------------------------
% 6.85/1.55  % (3441365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441365)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441365)Termination reason: Instruction limit
% 6.85/1.55  % (3441365)Termination phase: Saturation
% 6.85/1.55  % (3441365)Time elapsed: 0.076 s
% 6.85/1.55  % (3441365)Peak memory usage: 12 MB
% 6.85/1.55  % (3441365)Instructions burned: 117 (million)
% 6.85/1.55  % (3441366)Instruction limit reached! 
% 6.85/1.55  % (3441366)------------------------------
% 6.85/1.55  % (3441366)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441366)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441366)Termination reason: Instruction limit
% 6.85/1.55  % (3441366)Termination phase: Saturation
% 6.85/1.55  % (3441366)Time elapsed: 0.083 s
% 6.85/1.55  % (3441366)Peak memory usage: 13 MB
% 6.85/1.55  % (3441366)Instructions burned: 131 (million)
% 6.85/1.55  % (3441375)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2725706716:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 6.85/1.55  % TRYING [1]
% 6.85/1.55  % TRYING [2]
% 6.85/1.55  % (3441376)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1010200673:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.85/1.55  % TRYING [3]
% 6.85/1.55  % TRYING [7]
% 6.85/1.55  % (3441377)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=3704713265:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.85/1.55  % TRYING [4]
% 6.85/1.55  % (3441367)Instruction limit reached! 
% 6.85/1.55  % (3441367)------------------------------
% 6.85/1.55  % (3441367)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441367)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441367)Termination reason: Instruction limit
% 6.85/1.55  % (3441367)Termination phase: Saturation
% 6.85/1.55  % (3441367)Time elapsed: 0.109 s
% 6.85/1.55  % (3441367)Peak memory usage: 13 MB
% 6.85/1.55  % (3441367)Instructions burned: 159 (million)
% 6.85/1.55  % (3441381)ott-21_1_sil=16000:fs=off:random_seed=506692153:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.85/1.55  % TRYING [5]
% 6.85/1.55  % (3441376)Instruction limit reached! 
% 6.85/1.55  % (3441376)------------------------------
% 6.85/1.55  % (3441376)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441376)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441376)Termination reason: Instruction limit
% 6.85/1.55  % (3441376)Termination phase: Saturation
% 6.85/1.55  % (3441376)Time elapsed: 0.091 s
% 6.85/1.55  % (3441376)Peak memory usage: 13 MB
% 6.85/1.55  % (3441376)Instructions burned: 131 (million)
% 6.85/1.55  % TRYING [6]
% 6.85/1.55  % (3441383)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3988092084:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 6.85/1.55  % TRYING [8]
% 6.85/1.55  % (3441381)Instruction limit reached! 
% 6.85/1.55  % (3441381)------------------------------
% 6.85/1.55  % (3441381)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441381)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441381)Termination reason: Instruction limit
% 6.85/1.55  % (3441381)Termination phase: Saturation
% 6.85/1.55  % (3441381)Time elapsed: 0.093 s
% 6.85/1.55  % (3441381)Peak memory usage: 13 MB
% 6.85/1.55  % (3441381)Instructions burned: 182 (million)
% 6.85/1.55  % (3441385)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3529087963:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.85/1.55  % TRYING [1]
% 6.85/1.55  % TRYING [2]
% 6.85/1.55  % TRYING [3]
% 6.85/1.55  % TRYING [4]
% 6.85/1.55  % TRYING [5]
% 6.85/1.55  % TRYING [7]
% 6.85/1.55  % (3441375)Instruction limit reached! 
% 6.85/1.55  % (3441375)------------------------------
% 6.85/1.55  % (3441375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441375)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441375)Termination reason: Instruction limit
% 6.85/1.55  % (3441375)Termination phase: Finite model building constraint generation
% 6.85/1.55  % (3441375)Time elapsed: 0.278 s
% 6.85/1.55  % (3441375)Peak memory usage: 29 MB
% 6.85/1.55  % (3441375)Instructions burned: 717 (million)
% 6.85/1.55  % (3441387)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=442709940:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 6.85/1.55  % TRYING [9]
% 6.85/1.55  % TRYING [6]
% 6.85/1.55  % (3441377)Instruction limit reached! 
% 6.85/1.55  % (3441377)------------------------------
% 6.85/1.55  % (3441377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441377)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441377)Termination reason: Instruction limit
% 6.85/1.55  % (3441377)Termination phase: Saturation
% 6.85/1.55  % (3441377)Time elapsed: 0.412 s
% 6.85/1.55  % (3441377)Peak memory usage: 20 MB
% 6.85/1.55  % (3441377)Instructions burned: 685 (million)
% 6.85/1.55  % (3441383)Instruction limit reached! 
% 6.85/1.55  % (3441383)------------------------------
% 6.85/1.55  % (3441383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441383)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441383)Termination reason: Instruction limit
% 6.85/1.55  % (3441383)Termination phase: Saturation
% 6.85/1.55  % (3441383)Time elapsed: 0.312 s
% 6.85/1.55  % (3441383)Peak memory usage: 15 MB
% 6.85/1.55  % (3441383)Instructions burned: 477 (million)
% 6.85/1.55  % (3441389)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=851236074:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 6.85/1.55  % (3441390)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=698006259: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)
% 6.85/1.55  % (3441385)Instruction limit reached! 
% 6.85/1.55  % (3441385)------------------------------
% 6.85/1.55  % (3441385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441385)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441385)Termination reason: Instruction limit
% 6.85/1.55  % (3441385)Termination phase: Finite model building SAT solving
% 6.85/1.55  % (3441385)Time elapsed: 0.348 s
% 6.85/1.55  % (3441385)Peak memory usage: 25 MB
% 6.85/1.55  % (3441385)Instructions burned: 866 (million)
% 6.85/1.55  % (3441393)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2520710562:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 6.85/1.55  % TRYING [14]
% 6.85/1.55  % TRYING [10]
% 6.85/1.55  % (3441389)Instruction limit reached! 
% 6.85/1.55  % (3441389)------------------------------
% 6.85/1.55  % (3441389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441389)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441389)Termination reason: Instruction limit
% 6.85/1.55  % (3441389)Termination phase: Finite model building constraint generation
% 6.85/1.55  % (3441389)Time elapsed: 0.338 s
% 6.85/1.55  % (3441389)Peak memory usage: 80 MB
% 6.85/1.55  % (3441389)Instructions burned: 889 (million)
% 6.85/1.55  % (3441395)fmb+10_1_sil=64000:random_seed=4125283133:i=22061:nm=2:gsp=on_2990 on theBenchmark for (2990ds/22061Mi)
% 6.85/1.55  % TRYING [1]
% 6.85/1.55  % TRYING [2]
% 6.85/1.55  % TRYING [3]
% 6.85/1.55  % TRYING [4]
% 6.85/1.55  % (3441390)Instruction limit reached! 
% 6.85/1.55  % (3441390)------------------------------
% 6.85/1.55  % (3441390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441390)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441390)Termination reason: Instruction limit
% 6.85/1.55  % (3441390)Termination phase: Saturation
% 6.85/1.55  % (3441390)Time elapsed: 0.428 s
% 6.85/1.55  % (3441390)Peak memory usage: 19 MB
% 6.85/1.55  % (3441390)Instructions burned: 694 (million)
% 6.85/1.55  % TRYING [5]
% 6.85/1.55  % (3441397)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=4048441173:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 6.85/1.55  % TRYING [20]
% 6.85/1.55  % (3441387) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3441356-3441387"...
% 6.85/1.55  % (3441387)...printing done.
% 6.85/1.55  % (3441387)Refutation found. Thanks to Tanya!
% 6.85/1.55  % SZS status Theorem for theBenchmark
% 6.85/1.55  % SZS output start Proof for theBenchmark
% See solution above
% 6.85/1.55  % (3441387)------------------------------
% 6.85/1.55  % (3441387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.55  % (3441387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.55  % (3441387)CaDiCaL version: 2.1.3
% 6.85/1.55  % (3441387)Termination reason: Refutation
% 6.85/1.55  % (3441387)Time elapsed: 0.656 s
% 6.85/1.55  % (3441387)Peak memory usage: 21 MB
% 6.85/1.55  % (3441387)Instructions burned: 1058 (million)
% 6.85/1.55  % (3441356)Success in time 1.097 s
% 6.85/1.55  % Vampire exiting
%------------------------------------------------------------------------------