TSTP Solution File: SET935+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:26:08 EDT 2022

% Result   : Theorem 0.21s 0.57s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   95 (  25 unt;   0 def)
%            Number of atoms       :  294 (  53 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  314 ( 115   ~; 124   |;  52   &)
%                                         (  18 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-3 aty)
%            Number of variables   :  123 ( 110   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f734,plain,
    $false,
    inference(avatar_sat_refutation,[],[f281,f290,f577,f584,f693,f705,f733]) ).

fof(f733,plain,
    ~ spl11_9,
    inference(avatar_contradiction_clause,[],[f732]) ).

fof(f732,plain,
    ( $false
    | ~ spl11_9 ),
    inference(subsumption_resolution,[],[f712,f66]) ).

fof(f66,plain,
    ~ inclusion_comparable(sK1,sK0),
    inference(cnf_transformation,[],[f40]) ).

fof(f40,plain,
    ( ~ inclusion_comparable(sK1,sK0)
    & set_union2(powerset(sK1),powerset(sK0)) = powerset(set_union2(sK1,sK0)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f38,f39]) ).

fof(f39,plain,
    ( ? [X0,X1] :
        ( ~ inclusion_comparable(X1,X0)
        & powerset(set_union2(X1,X0)) = set_union2(powerset(X1),powerset(X0)) )
   => ( ~ inclusion_comparable(sK1,sK0)
      & set_union2(powerset(sK1),powerset(sK0)) = powerset(set_union2(sK1,sK0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ? [X0,X1] :
      ( ~ inclusion_comparable(X1,X0)
      & powerset(set_union2(X1,X0)) = set_union2(powerset(X1),powerset(X0)) ),
    inference(rectify,[],[f26]) ).

fof(f26,plain,
    ? [X1,X0] :
      ( ~ inclusion_comparable(X0,X1)
      & set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f17,negated_conjecture,
    ~ ! [X0,X1] :
        ( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
       => inclusion_comparable(X0,X1) ),
    inference(negated_conjecture,[],[f16]) ).

fof(f16,conjecture,
    ! [X0,X1] :
      ( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
     => inclusion_comparable(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t82_zfmisc_1) ).

fof(f712,plain,
    ( inclusion_comparable(sK1,sK0)
    | ~ spl11_9 ),
    inference(superposition,[],[f169,f276]) ).

fof(f276,plain,
    ( sK1 = sF9
    | ~ spl11_9 ),
    inference(avatar_component_clause,[],[f274]) ).

fof(f274,plain,
    ( spl11_9
  <=> sK1 = sF9 ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).

fof(f169,plain,
    inclusion_comparable(sF9,sK0),
    inference(resolution,[],[f166,f64]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | inclusion_comparable(X1,X0) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ( inclusion_comparable(X1,X0)
        | ( ~ subset(X0,X1)
          & ~ subset(X1,X0) ) )
      & ( subset(X0,X1)
        | subset(X1,X0)
        | ~ inclusion_comparable(X1,X0) ) ),
    inference(flattening,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ( inclusion_comparable(X1,X0)
        | ( ~ subset(X0,X1)
          & ~ subset(X1,X0) ) )
      & ( subset(X0,X1)
        | subset(X1,X0)
        | ~ inclusion_comparable(X1,X0) ) ),
    inference(nnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( inclusion_comparable(X1,X0)
    <=> ( subset(X0,X1)
        | subset(X1,X0) ) ),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X1,X0] :
      ( inclusion_comparable(X0,X1)
    <=> ( subset(X1,X0)
        | subset(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_xboole_0) ).

fof(f166,plain,
    subset(sK0,sF9),
    inference(superposition,[],[f149,f95]) ).

fof(f95,plain,
    sF9 = set_union2(sK1,sK0),
    introduced(function_definition,[]) ).

fof(f149,plain,
    ! [X2,X3] : subset(X2,set_union2(X3,X2)),
    inference(superposition,[],[f61,f56]) ).

fof(f56,plain,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] : set_union2(X0,X1) = set_union2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

fof(f61,plain,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).

fof(f705,plain,
    ( spl11_10
    | ~ spl11_25 ),
    inference(avatar_contradiction_clause,[],[f704]) ).

fof(f704,plain,
    ( $false
    | spl11_10
    | ~ spl11_25 ),
    inference(subsumption_resolution,[],[f702,f280]) ).

fof(f280,plain,
    ( ~ subset(sF9,sK1)
    | spl11_10 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f278,plain,
    ( spl11_10
  <=> subset(sF9,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).

fof(f702,plain,
    ( subset(sF9,sK1)
    | ~ spl11_25 ),
    inference(resolution,[],[f576,f211]) ).

fof(f211,plain,
    ! [X0] :
      ( ~ in(X0,sF6)
      | subset(X0,sK1) ),
    inference(superposition,[],[f88,f92]) ).

fof(f92,plain,
    sF6 = powerset(sK1),
    introduced(function_definition,[]) ).

fof(f88,plain,
    ! [X3,X0] :
      ( ~ in(X3,powerset(X0))
      | subset(X3,X0) ),
    inference(equality_resolution,[],[f70]) ).

fof(f70,plain,
    ! [X3,X0,X1] :
      ( subset(X3,X0)
      | ~ in(X3,X1)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ( ( ~ subset(sK2(X0,X1),X0)
            | ~ in(sK2(X0,X1),X1) )
          & ( subset(sK2(X0,X1),X0)
            | in(sK2(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f43,f44]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X2,X0)
            | ~ in(X2,X1) )
          & ( subset(X2,X0)
            | in(X2,X1) ) )
     => ( ( ~ subset(sK2(X0,X1),X0)
          | ~ in(sK2(X0,X1),X1) )
        & ( subset(sK2(X0,X1),X0)
          | in(sK2(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(rectify,[],[f42]) ).

fof(f42,plain,
    ! [X1,X0] :
      ( ( powerset(X1) = X0
        | ? [X2] :
            ( ( ~ subset(X2,X1)
              | ~ in(X2,X0) )
            & ( subset(X2,X1)
              | in(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X0)
              | ~ subset(X2,X1) )
            & ( subset(X2,X1)
              | ~ in(X2,X0) ) )
        | powerset(X1) != X0 ) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X1,X0] :
      ( powerset(X1) = X0
    <=> ! [X2] :
          ( in(X2,X0)
        <=> subset(X2,X1) ) ),
    inference(rectify,[],[f4]) ).

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

fof(f576,plain,
    ( in(sF9,sF6)
    | ~ spl11_25 ),
    inference(avatar_component_clause,[],[f574]) ).

fof(f574,plain,
    ( spl11_25
  <=> in(sF9,sF6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_25])]) ).

fof(f693,plain,
    ~ spl11_11,
    inference(avatar_contradiction_clause,[],[f692]) ).

fof(f692,plain,
    ( $false
    | ~ spl11_11 ),
    inference(subsumption_resolution,[],[f668,f66]) ).

fof(f668,plain,
    ( inclusion_comparable(sK1,sK0)
    | ~ spl11_11 ),
    inference(superposition,[],[f125,f285]) ).

fof(f285,plain,
    ( sK0 = sF9
    | ~ spl11_11 ),
    inference(avatar_component_clause,[],[f283]) ).

fof(f283,plain,
    ( spl11_11
  <=> sK0 = sF9 ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_11])]) ).

fof(f125,plain,
    inclusion_comparable(sK1,sF9),
    inference(resolution,[],[f63,f100]) ).

fof(f100,plain,
    subset(sK1,sF9),
    inference(superposition,[],[f61,f95]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | inclusion_comparable(X1,X0) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f584,plain,
    ( spl11_12
    | ~ spl11_24 ),
    inference(avatar_contradiction_clause,[],[f583]) ).

fof(f583,plain,
    ( $false
    | spl11_12
    | ~ spl11_24 ),
    inference(subsumption_resolution,[],[f581,f289]) ).

fof(f289,plain,
    ( ~ subset(sF9,sK0)
    | spl11_12 ),
    inference(avatar_component_clause,[],[f287]) ).

fof(f287,plain,
    ( spl11_12
  <=> subset(sF9,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_12])]) ).

fof(f581,plain,
    ( subset(sF9,sK0)
    | ~ spl11_24 ),
    inference(resolution,[],[f572,f212]) ).

fof(f212,plain,
    ! [X1] :
      ( ~ in(X1,sF7)
      | subset(X1,sK0) ),
    inference(superposition,[],[f88,f93]) ).

fof(f93,plain,
    powerset(sK0) = sF7,
    introduced(function_definition,[]) ).

fof(f572,plain,
    ( in(sF9,sF7)
    | ~ spl11_24 ),
    inference(avatar_component_clause,[],[f570]) ).

fof(f570,plain,
    ( spl11_24
  <=> in(sF9,sF7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_24])]) ).

fof(f577,plain,
    ( spl11_24
    | spl11_25 ),
    inference(avatar_split_clause,[],[f568,f574,f570]) ).

fof(f568,plain,
    ( in(sF9,sF6)
    | in(sF9,sF7) ),
    inference(resolution,[],[f329,f200]) ).

fof(f200,plain,
    in(sF9,sF8),
    inference(resolution,[],[f199,f75]) ).

fof(f75,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1] : subset(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(f199,plain,
    ! [X2] :
      ( ~ subset(X2,sF9)
      | in(X2,sF8) ),
    inference(forward_demodulation,[],[f198,f97]) ).

fof(f97,plain,
    sF8 = sF10,
    inference(definition_folding,[],[f65,f96,f95,f94,f93,f92]) ).

fof(f94,plain,
    set_union2(sF6,sF7) = sF8,
    introduced(function_definition,[]) ).

fof(f96,plain,
    sF10 = powerset(sF9),
    introduced(function_definition,[]) ).

fof(f65,plain,
    set_union2(powerset(sK1),powerset(sK0)) = powerset(set_union2(sK1,sK0)),
    inference(cnf_transformation,[],[f40]) ).

fof(f198,plain,
    ! [X2] :
      ( in(X2,sF10)
      | ~ subset(X2,sF9) ),
    inference(superposition,[],[f87,f96]) ).

fof(f87,plain,
    ! [X3,X0] :
      ( in(X3,powerset(X0))
      | ~ subset(X3,X0) ),
    inference(equality_resolution,[],[f71]) ).

fof(f71,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | ~ subset(X3,X0)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f45]) ).

fof(f329,plain,
    ! [X10] :
      ( ~ in(X10,sF8)
      | in(X10,sF6)
      | in(X10,sF7) ),
    inference(superposition,[],[f91,f94]) ).

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

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

fof(f55,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ( ( ( ~ in(sK5(X0,X1,X2),X1)
              & ~ in(sK5(X0,X1,X2),X0) )
            | ~ in(sK5(X0,X1,X2),X2) )
          & ( in(sK5(X0,X1,X2),X1)
            | in(sK5(X0,X1,X2),X0)
            | in(sK5(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f53,f54]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ( ~ in(X3,X1)
              & ~ in(X3,X0) )
            | ~ in(X3,X2) )
          & ( in(X3,X1)
            | in(X3,X0)
            | in(X3,X2) ) )
     => ( ( ( ~ in(sK5(X0,X1,X2),X1)
            & ~ in(sK5(X0,X1,X2),X0) )
          | ~ in(sK5(X0,X1,X2),X2) )
        & ( in(sK5(X0,X1,X2),X1)
          | in(sK5(X0,X1,X2),X0)
          | in(sK5(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f19,plain,
    ! [X2,X0,X1] :
      ( set_union2(X2,X0) = X1
    <=> ! [X3] :
          ( in(X3,X1)
        <=> ( in(X3,X0)
            | in(X3,X2) ) ) ),
    inference(rectify,[],[f5]) ).

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

fof(f290,plain,
    ( spl11_11
    | ~ spl11_12 ),
    inference(avatar_split_clause,[],[f251,f287,f283]) ).

fof(f251,plain,
    ( ~ subset(sF9,sK0)
    | sK0 = sF9 ),
    inference(resolution,[],[f57,f166]) ).

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

fof(f34,plain,
    ! [X0,X1] :
      ( ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f33]) ).

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

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

fof(f18,plain,
    ! [X1,X0] :
      ( ( subset(X0,X1)
        & subset(X1,X0) )
    <=> X0 = X1 ),
    inference(rectify,[],[f3]) ).

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

fof(f281,plain,
    ( spl11_9
    | ~ spl11_10 ),
    inference(avatar_split_clause,[],[f252,f278,f274]) ).

fof(f252,plain,
    ( ~ subset(sF9,sK1)
    | sK1 = sF9 ),
    inference(resolution,[],[f57,f100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 14:27:41 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.52  % (32417)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.52  % (32411)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.52  % (32393)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52  % (32403)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.52  % (32391)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.52  % (32394)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.52  % (32390)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53  % (32396)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.53  % (32388)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.53  % (32416)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.53  % (32392)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53  % (32395)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53  TRYING [1]
% 0.21/0.53  TRYING [2]
% 0.21/0.53  % (32414)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.53  % (32408)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.53  % (32409)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.54  % (32399)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.54  % (32406)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.54  % (32390)Refutation not found, incomplete strategy% (32390)------------------------------
% 0.21/0.54  % (32390)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54  TRYING [1]
% 0.21/0.54  % (32390)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54  % (32390)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.54  
% 0.21/0.54  % (32390)Memory used [KB]: 5500
% 0.21/0.54  % (32390)Time elapsed: 0.106 s
% 0.21/0.54  % (32390)Instructions burned: 4 (million)
% 0.21/0.54  % (32390)------------------------------
% 0.21/0.54  % (32390)------------------------------
% 0.21/0.54  TRYING [2]
% 0.21/0.54  % (32400)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54  % (32397)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.54  % (32418)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.54  % (32398)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54  % (32407)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54  TRYING [3]
% 0.21/0.54  % (32410)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.54  TRYING [3]
% 0.21/0.54  % (32415)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.54  % (32401)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.54  TRYING [1]
% 0.21/0.54  TRYING [2]
% 0.21/0.54  % (32396)Instruction limit reached!
% 0.21/0.54  % (32396)------------------------------
% 0.21/0.54  % (32396)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54  TRYING [3]
% 0.21/0.54  % (32402)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.55  % (32413)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.55  TRYING [4]
% 0.21/0.55  % (32412)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.55  % (32396)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (32396)Termination reason: Unknown
% 0.21/0.55  % (32396)Termination phase: Saturation
% 0.21/0.55  
% 0.21/0.55  % (32396)Memory used [KB]: 5500
% 0.21/0.55  % (32396)Time elapsed: 0.123 s
% 0.21/0.55  % (32396)Instructions burned: 7 (million)
% 0.21/0.55  % (32396)------------------------------
% 0.21/0.55  % (32396)------------------------------
% 0.21/0.55  TRYING [4]
% 0.21/0.55  % (32404)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.55  % (32405)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.56  % (32397)Instruction limit reached!
% 0.21/0.56  % (32397)------------------------------
% 0.21/0.56  % (32397)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (32397)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (32397)Termination reason: Unknown
% 0.21/0.56  % (32397)Termination phase: Saturation
% 0.21/0.56  
% 0.21/0.56  % (32397)Memory used [KB]: 5373
% 0.21/0.56  % (32397)Time elapsed: 0.161 s
% 0.21/0.56  % (32397)Instructions burned: 3 (million)
% 0.21/0.56  % (32397)------------------------------
% 0.21/0.56  % (32397)------------------------------
% 0.21/0.56  TRYING [4]
% 0.21/0.57  % (32414)First to succeed.
% 0.21/0.57  % (32401)Also succeeded, but the first one will report.
% 0.21/0.57  % (32414)Refutation found. Thanks to Tanya!
% 0.21/0.57  % SZS status Theorem for theBenchmark
% 0.21/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57  % (32414)------------------------------
% 0.21/0.57  % (32414)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57  % (32414)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57  % (32414)Termination reason: Refutation
% 0.21/0.57  
% 0.21/0.57  % (32414)Memory used [KB]: 5756
% 0.21/0.57  % (32414)Time elapsed: 0.163 s
% 0.21/0.57  % (32414)Instructions burned: 21 (million)
% 0.21/0.57  % (32414)------------------------------
% 0.21/0.57  % (32414)------------------------------
% 0.21/0.57  % (32387)Success in time 0.218 s
%------------------------------------------------------------------------------