↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n003.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:40:16 PM UTC 2026

% Result   : Theorem 2.04s 1.33s
% Output   : Refutation 3.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   97 (  13 unt;  10 def)
%            Number of atoms       :  228 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  206 (  75   ~; 102   |;  13   &)
%                                         (  14 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   14 (  13 usr;  11 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  53   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).

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

fof(f4,axiom,
    ! [X0,X1,X2] :
      ( member(X0,intersection(X1,X2))
    <=> ( member(X0,X1)
        & member(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).

fof(f12,conjecture,
    ! [X0,X1,X2] : equal_set(intersection(intersection(X0,X1),X2),intersection(X0,intersection(X1,X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI08) ).

fof(f13,negated_conjecture,
    ~ ! [X0,X1,X2] : equal_set(intersection(intersection(X0,X1),X2),intersection(X0,intersection(X1,X2))),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        & subset(X1,X0) )
     => equal_set(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f2]) ).

fof(f15,plain,
    ? [X0,X1,X2] : ~ equal_set(intersection(intersection(X0,X1),X2),intersection(X0,intersection(X1,X2))),
    inference(ennf_transformation,[],[f13]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(flattening,[],[f16]) ).

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

fof(f19,plain,
    ~ equal_set(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).

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

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

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

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

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

fof(f26,plain,
    ~ equal_set(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),
    inference(cnf_transformation,[],[f19]) ).

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

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

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

fof(f30,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK3(X0,X1),X0) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sK3(X0,X1),X1) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f39,plain,
    ( ~ subset(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2)))
    | ~ subset(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)) ),
    inference(resolution,[],[f30,f26]) ).

fof(f41,definition,
    ( spl4_1
  <=> subset(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)) ),
    introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).

fof(f42,plain,
    ( ~ subset(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2))
    | spl4_1 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f44,definition,
    ( spl4_2
  <=> subset(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))) ),
    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).

fof(f45,plain,
    ( ~ subset(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2)))
    | spl4_2 ),
    inference(avatar_component_clause,[],[f44]) ).

fof(f46,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f39,f44,f41]) ).

fof(f47,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(intersection(sK0,sK1),sK2))
    | spl4_1 ),
    inference(resolution,[],[f42,f33]) ).

fof(f48,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK0,intersection(sK1,sK2)))
    | spl4_1 ),
    inference(resolution,[],[f42,f32]) ).

fof(f51,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK1,sK2))
    | spl4_1 ),
    inference(resolution,[],[f48,f27]) ).

fof(f52,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK1)
    | spl4_1 ),
    inference(resolution,[],[f51,f28]) ).

fof(f53,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK2)
    | spl4_1 ),
    inference(resolution,[],[f51,f27]) ).

fof(f59,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK0,sK1))
    | ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK2)
    | spl4_1 ),
    inference(resolution,[],[f29,f47]) ).

fof(f61,definition,
    ( spl4_3
  <=> member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK2) ),
    introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).

fof(f62,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK2)
    | spl4_3 ),
    inference(avatar_component_clause,[],[f61]) ).

fof(f64,definition,
    ( spl4_4
  <=> member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK0,sK1)) ),
    introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).

fof(f65,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK0,sK1))
    | spl4_4 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f66,plain,
    ( ~ spl4_3
    | ~ spl4_4
    | spl4_1 ),
    inference(avatar_split_clause,[],[f59,f41,f64,f61]) ).

fof(f67,plain,
    ( $false
    | spl4_1
    | spl4_3 ),
    inference(resolution,[],[f62,f53]) ).

fof(f68,plain,
    ( spl4_1
    | spl4_3 ),
    inference(avatar_contradiction_clause,[],[f67]) ).

fof(f69,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK0)
    | ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK1)
    | spl4_4 ),
    inference(resolution,[],[f65,f29]) ).

fof(f71,definition,
    ( spl4_5
  <=> member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK1) ),
    introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).

fof(f72,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK1)
    | spl4_5 ),
    inference(avatar_component_clause,[],[f71]) ).

fof(f74,definition,
    ( spl4_6
  <=> member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK0) ),
    introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).

fof(f75,plain,
    ( ~ member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK0)
    | spl4_6 ),
    inference(avatar_component_clause,[],[f74]) ).

fof(f76,plain,
    ( ~ spl4_5
    | ~ spl4_6
    | spl4_4 ),
    inference(avatar_split_clause,[],[f69,f64,f74,f71]) ).

fof(f77,plain,
    ( $false
    | spl4_1
    | spl4_5 ),
    inference(resolution,[],[f72,f52]) ).

fof(f78,plain,
    ( spl4_1
    | spl4_5 ),
    inference(avatar_contradiction_clause,[],[f77]) ).

fof(f79,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(sK0,intersection(sK1,sK2)))
    | spl4_2 ),
    inference(resolution,[],[f45,f33]) ).

fof(f80,plain,
    ( member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(intersection(sK0,sK1),sK2))
    | spl4_2 ),
    inference(resolution,[],[f45,f32]) ).

fof(f82,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK0)
    | ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(sK1,sK2))
    | spl4_2 ),
    inference(resolution,[],[f79,f29]) ).

fof(f84,definition,
    ( spl4_7
  <=> member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).

fof(f85,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(sK1,sK2))
    | spl4_7 ),
    inference(avatar_component_clause,[],[f84]) ).

fof(f87,definition,
    ( spl4_8
  <=> member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK0) ),
    introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).

fof(f88,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK0)
    | spl4_8 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f89,plain,
    ( ~ spl4_7
    | ~ spl4_8
    | spl4_2 ),
    inference(avatar_split_clause,[],[f82,f44,f87,f84]) ).

fof(f90,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK1)
    | ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK2)
    | spl4_7 ),
    inference(resolution,[],[f85,f29]) ).

fof(f92,definition,
    ( spl4_9
  <=> member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK2) ),
    introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).

fof(f93,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK2)
    | spl4_9 ),
    inference(avatar_component_clause,[],[f92]) ).

fof(f95,definition,
    ( spl4_10
  <=> member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK1) ),
    introduced(definition,[new_symbols(definition,[spl4_10])],[avatar_definition]) ).

fof(f96,plain,
    ( ~ member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK1)
    | spl4_10 ),
    inference(avatar_component_clause,[],[f95]) ).

fof(f97,plain,
    ( ~ spl4_9
    | ~ spl4_10
    | spl4_7 ),
    inference(avatar_split_clause,[],[f90,f84,f95,f92]) ).

fof(f98,plain,
    ( member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),intersection(sK0,sK1))
    | spl4_2 ),
    inference(resolution,[],[f80,f28]) ).

fof(f99,plain,
    ( member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK2)
    | spl4_2 ),
    inference(resolution,[],[f80,f27]) ).

fof(f100,plain,
    ( member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK0)
    | spl4_2 ),
    inference(resolution,[],[f98,f28]) ).

fof(f101,plain,
    ( member(sK3(intersection(intersection(sK0,sK1),sK2),intersection(sK0,intersection(sK1,sK2))),sK1)
    | spl4_2 ),
    inference(resolution,[],[f98,f27]) ).

fof(f102,plain,
    ( $false
    | spl4_2
    | spl4_9 ),
    inference(resolution,[],[f93,f99]) ).

fof(f103,plain,
    ( spl4_2
    | spl4_9 ),
    inference(avatar_contradiction_clause,[],[f102]) ).

fof(f104,plain,
    ( $false
    | spl4_2
    | spl4_10 ),
    inference(resolution,[],[f101,f96]) ).

fof(f105,plain,
    ( spl4_2
    | spl4_10 ),
    inference(avatar_contradiction_clause,[],[f104]) ).

fof(f106,plain,
    ( $false
    | spl4_2
    | spl4_8 ),
    inference(resolution,[],[f88,f100]) ).

fof(f107,plain,
    ( spl4_2
    | spl4_8 ),
    inference(avatar_contradiction_clause,[],[f106]) ).

fof(f109,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),intersection(sK0,intersection(sK1,sK2)))
    | spl4_1 ),
    inference(resolution,[],[f42,f32]) ).

fof(f114,plain,
    ( member(sK3(intersection(sK0,intersection(sK1,sK2)),intersection(intersection(sK0,sK1),sK2)),sK0)
    | spl4_1 ),
    inference(resolution,[],[f109,f28]) ).

fof(f116,plain,
    ( $false
    | spl4_1
    | spl4_6 ),
    inference(resolution,[],[f114,f75]) ).

fof(f117,plain,
    ( spl4_1
    | spl4_6 ),
    inference(avatar_contradiction_clause,[],[f116]) ).

cnf(s1,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(sat_conversion,[],[f46]) ).

cnf(s2,plain,
    ( spl4_1
    | ~ spl4_3
    | ~ spl4_4 ),
    inference(sat_conversion,[],[f66]) ).

cnf(s3,plain,
    ( spl4_1
    | spl4_3 ),
    inference(sat_conversion,[],[f68]) ).

cnf(s4,plain,
    ( spl4_4
    | ~ spl4_5
    | ~ spl4_6 ),
    inference(sat_conversion,[],[f76]) ).

cnf(s5,plain,
    ( spl4_1
    | spl4_5 ),
    inference(sat_conversion,[],[f78]) ).

cnf(s6,plain,
    ( spl4_2
    | ~ spl4_7
    | ~ spl4_8 ),
    inference(sat_conversion,[],[f89]) ).

cnf(s7,plain,
    ( spl4_7
    | ~ spl4_9
    | ~ spl4_10 ),
    inference(sat_conversion,[],[f97]) ).

cnf(s8,plain,
    ( spl4_2
    | spl4_9 ),
    inference(sat_conversion,[],[f103]) ).

cnf(s9,plain,
    ( spl4_2
    | spl4_10 ),
    inference(sat_conversion,[],[f105]) ).

cnf(s10,plain,
    ( spl4_2
    | spl4_8 ),
    inference(sat_conversion,[],[f107]) ).

cnf(s11,plain,
    ( spl4_1
    | spl4_6 ),
    inference(sat_conversion,[],[f117]) ).

cnf(s12,plain,
    spl4_1,
    inference(rat,[],[s2,s4,s3,s5,s11]) ).

cnf(s13,plain,
    ~ spl4_2,
    inference(rat,[],[s1,s12]) ).

cnf(s14,plain,
    spl4_8,
    inference(rat,[],[s10,s13]) ).

cnf(s15,plain,
    spl4_10,
    inference(rat,[],[s9,s13]) ).

cnf(s16,plain,
    spl4_9,
    inference(rat,[],[s8,s13]) ).

cnf(s17,plain,
    ~ spl4_7,
    inference(rat,[],[s6,s13,s14]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s7,s15,s16,s17]) ).

fof(f118,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET143+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  % Computer : n003.cluster.edu
% 0.11/0.41  % Model    : x86_64 x86_64
% 0.11/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41  % Memory   : 8046.5625MB
% 0.11/0.41  % OS       : Linux 6.8.0-71-generic
% 0.11/0.41  % CPULimit : 300
% 0.11/0.41  % WCLimit  : 300
% 0.11/0.41  % DateTime : Mon Sep 28 00:55:27 UTC 2026
% 0.11/0.41  % CPUTime  : 
% 0.11/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44  Running first-order theorem proving
% 0.11/0.44  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.04/1.33  % (1091142)Detected formulas, will run a generic FOF schedule.
% 2.04/1.33  % (1091148)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=1709284339:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.04/1.33  % (1091150)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4268898217:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.04/1.33  % (1091153)dis-21_1_sil=8000:lcm=predicate:random_seed=3330399570: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)
% 2.04/1.33  % (1091147)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=1445284410:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.04/1.33  % (1091151)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3370501311:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.04/1.33  % (1091152)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2144048648:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.04/1.33  % (1091149)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=1236093026:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.04/1.33  % (1091150)Refutation not found, incomplete strategy
% 2.04/1.33  % (1091150)------------------------------
% 2.04/1.33  % (1091150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.04/1.33  % (1091150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/1.33  % (1091150)CaDiCaL version: 2.1.3
% 2.04/1.33  % (1091150)Termination reason: Refutation not found, incomplete strategy
% 2.04/1.33  % (1091150)Time elapsed: 0.001 s
% 2.04/1.33  % (1091150)Peak memory usage: 87 MB
% 2.04/1.33  % (1091153)First to succeed.
% 2.04/1.33  % (1091153)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1091142"
% 2.04/1.33  % (1091152)Also succeeded, but the first one will report.
% 2.04/1.33  % (1091151)Instruction limit reached! 
% 2.04/1.33  % (1091151)------------------------------
% 2.04/1.33  % (1091151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.04/1.33  % (1091151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.04/1.33  % (1091151)CaDiCaL version: 2.1.3
% 2.04/1.33  % (1091151)Termination reason: Instruction limit
% 2.04/1.33  % (1091151)Termination phase: Saturation
% 2.04/1.33  % (1091151)Time elapsed: 0.071 s
% 2.04/1.33  % (1091151)Peak memory usage: 89 MB
% 2.04/1.33  % (1091151)Instructions burned: 120 (million)
% 2.04/1.33  % (1091161)lrs+10_1_sil=8000:sp=occurrence:random_seed=2437796240:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.04/1.33  % (1091150)------------------------------
% 2.04/1.33  % (1091150)------------------------------
% 2.04/1.33  % (1091153)Refutation found. Thanks to Tanya!
% 2.04/1.33  % SZS status Theorem for theBenchmark
% 2.04/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 3.75/1.53  % (1091153)------------------------------
% 3.75/1.53  % (1091153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.53  % (1091153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.53  % (1091153)CaDiCaL version: 2.1.3
% 3.75/1.53  % (1091153)Termination reason: Refutation
% 3.75/1.53  % (1091153)Time elapsed: 0.004 s
% 3.75/1.53  % (1091153)Peak memory usage: 89 MB
% 3.75/1.53  % (1091153)Instructions burned: 4 (million)
% 3.75/1.53  % (1091153)------------------------------
% 3.75/1.53  % (1091153)------------------------------
% 3.75/1.53  % (1091142)Success in time 0.441 s
% 3.75/1.53  % Vampire exiting
%------------------------------------------------------------------------------