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

% Computer : n015.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:01 PM UTC 2026

% Result   : Theorem 2.42s 0.89s
% Output   : Refutation 2.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   90 (  12 unt;   3 def)
%            Number of atoms       :  309 (  59 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  353 ( 134   ~; 152   |;  52   &)
%                                         (  11 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :  132 (   0 sgn 117   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( X0 = empty_set
    <=> ! [X1] : ~ in(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_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/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).

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

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

fof(f20,conjecture,
    ! [X0,X1] :
      ( set_difference(X0,X1) = empty_set
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).

fof(f21,negated_conjecture,
    ~ ! [X0,X1] :
        ( set_difference(X0,X1) = empty_set
      <=> subset(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f22,axiom,
    ? [X0] : empty(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).

fof(f26,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f41,axiom,
    ! [X0] :
      ( empty(X0)
     => X0 = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).

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

fof(f55,plain,
    ? [X0,X1] :
      ( set_difference(X0,X1) = empty_set
    <~> subset(X0,X1) ),
    inference(ennf_transformation,[],[f21]) ).

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

fof(f68,plain,
    ! [X0] :
      ( X0 = empty_set
      | ~ empty(X0) ),
    inference(ennf_transformation,[],[f41]) ).

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

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

fof(f77,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | in(sK0(X0),X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f76]) ).

fof(f78,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(f79,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,[],[f78]) ).

fof(f80,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,[],[f79]) ).

fof(f81,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))],[f80]) ).

fof(f82,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,[],[f52]) ).

fof(f83,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,[],[f82]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK2(X0,X1),X1)
          & in(sK2(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f83]) ).

fof(f89,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(f90,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,[],[f89]) ).

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

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

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

fof(f95,plain,
    ( ( ~ subset(sK5,sK6)
      | empty_set != set_difference(sK5,sK6) )
    & ( subset(sK5,sK6)
      | empty_set = set_difference(sK5,sK6) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f94]) ).

fof(f96,plain,
    empty(sK7),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X0,sK7)],[f22]) ).

fof(f108,plain,
    ! [X2,X0] :
      ( ~ in(X2,X0)
      | empty_set != X0 ),
    inference(cnf_transformation,[],[f77]) ).

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

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

fof(f117,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK2(X0,X1),X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( ~ in(sK2(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f84]) ).

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

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

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

fof(f138,plain,
    ( subset(sK5,sK6)
    | empty_set = set_difference(sK5,sK6) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f139,plain,
    ( ~ subset(sK5,sK6)
    | empty_set != set_difference(sK5,sK6) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f140,plain,
    empty(sK7),
    inference(cnf_transformation,[],[f96]) ).

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

fof(f163,plain,
    ! [X0] :
      ( ~ empty(X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f68]) ).

fof(f170,plain,
    ! [X2] : ~ in(X2,empty_set),
    inference(equality_resolution,[],[f108]) ).

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

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

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

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

fof(f180,definition,
    sF12 = set_difference(sK5,sK6),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f181,plain,
    set_difference(sK5,sK6) = sF12,
    inference(reorient_equations,[],[f180]) ).

fof(f182,plain,
    ( ~ subset(sK5,sK6)
    | empty_set != sF12 ),
    inference(definition_folding,[],[f139,f181]) ).

fof(f183,plain,
    ( subset(sK5,sK6)
    | empty_set = sF12 ),
    inference(definition_folding,[],[f138,f181]) ).

fof(f185,definition,
    ( spl13_1
  <=> empty_set = sF12 ),
    introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).

fof(f186,plain,
    ( empty_set != sF12
    | spl13_1 ),
    inference(avatar_component_clause,[],[f185]) ).

fof(f187,plain,
    ( empty_set = sF12
    | ~ spl13_1 ),
    inference(avatar_component_clause,[],[f185]) ).

fof(f189,definition,
    ( spl13_2
  <=> subset(sK5,sK6) ),
    introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).

fof(f190,plain,
    ( ~ subset(sK5,sK6)
    | spl13_2 ),
    inference(avatar_component_clause,[],[f189]) ).

fof(f191,plain,
    ( subset(sK5,sK6)
    | ~ spl13_2 ),
    inference(avatar_component_clause,[],[f189]) ).

fof(f192,plain,
    ( spl13_1
    | spl13_2 ),
    inference(avatar_split_clause,[],[f183,f189,f185]) ).

fof(f193,plain,
    ( ~ spl13_1
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f182,f189,f185]) ).

fof(f199,plain,
    empty_set = sK7,
    inference(resolution,[],[f163,f140]) ).

fof(f206,plain,
    ! [X0] : ~ in(X0,sK7),
    inference(superposition,[],[f170,f199]) ).

fof(f287,plain,
    ( sK6 = set_union2(sK5,sK6)
    | ~ spl13_2 ),
    inference(resolution,[],[f144,f191]) ).

fof(f386,plain,
    ( ! [X0] :
        ( ~ in(X0,sK5)
        | in(X0,sK6) )
    | ~ spl13_2 ),
    inference(superposition,[],[f171,f287]) ).

fof(f433,plain,
    ! [X0] :
      ( ~ in(X0,sF12)
      | in(X0,sK5) ),
    inference(superposition,[],[f178,f181]) ).

fof(f444,plain,
    ! [X0] :
      ( ~ in(X0,sF12)
      | ~ in(X0,sK6) ),
    inference(superposition,[],[f179,f181]) ).

fof(f620,plain,
    ! [X0] :
      ( ~ in(X0,sK5)
      | in(X0,sF12)
      | in(X0,sK6) ),
    inference(superposition,[],[f177,f181]) ).

fof(f1033,plain,
    ( in(sK0(sF12),sK5)
    | empty_set = sF12 ),
    inference(resolution,[],[f433,f109]) ).

fof(f1047,plain,
    ( in(sK0(sF12),sK5)
    | spl13_1 ),
    inference(forward_subsumption_resolution,[],[f1033,f186]) ).

fof(f1048,plain,
    ( in(sK0(sF12),sK6)
    | spl13_1
    | ~ spl13_2 ),
    inference(resolution,[],[f1047,f386]) ).

fof(f1051,plain,
    ( ~ in(sK0(sF12),sK6)
    | empty_set = sF12 ),
    inference(resolution,[],[f444,f109]) ).

fof(f1065,plain,
    ( empty_set = sF12
    | spl13_1
    | ~ spl13_2 ),
    inference(forward_subsumption_resolution,[],[f1051,f1048]) ).

fof(f1066,plain,
    ( $false
    | spl13_1
    | ~ spl13_2 ),
    inference(forward_subsumption_resolution,[],[f1065,f186]) ).

fof(f1067,plain,
    ( spl13_1
    | ~ spl13_2 ),
    inference(avatar_contradiction_clause,[],[f1066]) ).

fof(f1068,plain,
    ( sK7 = sF12
    | ~ spl13_1 ),
    inference(forward_demodulation,[],[f187,f199]) ).

fof(f1071,plain,
    ( in(sK2(sK5,sK6),sK5)
    | spl13_2 ),
    inference(resolution,[],[f190,f117]) ).

fof(f1760,plain,
    ( in(sK2(sK5,sK6),sF12)
    | in(sK2(sK5,sK6),sK6)
    | spl13_2 ),
    inference(resolution,[],[f620,f1071]) ).

fof(f1789,plain,
    ( in(sK2(sK5,sK6),sK7)
    | in(sK2(sK5,sK6),sK6)
    | ~ spl13_1
    | spl13_2 ),
    inference(forward_demodulation,[],[f1760,f1068]) ).

fof(f1808,plain,
    ( in(sK2(sK5,sK6),sK6)
    | ~ spl13_1
    | spl13_2 ),
    inference(forward_subsumption_resolution,[],[f1789,f206]) ).

fof(f1996,plain,
    ( subset(sK5,sK6)
    | ~ spl13_1
    | spl13_2 ),
    inference(resolution,[],[f1808,f118]) ).

fof(f1999,plain,
    ( $false
    | ~ spl13_1
    | spl13_2 ),
    inference(forward_subsumption_resolution,[],[f1996,f190]) ).

fof(f2000,plain,
    ( ~ spl13_1
    | spl13_2 ),
    inference(avatar_contradiction_clause,[],[f1999]) ).

cnf(s1,plain,
    ( spl13_1
    | spl13_2 ),
    inference(sat_conversion,[],[f192]) ).

cnf(s2,plain,
    ( ~ spl13_1
    | ~ spl13_2 ),
    inference(sat_conversion,[],[f193]) ).

cnf(s7,plain,
    ( spl13_1
    | ~ spl13_2 ),
    inference(sat_conversion,[],[f1067]) ).

cnf(s18,plain,
    ( ~ spl13_1
    | spl13_2 ),
    inference(sat_conversion,[],[f2000]) ).

cnf(s19,plain,
    spl13_1,
    inference(rat,[],[s1,s7]) ).

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

cnf(s21,plain,
    $false,
    inference(rat,[],[s2,s20,s19]) ).

fof(f2001,plain,
    $false,
    inference(avatar_sat_refutation,[],[s21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n015.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:43:31 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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
% 2.42/0.89  % (2236493)Will run a generic schedule for satisfiability detection.
% 2.42/0.89  % (2236499)% WARNING: option uhcvi not known.
% 2.42/0.89  % (2236498)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2606928869_2999 on theBenchmark for (2999ds/0Mi)
% 2.42/0.89  % (2236501)dis+10_1_sil=32000:sp=arity:random_seed=2125680349:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.42/0.89  % (2236500)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4050928330:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.42/0.89  % (2236502)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2581687751:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.42/0.89  % (2236503)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2242238639:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.42/0.89  % (2236504)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2352542119:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.42/0.89  % (2236499)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3590940294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.42/0.89  % TRYING [1]
% 2.42/0.89  % TRYING [2]
% 2.42/0.89  % TRYING [3]
% 2.42/0.89  % TRYING [4]
% 2.42/0.89  % TRYING [5]
% 2.42/0.89  % (2236501)Instruction limit reached! 
% 2.42/0.89  % (2236501)------------------------------
% 2.42/0.89  % (2236501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236501)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236501)Termination reason: Instruction limit
% 2.42/0.89  % (2236501)Termination phase: Saturation
% 2.42/0.89  % (2236501)Time elapsed: 0.067 s
% 2.42/0.89  % (2236501)Peak memory usage: 12 MB
% 2.42/0.89  % (2236501)Instructions burned: 103 (million)
% 2.42/0.89  % (2236502)Instruction limit reached! 
% 2.42/0.89  % (2236502)------------------------------
% 2.42/0.89  % (2236502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236502)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236502)Termination reason: Instruction limit
% 2.42/0.89  % (2236502)Termination phase: Saturation
% 2.42/0.89  % (2236502)Time elapsed: 0.074 s
% 2.42/0.89  % (2236502)Peak memory usage: 13 MB
% 2.42/0.89  % (2236502)Instructions burned: 117 (million)
% 2.42/0.89  % (2236503)Instruction limit reached! 
% 2.42/0.89  % (2236503)------------------------------
% 2.42/0.89  % (2236503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236503)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236503)Termination reason: Instruction limit
% 2.42/0.89  % (2236503)Termination phase: Saturation
% 2.42/0.89  % (2236503)Time elapsed: 0.082 s
% 2.42/0.89  % (2236503)Peak memory usage: 13 MB
% 2.42/0.89  % (2236503)Instructions burned: 132 (million)
% 2.42/0.89  % (2236512)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=485540718:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.42/0.89  % (2236504)Instruction limit reached! 
% 2.42/0.89  % (2236504)------------------------------
% 2.42/0.89  % (2236504)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236504)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236504)Termination reason: Instruction limit
% 2.42/0.89  % (2236504)Termination phase: Saturation
% 2.42/0.89  % (2236504)Time elapsed: 0.091 s
% 2.42/0.89  % (2236504)Peak memory usage: 12 MB
% 2.42/0.89  % (2236504)Instructions burned: 160 (million)
% 2.42/0.89  % TRYING [1]
% 2.42/0.89  % TRYING [2]
% 2.42/0.89  % (2236513)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2644857161:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.42/0.89  % TRYING [3]
% 2.42/0.89  % TRYING [6]
% 2.42/0.89  % TRYING [4]
% 2.42/0.89  % (2236514)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=4291295437:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.42/0.89  % (2236516)ott-21_1_sil=16000:fs=off:random_seed=2780905717:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.42/0.89  % TRYING [5]
% 2.42/0.89  % TRYING [6]
% 2.42/0.89  % (2236513)Instruction limit reached! 
% 2.42/0.89  % (2236513)------------------------------
% 2.42/0.89  % (2236513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236513)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236513)Termination reason: Instruction limit
% 2.42/0.89  % (2236513)Termination phase: Saturation
% 2.42/0.89  % (2236513)Time elapsed: 0.089 s
% 2.42/0.89  % (2236513)Peak memory usage: 13 MB
% 2.42/0.89  % (2236513)Instructions burned: 132 (million)
% 2.42/0.89  % (2236520)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1200107163:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.42/0.89  % (2236516)Instruction limit reached! 
% 2.42/0.89  % (2236516)------------------------------
% 2.42/0.89  % (2236516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236516)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236516)Termination reason: Instruction limit
% 2.42/0.89  % (2236516)Termination phase: Saturation
% 2.42/0.89  % (2236516)Time elapsed: 0.096 s
% 2.42/0.89  % (2236516)Peak memory usage: 13 MB
% 2.42/0.89  % (2236516)Instructions burned: 181 (million)
% 2.42/0.89  % (2236522)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2181886943:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.42/0.89  % TRYING [1]
% 2.42/0.89  % TRYING [2]
% 2.42/0.89  % TRYING [3]
% 2.42/0.89  % TRYING [4]
% 2.42/0.89  % TRYING [7]
% 2.42/0.89  % TRYING [5]
% 2.42/0.89  % TRYING [7]
% 2.42/0.89  % (2236512)Instruction limit reached! 
% 2.42/0.89  % (2236512)------------------------------
% 2.42/0.89  % (2236512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236512)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236512)Termination reason: Instruction limit
% 2.42/0.89  % (2236512)Termination phase: Finite model building SAT solving
% 2.42/0.89  % (2236512)Time elapsed: 0.277 s
% 2.42/0.89  % (2236512)Peak memory usage: 31 MB
% 2.42/0.89  % (2236512)Instructions burned: 714 (million)
% 2.42/0.89  % TRYING [6]
% 2.42/0.89  % (2236524)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3047919492:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.42/0.89  % (2236524) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2236493-2236524"...
% 2.42/0.89  % (2236524)...printing done.
% 2.42/0.89  % (2236524)Refutation found. Thanks to Tanya!
% 2.42/0.89  % SZS status Theorem for theBenchmark
% 2.42/0.89  % SZS output start Proof for theBenchmark
% See solution above
% 2.42/0.89  % (2236524)------------------------------
% 2.42/0.89  % (2236524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.42/0.89  % (2236524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.42/0.89  % (2236524)CaDiCaL version: 2.1.3
% 2.42/0.89  % (2236524)Termination reason: Refutation
% 2.42/0.89  % (2236524)Time elapsed: 0.044 s
% 2.42/0.89  % (2236524)Peak memory usage: 13 MB
% 2.42/0.89  % (2236524)Instructions burned: 67 (million)
% 2.42/0.89  % (2236493)Success in time 0.469 s
% 2.42/0.89  % Vampire exiting
%------------------------------------------------------------------------------