↑ 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  : SEU136+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 : n009.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:03 PM UTC 2026

% Result   : Theorem 15.06s 10.27s
% Output   : Refutation 15.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   84 (  36 unt;   3 def)
%            Number of atoms       :  300 (  69 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  341 ( 125   ~; 140   |;  64   &)
%                                         (   7 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :  166 ( 153   !;  13   ?)

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

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

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

fof(f9,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(f25,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).

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

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

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

fof(f36,axiom,
    ! [X0,X1] : subset(set_difference(X0,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).

fof(f38,axiom,
    ! [X0,X1] : set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).

fof(f42,conjecture,
    ! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_xboole_1) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
    inference(negated_conjecture,[status(cth)],[f42]) ).

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

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

fof(f67,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ? [X2] :
          ( in(X2,X0)
        <~> in(X2,X1) ) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( subset(set_difference(X0,X2),set_difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f72,plain,
    ? [X0,X1] : set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1),
    inference(ennf_transformation,[],[f43]) ).

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

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

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

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

fof(f91,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,[],[f8]) ).

fof(f92,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,[],[f91]) ).

fof(f93,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,[],[f92]) ).

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

fof(f95,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,[],[f9]) ).

fof(f96,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,[],[f95]) ).

fof(f97,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,[],[f96]) ).

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

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

fof(f104,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ( ( ~ in(sK7(X0,X1),X1)
          | ~ in(sK7(X0,X1),X0) )
        & ( in(sK7(X0,X1),X1)
          | in(sK7(X0,X1),X0) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f103]) ).

fof(f107,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f72]) ).

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

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

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

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

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

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

fof(f157,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_intersection2(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f67]) ).

fof(f159,plain,
    ! [X0,X1] :
      ( in(sK7(X0,X1),X1)
      | in(sK7(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f104]) ).

fof(f160,plain,
    ! [X0,X1] :
      ( ~ in(sK7(X0,X1),X1)
      | X0 = X1
      | ~ in(sK7(X0,X1),X0) ),
    inference(cnf_transformation,[],[f104]) ).

fof(f162,plain,
    ! [X2,X0,X1] :
      ( subset(set_difference(X0,X2),set_difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f69]) ).

fof(f163,plain,
    ! [X0,X1] : subset(set_difference(X0,X1),X0),
    inference(cnf_transformation,[],[f36]) ).

fof(f166,plain,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
    inference(cnf_transformation,[],[f38]) ).

fof(f172,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(cnf_transformation,[],[f107]) ).

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

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

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

fof(f189,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_intersection2(X0,X1))
      | in(X4,X1) ),
    inference(equality_resolution,[],[f126]) ).

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

fof(f193,definition,
    sF12 = set_difference(sK9,sK10),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f194,plain,
    set_difference(sK9,sK10) = sF12,
    inference(reorient_equations,[],[f193]) ).

fof(f195,definition,
    sF13 = set_union2(sK9,sK10),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f196,plain,
    set_union2(sK9,sK10) = sF13,
    inference(reorient_equations,[],[f195]) ).

fof(f197,definition,
    sF14 = set_difference(sF13,sK10),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f198,plain,
    set_difference(sF13,sK10) = sF14,
    inference(reorient_equations,[],[f197]) ).

fof(f199,plain,
    sF12 != sF14,
    inference(definition_folding,[],[f172,f198,f196,f194]) ).

fof(f200,plain,
    sF13 = set_union2(sK10,sK9),
    inference(forward_demodulation,[],[f196,f110]) ).

fof(f211,plain,
    subset(sF14,sF13),
    inference(superposition,[],[f163,f198]) ).

fof(f232,plain,
    ! [X0,X1] : subset(X1,set_union2(X0,X1)),
    inference(superposition,[],[f178,f110]) ).

fof(f238,plain,
    subset(sK9,sF13),
    inference(superposition,[],[f232,f200]) ).

fof(f277,plain,
    sF13 = set_union2(sF14,sF13),
    inference(resolution,[],[f151,f211]) ).

fof(f280,plain,
    sF13 = set_union2(sF13,sF14),
    inference(forward_demodulation,[],[f277,f110]) ).

fof(f398,plain,
    ! [X0] :
      ( ~ in(X0,sF14)
      | in(X0,sF13) ),
    inference(superposition,[],[f185,f280]) ).

fof(f457,plain,
    ! [X0] :
      ( ~ in(X0,sF14)
      | ~ in(X0,sK10) ),
    inference(superposition,[],[f192,f198]) ).

fof(f483,plain,
    set_union2(sK10,sK9) = set_union2(sK10,sF12),
    inference(superposition,[],[f166,f194]) ).

fof(f502,plain,
    sF13 = set_union2(sK10,sF12),
    inference(forward_demodulation,[],[f483,f200]) ).

fof(f590,plain,
    ! [X0] :
      ( subset(sF12,set_difference(X0,sK10))
      | ~ subset(sK9,X0) ),
    inference(superposition,[],[f162,f194]) ).

fof(f708,plain,
    ! [X0] :
      ( ~ in(X0,sF13)
      | in(X0,sF12)
      | in(X0,sK10) ),
    inference(superposition,[],[f186,f502]) ).

fof(f759,plain,
    ! [X2,X0,X1] :
      ( in(sK7(set_intersection2(X0,X1),X2),X2)
      | in(sK7(set_intersection2(X0,X1),X2),X1)
      | set_intersection2(X0,X1) = X2 ),
    inference(resolution,[],[f159,f189]) ).

fof(f1620,plain,
    ( subset(sF12,sF14)
    | ~ subset(sK9,sF13) ),
    inference(superposition,[],[f590,f198]) ).

fof(f1621,plain,
    subset(sF12,sF14),
    inference(forward_subsumption_resolution,[],[f1620,f238]) ).

fof(f1627,plain,
    sF12 = set_intersection2(sF12,sF14),
    inference(resolution,[],[f1621,f157]) ).

fof(f7799,plain,
    ! [X0,X1] :
      ( in(sK7(set_intersection2(X0,X1),X1),X1)
      | set_intersection2(X0,X1) = X1 ),
    inference(factoring,[],[f759]) ).

fof(f73410,plain,
    ( in(sK7(sF12,sF14),sF14)
    | sF12 = sF14 ),
    inference(superposition,[],[f7799,f1627]) ).

fof(f73417,plain,
    in(sK7(sF12,sF14),sF14),
    inference(forward_subsumption_resolution,[],[f73410,f199]) ).

fof(f73491,plain,
    ( sF12 = sF14
    | ~ in(sK7(sF12,sF14),sF12) ),
    inference(resolution,[],[f73417,f160]) ).

fof(f73492,plain,
    in(sK7(sF12,sF14),sF13),
    inference(resolution,[],[f73417,f398]) ).

fof(f73495,plain,
    ~ in(sK7(sF12,sF14),sK10),
    inference(resolution,[],[f73417,f457]) ).

fof(f73498,plain,
    ~ in(sK7(sF12,sF14),sF12),
    inference(forward_subsumption_resolution,[],[f73491,f199]) ).

fof(f73839,plain,
    ( in(sK7(sF12,sF14),sF12)
    | in(sK7(sF12,sF14),sK10) ),
    inference(resolution,[],[f73492,f708]) ).

fof(f73844,plain,
    in(sK7(sF12,sF14),sK10),
    inference(forward_subsumption_resolution,[],[f73839,f73498]) ).

fof(f73845,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f73844,f73495]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU136+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/5.38  % Computer : n009.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Mon Sep 28 03:41:36 UTC 2026
% 0.12/5.39  % CPUTime  : 
% 0.12/5.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/5.42  Running first-order model finding
% 0.15/5.42  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
% 11.38/7.07  % (2641014)Will run a generic schedule for satisfiability detection.
% 11.38/7.07  % (2641023)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1951666178:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 11.38/7.07  % (2641020)% WARNING: option uhcvi not known.
% 11.38/7.07  % (2641021)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3602459747:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 11.38/7.07  % (2641024)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2235559329:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 11.38/7.07  % (2641019)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4083205881_2999 on theBenchmark for (2999ds/0Mi)
% 11.38/7.07  % (2641020)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4173681815:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 11.38/7.07  % (2641022)dis+10_1_sil=32000:sp=arity:random_seed=1009734355:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 11.38/7.07  % (2641025)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=857917573:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 11.38/7.07  % TRYING [1]
% 11.38/7.07  % TRYING [2]
% 11.38/7.07  % TRYING [3]
% 11.38/7.07  % TRYING [4]
% 11.38/7.07  % (2641023)Instruction limit reached! 
% 11.38/7.07  % (2641023)------------------------------
% 11.38/7.07  % (2641023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/7.07  % (2641023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/7.07  % (2641023)CaDiCaL version: 2.1.3
% 11.38/7.07  % (2641023)Termination reason: Instruction limit
% 11.38/7.07  % (2641023)Termination phase: Saturation
% 11.38/7.07  % (2641023)Time elapsed: 0.041 s
% 11.38/7.07  % (2641023)Peak memory usage: 12 MB
% 11.38/7.07  % (2641023)Instructions burned: 119 (million)
% 11.38/7.07  % (2641033)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1162492864:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 11.38/7.07  % TRYING [1]
% 11.38/7.07  % TRYING [2]
% 11.38/7.07  % TRYING [3]
% 11.38/7.07  % TRYING [4]
% 11.38/7.07  % (2641022)Instruction limit reached! 
% 11.38/7.07  % (2641022)------------------------------
% 11.38/7.07  % (2641022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/7.07  % (2641022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/7.07  % (2641022)CaDiCaL version: 2.1.3
% 11.38/7.07  % (2641022)Termination reason: Instruction limit
% 11.38/7.07  % (2641022)Termination phase: Saturation
% 11.38/7.07  % (2641022)Time elapsed: 0.065 s
% 11.38/7.07  % (2641022)Peak memory usage: 12 MB
% 11.38/7.07  % (2641022)Instructions burned: 104 (million)
% 11.38/7.07  % TRYING [5]
% 11.38/7.07  % TRYING [5]
% 11.38/7.07  % (2641024)Instruction limit reached! 
% 11.38/7.07  % (2641024)------------------------------
% 11.38/7.07  % (2641024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/7.07  % (2641024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/7.07  % (2641024)CaDiCaL version: 2.1.3
% 11.38/7.07  % (2641024)Termination reason: Instruction limit
% 11.38/7.07  % (2641024)Termination phase: Saturation
% 11.38/7.07  % (2641024)Time elapsed: 0.082 s
% 11.38/7.07  % (2641024)Peak memory usage: 13 MB
% 11.38/7.07  % (2641024)Instructions burned: 132 (million)
% 11.38/7.07  % (2641035)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2200695754:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 11.38/7.07  % (2641036)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=2686268347:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 11.38/7.07  % (2641025)Instruction limit reached! 
% 11.38/7.07  % (2641025)------------------------------
% 11.38/7.07  % (2641025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/7.07  % (2641025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/7.07  % (2641025)CaDiCaL version: 2.1.3
% 11.38/7.07  % (2641025)Termination reason: Instruction limit
% 11.38/7.07  % (2641025)Termination phase: Saturation
% 11.38/7.07  % (2641025)Time elapsed: 0.100 s
% 11.38/7.07  % (2641025)Peak memory usage: 13 MB
% 11.38/7.07  % (2641025)Instructions burned: 160 (million)
% 11.38/7.07  % TRYING [6]
% 11.38/7.07  % (2641039)ott-21_1_sil=16000:fs=off:random_seed=1467033347:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 11.38/7.07  % TRYING [6]
% 11.38/7.07  % (2641035)Instruction limit reached! 
% 11.38/7.07  % (2641035)------------------------------
% 11.38/7.07  % (2641035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641035)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641035)Termination reason: Instruction limit
% 15.06/10.27  % (2641035)Termination phase: Saturation
% 15.06/10.27  % (2641035)Time elapsed: 0.090 s
% 15.06/10.27  % (2641035)Peak memory usage: 13 MB
% 15.06/10.27  % (2641035)Instructions burned: 132 (million)
% 15.06/10.27  % (2641041)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=603914522:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 15.06/10.27  % (2641039)Instruction limit reached! 
% 15.06/10.27  % (2641039)------------------------------
% 15.06/10.27  % (2641039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641039)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641039)Termination reason: Instruction limit
% 15.06/10.27  % (2641039)Termination phase: Saturation
% 15.06/10.27  % (2641039)Time elapsed: 0.085 s
% 15.06/10.27  % (2641039)Peak memory usage: 12 MB
% 15.06/10.27  % (2641039)Instructions burned: 180 (million)
% 15.06/10.27  % (2641033)Instruction limit reached! 
% 15.06/10.27  % (2641033)------------------------------
% 15.06/10.27  % (2641033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641033)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641033)Termination reason: Instruction limit
% 15.06/10.27  % (2641033)Termination phase: Finite model building SAT solving
% 15.06/10.27  % (2641033)Time elapsed: 0.165 s
% 15.06/10.27  % (2641033)Peak memory usage: 24 MB
% 15.06/10.27  % (2641033)Instructions burned: 716 (million)
% 15.06/10.27  % (2641044)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=508331036:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 15.06/10.27  % (2641043)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2782316665:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 15.06/10.27  % TRYING [1]
% 15.06/10.27  % TRYING [2]
% 15.06/10.27  % TRYING [3]
% 15.06/10.27  % TRYING [4]
% 15.06/10.27  % TRYING [7]
% 15.06/10.27  % TRYING [5]
% 15.06/10.27  % TRYING [6]
% 15.06/10.27  % (2641036)Instruction limit reached! 
% 15.06/10.27  % (2641036)------------------------------
% 15.06/10.27  % (2641036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641036)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641036)Termination reason: Instruction limit
% 15.06/10.27  % (2641036)Termination phase: Saturation
% 15.06/10.27  % (2641036)Time elapsed: 0.385 s
% 15.06/10.27  % (2641036)Peak memory usage: 17 MB
% 15.06/10.27  % (2641036)Instructions burned: 684 (million)
% 15.06/10.27  % (2641047)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=292883906:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 15.06/10.27  % (2641041)Instruction limit reached! 
% 15.06/10.27  % (2641041)------------------------------
% 15.06/10.27  % (2641041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641041)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641041)Termination reason: Instruction limit
% 15.06/10.27  % (2641041)Termination phase: Saturation
% 15.06/10.27  % (2641041)Time elapsed: 0.314 s
% 15.06/10.27  % (2641041)Peak memory usage: 13 MB
% 15.06/10.27  % (2641041)Instructions burned: 478 (million)
% 15.06/10.27  % (2641049)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=1885366651: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)
% 15.06/10.27  % (2641044)Instruction limit reached! 
% 15.06/10.27  % (2641044)------------------------------
% 15.06/10.27  % (2641044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641044)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641044)Termination reason: Instruction limit
% 15.06/10.27  % (2641044)Termination phase: Saturation
% 15.06/10.27  % (2641044)Time elapsed: 0.356 s
% 15.06/10.27  % (2641044)Peak memory usage: 22 MB
% 15.06/10.27  % (2641044)Instructions burned: 1180 (million)
% 15.06/10.27  % (2641043)Instruction limit reached! 
% 15.06/10.27  % (2641043)------------------------------
% 15.06/10.27  % (2641043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641043)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641043)Termination reason: Instruction limit
% 15.06/10.27  % (2641043)Termination phase: Finite model building SAT solving
% 15.06/10.27  % (2641043)Time elapsed: 0.364 s
% 15.06/10.27  % (2641043)Peak memory usage: 22 MB
% 15.06/10.27  % (2641043)Instructions burned: 865 (million)
% 15.06/10.27  % (2641051)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=219250980:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 15.06/10.27  % TRYING [14]
% 15.06/10.27  % (2641053)fmb+10_1_sil=64000:random_seed=1999383328:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 15.06/10.27  % TRYING [1]
% 15.06/10.27  % TRYING [2]
% 15.06/10.27  % TRYING [3]
% 15.06/10.27  % TRYING [4]
% 15.06/10.27  % TRYING [8]
% 15.06/10.27  % TRYING [5]
% 15.06/10.27  % TRYING [6]
% 15.06/10.27  % (2641047)Instruction limit reached! 
% 15.06/10.27  % (2641047)------------------------------
% 15.06/10.27  % (2641047)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641047)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641047)Termination reason: Instruction limit
% 15.06/10.27  % (2641047)Termination phase: Finite model building constraint generation
% 15.06/10.27  % (2641047)Time elapsed: 0.325 s
% 15.06/10.27  % (2641047)Peak memory usage: 75 MB
% 15.06/10.27  % (2641047)Instructions burned: 892 (million)
% 15.06/10.27  % (2641055)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2976549210:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 15.06/10.27  % (2641051)Instruction limit reached! 
% 15.06/10.27  % (2641051)------------------------------
% 15.06/10.27  % (2641051)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641051)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641051)Termination reason: Instruction limit
% 15.06/10.27  % (2641051)Termination phase: Saturation
% 15.06/10.27  % (2641051)Time elapsed: 0.270 s
% 15.06/10.27  % (2641051)Peak memory usage: 19 MB
% 15.06/10.27  % (2641051)Instructions burned: 879 (million)
% 15.06/10.27  % TRYING [20]
% 15.06/10.27  % (2641057)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=291471364:fmbsr=1.7:i=920_2991 on theBenchmark for (2991ds/920Mi)
% 15.06/10.27  % TRYING [8]
% 15.06/10.27  % (2641049)Instruction limit reached! 
% 15.06/10.27  % (2641049)------------------------------
% 15.06/10.27  % (2641049)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641049)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641049)Termination reason: Instruction limit
% 15.06/10.27  % (2641049)Termination phase: Saturation
% 15.06/10.27  % (2641049)Time elapsed: 0.445 s
% 15.06/10.27  % (2641049)Peak memory usage: 18 MB
% 15.06/10.27  % (2641049)Instructions burned: 692 (million)
% 15.06/10.27  % TRYING [7]
% 15.06/10.27  % (2641059)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=693851269:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 15.06/10.27  % (2641057)Instruction limit reached! 
% 15.06/10.27  % (2641057)------------------------------
% 15.06/10.27  % (2641057)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641057)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641057)Termination reason: Instruction limit
% 15.06/10.27  % (2641057)Termination phase: Finite model building SAT solving
% 15.06/10.27  % (2641057)Time elapsed: 0.214 s
% 15.06/10.27  % (2641057)Peak memory usage: 53 MB
% 15.06/10.27  % (2641057)Instructions burned: 921 (million)
% 15.06/10.27  % (2641061)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3288215403:i=1472:ins=7:fdi=8:gsp=on_2988 on theBenchmark for (2988ds/1472Mi)
% 15.06/10.27  % (2641061)Instruction limit reached! 
% 15.06/10.27  % (2641061)------------------------------
% 15.06/10.27  % (2641061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641061)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641061)Termination reason: Instruction limit
% 15.06/10.27  % (2641061)Termination phase: Saturation
% 15.06/10.27  % (2641061)Time elapsed: 0.493 s
% 15.06/10.27  % (2641061)Peak memory usage: 31 MB
% 15.06/10.27  % (2641061)Instructions burned: 1473 (million)
% 15.06/10.27  % (2641063)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2980147098:i=6324_2983 on theBenchmark for (2983ds/6324Mi)
% 15.06/10.27  % TRYING [77]
% 15.06/10.27  % TRYING [9]
% 15.06/10.27  % TRYING [8]
% 15.06/10.27  % (2641063)Instruction limit reached! 
% 15.06/10.27  % (2641063)------------------------------
% 15.06/10.27  % (2641063)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641063)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641063)Termination reason: Instruction limit
% 15.06/10.27  % (2641063)Termination phase: Finite model building constraint generation
% 15.06/10.27  % (2641063)Time elapsed: 1.285 s
% 15.06/10.27  % (2641063)Peak memory usage: 433 MB
% 15.06/10.27  % (2641063)Instructions burned: 6329 (million)
% 15.06/10.27  % (2641065)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1453727154:fmbsr=2.30978:i=2174_2970 on theBenchmark for (2970ds/2174Mi)
% 15.06/10.27  % TRYING [16]
% 15.06/10.27  % TRYING [9]
% 15.06/10.27  % (2641065)Instruction limit reached! 
% 15.06/10.27  % (2641065)------------------------------
% 15.06/10.27  % (2641065)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641065)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641065)Termination reason: Instruction limit
% 15.06/10.27  % (2641065)Termination phase: Finite model building constraint generation
% 15.06/10.27  % (2641065)Time elapsed: 0.406 s
% 15.06/10.27  % (2641065)Peak memory usage: 135 MB
% 15.06/10.27  % (2641065)Instructions burned: 2178 (million)
% 15.06/10.27  % (2641067)ott-2_1_sil=16000:newcnf=on:random_seed=2151371600:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2966 on theBenchmark for (2966ds/869Mi)
% 15.06/10.27  % (2641067)Instruction limit reached! 
% 15.06/10.27  % (2641067)------------------------------
% 15.06/10.27  % (2641067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641067)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641067)Termination reason: Instruction limit
% 15.06/10.27  % (2641067)Termination phase: Saturation
% 15.06/10.27  % (2641067)Time elapsed: 0.266 s
% 15.06/10.27  % (2641067)Peak memory usage: 17 MB
% 15.06/10.27  % (2641067)Instructions burned: 869 (million)
% 15.06/10.27  % (2641069)ott+10_1_sil=32000:tgt=ground:random_seed=1391782029:i=5114:av=off_2963 on theBenchmark for (2963ds/5114Mi)
% 15.06/10.27  % (2641059)Instruction limit reached! 
% 15.06/10.27  % (2641059)------------------------------
% 15.06/10.27  % (2641059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641059)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641059)Termination reason: Instruction limit
% 15.06/10.27  % (2641059)Termination phase: Saturation
% 15.06/10.27  % (2641059)Time elapsed: 2.726 s
% 15.06/10.27  % (2641059)Peak memory usage: 31 MB
% 15.06/10.27  % (2641059)Instructions burned: 5132 (million)
% 15.06/10.27  % (2641071)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=612228564:i=54282_2962 on theBenchmark for (2962ds/54282Mi)
% 15.06/10.27  % TRYING [1]
% 15.06/10.27  % TRYING [2]
% 15.06/10.27  % TRYING [3]
% 15.06/10.27  % TRYING [4]
% 15.06/10.27  % TRYING [5]
% 15.06/10.27  % TRYING [6]
% 15.06/10.27  % TRYING [7]
% 15.06/10.27  % TRYING [8]
% 15.06/10.27  % (2641069) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2641014-2641069"...
% 15.06/10.27  % (2641069)...printing done.
% 15.06/10.27  % (2641069)Refutation found. Thanks to Tanya!
% 15.06/10.27  % SZS status Theorem for theBenchmark
% 15.06/10.27  % SZS output start Proof for theBenchmark
% See solution above
% 15.06/10.27  % (2641069)------------------------------
% 15.06/10.27  % (2641069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.06/10.27  % (2641069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.06/10.27  % (2641069)CaDiCaL version: 2.1.3
% 15.06/10.27  % (2641069)Termination reason: Refutation
% 15.06/10.27  % (2641069)Time elapsed: 1.063 s
% 15.06/10.27  % (2641069)Peak memory usage: 40 MB
% 15.06/10.27  % (2641069)Instructions burned: 3362 (million)
% 15.06/10.27  % (2641014)Success in time 4.84 s
% 15.06/10.27  % Vampire exiting
%------------------------------------------------------------------------------