↑ 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  : SEU142+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 : n007.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:04 PM UTC 2026

% Result   : Theorem 25.57s 6.90s
% Output   : Refutation 25.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   88 (  21 unt;   2 def)
%            Number of atoms       :  327 ( 139 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  386 ( 147   ~; 157   |;  68   &)
%                                         (  12 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :  178 ( 165   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).

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(f9,axiom,
    ! [X0,X1,X2] :
      ( X2 = unordered_pair(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( X3 = X0
            | X3 = X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

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(f15,axiom,
    ! [X0,X1] :
      ( proper_subset(X0,X1)
    <=> ( subset(X0,X1)
        & X0 != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).

fof(f45,axiom,
    ! [X0,X1] :
      ( set_difference(X0,X1) = empty_set
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).

fof(f55,axiom,
    ! [X0,X1] :
      ~ ( subset(X0,X1)
        & proper_subset(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).

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

fof(f58,negated_conjecture,
    ~ ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    inference(negated_conjecture,[status(cth)],[f57]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        & X0 != X1 )
     => proper_subset(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f15]) ).

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

fof(f75,plain,
    ! [X0,X1] :
      ( proper_subset(X0,X1)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(ennf_transformation,[],[f71]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( proper_subset(X0,X1)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(flattening,[],[f75]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | ~ proper_subset(X1,X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f96,plain,
    ? [X0] : singleton(X0) != unordered_pair(X0,X0),
    inference(ennf_transformation,[],[f58]) ).

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

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

fof(f104,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(f105,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,[],[f104]) ).

fof(f106,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))],[f105]) ).

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

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

fof(f109,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))],[f108]) ).

fof(f110,plain,
    ! [X0,X1,X2] :
      ( ( X2 = unordered_pair(X0,X1)
        | ? [X3] :
            ( ( ( X0 != X3
                & X1 != X3 )
              | ~ in(X3,X2) )
            & ( X3 = X0
              | X3 = X1
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( X3 = X0
              | X3 = X1
              | ~ in(X3,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f111,plain,
    ! [X0,X1,X2] :
      ( ( X2 = unordered_pair(X0,X1)
        | ? [X3] :
            ( ( ( X0 != X3
                & X1 != X3 )
              | ~ in(X3,X2) )
            & ( X3 = X0
              | X3 = X1
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( X3 = X0
              | X3 = X1
              | ~ in(X3,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(flattening,[],[f110]) ).

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

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

fof(f118,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,[],[f74]) ).

fof(f119,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,[],[f118]) ).

fof(f120,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))],[f119]) ).

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

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

fof(f128,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))],[f127]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( ( set_difference(X0,X1) = empty_set
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | empty_set != set_difference(X0,X1) ) ),
    inference(nnf_transformation,[],[f45]) ).

fof(f138,plain,
    singleton(sK12) != unordered_pair(sK12,sK12),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f96]) ).

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

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

fof(f149,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | X0 != X3
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f106]) ).

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

fof(f154,plain,
    ! [X2,X0,X1,X4] :
      ( X0 = X4
      | X1 = X4
      | ~ in(X4,X2)
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f113]) ).

fof(f156,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | X0 != X4
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f113]) ).

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

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

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

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

fof(f183,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | proper_subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f76]) ).

fof(f209,plain,
    ! [X0,X1] :
      ( empty_set != set_difference(X0,X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f223,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | ~ proper_subset(X1,X0) ),
    inference(cnf_transformation,[],[f93]) ).

fof(f225,plain,
    singleton(sK12) != unordered_pair(sK12,sK12),
    inference(cnf_transformation,[],[f138]) ).

fof(f252,plain,
    ! [X3,X1] :
      ( in(X3,X1)
      | singleton(X3) != X1 ),
    inference(equality_resolution,[],[f149]) ).

fof(f253,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f252]) ).

fof(f254,plain,
    ! [X3,X0] :
      ( ~ in(X3,singleton(X0))
      | X0 = X3 ),
    inference(equality_resolution,[],[f148]) ).

fof(f256,plain,
    ! [X2,X1,X4] :
      ( in(X4,X2)
      | unordered_pair(X4,X1) != X2 ),
    inference(equality_resolution,[],[f156]) ).

fof(f257,plain,
    ! [X1,X4] : in(X4,unordered_pair(X4,X1)),
    inference(equality_resolution,[],[f256]) ).

fof(f260,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,unordered_pair(X0,X1))
      | X1 = X4
      | X0 = X4 ),
    inference(equality_resolution,[],[f154]) ).

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

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

fof(f270,definition,
    sF13 = singleton(sK12),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f271,plain,
    singleton(sK12) = sF13,
    inference(reorient_equations,[],[f270]) ).

fof(f272,definition,
    sF14 = unordered_pair(sK12,sK12),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f273,plain,
    unordered_pair(sK12,sK12) = sF14,
    inference(reorient_equations,[],[f272]) ).

fof(f274,plain,
    sF13 != sF14,
    inference(definition_folding,[],[f225,f273,f271]) ).

fof(f276,plain,
    in(sK12,sF13),
    inference(superposition,[],[f253,f271]) ).

fof(f291,plain,
    in(sK12,sF14),
    inference(superposition,[],[f257,f273]) ).

fof(f367,plain,
    ! [X0] :
      ( ~ in(X0,sF13)
      | sK12 = X0 ),
    inference(superposition,[],[f254,f271]) ).

fof(f474,plain,
    ! [X0,X1] :
      ( in(sK1(set_difference(X0,X1)),X0)
      | empty_set = set_difference(X0,X1) ),
    inference(resolution,[],[f268,f153]) ).

fof(f490,plain,
    ! [X0,X1] :
      ( ~ in(sK1(set_difference(X0,X1)),X1)
      | empty_set = set_difference(X0,X1) ),
    inference(resolution,[],[f269,f153]) ).

fof(f985,plain,
    ! [X0] :
      ( ~ in(X0,sF14)
      | sK12 = X0
      | sK12 = X0 ),
    inference(superposition,[],[f260,f273]) ).

fof(f988,plain,
    ! [X0] :
      ( ~ in(X0,sF14)
      | sK12 = X0 ),
    inference(duplicate_literal_removal,[],[f985]) ).

fof(f990,plain,
    ! [X0] :
      ( subset(sF14,X0)
      | sK12 = sK4(sF14,X0) ),
    inference(resolution,[],[f988,f167]) ).

fof(f4046,plain,
    ! [X0] :
      ( sK12 = sK1(set_difference(sF13,X0))
      | empty_set = set_difference(sF13,X0) ),
    inference(resolution,[],[f474,f367]) ).

fof(f7125,plain,
    ! [X0] :
      ( ~ proper_subset(X0,sF14)
      | sK12 = sK4(sF14,X0) ),
    inference(resolution,[],[f990,f223]) ).

fof(f50180,plain,
    ! [X0] :
      ( ~ in(sK12,X0)
      | empty_set = set_difference(sF13,X0)
      | empty_set = set_difference(sF13,X0) ),
    inference(superposition,[],[f490,f4046]) ).

fof(f50199,plain,
    ! [X0] :
      ( ~ in(sK12,X0)
      | empty_set = set_difference(sF13,X0) ),
    inference(duplicate_literal_removal,[],[f50180]) ).

fof(f50202,plain,
    empty_set = set_difference(sF13,sF14),
    inference(resolution,[],[f50199,f291]) ).

fof(f50269,plain,
    ( empty_set != empty_set
    | subset(sF13,sF14) ),
    inference(superposition,[],[f209,f50202]) ).

fof(f50649,plain,
    subset(sF13,sF14),
    inference(trivial_inequality_removal,[],[f50269]) ).

fof(f50992,plain,
    ( ~ subset(sF14,sF13)
    | sF13 = sF14 ),
    inference(resolution,[],[f50649,f147]) ).

fof(f50994,plain,
    ( proper_subset(sF13,sF14)
    | sF13 = sF14 ),
    inference(resolution,[],[f50649,f183]) ).

fof(f51030,plain,
    proper_subset(sF13,sF14),
    inference(forward_subsumption_resolution,[],[f50994,f274]) ).

fof(f51031,plain,
    ~ subset(sF14,sF13),
    inference(forward_subsumption_resolution,[],[f50992,f274]) ).

fof(f51062,plain,
    sK12 = sK4(sF14,sF13),
    inference(resolution,[],[f51030,f7125]) ).

fof(f51106,plain,
    ( ~ in(sK12,sF13)
    | subset(sF14,sF13) ),
    inference(superposition,[],[f168,f51062]) ).

fof(f51116,plain,
    subset(sF14,sF13),
    inference(forward_subsumption_resolution,[],[f51106,f276]) ).

fof(f51117,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f51116,f51031]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU142+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.38  % Computer : n007.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 03:41:26 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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
% 16.83/2.89  % (2004825)Will run a generic schedule for satisfiability detection.
% 16.83/2.89  % (2004830)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4126998778_2999 on theBenchmark for (2999ds/0Mi)
% 16.83/2.89  % TRYING [1]
% 16.83/2.89  % TRYING [2]
% 16.83/2.89  % (2004831)% WARNING: option uhcvi not known.
% 16.83/2.89  % TRYING [3]
% 16.83/2.89  % (2004831)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3242059988:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 16.83/2.89  % (2004832)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3929395416:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 16.83/2.89  % (2004833)dis+10_1_sil=32000:sp=arity:random_seed=3834930647:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 16.83/2.89  % (2004834)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4286496732:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 16.83/2.89  % TRYING [4]
% 16.83/2.89  % (2004835)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1317747407:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 16.83/2.89  % (2004836)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=828096689:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 16.83/2.89  % TRYING [5]
% 16.83/2.89  % TRYING [6]
% 16.83/2.89  % (2004833)Instruction limit reached! 
% 16.83/2.89  % (2004833)------------------------------
% 16.83/2.89  % (2004833)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.83/2.89  % (2004833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/2.89  % (2004833)CaDiCaL version: 2.1.3
% 16.83/2.89  % (2004833)Termination reason: Instruction limit
% 16.83/2.89  % (2004833)Termination phase: Saturation
% 16.83/2.89  % (2004833)Time elapsed: 0.064 s
% 16.83/2.89  % (2004833)Peak memory usage: 12 MB
% 16.83/2.89  % (2004833)Instructions burned: 103 (million)
% 16.83/2.89  % (2004834)Instruction limit reached! 
% 16.83/2.89  % (2004834)------------------------------
% 16.83/2.89  % (2004834)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.83/2.89  % (2004834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/2.89  % (2004834)CaDiCaL version: 2.1.3
% 16.83/2.89  % (2004834)Termination reason: Instruction limit
% 16.83/2.89  % (2004834)Termination phase: Saturation
% 16.83/2.89  % (2004834)Time elapsed: 0.074 s
% 16.83/2.89  % (2004834)Peak memory usage: 12 MB
% 16.83/2.89  % (2004834)Instructions burned: 119 (million)
% 16.83/2.89  % (2004835)Instruction limit reached! 
% 16.83/2.89  % (2004835)------------------------------
% 16.83/2.89  % (2004835)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.83/2.89  % (2004835)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/2.89  % (2004835)CaDiCaL version: 2.1.3
% 16.83/2.89  % (2004835)Termination reason: Instruction limit
% 16.83/2.89  % (2004835)Termination phase: Saturation
% 16.83/2.89  % (2004835)Time elapsed: 0.080 s
% 16.83/2.89  % (2004835)Peak memory usage: 12 MB
% 16.83/2.89  % (2004835)Instructions burned: 131 (million)
% 16.83/2.89  % (2004844)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2593966130:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 16.83/2.89  % TRYING [1]
% 16.83/2.89  % TRYING [2]
% 16.83/2.89  % TRYING [3]
% 16.83/2.89  % (2004845)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3815101199:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 16.83/2.89  % TRYING [7]
% 16.83/2.89  % (2004846)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=3353007265:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.83/2.89  % (2004836)Instruction limit reached! 
% 16.83/2.89  % (2004836)------------------------------
% 16.83/2.89  % (2004836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.83/2.89  % (2004836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.83/2.89  % (2004836)CaDiCaL version: 2.1.3
% 16.83/2.89  % (2004836)Termination reason: Instruction limit
% 16.83/2.89  % (2004836)Termination phase: Saturation
% 16.83/2.89  % (2004836)Time elapsed: 0.099 s
% 16.83/2.89  % (2004836)Peak memory usage: 13 MB
% 16.83/2.89  % (2004836)Instructions burned: 160 (million)
% 16.83/2.89  % TRYING [4]
% 16.83/2.89  % (2004850)ott-21_1_sil=16000:fs=off:random_seed=589775206:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.83/2.89  % TRYING [5]
% 16.83/2.89  % (2004845)Instruction limit reached! 
% 16.83/2.89  % (2004845)------------------------------
% 16.83/2.89  % (2004845)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004845)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004845)Termination reason: Instruction limit
% 25.57/6.90  % (2004845)Termination phase: Saturation
% 25.57/6.90  % (2004845)Time elapsed: 0.089 s
% 25.57/6.90  % (2004845)Peak memory usage: 13 MB
% 25.57/6.90  % (2004845)Instructions burned: 131 (million)
% 25.57/6.90  % TRYING [6]
% 25.57/6.90  % (2004850)Instruction limit reached! 
% 25.57/6.90  % (2004850)------------------------------
% 25.57/6.90  % (2004850)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004850)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004850)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004850)Termination reason: Instruction limit
% 25.57/6.90  % (2004850)Termination phase: Saturation
% 25.57/6.90  % (2004850)Time elapsed: 0.081 s
% 25.57/6.90  % (2004850)Peak memory usage: 12 MB
% 25.57/6.90  % (2004850)Instructions burned: 180 (million)
% 25.57/6.90  % (2004852)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4037023407:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 25.57/6.90  % TRYING [8]
% 25.57/6.90  % (2004853)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=380279041:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 25.57/6.90  % TRYING [1]
% 25.57/6.90  % TRYING [2]
% 25.57/6.90  % TRYING [3]
% 25.57/6.90  % TRYING [4]
% 25.57/6.90  % TRYING [5]
% 25.57/6.90  % TRYING [7]
% 25.57/6.90  % (2004844)Instruction limit reached! 
% 25.57/6.90  % (2004844)------------------------------
% 25.57/6.90  % (2004844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004844)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004844)Termination reason: Instruction limit
% 25.57/6.90  % (2004844)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004844)Time elapsed: 0.269 s
% 25.57/6.90  % (2004844)Peak memory usage: 28 MB
% 25.57/6.90  % (2004844)Instructions burned: 717 (million)
% 25.57/6.90  % (2004856)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=734153509:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 25.57/6.90  % TRYING [9]
% 25.57/6.90  % TRYING [6]
% 25.57/6.90  % (2004846)Instruction limit reached! 
% 25.57/6.90  % (2004846)------------------------------
% 25.57/6.90  % (2004846)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004846)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004846)Termination reason: Instruction limit
% 25.57/6.90  % (2004846)Termination phase: Saturation
% 25.57/6.90  % (2004846)Time elapsed: 0.409 s
% 25.57/6.90  % (2004846)Peak memory usage: 17 MB
% 25.57/6.90  % (2004846)Instructions burned: 685 (million)
% 25.57/6.90  % (2004852)Instruction limit reached! 
% 25.57/6.90  % (2004852)------------------------------
% 25.57/6.90  % (2004852)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004852)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004852)Termination reason: Instruction limit
% 25.57/6.90  % (2004852)Termination phase: Saturation
% 25.57/6.90  % (2004852)Time elapsed: 0.318 s
% 25.57/6.90  % (2004852)Peak memory usage: 13 MB
% 25.57/6.90  % (2004852)Instructions burned: 478 (million)
% 25.57/6.90  % (2004858)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3634274189:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 25.57/6.90  % (2004859)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=3432949533: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)
% 25.57/6.90  % (2004853)Instruction limit reached! 
% 25.57/6.90  % (2004853)------------------------------
% 25.57/6.90  % (2004853)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004853)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004853)Termination reason: Instruction limit
% 25.57/6.90  % (2004853)Termination phase: Finite model building SAT solving
% 25.57/6.90  % (2004853)Time elapsed: 0.344 s
% 25.57/6.90  % (2004853)Peak memory usage: 24 MB
% 25.57/6.90  % (2004853)Instructions burned: 866 (million)
% 25.57/6.90  % (2004862)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1407416434:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 25.57/6.90  % TRYING [14]
% 25.57/6.90  % TRYING [10]
% 25.57/6.90  % (2004858)Instruction limit reached! 
% 25.57/6.90  % (2004858)------------------------------
% 25.57/6.90  % (2004858)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004858)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004858)Termination reason: Instruction limit
% 25.57/6.90  % (2004858)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004858)Time elapsed: 0.333 s
% 25.57/6.90  % (2004858)Peak memory usage: 79 MB
% 25.57/6.90  % (2004858)Instructions burned: 890 (million)
% 25.57/6.90  % (2004864)fmb+10_1_sil=64000:random_seed=2433209701:i=22061:nm=2:gsp=on_2990 on theBenchmark for (2990ds/22061Mi)
% 25.57/6.90  % TRYING [1]
% 25.57/6.90  % TRYING [2]
% 25.57/6.90  % TRYING [3]
% 25.57/6.90  % TRYING [4]
% 25.57/6.90  % TRYING [5]
% 25.57/6.90  % (2004859)Instruction limit reached! 
% 25.57/6.90  % (2004859)------------------------------
% 25.57/6.90  % (2004859)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004859)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004859)Termination reason: Instruction limit
% 25.57/6.90  % (2004859)Termination phase: Saturation
% 25.57/6.90  % (2004859)Time elapsed: 0.450 s
% 25.57/6.90  % (2004859)Peak memory usage: 18 MB
% 25.57/6.90  % (2004859)Instructions burned: 692 (million)
% 25.57/6.90  % (2004866)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1198476735:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 25.57/6.90  % TRYING [20]
% 25.57/6.90  % (2004856)Instruction limit reached! 
% 25.57/6.90  % (2004856)------------------------------
% 25.57/6.90  % (2004856)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004856)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004856)Termination reason: Instruction limit
% 25.57/6.90  % (2004856)Termination phase: Saturation
% 25.57/6.90  % (2004856)Time elapsed: 0.692 s
% 25.57/6.90  % (2004856)Peak memory usage: 19 MB
% 25.57/6.90  % (2004856)Instructions burned: 1179 (million)
% 25.57/6.90  % TRYING [6]
% 25.57/6.90  % (2004862)Instruction limit reached! 
% 25.57/6.90  % (2004862)------------------------------
% 25.57/6.90  % (2004862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004862)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004862)Termination reason: Instruction limit
% 25.57/6.90  % (2004862)Termination phase: Saturation
% 25.57/6.90  % (2004862)Time elapsed: 0.496 s
% 25.57/6.90  % (2004862)Peak memory usage: 19 MB
% 25.57/6.90  % (2004862)Instructions burned: 881 (million)
% 25.57/6.90  % (2004868)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=434218830:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 25.57/6.90  % TRYING [8]
% 25.57/6.90  % (2004869)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=535656330:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 25.57/6.90  % TRYING [7]
% 25.57/6.90  % (2004868)Instruction limit reached! 
% 25.57/6.90  % (2004868)------------------------------
% 25.57/6.90  % (2004868)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004868)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004868)Termination reason: Instruction limit
% 25.57/6.90  % (2004868)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004868)Time elapsed: 0.386 s
% 25.57/6.90  % (2004868)Peak memory usage: 65 MB
% 25.57/6.90  % (2004868)Instructions burned: 920 (million)
% 25.57/6.90  % (2004872)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1611458812:i=1472:ins=7:fdi=8:gsp=on_2984 on theBenchmark for (2984ds/1472Mi)
% 25.57/6.90  % TRYING [11]
% 25.57/6.90  % TRYING [8]
% 25.57/6.90  % (2004872)Instruction limit reached! 
% 25.57/6.90  % (2004872)------------------------------
% 25.57/6.90  % (2004872)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004872)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004872)Termination reason: Instruction limit
% 25.57/6.90  % (2004872)Termination phase: Saturation
% 25.57/6.90  % (2004872)Time elapsed: 0.914 s
% 25.57/6.90  % (2004872)Peak memory usage: 28 MB
% 25.57/6.90  % (2004872)Instructions burned: 1472 (million)
% 25.57/6.90  % (2004874)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3722772026:i=6324_2975 on theBenchmark for (2975ds/6324Mi)
% 25.57/6.90  % TRYING [77]
% 25.57/6.90  % TRYING [9]
% 25.57/6.90  % (2004869)Instruction limit reached! 
% 25.57/6.90  % (2004869)------------------------------
% 25.57/6.90  % (2004869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004869)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004869)Termination reason: Instruction limit
% 25.57/6.90  % (2004869)Termination phase: Saturation
% 25.57/6.90  % (2004869)Time elapsed: 2.895 s
% 25.57/6.90  % (2004869)Peak memory usage: 32 MB
% 25.57/6.90  % (2004869)Instructions burned: 5132 (million)
% 25.57/6.90  % (2004876)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=70369210:fmbsr=2.30978:i=2174_2959 on theBenchmark for (2959ds/2174Mi)
% 25.57/6.90  % TRYING [16]
% 25.57/6.90  % TRYING [12]
% 25.57/6.90  % (2004866)Instruction limit reached! 
% 25.57/6.90  % (2004866)------------------------------
% 25.57/6.90  % (2004866)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004866)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004866)Termination reason: Instruction limit
% 25.57/6.90  % (2004866)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004866)Time elapsed: 3.482 s
% 25.57/6.90  % (2004866)Peak memory usage: 688 MB
% 25.57/6.90  % (2004866)Instructions burned: 9515 (million)
% 25.57/6.90  % (2004878)ott-2_1_sil=16000:newcnf=on:random_seed=940440325:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2953 on theBenchmark for (2953ds/869Mi)
% 25.57/6.90  % (2004876)Instruction limit reached! 
% 25.57/6.90  % (2004876)------------------------------
% 25.57/6.90  % (2004876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004876)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004876)Termination reason: Instruction limit
% 25.57/6.90  % (2004876)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004876)Time elapsed: 0.746 s
% 25.57/6.90  % (2004876)Peak memory usage: 136 MB
% 25.57/6.90  % (2004876)Instructions burned: 2175 (million)
% 25.57/6.90  % (2004874)Instruction limit reached! 
% 25.57/6.90  % (2004874)------------------------------
% 25.57/6.90  % (2004874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004874)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004874)Termination reason: Instruction limit
% 25.57/6.90  % (2004874)Termination phase: Finite model building constraint generation
% 25.57/6.90  % (2004874)Time elapsed: 2.360 s
% 25.57/6.90  % (2004874)Peak memory usage: 523 MB
% 25.57/6.90  % (2004874)Instructions burned: 6324 (million)
% 25.57/6.90  % (2004880)ott+10_1_sil=32000:tgt=ground:random_seed=4228065617:i=5114:av=off_2951 on theBenchmark for (2951ds/5114Mi)
% 25.57/6.90  % (2004882)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3257672511:i=54282_2951 on theBenchmark for (2951ds/54282Mi)
% 25.57/6.90  % TRYING [1]
% 25.57/6.90  % TRYING [2]
% 25.57/6.90  % TRYING [3]
% 25.57/6.90  % TRYING [4]
% 25.57/6.90  % TRYING [5]
% 25.57/6.90  % TRYING [6]
% 25.57/6.90  % TRYING [10]
% 25.57/6.90  % TRYING [7]
% 25.57/6.90  % (2004878)Instruction limit reached! 
% 25.57/6.90  % (2004878)------------------------------
% 25.57/6.90  % (2004878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004878)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004878)Termination reason: Instruction limit
% 25.57/6.90  % (2004878)Termination phase: Saturation
% 25.57/6.90  % (2004878)Time elapsed: 0.541 s
% 25.57/6.90  % (2004878)Peak memory usage: 18 MB
% 25.57/6.90  % (2004878)Instructions burned: 870 (million)
% 25.57/6.90  % (2004884)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=3028482459:i=3512:aac=none_2948 on theBenchmark for (2948ds/3512Mi)
% 25.57/6.90  % TRYING [8]
% 25.57/6.90  % TRYING [9]
% 25.57/6.90  % (2004880) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2004825-2004880"...
% 25.57/6.90  % (2004880)...printing done.
% 25.57/6.90  % (2004880)Refutation found. Thanks to Tanya!
% 25.57/6.90  % SZS status Theorem for theBenchmark
% 25.57/6.90  % SZS output start Proof for theBenchmark
% See solution above
% 25.57/6.90  % (2004880)------------------------------
% 25.57/6.90  % (2004880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.57/6.90  % (2004880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.57/6.90  % (2004880)CaDiCaL version: 2.1.3
% 25.57/6.90  % (2004880)Termination reason: Refutation
% 25.57/6.90  % (2004880)Time elapsed: 1.601 s
% 25.57/6.90  % (2004880)Peak memory usage: 27 MB
% 25.57/6.90  % (2004880)Instructions burned: 2740 (million)
% 25.57/6.90  % (2004825)Success in time 6.481 s
% 25.57/6.90  % Vampire exiting
%------------------------------------------------------------------------------