↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET611+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:41:21 PM UTC 2026

% Result   : Theorem 4.26s 1.24s
% Output   : Refutation 4.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   77 (  10 unt;   2 def)
%            Number of atoms       :  205 (  36 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  215 (  87   ~;  94   |;  23   &)
%                                         (   9 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  110 (   0 sgn 104   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X0)
        & member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( member(X2,X0)
        & ~ member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).

fof(f4,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).

fof(f6,axiom,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).

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

fof(f11,conjecture,
    ! [X0,X1] :
      ( intersection(X0,X1) = empty_set
    <=> difference(X0,X1) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th84) ).

fof(f12,negated_conjecture,
    ~ ! [X0,X1] :
        ( intersection(X0,X1) = empty_set
      <=> difference(X0,X1) = X0 ),
    inference(negated_conjecture,[status(cth)],[f11]) ).

fof(f13,plain,
    ? [X0,X1] :
      ( intersection(X0,X1) = empty_set
    <~> difference(X0,X1) = X0 ),
    inference(ennf_transformation,[],[f12]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f16,plain,
    ? [X0,X1] :
      ( ( difference(X0,X1) != X0
        | intersection(X0,X1) != empty_set )
      & ( difference(X0,X1) = X0
        | intersection(X0,X1) = empty_set ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f17,plain,
    ( ( sK0 != difference(sK0,sK1)
      | empty_set != intersection(sK0,sK1) )
    & ( sK0 = difference(sK0,sK1)
      | empty_set = intersection(sK0,sK1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).

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

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

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(flattening,[],[f25]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(flattening,[],[f27]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f15]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f29]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK4(X0,X1),X1)
          & member(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f30]) ).

fof(f32,plain,
    ( sK0 = difference(sK0,sK1)
    | empty_set = intersection(sK0,sK1) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f33,plain,
    ( sK0 != difference(sK0,sK1)
    | empty_set != intersection(sK0,sK1) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f38,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f6]) ).

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

fof(f44,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X0,X1))
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f45,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,intersection(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( member(X2,intersection(X0,X1))
      | ~ member(X2,X0)
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f47,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f49,plain,
    ! [X2,X0,X1] :
      ( member(X2,difference(X0,X1))
      | ~ member(X2,X0)
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f50,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f4]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( member(sK4(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ member(sK4(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f60,definition,
    ( spl5_1
  <=> empty_set = intersection(sK0,sK1) ),
    introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).

fof(f61,plain,
    ( empty_set != intersection(sK0,sK1)
    | spl5_1 ),
    inference(avatar_component_clause,[],[f60]) ).

fof(f62,plain,
    ( empty_set = intersection(sK0,sK1)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f60]) ).

fof(f64,definition,
    ( spl5_2
  <=> sK0 = difference(sK0,sK1) ),
    introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).

fof(f65,plain,
    ( sK0 != difference(sK0,sK1)
    | spl5_2 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f66,plain,
    ( sK0 = difference(sK0,sK1)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f67,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f32,f64,f60]) ).

fof(f68,plain,
    ( ~ spl5_1
    | ~ spl5_2 ),
    inference(avatar_split_clause,[],[f33,f64,f60]) ).

fof(f73,plain,
    ( ! [X0] :
        ( ~ member(X0,sK1)
        | ~ member(X0,sK0) )
    | ~ spl5_2 ),
    inference(superposition,[],[f47,f66]) ).

fof(f75,plain,
    ! [X2,X0,X1] :
      ( member(sK4(intersection(X0,X1),X2),X0)
      | subset(intersection(X0,X1),X2) ),
    inference(resolution,[],[f52,f45]) ).

fof(f76,plain,
    ! [X2,X0,X1] :
      ( member(sK4(intersection(X0,X1),X2),X1)
      | subset(intersection(X0,X1),X2) ),
    inference(resolution,[],[f52,f44]) ).

fof(f77,plain,
    ! [X2,X0,X1] :
      ( member(sK4(difference(X0,X1),X2),X0)
      | subset(difference(X0,X1),X2) ),
    inference(resolution,[],[f52,f48]) ).

fof(f79,plain,
    ! [X0] : subset(empty_set,X0),
    inference(resolution,[],[f52,f50]) ).

fof(f84,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(resolution,[],[f79,f41]) ).

fof(f96,plain,
    ! [X2,X0,X1] :
      ( ~ member(sK4(X0,difference(X1,X2)),X1)
      | member(sK4(X0,difference(X1,X2)),X2)
      | subset(X0,difference(X1,X2)) ),
    inference(resolution,[],[f49,f53]) ).

fof(f194,plain,
    ( ! [X0,X1] :
        ( ~ member(sK4(intersection(sK1,X0),X1),sK0)
        | subset(intersection(sK1,X0),X1) )
    | ~ spl5_2 ),
    inference(resolution,[],[f75,f73]) ).

fof(f201,plain,
    ( ! [X0] :
        ( subset(intersection(sK1,sK0),X0)
        | subset(intersection(sK1,sK0),X0) )
    | ~ spl5_2 ),
    inference(resolution,[],[f76,f194]) ).

fof(f210,plain,
    ( ! [X0] : subset(intersection(sK1,sK0),X0)
    | ~ spl5_2 ),
    inference(duplicate_literal_removal,[],[f201]) ).

fof(f212,plain,
    ( ! [X0] : subset(intersection(sK0,sK1),X0)
    | ~ spl5_2 ),
    inference(forward_demodulation,[],[f210,f38]) ).

fof(f215,plain,
    ( empty_set = intersection(sK0,sK1)
    | ~ spl5_2 ),
    inference(resolution,[],[f212,f84]) ).

fof(f216,plain,
    ( $false
    | spl5_1
    | ~ spl5_2 ),
    inference(forward_subsumption_resolution,[],[f215,f61]) ).

fof(f217,plain,
    ( spl5_1
    | ~ spl5_2 ),
    inference(avatar_contradiction_clause,[],[f216]) ).

fof(f220,plain,
    ( ! [X0] :
        ( member(X0,empty_set)
        | ~ member(X0,sK0)
        | ~ member(X0,sK1) )
    | ~ spl5_1 ),
    inference(superposition,[],[f46,f62]) ).

fof(f223,plain,
    ( ! [X0] :
        ( ~ member(X0,sK1)
        | ~ member(X0,sK0) )
    | ~ spl5_1 ),
    inference(forward_subsumption_resolution,[],[f220,f50]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( subset(difference(X0,X1),X0)
      | subset(difference(X0,X1),X0) ),
    inference(resolution,[],[f77,f53]) ).

fof(f242,plain,
    ! [X0,X1] : subset(difference(X0,X1),X0),
    inference(duplicate_literal_removal,[],[f235]) ).

fof(f272,plain,
    ! [X0,X1] :
      ( member(sK4(X0,difference(X0,X1)),X1)
      | subset(X0,difference(X0,X1))
      | subset(X0,difference(X0,X1)) ),
    inference(resolution,[],[f96,f52]) ).

fof(f281,plain,
    ! [X0,X1] :
      ( member(sK4(X0,difference(X0,X1)),X1)
      | subset(X0,difference(X0,X1)) ),
    inference(duplicate_literal_removal,[],[f272]) ).

fof(f1139,plain,
    ( ! [X0] :
        ( ~ member(sK4(X0,difference(X0,sK1)),sK0)
        | subset(X0,difference(X0,sK1)) )
    | ~ spl5_1 ),
    inference(resolution,[],[f281,f223]) ).

fof(f1900,plain,
    ( subset(sK0,difference(sK0,sK1))
    | subset(sK0,difference(sK0,sK1))
    | ~ spl5_1 ),
    inference(resolution,[],[f1139,f52]) ).

fof(f1909,plain,
    ( subset(sK0,difference(sK0,sK1))
    | ~ spl5_1 ),
    inference(duplicate_literal_removal,[],[f1900]) ).

fof(f1927,plain,
    ( ~ subset(difference(sK0,sK1),sK0)
    | sK0 = difference(sK0,sK1)
    | ~ spl5_1 ),
    inference(resolution,[],[f1909,f41]) ).

fof(f1928,plain,
    ( sK0 = difference(sK0,sK1)
    | ~ spl5_1 ),
    inference(forward_subsumption_resolution,[],[f1927,f242]) ).

fof(f1929,plain,
    ( $false
    | ~ spl5_1
    | spl5_2 ),
    inference(forward_subsumption_resolution,[],[f1928,f65]) ).

fof(f1930,plain,
    ( ~ spl5_1
    | spl5_2 ),
    inference(avatar_contradiction_clause,[],[f1929]) ).

cnf(s1,plain,
    ( spl5_1
    | spl5_2 ),
    inference(sat_conversion,[],[f67]) ).

cnf(s2,plain,
    ( ~ spl5_1
    | ~ spl5_2 ),
    inference(sat_conversion,[],[f68]) ).

cnf(s7,plain,
    ( spl5_1
    | ~ spl5_2 ),
    inference(sat_conversion,[],[f217]) ).

cnf(s8,plain,
    ( ~ spl5_1
    | spl5_2 ),
    inference(sat_conversion,[],[f1930]) ).

cnf(s9,plain,
    spl5_1,
    inference(rat,[],[s1,s7]) ).

cnf(s10,plain,
    spl5_2,
    inference(rat,[],[s8,s9]) ).

cnf(s11,plain,
    $false,
    inference(rat,[],[s2,s10,s9]) ).

fof(f1931,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET611+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n016.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 28 02:23:48 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40  Running first-order theorem proving
% 0.15/0.40  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.26/1.24  % (3194435)Detected formulas, will run a generic FOF schedule.
% 4.26/1.24  % (3194445)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4063483737:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.26/1.24  % (3194444)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2680015088:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.26/1.24  % (3194441)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1782989558:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.26/1.24  % (3194446)dis-21_1_sil=8000:lcm=predicate:random_seed=2879501884:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.26/1.24  % (3194443)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=498705831:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.26/1.24  % (3194440)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1861419467:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.26/1.24  % (3194442)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=46961203:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.26/1.24  % (3194443)Instruction limit reached! 
% 4.26/1.24  % (3194443)------------------------------
% 4.26/1.24  % (3194443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194443)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194443)Termination reason: Instruction limit
% 4.26/1.24  % (3194443)Termination phase: Saturation
% 4.26/1.24  % (3194443)Time elapsed: 0.065 s
% 4.26/1.24  % (3194443)Peak memory usage: 89 MB
% 4.26/1.24  % (3194443)Instructions burned: 110 (million)
% 4.26/1.24  % (3194444)Instruction limit reached! 
% 4.26/1.24  % (3194444)------------------------------
% 4.26/1.24  % (3194444)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194444)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194444)Termination reason: Instruction limit
% 4.26/1.24  % (3194444)Termination phase: Saturation
% 4.26/1.24  % (3194444)Time elapsed: 0.072 s
% 4.26/1.24  % (3194444)Peak memory usage: 89 MB
% 4.26/1.24  % (3194444)Instructions burned: 119 (million)
% 4.26/1.24  % (3194446)Instruction limit reached! 
% 4.26/1.24  % (3194446)------------------------------
% 4.26/1.24  % (3194446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194446)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194446)Termination reason: Instruction limit
% 4.26/1.24  % (3194446)Termination phase: Saturation
% 4.26/1.24  % (3194446)Time elapsed: 0.079 s
% 4.26/1.24  % (3194446)Peak memory usage: 89 MB
% 4.26/1.24  % (3194446)Instructions burned: 130 (million)
% 4.26/1.24  % (3194445)Instruction limit reached! 
% 4.26/1.24  % (3194445)------------------------------
% 4.26/1.24  % (3194445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194445)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194445)Termination reason: Instruction limit
% 4.26/1.24  % (3194445)Termination phase: Saturation
% 4.26/1.24  % (3194445)Time elapsed: 0.090 s
% 4.26/1.24  % (3194445)Peak memory usage: 89 MB
% 4.26/1.24  % (3194445)Instructions burned: 140 (million)
% 4.26/1.24  % (3194454)lrs+10_1_sil=8000:sp=occurrence:random_seed=879987100:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.26/1.24  % (3194455)lrs+10_1_sil=32000:urr=on:br=off:random_seed=652912707:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.26/1.24  % (3194456)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1197457850:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.26/1.24  % (3194457)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1530988427:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.26/1.24  % (3194455)Refutation not found, incomplete strategy
% 4.26/1.24  % (3194455)------------------------------
% 4.26/1.24  % (3194455)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194455)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194455)Termination reason: Refutation not found, incomplete strategy
% 4.26/1.24  % (3194455)Time elapsed: 0.041 s
% 4.26/1.24  % (3194455)Peak memory usage: 89 MB
% 4.26/1.24  % (3194455)Instructions burned: 88 (million)
% 4.26/1.24  % (3194454)First to succeed.
% 4.26/1.24  % (3194454)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3194435"
% 4.26/1.24  % (3194457)Instruction limit reached! 
% 4.26/1.24  % (3194457)------------------------------
% 4.26/1.24  % (3194457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194457)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194457)Termination reason: Instruction limit
% 4.26/1.24  % (3194457)Termination phase: Saturation
% 4.26/1.24  % (3194457)Time elapsed: 0.100 s
% 4.26/1.24  % (3194457)Peak memory usage: 90 MB
% 4.26/1.24  % (3194457)Instructions burned: 252 (million)
% 4.26/1.24  % (3194462)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1030406320:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.26/1.24  % (3194456)Instruction limit reached! 
% 4.26/1.24  % (3194456)------------------------------
% 4.26/1.24  % (3194456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194456)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194456)Termination reason: Instruction limit
% 4.26/1.24  % (3194456)Termination phase: Saturation
% 4.26/1.24  % (3194456)Time elapsed: 0.199 s
% 4.26/1.24  % (3194456)Peak memory usage: 90 MB
% 4.26/1.24  % (3194456)Instructions burned: 325 (million)
% 4.26/1.24  % (3194455)------------------------------
% 4.26/1.24  % (3194455)------------------------------
% 4.26/1.24  % (3194462)Instruction limit reached! 
% 4.26/1.24  % (3194462)------------------------------
% 4.26/1.24  % (3194462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.26/1.24  % (3194462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.26/1.24  % (3194462)CaDiCaL version: 2.1.3
% 4.26/1.24  % (3194462)Termination reason: Instruction limit
% 4.26/1.24  % (3194462)Termination phase: Saturation
% 4.26/1.24  % (3194462)Time elapsed: 0.091 s
% 4.26/1.24  % (3194462)Peak memory usage: 92 MB
% 4.26/1.24  % (3194462)Instructions burned: 294 (million)
% 4.26/1.24  % (3194454)Refutation found. Thanks to Tanya!
% 4.26/1.24  % SZS status Theorem for theBenchmark
% 4.26/1.24  % SZS output start Proof for theBenchmark
% See solution above
% 4.91/1.43  % (3194454)------------------------------
% 4.91/1.43  % (3194454)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.91/1.43  % (3194454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.91/1.43  % (3194454)CaDiCaL version: 2.1.3
% 4.91/1.43  % (3194454)Termination reason: Refutation
% 4.91/1.43  % (3194454)Time elapsed: 0.050 s
% 4.91/1.43  % (3194454)Peak memory usage: 90 MB
% 4.91/1.43  % (3194454)Instructions burned: 77 (million)
% 4.91/1.43  % (3194454)------------------------------
% 4.91/1.43  % (3194454)------------------------------
% 4.91/1.43  % (3194435)Success in time 0.637 s
% 4.91/1.43  % Vampire exiting
%------------------------------------------------------------------------------