↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET612+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% 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 12:41:22 PM UTC 2026

% Result   : Theorem 2.76s 1.26s
% Output   : Refutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   18
% Syntax   : Number of formulae    :  107 (  20 unt;   9 def)
%            Number of atoms       :  264 (  12 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  260 ( 103   ~; 113   |;  26   &)
%                                         (  15 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :  115 (   0 sgn 110   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X0)
        | member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X0)
        & member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( member(X2,X0)
        & ~ member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).

fof(f4,axiom,
    ! [X0,X1] : subset(X0,union(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & subset(X0,X2) )
     => subset(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_subsets) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(difference(X2,X1),difference(X2,X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_difference) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).

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

fof(f13,conjecture,
    ! [X0,X1,X2] : difference(X0,union(X1,X2)) = intersection(difference(X0,X1),difference(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th85) ).

fof(f14,negated_conjecture,
    ~ ! [X0,X1,X2] : difference(X0,union(X1,X2)) = intersection(difference(X0,X1),difference(X0,X2)),
    inference(negated_conjecture,[status(cth)],[f13]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( subset(X0,intersection(X1,X2))
      | ~ subset(X0,X1)
      | ~ subset(X0,X2) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f16,plain,
    ! [X0,X1,X2] :
      ( subset(X0,intersection(X1,X2))
      | ~ subset(X0,X1)
      | ~ subset(X0,X2) ),
    inference(flattening,[],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( subset(difference(X2,X1),difference(X2,X0))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f19,plain,
    ? [X0,X1,X2] : difference(X0,union(X1,X2)) != intersection(difference(X0,X1),difference(X0,X2)),
    inference(ennf_transformation,[],[f14]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,union(X0,X1))
        | ( ~ member(X2,X0)
          & ~ member(X2,X1) ) )
      & ( member(X2,X0)
        | member(X2,X1)
        | ~ member(X2,union(X0,X1)) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,union(X0,X1))
        | ( ~ member(X2,X0)
          & ~ member(X2,X1) ) )
      & ( member(X2,X0)
        | member(X2,X1)
        | ~ member(X2,union(X0,X1)) ) ),
    inference(flattening,[],[f20]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(flattening,[],[f22]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(flattening,[],[f24]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(flattening,[],[f26]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f18]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f28]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK0(X0,X1),X1)
          & member(sK0(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f29]) ).

fof(f34,plain,
    difference(sK2,union(sK3,sK4)) != intersection(difference(sK2,sK3),difference(sK2,sK4)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f19]) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,union(X0,X1))
      | member(X2,X1)
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f36,plain,
    ! [X2,X0,X1] :
      ( member(X2,union(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f38,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X0,X1))
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f39,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f42,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( member(X2,difference(X0,X1))
      | ~ member(X2,X0)
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f44,plain,
    ! [X0,X1] : subset(X0,union(X0,X1)),
    inference(cnf_transformation,[],[f4]) ).

fof(f45,plain,
    ! [X2,X0,X1] :
      ( subset(X0,intersection(X1,X2))
      | ~ subset(X0,X1)
      | ~ subset(X0,X2) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( subset(difference(X2,X1),difference(X2,X0))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f60,plain,
    difference(sK2,union(sK3,sK4)) != intersection(difference(sK2,sK3),difference(sK2,sK4)),
    inference(cnf_transformation,[],[f34]) ).

fof(f65,definition,
    ! [X0,X1] :
      ( sQ5_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(definition,[new_symbols(definition,[sQ5_eqProxy])],[equality_proxy_definition]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( sQ5_eqProxy(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(equality_proxy_replacement,[],[f49,f65]) ).

fof(f71,plain,
    ~ sQ5_eqProxy(difference(sK2,union(sK3,sK4)),intersection(difference(sK2,sK3),difference(sK2,sK4))),
    inference(equality_proxy_replacement,[],[f60,f65]) ).

fof(f80,plain,
    ( ~ subset(difference(sK2,union(sK3,sK4)),intersection(difference(sK2,sK3),difference(sK2,sK4)))
    | ~ subset(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))) ),
    inference(resolution,[],[f66,f71]) ).

fof(f83,definition,
    ( spl6_1
  <=> subset(difference(sK2,union(sK3,sK4)),intersection(difference(sK2,sK3),difference(sK2,sK4))) ),
    introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).

fof(f84,plain,
    ( ~ subset(difference(sK2,union(sK3,sK4)),intersection(difference(sK2,sK3),difference(sK2,sK4)))
    | spl6_1 ),
    inference(avatar_component_clause,[],[f83]) ).

fof(f86,definition,
    ( spl6_2
  <=> subset(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))) ),
    introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).

fof(f87,plain,
    ( ~ subset(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4)))
    | spl6_2 ),
    inference(avatar_component_clause,[],[f86]) ).

fof(f89,plain,
    ( ~ spl6_2
    | ~ spl6_1 ),
    inference(avatar_split_clause,[],[f80,f83,f86]) ).

fof(f124,plain,
    ( ~ member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),difference(sK2,union(sK3,sK4)))
    | spl6_2 ),
    inference(resolution,[],[f87,f54]) ).

fof(f125,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),intersection(difference(sK2,sK3),difference(sK2,sK4)))
    | spl6_2 ),
    inference(resolution,[],[f87,f53]) ).

fof(f126,plain,
    ( ~ member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK2)
    | member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),union(sK3,sK4))
    | spl6_2 ),
    inference(resolution,[],[f124,f43]) ).

fof(f128,definition,
    ( spl6_7
  <=> member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),union(sK3,sK4)) ),
    introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).

fof(f129,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),union(sK3,sK4))
    | ~ spl6_7 ),
    inference(avatar_component_clause,[],[f128]) ).

fof(f131,definition,
    ( spl6_8
  <=> member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK2) ),
    introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).

fof(f132,plain,
    ( ~ member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK2)
    | spl6_8 ),
    inference(avatar_component_clause,[],[f131]) ).

fof(f133,plain,
    ( spl6_7
    | ~ spl6_8
    | spl6_2 ),
    inference(avatar_split_clause,[],[f126,f86,f131,f128]) ).

fof(f134,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),difference(sK2,sK3))
    | spl6_2 ),
    inference(resolution,[],[f125,f39]) ).

fof(f135,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),difference(sK2,sK4))
    | spl6_2 ),
    inference(resolution,[],[f125,f38]) ).

fof(f136,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK2)
    | spl6_2 ),
    inference(resolution,[],[f134,f42]) ).

fof(f137,plain,
    ( ~ member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK3)
    | spl6_2 ),
    inference(resolution,[],[f134,f41]) ).

fof(f138,plain,
    ( $false
    | spl6_2
    | spl6_8 ),
    inference(resolution,[],[f136,f132]) ).

fof(f139,plain,
    ( spl6_2
    | spl6_8 ),
    inference(avatar_contradiction_clause,[],[f138]) ).

fof(f140,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK4)
    | member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK3)
    | ~ spl6_7 ),
    inference(resolution,[],[f129,f35]) ).

fof(f142,definition,
    ( spl6_9
  <=> member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK3) ),
    introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).

fof(f143,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK3)
    | ~ spl6_9 ),
    inference(avatar_component_clause,[],[f142]) ).

fof(f145,definition,
    ( spl6_10
  <=> member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK4) ),
    introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).

fof(f146,plain,
    ( member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK4)
    | ~ spl6_10 ),
    inference(avatar_component_clause,[],[f145]) ).

fof(f147,plain,
    ( spl6_9
    | spl6_10
    | ~ spl6_7 ),
    inference(avatar_split_clause,[],[f140,f128,f145,f142]) ).

fof(f149,plain,
    ( ~ member(sK0(intersection(difference(sK2,sK3),difference(sK2,sK4)),difference(sK2,union(sK3,sK4))),sK4)
    | spl6_2 ),
    inference(resolution,[],[f135,f41]) ).

fof(f150,plain,
    ( $false
    | spl6_2
    | ~ spl6_10 ),
    inference(resolution,[],[f149,f146]) ).

fof(f151,plain,
    ( spl6_2
    | ~ spl6_10 ),
    inference(avatar_contradiction_clause,[],[f150]) ).

fof(f152,plain,
    ( $false
    | spl6_2
    | ~ spl6_9 ),
    inference(resolution,[],[f143,f137]) ).

fof(f153,plain,
    ( spl6_2
    | ~ spl6_9 ),
    inference(avatar_contradiction_clause,[],[f152]) ).

fof(f154,plain,
    ( ~ subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK3))
    | ~ subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK4))
    | spl6_1 ),
    inference(resolution,[],[f84,f45]) ).

fof(f158,definition,
    ( spl6_11
  <=> subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK4)) ),
    introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).

fof(f159,plain,
    ( ~ subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK4))
    | spl6_11 ),
    inference(avatar_component_clause,[],[f158]) ).

fof(f161,definition,
    ( spl6_12
  <=> subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK3)) ),
    introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).

fof(f162,plain,
    ( ~ subset(difference(sK2,union(sK3,sK4)),difference(sK2,sK3))
    | spl6_12 ),
    inference(avatar_component_clause,[],[f161]) ).

fof(f163,plain,
    ( ~ spl6_11
    | ~ spl6_12
    | spl6_1 ),
    inference(avatar_split_clause,[],[f154,f83,f161,f158]) ).

fof(f164,plain,
    ( ~ subset(sK4,union(sK3,sK4))
    | spl6_11 ),
    inference(resolution,[],[f159,f46]) ).

fof(f185,plain,
    ( ~ member(sK0(sK4,union(sK3,sK4)),union(sK3,sK4))
    | spl6_11 ),
    inference(resolution,[],[f164,f54]) ).

fof(f186,plain,
    ( member(sK0(sK4,union(sK3,sK4)),sK4)
    | spl6_11 ),
    inference(resolution,[],[f164,f53]) ).

fof(f204,plain,
    ( ~ member(sK0(sK4,union(sK3,sK4)),sK4)
    | spl6_11 ),
    inference(resolution,[],[f185,f36]) ).

fof(f213,plain,
    ( $false
    | spl6_11 ),
    inference(resolution,[],[f204,f186]) ).

fof(f214,plain,
    spl6_11,
    inference(avatar_contradiction_clause,[],[f213]) ).

fof(f215,plain,
    ( ~ subset(sK3,union(sK3,sK4))
    | spl6_12 ),
    inference(resolution,[],[f162,f46]) ).

fof(f218,plain,
    ( $false
    | spl6_12 ),
    inference(resolution,[],[f215,f44]) ).

fof(f221,plain,
    spl6_12,
    inference(avatar_contradiction_clause,[],[f218]) ).

cnf(s2,plain,
    ( ~ spl6_1
    | ~ spl6_2 ),
    inference(sat_conversion,[],[f89]) ).

cnf(s7,plain,
    ( spl6_2
    | spl6_7
    | ~ spl6_8 ),
    inference(sat_conversion,[],[f133]) ).

cnf(s8,plain,
    ( spl6_2
    | spl6_8 ),
    inference(sat_conversion,[],[f139]) ).

cnf(s9,plain,
    ( ~ spl6_7
    | spl6_9
    | spl6_10 ),
    inference(sat_conversion,[],[f147]) ).

cnf(s10,plain,
    ( spl6_2
    | ~ spl6_10 ),
    inference(sat_conversion,[],[f151]) ).

cnf(s11,plain,
    ( spl6_2
    | ~ spl6_9 ),
    inference(sat_conversion,[],[f153]) ).

cnf(s12,plain,
    ( spl6_1
    | ~ spl6_11
    | ~ spl6_12 ),
    inference(sat_conversion,[],[f163]) ).

cnf(s18,plain,
    spl6_11,
    inference(sat_conversion,[],[f214]) ).

cnf(s19,plain,
    spl6_12,
    inference(sat_conversion,[],[f221]) ).

cnf(s20,plain,
    spl6_1,
    inference(rat,[],[s12,s19,s18]) ).

cnf(s21,plain,
    ~ spl6_2,
    inference(rat,[],[s2,s20]) ).

cnf(s22,plain,
    ~ spl6_9,
    inference(rat,[],[s11,s21]) ).

cnf(s23,plain,
    ~ spl6_10,
    inference(rat,[],[s10,s21]) ).

cnf(s24,plain,
    spl6_8,
    inference(rat,[],[s8,s21]) ).

cnf(s25,plain,
    spl6_7,
    inference(rat,[],[s7,s24,s21]) ).

cnf(s26,plain,
    $false,
    inference(rat,[],[s9,s23,s22,s25]) ).

fof(f222,plain,
    $false,
    inference(avatar_sat_refutation,[],[s26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET612+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n016.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 28 02:23:32 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  Running first-order theorem proving
% 0.10/0.39  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.76/1.26  % (3193585)Detected formulas, will run a generic FOF schedule.
% 2.76/1.26  % (3193602)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=2601139947:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.76/1.26  % (3193601)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=2808784718:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.76/1.26  % (3193606)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2997977151:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.76/1.26  % (3193605)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4234242744:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.76/1.26  % (3193603)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=4139703932:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.76/1.26  % (3193607)dis-21_1_sil=8000:lcm=predicate:random_seed=1588566639: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)
% 2.76/1.26  % (3193604)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1916646927:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.76/1.26  % (3193604)Refutation not found, incomplete strategy
% 2.76/1.26  % (3193604)------------------------------
% 2.76/1.26  % (3193604)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.26  % (3193604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.26  % (3193604)CaDiCaL version: 2.1.3
% 2.76/1.26  % (3193604)Termination reason: Refutation not found, incomplete strategy
% 2.76/1.26  % (3193604)Time elapsed: 0.002 s
% 2.76/1.26  % (3193604)Peak memory usage: 88 MB
% 2.76/1.26  % (3193604)Instructions burned: 1 (million)
% 2.76/1.26  % (3193607)First to succeed.
% 2.76/1.26  % (3193607)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3193585"
% 2.76/1.26  % (3193605)Instruction limit reached! 
% 2.76/1.26  % (3193605)------------------------------
% 2.76/1.26  % (3193605)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.26  % (3193605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.26  % (3193605)CaDiCaL version: 2.1.3
% 2.76/1.26  % (3193605)Termination reason: Instruction limit
% 2.76/1.26  % (3193605)Termination phase: Saturation
% 2.76/1.26  % (3193605)Time elapsed: 0.076 s
% 2.76/1.26  % (3193605)Peak memory usage: 89 MB
% 2.76/1.26  % (3193605)Instructions burned: 119 (million)
% 2.76/1.26  % (3193606)Instruction limit reached! 
% 2.76/1.26  % (3193606)------------------------------
% 2.76/1.26  % (3193606)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.26  % (3193606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.26  % (3193606)CaDiCaL version: 2.1.3
% 2.76/1.26  % (3193606)Termination reason: Instruction limit
% 2.76/1.26  % (3193606)Termination phase: Saturation
% 2.76/1.26  % (3193606)Time elapsed: 0.087 s
% 2.76/1.26  % (3193606)Peak memory usage: 89 MB
% 2.76/1.26  % (3193606)Instructions burned: 140 (million)
% 2.76/1.26  % (3193629)lrs+10_1_sil=8000:sp=occurrence:random_seed=1917605979:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.76/1.26  % (3193604)------------------------------
% 2.76/1.26  % (3193604)------------------------------
% 2.76/1.26  % (3193634)lrs+10_1_sil=32000:urr=on:br=off:random_seed=805654366:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.76/1.26  % (3193607)Refutation found. Thanks to Tanya!
% 2.76/1.26  % SZS status Theorem for theBenchmark
% 2.76/1.26  % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.46  % (3193607)------------------------------
% 3.63/1.46  % (3193607)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.46  % (3193607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.46  % (3193607)CaDiCaL version: 2.1.3
% 3.63/1.46  % (3193607)Termination reason: Refutation
% 3.63/1.46  % (3193607)Time elapsed: 0.005 s
% 3.63/1.46  % (3193607)Peak memory usage: 89 MB
% 3.63/1.46  % (3193607)Instructions burned: 6 (million)
% 3.63/1.46  % (3193607)------------------------------
% 3.63/1.46  % (3193607)------------------------------
% 3.63/1.46  % (3193585)Success in time 0.43 s
% 3.63/1.46  % Vampire exiting
%------------------------------------------------------------------------------