↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n001.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:48:26 PM UTC 2026

% Result   : Theorem 1.02s 1.74s
% Output   : Refutation 5.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   84 (  15 unt;   4 def)
%            Number of atoms       :  242 (  37 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  268 ( 110   ~; 118   |;  19   &)
%                                         (   9 <=>;  11  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   5 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   80 (   0 sgn  71   !;   9   ?)

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

fof(f10,axiom,
    ! [X0] :
      ( ( ~ empty_carrier(X0)
        & join_semilatt_str(X0) )
     => ! [X1] :
          ( element(X1,the_carrier(X0))
         => ! [X2] :
              ( element(X2,the_carrier(X0))
             => ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).

fof(f15,axiom,
    ! [X0] :
      ( strict_latt_str(boole_lattice(X0))
      & latt_str(boole_lattice(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).

fof(f30,axiom,
    ! [X0] :
      ( latt_str(X0)
     => ( meet_semilatt_str(X0)
        & join_semilatt_str(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).

fof(f44,axiom,
    ! [X0] :
      ( ~ empty_carrier(boole_lattice(X0))
      & strict_latt_str(boole_lattice(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_lattice3) ).

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

fof(f70,axiom,
    ! [X0,X1] :
      ( element(X1,the_carrier(boole_lattice(X0)))
     => ! [X2] :
          ( element(X2,the_carrier(boole_lattice(X0)))
         => ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
            & meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).

fof(f73,conjecture,
    ! [X0,X1] :
      ( element(X1,the_carrier(boole_lattice(X0)))
     => ! [X2] :
          ( element(X2,the_carrier(boole_lattice(X0)))
         => ( below(boole_lattice(X0),X1,X2)
          <=> subset(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

fof(f74,negated_conjecture,
    ~ ! [X0,X1] :
        ( element(X1,the_carrier(boole_lattice(X0)))
       => ! [X2] :
            ( element(X2,the_carrier(boole_lattice(X0)))
           => ( below(boole_lattice(X0),X1,X2)
            <=> subset(X1,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f73]) ).

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

fof(f96,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 )
              | ~ element(X2,the_carrier(X0)) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f97,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 )
              | ~ element(X2,the_carrier(X0)) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(flattening,[],[f96]) ).

fof(f108,plain,
    ! [X0] :
      ( ( meet_semilatt_str(X0)
        & join_semilatt_str(X0) )
      | ~ latt_str(X0) ),
    inference(ennf_transformation,[],[f30]) ).

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

fof(f128,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
            & meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) )
          | ~ element(X2,the_carrier(boole_lattice(X0))) )
      | ~ element(X1,the_carrier(boole_lattice(X0))) ),
    inference(ennf_transformation,[],[f70]) ).

fof(f130,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( below(boole_lattice(X0),X1,X2)
          <~> subset(X1,X2) )
          & element(X2,the_carrier(boole_lattice(X0))) )
      & element(X1,the_carrier(boole_lattice(X0))) ),
    inference(ennf_transformation,[],[f74]) ).

fof(f139,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( below(X0,X1,X2)
                  | join(X0,X1,X2) != X2 )
                & ( join(X0,X1,X2) = X2
                  | ~ below(X0,X1,X2) ) )
              | ~ element(X2,the_carrier(X0)) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(nnf_transformation,[],[f97]) ).

fof(f156,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X1,X2)
            | ~ below(boole_lattice(X0),X1,X2) )
          & ( subset(X1,X2)
            | below(boole_lattice(X0),X1,X2) )
          & element(X2,the_carrier(boole_lattice(X0))) )
      & element(X1,the_carrier(boole_lattice(X0))) ),
    inference(nnf_transformation,[],[f130]) ).

fof(f157,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X1,X2)
            | ~ below(boole_lattice(X0),X1,X2) )
          & ( subset(X1,X2)
            | below(boole_lattice(X0),X1,X2) )
          & element(X2,the_carrier(boole_lattice(X0))) )
      & element(X1,the_carrier(boole_lattice(X0))) ),
    inference(flattening,[],[f156]) ).

fof(f158,plain,
    ( ( ~ subset(sK16,sK17)
      | ~ below(boole_lattice(sK15),sK16,sK17) )
    & ( subset(sK16,sK17)
      | below(boole_lattice(sK15),sK16,sK17) )
    & element(sK17,the_carrier(boole_lattice(sK15)))
    & element(sK16,the_carrier(boole_lattice(sK15))) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X0,sK15),skolemize(X1,sK16),skolemize(X2,sK17)],[f157]) ).

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

fof(f169,plain,
    ! [X2,X0,X1] :
      ( ~ below(X0,X1,X2)
      | join(X0,X1,X2) = X2
      | ~ element(X2,the_carrier(X0))
      | ~ element(X1,the_carrier(X0))
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f170,plain,
    ! [X2,X0,X1] :
      ( join(X0,X1,X2) != X2
      | below(X0,X1,X2)
      | ~ element(X2,the_carrier(X0))
      | ~ element(X1,the_carrier(X0))
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f174,plain,
    ! [X0] : latt_str(boole_lattice(X0)),
    inference(cnf_transformation,[],[f15]) ).

fof(f181,plain,
    ! [X0] :
      ( join_semilatt_str(X0)
      | ~ latt_str(X0) ),
    inference(cnf_transformation,[],[f108]) ).

fof(f198,plain,
    ! [X0] : ~ empty_carrier(boole_lattice(X0)),
    inference(cnf_transformation,[],[f44]) ).

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

fof(f236,plain,
    ! [X2,X0,X1] :
      ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
      | ~ element(X2,the_carrier(boole_lattice(X0)))
      | ~ element(X1,the_carrier(boole_lattice(X0))) ),
    inference(cnf_transformation,[],[f128]) ).

fof(f239,plain,
    element(sK16,the_carrier(boole_lattice(sK15))),
    inference(cnf_transformation,[],[f158]) ).

fof(f240,plain,
    element(sK17,the_carrier(boole_lattice(sK15))),
    inference(cnf_transformation,[],[f158]) ).

fof(f241,plain,
    ( subset(sK16,sK17)
    | below(boole_lattice(sK15),sK16,sK17) ),
    inference(cnf_transformation,[],[f158]) ).

fof(f242,plain,
    ( ~ subset(sK16,sK17)
    | ~ below(boole_lattice(sK15),sK16,sK17) ),
    inference(cnf_transformation,[],[f158]) ).

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

fof(f253,definition,
    ( spl18_1
  <=> below(boole_lattice(sK15),sK16,sK17) ),
    introduced(definition,[new_symbols(definition,[spl18_1])],[avatar_definition]) ).

fof(f254,plain,
    ( ~ below(boole_lattice(sK15),sK16,sK17)
    | spl18_1 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f255,plain,
    ( below(boole_lattice(sK15),sK16,sK17)
    | ~ spl18_1 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f257,definition,
    ( spl18_2
  <=> subset(sK16,sK17) ),
    introduced(definition,[new_symbols(definition,[spl18_2])],[avatar_definition]) ).

fof(f258,plain,
    ( ~ subset(sK16,sK17)
    | spl18_2 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( subset(sK16,sK17)
    | ~ spl18_2 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f260,plain,
    ( spl18_1
    | spl18_2 ),
    inference(avatar_split_clause,[],[f241,f257,f253]) ).

fof(f261,plain,
    ( ~ spl18_1
    | ~ spl18_2 ),
    inference(avatar_split_clause,[],[f242,f257,f253]) ).

fof(f296,plain,
    ! [X2,X0,X1] :
      ( set_union2(X0,X1) != X1
      | below(boole_lattice(X2),X0,X1)
      | ~ element(X1,the_carrier(boole_lattice(X2)))
      | ~ element(X0,the_carrier(boole_lattice(X2)))
      | empty_carrier(boole_lattice(X2))
      | ~ join_semilatt_str(boole_lattice(X2))
      | ~ element(X1,the_carrier(boole_lattice(X2)))
      | ~ element(X0,the_carrier(boole_lattice(X2))) ),
    inference(superposition,[],[f170,f236]) ).

fof(f297,plain,
    ! [X2,X0,X1] :
      ( set_union2(X0,X1) != X1
      | below(boole_lattice(X2),X0,X1)
      | ~ element(X1,the_carrier(boole_lattice(X2)))
      | ~ element(X0,the_carrier(boole_lattice(X2)))
      | empty_carrier(boole_lattice(X2))
      | ~ join_semilatt_str(boole_lattice(X2)) ),
    inference(duplicate_literal_removal,[],[f296]) ).

fof(f298,plain,
    ! [X2,X0,X1] :
      ( ~ join_semilatt_str(boole_lattice(X2))
      | below(boole_lattice(X2),X0,X1)
      | ~ element(X1,the_carrier(boole_lattice(X2)))
      | ~ element(X0,the_carrier(boole_lattice(X2)))
      | set_union2(X0,X1) != X1 ),
    inference(forward_subsumption_resolution,[],[f297,f198]) ).

fof(f311,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | set_union2(X0,X1) = X0 ),
    inference(superposition,[],[f164,f233]) ).

fof(f369,plain,
    ! [X2,X0,X1] :
      ( below(boole_lattice(X0),X1,X2)
      | ~ element(X2,the_carrier(boole_lattice(X0)))
      | ~ element(X1,the_carrier(boole_lattice(X0)))
      | set_union2(X1,X2) != X2
      | ~ latt_str(boole_lattice(X0)) ),
    inference(resolution,[],[f298,f181]) ).

fof(f370,plain,
    ! [X2,X0,X1] :
      ( below(boole_lattice(X0),X1,X2)
      | ~ element(X2,the_carrier(boole_lattice(X0)))
      | ~ element(X1,the_carrier(boole_lattice(X0)))
      | set_union2(X1,X2) != X2 ),
    inference(forward_subsumption_resolution,[],[f369,f174]) ).

fof(f409,plain,
    ( sK17 = set_union2(sK17,sK16)
    | ~ spl18_2 ),
    inference(resolution,[],[f311,f259]) ).

fof(f417,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ spl18_2 ),
    inference(forward_demodulation,[],[f409,f164]) ).

fof(f494,plain,
    ( ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | sK17 != set_union2(sK16,sK17)
    | spl18_1 ),
    inference(resolution,[],[f370,f254]) ).

fof(f498,plain,
    ( ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | sK17 != set_union2(sK16,sK17)
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f494,f240]) ).

fof(f499,plain,
    ( sK17 != set_union2(sK16,sK17)
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f498,f239]) ).

fof(f500,plain,
    ( $false
    | spl18_1
    | ~ spl18_2 ),
    inference(forward_subsumption_resolution,[],[f499,f417]) ).

fof(f501,plain,
    ( spl18_1
    | ~ spl18_2 ),
    inference(avatar_contradiction_clause,[],[f500]) ).

fof(f503,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | empty_carrier(boole_lattice(sK15))
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(resolution,[],[f255,f169]) ).

fof(f504,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | empty_carrier(boole_lattice(sK15))
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f503,f240]) ).

fof(f505,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | empty_carrier(boole_lattice(sK15))
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f504,f239]) ).

fof(f506,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f505,f198]) ).

fof(f508,definition,
    ( spl18_5
  <=> join_semilatt_str(boole_lattice(sK15)) ),
    introduced(definition,[new_symbols(definition,[spl18_5])],[avatar_definition]) ).

fof(f510,plain,
    ( ~ join_semilatt_str(boole_lattice(sK15))
    | spl18_5 ),
    inference(avatar_component_clause,[],[f508]) ).

fof(f512,definition,
    ( spl18_6
  <=> sK17 = join(boole_lattice(sK15),sK16,sK17) ),
    introduced(definition,[new_symbols(definition,[spl18_6])],[avatar_definition]) ).

fof(f514,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ spl18_6 ),
    inference(avatar_component_clause,[],[f512]) ).

fof(f515,plain,
    ( ~ spl18_5
    | spl18_6
    | ~ spl18_1 ),
    inference(avatar_split_clause,[],[f506,f253,f512,f508]) ).

fof(f516,plain,
    ( ~ latt_str(boole_lattice(sK15))
    | spl18_5 ),
    inference(resolution,[],[f510,f181]) ).

fof(f517,plain,
    ( $false
    | spl18_5 ),
    inference(forward_subsumption_resolution,[],[f516,f174]) ).

fof(f518,plain,
    spl18_5,
    inference(avatar_contradiction_clause,[],[f517]) ).

fof(f525,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ spl18_6 ),
    inference(superposition,[],[f236,f514]) ).

fof(f529,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ spl18_6 ),
    inference(forward_subsumption_resolution,[],[f525,f240]) ).

fof(f531,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ spl18_6 ),
    inference(forward_subsumption_resolution,[],[f529,f239]) ).

fof(f536,plain,
    ( subset(sK16,sK17)
    | ~ spl18_6 ),
    inference(superposition,[],[f250,f531]) ).

fof(f539,plain,
    ( $false
    | spl18_2
    | ~ spl18_6 ),
    inference(forward_subsumption_resolution,[],[f536,f258]) ).

fof(f540,plain,
    ( spl18_2
    | ~ spl18_6 ),
    inference(avatar_contradiction_clause,[],[f539]) ).

cnf(s1,plain,
    ( spl18_1
    | spl18_2 ),
    inference(sat_conversion,[],[f260]) ).

cnf(s2,plain,
    ( ~ spl18_1
    | ~ spl18_2 ),
    inference(sat_conversion,[],[f261]) ).

cnf(s4,plain,
    ( spl18_1
    | ~ spl18_2 ),
    inference(sat_conversion,[],[f501]) ).

cnf(s5,plain,
    ( ~ spl18_1
    | ~ spl18_5
    | spl18_6 ),
    inference(sat_conversion,[],[f515]) ).

cnf(s6,plain,
    spl18_5,
    inference(sat_conversion,[],[f518]) ).

cnf(s7,plain,
    ( spl18_2
    | ~ spl18_6 ),
    inference(sat_conversion,[],[f540]) ).

cnf(s8,plain,
    ( ~ spl18_1
    | spl18_6 ),
    inference(rat,[],[s5,s6]) ).

cnf(s9,plain,
    spl18_1,
    inference(rat,[],[s1,s4]) ).

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

cnf(s11,plain,
    ~ spl18_2,
    inference(rat,[],[s2,s9]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s7,s10,s11]) ).

fof(f541,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU344+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44  % Computer : n001.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Mon Sep 28 04:54:47 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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
% 1.02/1.74  % (29983)Detected formulas, will run a generic FOF schedule.
% 1.02/1.74  % (29994)dis-21_1_sil=8000:lcm=predicate:random_seed=3001747553: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)
% 1.02/1.74  % (29988)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=2861324172:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.02/1.74  % (29994)Instruction limit reached! 
% 1.02/1.74  % (29994)------------------------------
% 1.02/1.74  % (29994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.02/1.74  % (29994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/1.74  % (29994)CaDiCaL version: 2.1.3
% 1.02/1.74  % (29994)Termination reason: Instruction limit
% 1.02/1.74  % (29994)Termination phase: Saturation
% 1.02/1.74  % (29994)Time elapsed: 0.069 s
% 1.02/1.74  % (29994)Peak memory usage: 91 MB
% 1.02/1.74  % (29994)Instructions burned: 130 (million)
% 1.02/1.74  % (29989)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=2854539315:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.02/1.74  % (29991)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2560796401:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.02/1.74  % (29990)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=3363135980:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.02/1.74  % (29992)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2733986389:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.02/1.74  % (29993)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2121268000:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.02/1.74  % (29991)Refutation not found, incomplete strategy
% 1.02/1.74  % (29991)------------------------------
% 1.02/1.74  % (29991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.02/1.74  % (29991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/1.74  % (29991)CaDiCaL version: 2.1.3
% 1.02/1.74  % (29991)Termination reason: Refutation not found, incomplete strategy
% 1.02/1.74  % (29991)Time elapsed: 0.002 s
% 1.02/1.74  % (29991)Peak memory usage: 88 MB
% 1.02/1.74  % (29992)Refutation not found, incomplete strategy
% 1.02/1.74  % (29992)------------------------------
% 1.02/1.74  % (29992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.02/1.74  % (29992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/1.74  % (29992)CaDiCaL version: 2.1.3
% 1.02/1.74  % (29992)Termination reason: Refutation not found, incomplete strategy
% 1.02/1.74  % (29992)Time elapsed: 0.006 s
% 1.02/1.74  % (29992)Peak memory usage: 88 MB
% 1.02/1.74  % (29992)Instructions burned: 3 (million)
% 1.02/1.74  % (29993)First to succeed.
% 1.02/1.74  % (29993)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29983"
% 1.02/1.74  % (29997)lrs+10_1_sil=8000:sp=occurrence:random_seed=1133109378:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.02/1.74  % (29997)Also succeeded, but the first one will report.
% 1.02/1.74  % (29991)------------------------------
% 1.02/1.74  % (29991)------------------------------
% 1.02/1.74  % (29992)------------------------------
% 1.02/1.74  % (29992)------------------------------
% 1.02/1.74  % (29993)Refutation found. Thanks to Tanya!
% 1.02/1.74  % SZS status Theorem for theBenchmark
% 1.02/1.74  % SZS output start Proof for theBenchmark
% See solution above
% 5.77/1.94  % (29993)------------------------------
% 5.77/1.94  % (29993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.77/1.94  % (29993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.77/1.94  % (29993)CaDiCaL version: 2.1.3
% 5.77/1.94  % (29993)Termination reason: Refutation
% 5.77/1.94  % (29993)Time elapsed: 0.025 s
% 5.77/1.94  % (29993)Peak memory usage: 90 MB
% 5.77/1.94  % (29993)Instructions burned: 20 (million)
% 5.77/1.94  % (29993)------------------------------
% 5.77/1.94  % (29993)------------------------------
% 5.77/1.94  % (29983)Success in time 0.702 s
% 5.77/1.94  % Vampire exiting
%------------------------------------------------------------------------------