↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU170+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:47:33 PM UTC 2026

% Result   : Theorem 4.75s 1.68s
% Output   : Refutation 6.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   81 (   9 unt;   2 def)
%            Number of atoms       :  324 (  28 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  388 ( 145   ~; 143   |;  81   &)
%                                         (  10 <=>;   8  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   3 con; 0-3 aty)
%            Number of variables   :  154 (   0 sgn 131   !;  23   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

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

fof(f15,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_intersection2(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & in(X3,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).

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

fof(f18,axiom,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
     => subset_complement(X0,X1) = set_difference(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).

fof(f50,axiom,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
     => ! [X2] :
          ( in(X2,X1)
         => in(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_subset_1) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ~ ( ~ disjoint(X0,X1)
          & ! [X2] :
              ~ ( in(X2,X0)
                & in(X2,X1) ) )
      & ~ ( ? [X2] :
              ( in(X2,X0)
              & in(X2,X1) )
          & disjoint(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).

fof(f89,conjecture,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
     => ! [X2] :
          ( element(X2,powerset(X0))
         => ( disjoint(X1,X2)
          <=> subset(X1,subset_complement(X0,X2)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_subset_1) ).

fof(f90,negated_conjecture,
    ~ ! [X0,X1] :
        ( element(X1,powerset(X0))
       => ! [X2] :
            ( element(X2,powerset(X0))
           => ( disjoint(X1,X2)
            <=> subset(X1,subset_complement(X0,X2)) ) ) ),
    inference(negated_conjecture,[status(cth)],[f89]) ).

fof(f95,axiom,
    ! [X0,X1] :
      ( ~ ( ~ disjoint(X0,X1)
          & ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
      & ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
          & disjoint(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ~ ( ~ disjoint(X0,X1)
          & ! [X2] :
              ~ ( in(X2,X0)
                & in(X2,X1) ) )
      & ~ ( ? [X3] :
              ( in(X3,X0)
              & in(X3,X1) )
          & disjoint(X0,X1) ) ),
    inference(rectify,[],[f86]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( ~ ( ~ disjoint(X0,X1)
          & ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
      & ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
          & disjoint(X0,X1) ) ),
    inference(rectify,[],[f95]) ).

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

fof(f127,plain,
    ! [X0,X1] :
      ( subset_complement(X0,X1) = set_difference(X0,X1)
      | ~ element(X1,powerset(X0)) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f137,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
          | ~ in(X2,X1) )
      | ~ element(X1,powerset(X0)) ),
    inference(ennf_transformation,[],[f50]) ).

fof(f159,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | ? [X2] :
            ( in(X2,X0)
            & in(X2,X1) ) )
      & ( ! [X3] :
            ( ~ in(X3,X0)
            | ~ in(X3,X1) )
        | ~ disjoint(X0,X1) ) ),
    inference(ennf_transformation,[],[f117]) ).

fof(f161,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( disjoint(X1,X2)
          <~> subset(X1,subset_complement(X0,X2)) )
          & element(X2,powerset(X0)) )
      & element(X1,powerset(X0)) ),
    inference(ennf_transformation,[],[f90]) ).

fof(f164,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | ? [X2] : in(X2,set_intersection2(X0,X1)) )
      & ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
        | ~ disjoint(X0,X1) ) ),
    inference(ennf_transformation,[],[f118]) ).

fof(f202,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,[],[f126]) ).

fof(f203,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,[],[f202]) ).

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

fof(f205,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f15]) ).

fof(f206,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(flattening,[],[f205]) ).

fof(f207,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(rectify,[],[f206]) ).

fof(f208,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ( ( ~ in(sK11(X0,X1,X2),X0)
            | ~ in(sK11(X0,X1,X2),X1)
            | ~ in(sK11(X0,X1,X2),X2) )
          & ( ( in(sK11(X0,X1,X2),X0)
              & in(sK11(X0,X1,X2),X1) )
            | in(sK11(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | ~ in(X4,X1) )
            & ( ( in(X4,X0)
                & in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1,X2))],[f207]) ).

fof(f212,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,[],[f17]) ).

fof(f213,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,[],[f212]) ).

fof(f214,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,[],[f213]) ).

fof(f215,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ( ( ~ in(sK15(X0,X1,X2),X0)
            | in(sK15(X0,X1,X2),X1)
            | ~ in(sK15(X0,X1,X2),X2) )
          & ( ( in(sK15(X0,X1,X2),X0)
              & ~ in(sK15(X0,X1,X2),X1) )
            | in(sK15(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,[sK15]),skolemize(X3,sK15(X0,X1,X2))],[f214]) ).

fof(f239,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | ( in(sK23(X0,X1),X0)
          & in(sK23(X0,X1),X1) ) )
      & ( ! [X3] :
            ( ~ in(X3,X0)
            | ~ in(X3,X1) )
        | ~ disjoint(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(X2,sK23(X0,X1))],[f159]) ).

fof(f240,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X1,subset_complement(X0,X2))
            | ~ disjoint(X1,X2) )
          & ( subset(X1,subset_complement(X0,X2))
            | disjoint(X1,X2) )
          & element(X2,powerset(X0)) )
      & element(X1,powerset(X0)) ),
    inference(nnf_transformation,[],[f161]) ).

fof(f241,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X1,subset_complement(X0,X2))
            | ~ disjoint(X1,X2) )
          & ( subset(X1,subset_complement(X0,X2))
            | disjoint(X1,X2) )
          & element(X2,powerset(X0)) )
      & element(X1,powerset(X0)) ),
    inference(flattening,[],[f240]) ).

fof(f242,plain,
    ( ( ~ subset(sK25,subset_complement(sK24,sK26))
      | ~ disjoint(sK25,sK26) )
    & ( subset(sK25,subset_complement(sK24,sK26))
      | disjoint(sK25,sK26) )
    & element(sK26,powerset(sK24))
    & element(sK25,powerset(sK24)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK24,sK25,sK26]),skolemize(X0,sK24),skolemize(X1,sK25),skolemize(X2,sK26)],[f241]) ).

fof(f243,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | in(sK27(X0,X1),set_intersection2(X0,X1)) )
      & ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
        | ~ disjoint(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK27]),skolemize(X2,sK27(X0,X1))],[f164]) ).

fof(f251,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f5]) ).

fof(f289,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ in(X3,X0)
      | in(X3,X1) ),
    inference(cnf_transformation,[],[f204]) ).

fof(f290,plain,
    ! [X0,X1] :
      ( in(sK10(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f204]) ).

fof(f291,plain,
    ! [X0,X1] :
      ( ~ in(sK10(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f204]) ).

fof(f294,plain,
    ! [X2,X0,X1,X4] :
      ( set_intersection2(X0,X1) != X2
      | ~ in(X4,X0)
      | ~ in(X4,X1)
      | in(X4,X2) ),
    inference(cnf_transformation,[],[f208]) ).

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

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

fof(f310,plain,
    ! [X0,X1] :
      ( ~ element(X1,powerset(X0))
      | set_difference(X0,X1) = subset_complement(X0,X1) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f334,plain,
    ! [X2,X0,X1] :
      ( ~ element(X1,powerset(X0))
      | ~ in(X2,X1)
      | in(X2,X0) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f390,plain,
    ! [X0,X1] :
      ( in(sK23(X0,X1),X1)
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f239]) ).

fof(f391,plain,
    ! [X0,X1] :
      ( in(sK23(X0,X1),X0)
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f239]) ).

fof(f394,plain,
    element(sK25,powerset(sK24)),
    inference(cnf_transformation,[],[f242]) ).

fof(f395,plain,
    element(sK26,powerset(sK24)),
    inference(cnf_transformation,[],[f242]) ).

fof(f396,plain,
    ( subset(sK25,subset_complement(sK24,sK26))
    | disjoint(sK25,sK26) ),
    inference(cnf_transformation,[],[f242]) ).

fof(f397,plain,
    ( ~ subset(sK25,subset_complement(sK24,sK26))
    | ~ disjoint(sK25,sK26) ),
    inference(cnf_transformation,[],[f242]) ).

fof(f402,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_intersection2(X0,X1))
      | ~ disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f243]) ).

fof(f426,definition,
    ( spl30_1
  <=> disjoint(sK25,sK26) ),
    introduced(definition,[new_symbols(definition,[spl30_1])],[avatar_definition]) ).

fof(f427,plain,
    ( ~ disjoint(sK25,sK26)
    | spl30_1 ),
    inference(avatar_component_clause,[],[f426]) ).

fof(f428,plain,
    ( disjoint(sK25,sK26)
    | ~ spl30_1 ),
    inference(avatar_component_clause,[],[f426]) ).

fof(f430,definition,
    ( spl30_2
  <=> subset(sK25,subset_complement(sK24,sK26)) ),
    introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition]) ).

fof(f431,plain,
    ( ~ subset(sK25,subset_complement(sK24,sK26))
    | spl30_2 ),
    inference(avatar_component_clause,[],[f430]) ).

fof(f432,plain,
    ( subset(sK25,subset_complement(sK24,sK26))
    | ~ spl30_2 ),
    inference(avatar_component_clause,[],[f430]) ).

fof(f433,plain,
    ( spl30_1
    | spl30_2 ),
    inference(avatar_split_clause,[],[f396,f430,f426]) ).

fof(f434,plain,
    ( ~ spl30_1
    | ~ spl30_2 ),
    inference(avatar_split_clause,[],[f397,f430,f426]) ).

fof(f465,plain,
    ( in(sK23(sK25,sK26),sK26)
    | spl30_1 ),
    inference(unit_resulting_resolution,[],[f390,f427]) ).

fof(f467,plain,
    ( in(sK23(sK25,sK26),sK25)
    | spl30_1 ),
    inference(unit_resulting_resolution,[],[f391,f427]) ).

fof(f511,plain,
    ( in(sK23(sK25,sK26),subset_complement(sK24,sK26))
    | spl30_1
    | ~ spl30_2 ),
    inference(unit_resulting_resolution,[],[f289,f467,f432]) ).

fof(f548,plain,
    subset_complement(sK24,sK26) = set_difference(sK24,sK26),
    inference(unit_resulting_resolution,[],[f310,f395]) ).

fof(f3320,plain,
    ( ~ in(sK23(sK25,sK26),sK26)
    | spl30_1
    | ~ spl30_2 ),
    inference(unit_resulting_resolution,[],[f304,f548,f511]) ).

fof(f3348,plain,
    ( $false
    | spl30_1
    | ~ spl30_2 ),
    inference(forward_subsumption_resolution,[],[f3320,f465]) ).

fof(f3349,plain,
    ( spl30_1
    | ~ spl30_2 ),
    inference(avatar_contradiction_clause,[],[f3348]) ).

fof(f3356,plain,
    ( ! [X0] : ~ in(X0,set_intersection2(sK25,sK26))
    | ~ spl30_1 ),
    inference(unit_resulting_resolution,[],[f402,f428]) ).

fof(f3363,plain,
    ( in(sK10(sK25,subset_complement(sK24,sK26)),sK25)
    | spl30_2 ),
    inference(unit_resulting_resolution,[],[f290,f431]) ).

fof(f3364,plain,
    ( ~ in(sK10(sK25,subset_complement(sK24,sK26)),subset_complement(sK24,sK26))
    | spl30_2 ),
    inference(unit_resulting_resolution,[],[f291,f431]) ).

fof(f3668,plain,
    ( ~ in(sK10(sK25,subset_complement(sK24,sK26)),sK26)
    | ~ spl30_1
    | spl30_2 ),
    inference(unit_resulting_resolution,[],[f294,f251,f3356,f3363]) ).

fof(f3708,plain,
    ( in(sK10(sK25,subset_complement(sK24,sK26)),sK24)
    | spl30_2 ),
    inference(unit_resulting_resolution,[],[f334,f394,f3363]) ).

fof(f8515,plain,
    ( subset_complement(sK24,sK26) != set_difference(sK24,sK26)
    | ~ spl30_1
    | spl30_2 ),
    inference(unit_resulting_resolution,[],[f306,f3364,f3668,f3708]) ).

fof(f8668,plain,
    ( $false
    | ~ spl30_1
    | spl30_2 ),
    inference(forward_subsumption_resolution,[],[f8515,f548]) ).

fof(f8669,plain,
    ( ~ spl30_1
    | spl30_2 ),
    inference(avatar_contradiction_clause,[],[f8668]) ).

cnf(s1,plain,
    ( spl30_1
    | spl30_2 ),
    inference(sat_conversion,[],[f433]) ).

cnf(s2,plain,
    ( ~ spl30_1
    | ~ spl30_2 ),
    inference(sat_conversion,[],[f434]) ).

cnf(s13,plain,
    ( spl30_1
    | ~ spl30_2 ),
    inference(sat_conversion,[],[f3349]) ).

cnf(s45,plain,
    ( ~ spl30_1
    | spl30_2 ),
    inference(sat_conversion,[],[f8669]) ).

cnf(s46,plain,
    spl30_1,
    inference(rat,[],[s1,s13]) ).

cnf(s47,plain,
    spl30_2,
    inference(rat,[],[s45,s46]) ).

cnf(s48,plain,
    $false,
    inference(rat,[],[s2,s47,s46]) ).

fof(f8670,plain,
    $false,
    inference(avatar_sat_refutation,[],[s48]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU170+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n017.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 03:47:36 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.75/1.68  % (3186210)Detected formulas, will run a generic FOF schedule.
% 4.75/1.68  % (3186221)dis-21_1_sil=8000:lcm=predicate:random_seed=1873326710:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.75/1.68  % (3186216)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2416775309:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.75/1.68  % (3186217)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=385192114:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.75/1.68  % (3186219)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=949011865:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.75/1.68  % (3186215)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2583842575:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.75/1.68  % (3186218)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2578760132:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.75/1.68  % (3186220)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2076959394:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.75/1.68  % (3186221)Instruction limit reached! 
% 4.75/1.68  % (3186221)------------------------------
% 4.75/1.68  % (3186221)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186221)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186221)Termination reason: Instruction limit
% 4.75/1.68  % (3186221)Termination phase: Saturation
% 4.75/1.68  % (3186221)Time elapsed: 0.047 s
% 4.75/1.68  % (3186221)Peak memory usage: 89 MB
% 4.75/1.68  % (3186221)Instructions burned: 132 (million)
% 4.75/1.68  % (3186218)Instruction limit reached! 
% 4.75/1.68  % (3186218)------------------------------
% 4.75/1.68  % (3186218)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186218)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186218)Termination reason: Instruction limit
% 4.75/1.68  % (3186218)Termination phase: Saturation
% 4.75/1.68  % (3186218)Time elapsed: 0.074 s
% 4.75/1.68  % (3186218)Peak memory usage: 89 MB
% 4.75/1.68  % (3186218)Instructions burned: 109 (million)
% 4.75/1.68  % (3186219)Instruction limit reached! 
% 4.75/1.68  % (3186219)------------------------------
% 4.75/1.68  % (3186219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186219)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186219)Termination reason: Instruction limit
% 4.75/1.68  % (3186219)Termination phase: Saturation
% 4.75/1.68  % (3186219)Time elapsed: 0.079 s
% 4.75/1.68  % (3186219)Peak memory usage: 89 MB
% 4.75/1.68  % (3186219)Instructions burned: 120 (million)
% 4.75/1.68  % (3186220)Instruction limit reached! 
% 4.75/1.68  % (3186220)------------------------------
% 4.75/1.68  % (3186220)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186220)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186220)Termination reason: Instruction limit
% 4.75/1.68  % (3186220)Termination phase: Saturation
% 4.75/1.68  % (3186220)Time elapsed: 0.102 s
% 4.75/1.68  % (3186220)Peak memory usage: 90 MB
% 4.75/1.68  % (3186220)Instructions burned: 140 (million)
% 4.75/1.68  % (3186229)lrs+10_1_sil=8000:sp=occurrence:random_seed=1668736508:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.75/1.68  % (3186231)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1493233196:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.75/1.68  % (3186230)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1876467109:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.75/1.68  % (3186229)Instruction limit reached! 
% 4.75/1.68  % (3186229)------------------------------
% 4.75/1.68  % (3186229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186229)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186229)Termination reason: Instruction limit
% 4.75/1.68  % (3186229)Termination phase: Saturation
% 4.75/1.68  % (3186229)Time elapsed: 0.105 s
% 4.75/1.68  % (3186229)Peak memory usage: 92 MB
% 4.75/1.68  % (3186229)Instructions burned: 286 (million)
% 4.75/1.68  % (3186232)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3784531031:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.75/1.68  % (3186230)Instruction limit reached! 
% 4.75/1.68  % (3186230)------------------------------
% 4.75/1.68  % (3186230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186230)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186230)Termination reason: Instruction limit
% 4.75/1.68  % (3186230)Termination phase: Saturation
% 4.75/1.68  % (3186230)Time elapsed: 0.098 s
% 4.75/1.68  % (3186230)Peak memory usage: 90 MB
% 4.75/1.68  % (3186230)Instructions burned: 157 (million)
% 4.75/1.68  % (3186236)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3135462545:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.75/1.68  % (3186232)First to succeed.
% 4.75/1.68  % (3186232)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3186210"
% 4.75/1.68  % (3186236)Instruction limit reached! 
% 4.75/1.68  % (3186236)------------------------------
% 4.75/1.68  % (3186236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186236)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186236)Termination reason: Instruction limit
% 4.75/1.68  % (3186236)Termination phase: Saturation
% 4.75/1.68  % (3186236)Time elapsed: 0.100 s
% 4.75/1.68  % (3186236)Peak memory usage: 90 MB
% 4.75/1.68  % (3186236)Instructions burned: 297 (million)
% 4.75/1.68  % (3186231)Instruction limit reached! 
% 4.75/1.68  % (3186231)------------------------------
% 4.75/1.68  % (3186231)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186231)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186231)Termination reason: Instruction limit
% 4.75/1.68  % (3186231)Termination phase: Saturation
% 4.75/1.68  % (3186231)Time elapsed: 0.230 s
% 4.75/1.68  % (3186231)Peak memory usage: 92 MB
% 4.75/1.68  % (3186231)Instructions burned: 326 (million)
% 4.75/1.68  % (3186238)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3908099466:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.75/1.68  % (3186240)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=700781721:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 4.75/1.68  % (3186240)Instruction limit reached! 
% 4.75/1.68  % (3186240)------------------------------
% 4.75/1.68  % (3186240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.68  % (3186240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.68  % (3186240)CaDiCaL version: 2.1.3
% 4.75/1.68  % (3186240)Termination reason: Instruction limit
% 4.75/1.68  % (3186240)Termination phase: Saturation
% 4.75/1.68  % (3186240)Time elapsed: 0.037 s
% 4.75/1.68  % (3186240)Peak memory usage: 89 MB
% 4.75/1.68  % (3186240)Instructions burned: 117 (million)
% 4.75/1.68  % (3186241)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3793672035:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 4.75/1.68  % (3186232)Refutation found. Thanks to Tanya!
% 4.75/1.68  % SZS status Theorem for theBenchmark
% 4.75/1.68  % SZS output start Proof for theBenchmark
% See solution above
% 6.39/1.88  % (3186232)------------------------------
% 6.39/1.88  % (3186232)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.39/1.88  % (3186232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.39/1.88  % (3186232)CaDiCaL version: 2.1.3
% 6.39/1.88  % (3186232)Termination reason: Refutation
% 6.39/1.88  % (3186232)Time elapsed: 0.149 s
% 6.39/1.88  % (3186232)Peak memory usage: 93 MB
% 6.39/1.88  % (3186232)Instructions burned: 249 (million)
% 6.39/1.88  % (3186232)------------------------------
% 6.39/1.88  % (3186232)------------------------------
% 6.39/1.88  % (3186210)Success in time 0.827 s
% 6.39/1.88  % Vampire exiting
%------------------------------------------------------------------------------