↑ 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  : SET919+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:44:59 PM UTC 2026

% Result   : Theorem 21.50s 5.44s
% Output   : Refutation 21.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   91 (  27 unt;   3 def)
%            Number of atoms       :  320 ( 148 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  361 ( 132   ~; 163   |;  58   &)
%                                         (   6 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-3 aty)
%            Number of variables   :  151 ( 137   !;  14   ?)

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

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

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

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

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( in(X0,X1)
     => ( ( in(X2,X1)
          & X0 != X2 )
        | set_intersection2(unordered_pair(X0,X2),X1) = singleton(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_zfmisc_1) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( in(X0,X1)
       => ( ( in(X2,X1)
            & X0 != X2 )
          | set_intersection2(unordered_pair(X0,X2),X1) = singleton(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f10]) ).

fof(f14,plain,
    ? [X0,X1,X2] :
      ( ( ~ in(X2,X1)
        | X0 = X2 )
      & singleton(X0) != set_intersection2(unordered_pair(X0,X2),X1)
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f15,plain,
    ? [X0,X1,X2] :
      ( ( ~ in(X2,X1)
        | X0 = X2 )
      & singleton(X0) != set_intersection2(unordered_pair(X0,X2),X1)
      & in(X0,X1) ),
    inference(flattening,[],[f14]) ).

fof(f16,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,[],[f4]) ).

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

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

fof(f19,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,[],[f5]) ).

fof(f20,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,[],[f19]) ).

fof(f21,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,[],[f20]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ( X2 = unordered_pair(X0,X1)
        | ( ( ( sK1(X0,X1,X2) != X0
              & sK1(X0,X1,X2) != X1 )
            | ~ in(sK1(X0,X1,X2),X2) )
          & ( sK1(X0,X1,X2) = X0
            | sK1(X0,X1,X2) = X1
            | in(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f21]) ).

fof(f23,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,[],[f6]) ).

fof(f24,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,[],[f23]) ).

fof(f25,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,[],[f24]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ( ( ~ in(sK2(X0,X1,X2),X0)
            | ~ in(sK2(X0,X1,X2),X1)
            | ~ in(sK2(X0,X1,X2),X2) )
          & ( ( in(sK2(X0,X1,X2),X0)
              & in(sK2(X0,X1,X2),X1) )
            | in(sK2(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,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f25]) ).

fof(f29,plain,
    ( ( ~ in(sK7,sK6)
      | sK5 = sK7 )
    & singleton(sK5) != set_intersection2(unordered_pair(sK5,sK7),sK6)
    & in(sK5,sK6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f15]) ).

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

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

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

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

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

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

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

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

fof(f46,plain,
    ! [X2,X0,X1] :
      ( in(sK2(X0,X1,X2),X2)
      | in(sK2(X0,X1,X2),X1)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f47,plain,
    ! [X2,X0,X1] :
      ( in(sK2(X0,X1,X2),X2)
      | in(sK2(X0,X1,X2),X0)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( ~ in(sK2(X0,X1,X2),X2)
      | ~ in(sK2(X0,X1,X2),X0)
      | ~ in(sK2(X0,X1,X2),X1)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f52,plain,
    in(sK5,sK6),
    inference(cnf_transformation,[],[f29]) ).

fof(f53,plain,
    singleton(sK5) != set_intersection2(unordered_pair(sK5,sK7),sK6),
    inference(cnf_transformation,[],[f29]) ).

fof(f54,plain,
    ( ~ in(sK7,sK6)
    | sK5 = sK7 ),
    inference(cnf_transformation,[],[f29]) ).

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

fof(f56,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f55]) ).

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

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

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

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

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

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

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

fof(f66,definition,
    sF8 = singleton(sK5),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f67,plain,
    singleton(sK5) = sF8,
    inference(reorient_equations,[],[f66]) ).

fof(f68,definition,
    sF9 = unordered_pair(sK5,sK7),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f69,plain,
    unordered_pair(sK5,sK7) = sF9,
    inference(reorient_equations,[],[f68]) ).

fof(f70,definition,
    sF10 = set_intersection2(sF9,sK6),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f71,plain,
    set_intersection2(sF9,sK6) = sF10,
    inference(reorient_equations,[],[f70]) ).

fof(f72,plain,
    sF8 != sF10,
    inference(definition_folding,[],[f53,f71,f69,f67]) ).

fof(f73,plain,
    sF10 = set_intersection2(sK6,sF9),
    inference(forward_demodulation,[],[f71,f32]) ).

fof(f74,plain,
    in(sK5,sF8),
    inference(superposition,[],[f56,f67]) ).

fof(f76,plain,
    in(sK5,sF9),
    inference(superposition,[],[f59,f69]) ).

fof(f89,plain,
    ! [X0] :
      ( ~ in(X0,sF8)
      | sK5 = X0 ),
    inference(superposition,[],[f57,f67]) ).

fof(f93,plain,
    ! [X0] :
      ( ~ in(X0,sF10)
      | in(X0,sK6) ),
    inference(superposition,[],[f64,f73]) ).

fof(f98,plain,
    ! [X0] :
      ( ~ in(X0,sF10)
      | in(X0,sF9) ),
    inference(superposition,[],[f65,f73]) ).

fof(f104,plain,
    ! [X0] :
      ( ~ in(X0,sF9)
      | sK7 = X0
      | sK5 = X0 ),
    inference(superposition,[],[f62,f69]) ).

fof(f119,plain,
    ! [X0] :
      ( ~ in(X0,sF9)
      | ~ in(X0,sK6)
      | in(X0,sF10) ),
    inference(superposition,[],[f63,f73]) ).

fof(f134,plain,
    ( ~ in(sK5,sK6)
    | in(sK5,sF10) ),
    inference(resolution,[],[f119,f76]) ).

fof(f136,plain,
    in(sK5,sF10),
    inference(forward_subsumption_resolution,[],[f134,f52]) ).

fof(f153,plain,
    ! [X0,X1] :
      ( ~ in(sK2(X0,sF9,X1),sK6)
      | set_intersection2(X0,sF9) = X1
      | in(sK2(X0,sF9,X1),X1)
      | in(sK2(X0,sF9,X1),sF10) ),
    inference(resolution,[],[f46,f119]) ).

fof(f157,plain,
    ! [X0,X1] :
      ( in(sK2(X0,X1,X1),X1)
      | set_intersection2(X0,X1) = X1 ),
    inference(factoring,[],[f46]) ).

fof(f212,plain,
    ! [X0] :
      ( sK5 = sK2(X0,sF8,sF8)
      | sF8 = set_intersection2(X0,sF8) ),
    inference(resolution,[],[f157,f89]) ).

fof(f257,plain,
    ! [X0] :
      ( ~ in(sK5,sF8)
      | ~ in(sK5,X0)
      | ~ in(sK5,sF8)
      | sF8 = set_intersection2(X0,sF8)
      | sF8 = set_intersection2(X0,sF8) ),
    inference(superposition,[],[f48,f212]) ).

fof(f268,plain,
    ! [X0] :
      ( ~ in(sK5,sF8)
      | ~ in(sK5,X0)
      | sF8 = set_intersection2(X0,sF8) ),
    inference(duplicate_literal_removal,[],[f257]) ).

fof(f273,plain,
    ! [X0] :
      ( ~ in(sK5,X0)
      | sF8 = set_intersection2(X0,sF8) ),
    inference(forward_subsumption_resolution,[],[f268,f74]) ).

fof(f276,plain,
    sF8 = set_intersection2(sK6,sF8),
    inference(resolution,[],[f273,f52]) ).

fof(f279,plain,
    sF8 = set_intersection2(sF10,sF8),
    inference(resolution,[],[f273,f136]) ).

fof(f288,plain,
    sF8 = set_intersection2(sF8,sF10),
    inference(forward_demodulation,[],[f279,f32]) ).

fof(f296,plain,
    ! [X0] :
      ( ~ in(X0,sF8)
      | in(X0,sK6) ),
    inference(superposition,[],[f64,f276]) ).

fof(f314,plain,
    ! [X0] :
      ( ~ in(X0,sF8)
      | in(X0,sF10) ),
    inference(superposition,[],[f65,f288]) ).

fof(f337,plain,
    ! [X0,X1] :
      ( in(sK2(X0,X1,sF8),sK6)
      | in(sK2(X0,X1,sF8),X0)
      | set_intersection2(X0,X1) = sF8 ),
    inference(resolution,[],[f296,f47]) ).

fof(f947,plain,
    ! [X0] :
      ( in(sK2(sK6,X0,sF8),sK6)
      | sF8 = set_intersection2(sK6,X0) ),
    inference(factoring,[],[f337]) ).

fof(f3711,plain,
    ( sF8 = set_intersection2(sK6,sF9)
    | in(sK2(sK6,sF9,sF8),sF8)
    | in(sK2(sK6,sF9,sF8),sF10)
    | sF8 = set_intersection2(sK6,sF9) ),
    inference(resolution,[],[f153,f947]) ).

fof(f3750,plain,
    ( sF8 = set_intersection2(sK6,sF9)
    | in(sK2(sK6,sF9,sF8),sF8)
    | in(sK2(sK6,sF9,sF8),sF10) ),
    inference(duplicate_literal_removal,[],[f3711]) ).

fof(f3779,plain,
    ( sF8 = set_intersection2(sK6,sF9)
    | in(sK2(sK6,sF9,sF8),sF10) ),
    inference(forward_subsumption_resolution,[],[f3750,f314]) ).

fof(f3791,plain,
    ( sF8 = sF10
    | in(sK2(sK6,sF9,sF8),sF10) ),
    inference(forward_demodulation,[],[f3779,f73]) ).

fof(f3797,plain,
    in(sK2(sK6,sF9,sF8),sF10),
    inference(forward_subsumption_resolution,[],[f3791,f72]) ).

fof(f3799,plain,
    in(sK2(sK6,sF9,sF8),sF9),
    inference(resolution,[],[f3797,f98]) ).

fof(f3800,plain,
    in(sK2(sK6,sF9,sF8),sK6),
    inference(resolution,[],[f3797,f93]) ).

fof(f3834,plain,
    ( sK7 = sK2(sK6,sF9,sF8)
    | sK5 = sK2(sK6,sF9,sF8) ),
    inference(resolution,[],[f3799,f104]) ).

fof(f4544,plain,
    ( in(sK7,sK6)
    | sK5 = sK2(sK6,sF9,sF8) ),
    inference(superposition,[],[f3800,f3834]) ).

fof(f4568,plain,
    ( sK5 != sK7
    | sK5 = sK2(sK6,sF9,sF8) ),
    inference(equality_factoring,[],[f3834]) ).

fof(f4632,plain,
    ( sK5 = sK2(sK6,sF9,sF8)
    | sK5 = sK7 ),
    inference(resolution,[],[f4544,f54]) ).

fof(f4634,plain,
    sK5 = sK2(sK6,sF9,sF8),
    inference(forward_subsumption_resolution,[],[f4632,f4568]) ).

fof(f4684,plain,
    ( ~ in(sK5,sF8)
    | ~ in(sK5,sK6)
    | ~ in(sK5,sF9)
    | sF8 = set_intersection2(sK6,sF9) ),
    inference(superposition,[],[f48,f4634]) ).

fof(f4691,plain,
    ( ~ in(sK5,sF8)
    | ~ in(sK5,sF9)
    | sF8 = set_intersection2(sK6,sF9) ),
    inference(forward_subsumption_resolution,[],[f4684,f296]) ).

fof(f4692,plain,
    ( ~ in(sK5,sF9)
    | sF8 = set_intersection2(sK6,sF9) ),
    inference(forward_subsumption_resolution,[],[f4691,f74]) ).

fof(f4693,plain,
    sF8 = set_intersection2(sK6,sF9),
    inference(forward_subsumption_resolution,[],[f4692,f76]) ).

fof(f4730,plain,
    sF8 = sF10,
    inference(superposition,[],[f73,f4693]) ).

fof(f4775,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f4730,f72]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET919+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n014.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 03:10:16 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.12/2.78  % (1400566)Will run a generic schedule for satisfiability detection.
% 16.12/2.78  % (1400575)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1102944441:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 16.12/2.78  % (1400572)% WARNING: option uhcvi not known.
% 16.12/2.78  % (1400571)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4190834799_2999 on theBenchmark for (2999ds/0Mi)
% 16.12/2.78  % (1400572)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3015784880:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 16.12/2.78  % (1400573)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3777607311:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 16.12/2.78  % (1400574)dis+10_1_sil=32000:sp=arity:random_seed=1932468744:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 16.12/2.78  % (1400577)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1590209698:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 16.12/2.78  % (1400576)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=878313081:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 16.12/2.78  % TRYING [1]
% 16.12/2.78  % TRYING [2]
% 16.12/2.78  % TRYING [3]
% 16.12/2.78  % TRYING [4]
% 16.12/2.78  % TRYING [5]
% 16.12/2.78  % TRYING [6]
% 16.12/2.78  % (1400575)Instruction limit reached! 
% 16.12/2.78  % (1400575)------------------------------
% 16.12/2.78  % (1400575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.12/2.78  % (1400575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.12/2.78  % (1400575)CaDiCaL version: 2.1.3
% 16.12/2.78  % (1400575)Termination reason: Instruction limit
% 16.12/2.78  % (1400575)Termination phase: Saturation
% 16.12/2.78  % (1400575)Time elapsed: 0.038 s
% 16.12/2.78  % (1400575)Peak memory usage: 12 MB
% 16.12/2.78  % (1400575)Instructions burned: 119 (million)
% 16.12/2.78  % (1400585)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2850810978:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 16.12/2.78  % TRYING [1]
% 16.12/2.78  % TRYING [2]
% 16.12/2.78  % TRYING [3]
% 16.12/2.78  % TRYING [4]
% 16.12/2.78  % TRYING [5]
% 16.12/2.78  % TRYING [7]
% 16.12/2.78  % (1400574)Instruction limit reached! 
% 16.12/2.78  % (1400574)------------------------------
% 16.12/2.78  % (1400574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.12/2.78  % (1400574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.12/2.78  % (1400574)CaDiCaL version: 2.1.3
% 16.12/2.78  % (1400574)Termination reason: Instruction limit
% 16.12/2.78  % (1400574)Termination phase: Saturation
% 16.12/2.78  % (1400574)Time elapsed: 0.062 s
% 16.12/2.78  % (1400574)Peak memory usage: 12 MB
% 16.12/2.78  % (1400574)Instructions burned: 103 (million)
% 16.12/2.78  % TRYING [6]
% 16.12/2.78  % (1400576)Instruction limit reached! 
% 16.12/2.78  % (1400576)------------------------------
% 16.12/2.78  % (1400576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.12/2.78  % (1400576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.12/2.78  % (1400576)CaDiCaL version: 2.1.3
% 16.12/2.78  % (1400576)Termination reason: Instruction limit
% 16.12/2.78  % (1400576)Termination phase: Saturation
% 16.12/2.78  % (1400576)Time elapsed: 0.074 s
% 16.12/2.78  % (1400576)Peak memory usage: 12 MB
% 16.12/2.78  % (1400576)Instructions burned: 132 (million)
% 16.12/2.78  % (1400587)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=788802209:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 16.12/2.78  % (1400588)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=1803594904:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.12/2.78  % TRYING [7]
% 16.12/2.78  % (1400577)Instruction limit reached! 
% 16.12/2.78  % (1400577)------------------------------
% 16.12/2.78  % (1400577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.12/2.78  % (1400577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.12/2.78  % (1400577)CaDiCaL version: 2.1.3
% 16.12/2.78  % (1400577)Termination reason: Instruction limit
% 16.12/2.78  % (1400577)Termination phase: Saturation
% 16.12/2.78  % (1400577)Time elapsed: 0.098 s
% 16.12/2.78  % (1400577)Peak memory usage: 13 MB
% 16.12/2.78  % (1400577)Instructions burned: 159 (million)
% 16.12/2.78  % (1400591)ott-21_1_sil=16000:fs=off:random_seed=2178318977:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.12/2.78  % TRYING [8]
% 16.12/2.78  % (1400587)Instruction limit reached! 
% 16.12/2.78  % (1400587)------------------------------
% 16.12/2.78  % (1400587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400587)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400587)Termination reason: Instruction limit
% 21.50/5.43  % (1400587)Termination phase: Saturation
% 21.50/5.43  % (1400587)Time elapsed: 0.080 s
% 21.50/5.43  % (1400587)Peak memory usage: 13 MB
% 21.50/5.43  % (1400587)Instructions burned: 133 (million)
% 21.50/5.43  % TRYING [8]
% 21.50/5.43  % (1400593)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1604801914:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 21.50/5.43  % (1400585)Instruction limit reached! 
% 21.50/5.43  % (1400585)------------------------------
% 21.50/5.43  % (1400585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400585)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400585)Termination reason: Instruction limit
% 21.50/5.43  % (1400585)Termination phase: Finite model building constraint generation
% 21.50/5.43  % (1400585)Time elapsed: 0.157 s
% 21.50/5.43  % (1400585)Peak memory usage: 25 MB
% 21.50/5.43  % (1400585)Instructions burned: 715 (million)
% 21.50/5.43  % (1400591)Instruction limit reached! 
% 21.50/5.43  % (1400591)------------------------------
% 21.50/5.43  % (1400591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400591)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400591)Termination reason: Instruction limit
% 21.50/5.43  % (1400591)Termination phase: Saturation
% 21.50/5.43  % (1400591)Time elapsed: 0.088 s
% 21.50/5.43  % (1400591)Peak memory usage: 12 MB
% 21.50/5.43  % (1400591)Instructions burned: 181 (million)
% 21.50/5.43  % (1400595)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1556411526:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 21.50/5.43  % TRYING [1]
% 21.50/5.43  % TRYING [2]
% 21.50/5.43  % TRYING [3]
% 21.50/5.43  % TRYING [4]
% 21.50/5.43  % TRYING [5]
% 21.50/5.43  % (1400596)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1220280785:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 21.50/5.43  % TRYING [9]
% 21.50/5.43  % TRYING [6]
% 21.50/5.43  % TRYING [7]
% 21.50/5.43  % TRYING [8]
% 21.50/5.43  % (1400595)Instruction limit reached! 
% 21.50/5.43  % (1400595)------------------------------
% 21.50/5.43  % (1400595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400595)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400595)Termination reason: Instruction limit
% 21.50/5.43  % (1400595)Termination phase: Finite model building constraint generation
% 21.50/5.43  % (1400595)Time elapsed: 0.181 s
% 21.50/5.43  % (1400595)Peak memory usage: 23 MB
% 21.50/5.43  % (1400595)Instructions burned: 868 (million)
% 21.50/5.43  % (1400599)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4035331611:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 21.50/5.43  % TRYING [14]
% 21.50/5.43  % (1400588)Instruction limit reached! 
% 21.50/5.43  % (1400588)------------------------------
% 21.50/5.43  % (1400588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400588)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400588)Termination reason: Instruction limit
% 21.50/5.43  % (1400588)Termination phase: Saturation
% 21.50/5.43  % (1400588)Time elapsed: 0.358 s
% 21.50/5.43  % (1400588)Peak memory usage: 16 MB
% 21.50/5.43  % (1400588)Instructions burned: 685 (million)
% 21.50/5.43  % (1400601)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=2696145007:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 21.50/5.43  % (1400593)Instruction limit reached! 
% 21.50/5.43  % (1400593)------------------------------
% 21.50/5.43  % (1400593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400593)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400593)Termination reason: Instruction limit
% 21.50/5.43  % (1400593)Termination phase: Saturation
% 21.50/5.43  % (1400593)Time elapsed: 0.323 s
% 21.50/5.43  % (1400593)Peak memory usage: 13 MB
% 21.50/5.43  % (1400593)Instructions burned: 478 (million)
% 21.50/5.43  % (1400603)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=19346764:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 21.50/5.43  % TRYING [10]
% 21.50/5.43  % (1400599)Instruction limit reached! 
% 21.50/5.43  % (1400599)------------------------------
% 21.50/5.43  % (1400599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.43  % (1400599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.43  % (1400599)CaDiCaL version: 2.1.3
% 21.50/5.43  % (1400599)Termination reason: Instruction limit
% 21.50/5.43  % (1400599)Termination phase: Finite model building constraint generation
% 21.50/5.43  % (1400599)Time elapsed: 0.192 s
% 21.50/5.43  % (1400599)Peak memory usage: 76 MB
% 21.50/5.43  % (1400599)Instructions burned: 889 (million)
% 21.50/5.43  % (1400605)fmb+10_1_sil=64000:random_seed=3028364632:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 21.50/5.43  % TRYING [1]
% 21.50/5.43  % TRYING [2]
% 21.50/5.43  % TRYING [3]
% 21.50/5.43  % TRYING [4]
% 21.50/5.43  % TRYING [5]
% 21.50/5.43  % TRYING [6]
% 21.50/5.43  % TRYING [7]
% 21.50/5.43  % TRYING [8]
% 21.50/5.43  % (1400601)Instruction limit reached! 
% 21.50/5.43  % (1400601)------------------------------
% 21.50/5.43  % (1400601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400601)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400601)Termination reason: Instruction limit
% 21.50/5.44  % (1400601)Termination phase: Saturation
% 21.50/5.44  % (1400601)Time elapsed: 0.371 s
% 21.50/5.44  % (1400601)Peak memory usage: 19 MB
% 21.50/5.44  % (1400601)Instructions burned: 693 (million)
% 21.50/5.44  % (1400596)Instruction limit reached! 
% 21.50/5.44  % (1400596)------------------------------
% 21.50/5.44  % (1400596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400596)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400596)Termination reason: Instruction limit
% 21.50/5.44  % (1400596)Termination phase: Saturation
% 21.50/5.44  % (1400596)Time elapsed: 0.626 s
% 21.50/5.44  % (1400596)Peak memory usage: 15 MB
% 21.50/5.44  % (1400596)Instructions burned: 1180 (million)
% 21.50/5.44  % (1400607)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1482876415:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 21.50/5.44  % TRYING [20]
% 21.50/5.44  % (1400608)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1048192577:fmbsr=1.7:i=920_2991 on theBenchmark for (2991ds/920Mi)
% 21.50/5.44  % TRYING [8]
% 21.50/5.44  % TRYING [9]
% 21.50/5.44  % TRYING [9]
% 21.50/5.44  % (1400603)Instruction limit reached! 
% 21.50/5.44  % (1400603)------------------------------
% 21.50/5.44  % (1400603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400603)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400603)Termination reason: Instruction limit
% 21.50/5.44  % (1400603)Termination phase: Saturation
% 21.50/5.44  % (1400603)Time elapsed: 0.503 s
% 21.50/5.44  % (1400603)Peak memory usage: 17 MB
% 21.50/5.44  % (1400603)Instructions burned: 880 (million)
% 21.50/5.44  % (1400611)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=664919199:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 21.50/5.44  % (1400608)Instruction limit reached! 
% 21.50/5.44  % (1400608)------------------------------
% 21.50/5.44  % (1400608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400608)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400608)Termination reason: Instruction limit
% 21.50/5.44  % (1400608)Termination phase: Finite model building SAT solving
% 21.50/5.44  % (1400608)Time elapsed: 0.402 s
% 21.50/5.44  % (1400608)Peak memory usage: 44 MB
% 21.50/5.44  % (1400608)Instructions burned: 920 (million)
% 21.50/5.44  % (1400613)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1586423534:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 21.50/5.44  % TRYING [10]
% 21.50/5.44  % TRYING [11]
% 21.50/5.44  % TRYING [11]
% 21.50/5.44  % (1400613)Instruction limit reached! 
% 21.50/5.44  % (1400613)------------------------------
% 21.50/5.44  % (1400613)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400613)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400613)Termination reason: Instruction limit
% 21.50/5.44  % (1400613)Termination phase: Saturation
% 21.50/5.44  % (1400613)Time elapsed: 1.019 s
% 21.50/5.44  % (1400613)Peak memory usage: 33 MB
% 21.50/5.44  % (1400613)Instructions burned: 1473 (million)
% 21.50/5.44  % (1400615)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=674221877:i=6324_2976 on theBenchmark for (2976ds/6324Mi)
% 21.50/5.44  % TRYING [77]
% 21.50/5.44  % TRYING [12]
% 21.50/5.44  % (1400611)Instruction limit reached! 
% 21.50/5.44  % (1400611)------------------------------
% 21.50/5.44  % (1400611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400611)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400611)Termination reason: Instruction limit
% 21.50/5.44  % (1400611)Termination phase: Saturation
% 21.50/5.44  % (1400611)Time elapsed: 2.600 s
% 21.50/5.44  % (1400611)Peak memory usage: 35 MB
% 21.50/5.44  % (1400611)Instructions burned: 5131 (million)
% 21.50/5.44  % (1400617)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=507121609:fmbsr=2.30978:i=2174_2962 on theBenchmark for (2962ds/2174Mi)
% 21.50/5.44  % TRYING [16]
% 21.50/5.44  % (1400617)Instruction limit reached! 
% 21.50/5.44  % (1400617)------------------------------
% 21.50/5.44  % (1400617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400617)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400617)Termination reason: Instruction limit
% 21.50/5.44  % (1400617)Termination phase: Finite model building constraint generation
% 21.50/5.44  % (1400617)Time elapsed: 0.741 s
% 21.50/5.44  % (1400617)Peak memory usage: 135 MB
% 21.50/5.44  % (1400617)Instructions burned: 2176 (million)
% 21.50/5.44  % (1400619)ott-2_1_sil=16000:newcnf=on:random_seed=3309023043:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2955 on theBenchmark for (2955ds/869Mi)
% 21.50/5.44  % TRYING [13]
% 21.50/5.44  % (1400615)Instruction limit reached! 
% 21.50/5.44  % (1400615)------------------------------
% 21.50/5.44  % (1400615)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400615)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400615)Termination reason: Instruction limit
% 21.50/5.44  % (1400615)Termination phase: Finite model building constraint generation
% 21.50/5.44  % (1400615)Time elapsed: 2.334 s
% 21.50/5.44  % (1400615)Peak memory usage: 509 MB
% 21.50/5.44  % (1400615)Instructions burned: 6326 (million)
% 21.50/5.44  % (1400621)ott+10_1_sil=32000:tgt=ground:random_seed=2807106680:i=5114:av=off_2952 on theBenchmark for (2952ds/5114Mi)
% 21.50/5.44  % (1400619)Instruction limit reached! 
% 21.50/5.44  % (1400619)------------------------------
% 21.50/5.44  % (1400619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400619)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400619)Termination reason: Instruction limit
% 21.50/5.44  % (1400619)Termination phase: Saturation
% 21.50/5.44  % (1400619)Time elapsed: 0.374 s
% 21.50/5.44  % (1400619)Peak memory usage: 14 MB
% 21.50/5.44  % (1400619)Instructions burned: 872 (million)
% 21.50/5.44  % (1400623)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1669512296:i=54282_2951 on theBenchmark for (2951ds/54282Mi)
% 21.50/5.44  % TRYING [1]
% 21.50/5.44  % TRYING [2]
% 21.50/5.44  % TRYING [3]
% 21.50/5.44  % TRYING [4]
% 21.50/5.44  % TRYING [5]
% 21.50/5.44  % (1400621) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1400566-1400621"...
% 21.50/5.44  % (1400621)...printing done.
% 21.50/5.44  % (1400621)Refutation found. Thanks to Tanya!
% 21.50/5.44  % SZS status Theorem for theBenchmark
% 21.50/5.44  % SZS output start Proof for theBenchmark
% See solution above
% 21.50/5.44  % (1400621)------------------------------
% 21.50/5.44  % (1400621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.50/5.44  % (1400621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.50/5.44  % (1400621)CaDiCaL version: 2.1.3
% 21.50/5.44  % (1400621)Termination reason: Refutation
% 21.50/5.44  % (1400621)Time elapsed: 0.125 s
% 21.50/5.44  % (1400621)Peak memory usage: 13 MB
% 21.50/5.44  % (1400621)Instructions burned: 215 (million)
% 21.50/5.44  % (1400566)Success in time 5.024 s
% 21.50/5.44  % Vampire exiting
%------------------------------------------------------------------------------