↑ 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  : SEU132+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 : n019.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 1.95s 0.87s
% Output   : Refutation 1.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   52 (  15 unt;   2 def)
%            Number of atoms       :  210 (  30 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  253 (  95   ~;  99   |;  49   &)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :  114 ( 103   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
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(f7,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox2/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/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(f35,conjecture,
    ! [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,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( subset(X0,X1)
       => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    inference(negated_conjecture,[status(cth)],[f35]) ).

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

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

fof(f65,plain,
    ? [X0,X1,X2] :
      ( ~ subset(set_difference(X0,X2),set_difference(X1,X2))
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f36]) ).

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

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) ) ) )
      & ( ! [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,[],[f79]) ).

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

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

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

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

fof(f85,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))],[f84]) ).

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

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) ) ) )
      & ( ! [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,[],[f90]) ).

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

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

fof(f100,plain,
    ( ~ subset(set_difference(sK8,sK10),set_difference(sK9,sK10))
    & subset(sK8,sK9) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10)],[f65]) ).

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

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

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

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

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

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

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

fof(f156,plain,
    subset(sK8,sK9),
    inference(cnf_transformation,[],[f100]) ).

fof(f157,plain,
    ~ subset(set_difference(sK8,sK10),set_difference(sK9,sK10)),
    inference(cnf_transformation,[],[f100]) ).

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

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

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

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

fof(f183,definition,
    sF13 = set_difference(sK8,sK10),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f184,plain,
    set_difference(sK8,sK10) = sF13,
    inference(reorient_equations,[],[f183]) ).

fof(f185,definition,
    sF14 = set_difference(sK9,sK10),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f186,plain,
    set_difference(sK9,sK10) = sF14,
    inference(reorient_equations,[],[f185]) ).

fof(f187,plain,
    ~ subset(sF13,sF14),
    inference(definition_folding,[],[f157,f186,f184]) ).

fof(f285,plain,
    sK9 = set_union2(sK8,sK9),
    inference(resolution,[],[f145,f156]) ).

fof(f335,plain,
    in(sK2(sF13,sF14),sF13),
    inference(resolution,[],[f118,f187]) ).

fof(f359,plain,
    ! [X0] :
      ( ~ in(X0,sK8)
      | in(X0,sK9) ),
    inference(superposition,[],[f174,f285]) ).

fof(f400,plain,
    ! [X0] :
      ( ~ in(X0,sF13)
      | in(X0,sK8) ),
    inference(superposition,[],[f181,f184]) ).

fof(f410,plain,
    ! [X0] :
      ( ~ in(X0,sF13)
      | ~ in(X0,sK10) ),
    inference(superposition,[],[f182,f184]) ).

fof(f573,plain,
    ! [X0] :
      ( ~ in(X0,sK9)
      | in(X0,sF14)
      | in(X0,sK10) ),
    inference(superposition,[],[f180,f186]) ).

fof(f1043,plain,
    in(sK2(sF13,sF14),sK8),
    inference(resolution,[],[f400,f335]) ).

fof(f1055,plain,
    in(sK2(sF13,sF14),sK9),
    inference(resolution,[],[f1043,f359]) ).

fof(f1079,plain,
    ~ in(sK2(sF13,sF14),sK10),
    inference(resolution,[],[f410,f335]) ).

fof(f2042,plain,
    ( in(sK2(sF13,sF14),sF14)
    | in(sK2(sF13,sF14),sK10) ),
    inference(resolution,[],[f573,f1055]) ).

fof(f2106,plain,
    in(sK2(sF13,sF14),sF14),
    inference(forward_subsumption_resolution,[],[f2042,f1079]) ).

fof(f2708,plain,
    subset(sF13,sF14),
    inference(resolution,[],[f2106,f119]) ).

fof(f2713,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2708,f187]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU132+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39  % Computer : n019.cluster.edu
% 0.14/0.39  % Model    : x86_64 x86_64
% 0.14/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39  % Memory   : 8046.5625MB
% 0.14/0.39  % OS       : Linux 6.8.0-71-generic
% 0.14/0.39  % CPULimit : 300
% 0.14/0.39  % WCLimit  : 300
% 0.14/0.39  % DateTime : Mon Sep 28 03:40:34 UTC 2026
% 0.14/0.39  % CPUTime  : 
% 0.14/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.44  Running first-order model finding
% 0.14/0.44  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
% 1.95/0.86  % (3638297)Will run a generic schedule for satisfiability detection.
% 1.95/0.86  % (3638308)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=841978654:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.95/0.86  % (3638304)% WARNING: option uhcvi not known.
% 1.95/0.86  % (3638303)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=670291032_2999 on theBenchmark for (2999ds/0Mi)
% 1.95/0.86  % (3638304)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3702673435:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.95/0.86  % (3638306)dis+10_1_sil=32000:sp=arity:random_seed=3284660865:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.95/0.86  % (3638305)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1643605546:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.95/0.86  % (3638307)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1343794290:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.95/0.86  % (3638309)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2009997324:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.95/0.86  % TRYING [1]
% 1.95/0.86  % TRYING [2]
% 1.95/0.86  % TRYING [3]
% 1.95/0.86  % TRYING [4]
% 1.95/0.86  % (3638308)Instruction limit reached! 
% 1.95/0.86  % (3638308)------------------------------
% 1.95/0.86  % (3638308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.86  % (3638308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.86  % (3638308)CaDiCaL version: 2.1.3
% 1.95/0.86  % (3638308)Termination reason: Instruction limit
% 1.95/0.86  % (3638308)Termination phase: Saturation
% 1.95/0.86  % (3638308)Time elapsed: 0.075 s
% 1.95/0.86  % (3638308)Peak memory usage: 13 MB
% 1.95/0.86  % (3638308)Instructions burned: 131 (million)
% 1.95/0.86  % TRYING [5]
% 1.95/0.86  % (3638318)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1037550023:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.95/0.86  % TRYING [1]
% 1.95/0.86  % TRYING [2]
% 1.95/0.86  % TRYING [3]
% 1.95/0.86  % (3638306)Instruction limit reached! 
% 1.95/0.86  % (3638306)------------------------------
% 1.95/0.86  % (3638306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.86  % (3638306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.86  % (3638306)CaDiCaL version: 2.1.3
% 1.95/0.86  % (3638306)Termination reason: Instruction limit
% 1.95/0.86  % (3638306)Termination phase: Saturation
% 1.95/0.86  % (3638306)Time elapsed: 0.094 s
% 1.95/0.86  % (3638306)Peak memory usage: 12 MB
% 1.95/0.86  % (3638306)Instructions burned: 104 (million)
% 1.95/0.86  % TRYING [4]
% 1.95/0.86  % (3638320)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3716429911:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.95/0.86  % (3638307)Instruction limit reached! 
% 1.95/0.86  % (3638307)------------------------------
% 1.95/0.86  % (3638307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.86  % (3638307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.86  % (3638307)CaDiCaL version: 2.1.3
% 1.95/0.86  % (3638307)Termination reason: Instruction limit
% 1.95/0.86  % (3638307)Termination phase: Saturation
% 1.95/0.86  % (3638307)Time elapsed: 0.121 s
% 1.95/0.86  % (3638307)Peak memory usage: 13 MB
% 1.95/0.86  % (3638307)Instructions burned: 116 (million)
% 1.95/0.86  % TRYING [5]
% 1.95/0.87  % (3638322)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=3122404421:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.95/0.87  % TRYING [6]
% 1.95/0.87  % (3638309)Instruction limit reached! 
% 1.95/0.87  % (3638309)------------------------------
% 1.95/0.87  % (3638309)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.87  % (3638309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.87  % (3638309)CaDiCaL version: 2.1.3
% 1.95/0.87  % (3638309)Termination reason: Instruction limit
% 1.95/0.87  % (3638309)Termination phase: Saturation
% 1.95/0.87  % (3638309)Time elapsed: 0.161 s
% 1.95/0.87  % (3638309)Peak memory usage: 13 MB
% 1.95/0.87  % (3638309)Instructions burned: 159 (million)
% 1.95/0.87  % (3638325)ott-21_1_sil=16000:fs=off:random_seed=1777633394:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 1.95/0.87  % TRYING [6]
% 1.95/0.87  % (3638320)Instruction limit reached! 
% 1.95/0.87  % (3638320)------------------------------
% 1.95/0.87  % (3638320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.87  % (3638320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.87  % (3638320)CaDiCaL version: 2.1.3
% 1.95/0.87  % (3638320)Termination reason: Instruction limit
% 1.95/0.87  % (3638320)Termination phase: Saturation
% 1.95/0.87  % (3638320)Time elapsed: 0.148 s
% 1.95/0.87  % (3638320)Peak memory usage: 14 MB
% 1.95/0.87  % (3638320)Instructions burned: 131 (million)
% 1.95/0.87  % (3638329)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=764284831:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 1.95/0.87  % (3638325)Instruction limit reached! 
% 1.95/0.87  % (3638325)------------------------------
% 1.95/0.87  % (3638325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.87  % (3638325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.87  % (3638325)CaDiCaL version: 2.1.3
% 1.95/0.87  % (3638325)Termination reason: Instruction limit
% 1.95/0.87  % (3638325)Termination phase: Saturation
% 1.95/0.87  % (3638325)Time elapsed: 0.126 s
% 1.95/0.87  % (3638325)Peak memory usage: 13 MB
% 1.95/0.87  % (3638325)Instructions burned: 182 (million)
% 1.95/0.87  % (3638318)Instruction limit reached! 
% 1.95/0.87  % (3638318)------------------------------
% 1.95/0.87  % (3638318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.87  % (3638318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.87  % (3638318)CaDiCaL version: 2.1.3
% 1.95/0.87  % (3638318)Termination reason: Instruction limit
% 1.95/0.87  % (3638318)Termination phase: Finite model building SAT solving
% 1.95/0.87  % (3638318)Time elapsed: 0.243 s
% 1.95/0.87  % (3638318)Peak memory usage: 23 MB
% 1.95/0.87  % (3638318)Instructions burned: 715 (million)
% 1.95/0.87  % (3638331)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1615846998:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 1.95/0.87  % (3638332)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3355849185:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 1.95/0.87  % TRYING [1]
% 1.95/0.87  % TRYING [2]
% 1.95/0.87  % TRYING [3]
% 1.95/0.87  % TRYING [4]
% 1.95/0.87  % (3638332) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3638297-3638332"...
% 1.95/0.87  % TRYING [7]
% 1.95/0.87  % (3638332)...printing done.
% 1.95/0.87  % (3638332)Refutation found. Thanks to Tanya!
% 1.95/0.87  % SZS status Theorem for theBenchmark
% 1.95/0.87  % SZS output start Proof for theBenchmark
% See solution above
% 1.95/0.87  % (3638332)------------------------------
% 1.95/0.87  % (3638332)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.95/0.87  % (3638332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.95/0.87  % (3638332)CaDiCaL version: 2.1.3
% 1.95/0.87  % (3638332)Termination reason: Refutation
% 1.95/0.87  % (3638332)Time elapsed: 0.033 s
% 1.95/0.87  % (3638332)Peak memory usage: 13 MB
% 1.95/0.87  % (3638332)Instructions burned: 98 (million)
% 1.95/0.87  % (3638297)Success in time 0.409 s
% 1.95/0.87  % Vampire exiting
%------------------------------------------------------------------------------