↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n010.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:47:47 PM UTC 2026

% Result   : Theorem 2.57s 1.28s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   81 (  15 unt;   4 def)
%            Number of atoms       :  315 (  33 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  388 ( 154   ~; 161   |;  44   &)
%                                         (  13 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   75 (   0 sgn  69   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( ( relation(X0)
        & function(X0) )
     => ! [X1,X2] :
          ( ( in(X1,relation_dom(X0))
           => ( X2 = apply(X0,X1)
            <=> in(ordered_pair(X1,X2),X0) ) )
          & ( ~ in(X1,relation_dom(X0))
           => ( X2 = apply(X0,X1)
            <=> X2 = empty_set ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ( relation(X0)
        & relation(X1) )
     => relation(relation_composition(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_relat_1) ).

fof(f11,axiom,
    ! [X0,X1] :
      ( ( relation(X0)
        & function(X0)
        & relation(X1)
        & function(X1) )
     => ( relation(relation_composition(X0,X1))
        & function(relation_composition(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_funct_1) ).

fof(f31,axiom,
    ! [X0,X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( ( relation(X2)
            & function(X2) )
         => ( in(X0,relation_dom(relation_composition(X2,X1)))
          <=> ( in(X0,relation_dom(X2))
              & in(apply(X2,X0),relation_dom(X1)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_funct_1) ).

fof(f32,axiom,
    ! [X0,X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( ( relation(X2)
            & function(X2) )
         => ( in(X0,relation_dom(relation_composition(X2,X1)))
           => apply(relation_composition(X2,X1),X0) = apply(X1,apply(X2,X0)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_funct_1) ).

fof(f33,conjecture,
    ! [X0,X1] :
      ( ( relation(X1)
        & function(X1) )
     => ! [X2] :
          ( ( relation(X2)
            & function(X2) )
         => ( in(X0,relation_dom(X1))
           => apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).

fof(f34,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( relation(X1)
          & function(X1) )
       => ! [X2] :
            ( ( relation(X2)
              & function(X2) )
           => ( in(X0,relation_dom(X1))
             => apply(relation_composition(X1,X2),X0) = apply(X2,apply(X1,X0)) ) ) ),
    inference(negated_conjecture,[status(cth)],[f33]) ).

fof(f49,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( ( ( X2 = apply(X0,X1)
            <=> in(ordered_pair(X1,X2),X0) )
            | ~ in(X1,relation_dom(X0)) )
          & ( ( X2 = apply(X0,X1)
            <=> X2 = empty_set )
            | in(X1,relation_dom(X0)) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f50,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( ( ( X2 = apply(X0,X1)
            <=> in(ordered_pair(X1,X2),X0) )
            | ~ in(X1,relation_dom(X0)) )
          & ( ( X2 = apply(X0,X1)
            <=> X2 = empty_set )
            | in(X1,relation_dom(X0)) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(flattening,[],[f49]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( relation(relation_composition(X0,X1))
      | ~ relation(X0)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( relation(relation_composition(X0,X1))
      | ~ relation(X0)
      | ~ relation(X1) ),
    inference(flattening,[],[f51]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ( relation(relation_composition(X0,X1))
        & function(relation_composition(X0,X1)) )
      | ~ relation(X0)
      | ~ function(X0)
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ( relation(relation_composition(X0,X1))
        & function(relation_composition(X0,X1)) )
      | ~ relation(X0)
      | ~ function(X0)
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(flattening,[],[f55]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( in(X0,relation_dom(relation_composition(X2,X1)))
          <=> ( in(X0,relation_dom(X2))
              & in(apply(X2,X0),relation_dom(X1)) ) )
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( in(X0,relation_dom(relation_composition(X2,X1)))
          <=> ( in(X0,relation_dom(X2))
              & in(apply(X2,X0),relation_dom(X1)) ) )
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(flattening,[],[f64]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( apply(relation_composition(X2,X1),X0) = apply(X1,apply(X2,X0))
          | ~ in(X0,relation_dom(relation_composition(X2,X1)))
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( apply(relation_composition(X2,X1),X0) = apply(X1,apply(X2,X0))
          | ~ in(X0,relation_dom(relation_composition(X2,X1)))
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(flattening,[],[f66]) ).

fof(f68,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( apply(relation_composition(X1,X2),X0) != apply(X2,apply(X1,X0))
          & in(X0,relation_dom(X1))
          & relation(X2)
          & function(X2) )
      & relation(X1)
      & function(X1) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f69,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( apply(relation_composition(X1,X2),X0) != apply(X2,apply(X1,X0))
          & in(X0,relation_dom(X1))
          & relation(X2)
          & function(X2) )
      & relation(X1)
      & function(X1) ),
    inference(flattening,[],[f68]) ).

fof(f79,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( ( ( ( X2 = apply(X0,X1)
                | ~ in(ordered_pair(X1,X2),X0) )
              & ( in(ordered_pair(X1,X2),X0)
                | apply(X0,X1) != X2 ) )
            | ~ in(X1,relation_dom(X0)) )
          & ( ( ( X2 = apply(X0,X1)
                | empty_set != X2 )
              & ( X2 = empty_set
                | apply(X0,X1) != X2 ) )
            | in(X1,relation_dom(X0)) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(nnf_transformation,[],[f50]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( in(X0,relation_dom(relation_composition(X2,X1)))
              | ~ in(X0,relation_dom(X2))
              | ~ in(apply(X2,X0),relation_dom(X1)) )
            & ( ( in(X0,relation_dom(X2))
                & in(apply(X2,X0),relation_dom(X1)) )
              | ~ in(X0,relation_dom(relation_composition(X2,X1))) ) )
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f90,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( in(X0,relation_dom(relation_composition(X2,X1)))
              | ~ in(X0,relation_dom(X2))
              | ~ in(apply(X2,X0),relation_dom(X1)) )
            & ( ( in(X0,relation_dom(X2))
                & in(apply(X2,X0),relation_dom(X1)) )
              | ~ in(X0,relation_dom(relation_composition(X2,X1))) ) )
          | ~ relation(X2)
          | ~ function(X2) )
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(flattening,[],[f89]) ).

fof(f91,plain,
    ( apply(relation_composition(sK10,sK11),sK9) != apply(sK11,apply(sK10,sK9))
    & in(sK9,relation_dom(sK10))
    & relation(sK11)
    & function(sK11)
    & relation(sK10)
    & function(sK10) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X0,sK9),skolemize(X1,sK10),skolemize(X2,sK11)],[f69]) ).

fof(f97,plain,
    ! [X2,X0,X1] :
      ( apply(X0,X1) = X2
      | empty_set != X2
      | in(X1,relation_dom(X0))
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( relation(relation_composition(X0,X1))
      | ~ relation(X0)
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( function(relation_composition(X0,X1))
      | ~ relation(X0)
      | ~ function(X0)
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f138,plain,
    ! [X2,X0,X1] :
      ( ~ in(apply(X2,X0),relation_dom(X1))
      | ~ in(X0,relation_dom(X2))
      | in(X0,relation_dom(relation_composition(X2,X1)))
      | ~ relation(X2)
      | ~ function(X2)
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f139,plain,
    ! [X2,X0,X1] :
      ( ~ in(X0,relation_dom(relation_composition(X2,X1)))
      | apply(relation_composition(X2,X1),X0) = apply(X1,apply(X2,X0))
      | ~ relation(X2)
      | ~ function(X2)
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f140,plain,
    function(sK10),
    inference(cnf_transformation,[],[f91]) ).

fof(f141,plain,
    relation(sK10),
    inference(cnf_transformation,[],[f91]) ).

fof(f142,plain,
    function(sK11),
    inference(cnf_transformation,[],[f91]) ).

fof(f143,plain,
    relation(sK11),
    inference(cnf_transformation,[],[f91]) ).

fof(f144,plain,
    in(sK9,relation_dom(sK10)),
    inference(cnf_transformation,[],[f91]) ).

fof(f145,plain,
    apply(relation_composition(sK10,sK11),sK9) != apply(sK11,apply(sK10,sK9)),
    inference(cnf_transformation,[],[f91]) ).

fof(f154,plain,
    ! [X0,X1] :
      ( apply(X0,X1) = empty_set
      | in(X1,relation_dom(X0))
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(equality_resolution,[],[f97]) ).

fof(f195,plain,
    ( empty_set != apply(sK11,apply(sK10,sK9))
    | in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ relation(relation_composition(sK10,sK11))
    | ~ function(relation_composition(sK10,sK11)) ),
    inference(superposition,[],[f145,f154]) ).

fof(f197,definition,
    ( spl12_1
  <=> function(relation_composition(sK10,sK11)) ),
    introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).

fof(f199,plain,
    ( ~ function(relation_composition(sK10,sK11))
    | spl12_1 ),
    inference(avatar_component_clause,[],[f197]) ).

fof(f201,definition,
    ( spl12_2
  <=> relation(relation_composition(sK10,sK11)) ),
    introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).

fof(f203,plain,
    ( ~ relation(relation_composition(sK10,sK11))
    | spl12_2 ),
    inference(avatar_component_clause,[],[f201]) ).

fof(f205,definition,
    ( spl12_3
  <=> in(sK9,relation_dom(relation_composition(sK10,sK11))) ),
    introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).

fof(f207,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ spl12_3 ),
    inference(avatar_component_clause,[],[f205]) ).

fof(f209,definition,
    ( spl12_4
  <=> empty_set = apply(sK11,apply(sK10,sK9)) ),
    introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).

fof(f211,plain,
    ( empty_set != apply(sK11,apply(sK10,sK9))
    | spl12_4 ),
    inference(avatar_component_clause,[],[f209]) ).

fof(f212,plain,
    ( ~ spl12_1
    | ~ spl12_2
    | spl12_3
    | ~ spl12_4 ),
    inference(avatar_split_clause,[],[f195,f209,f205,f201,f197]) ).

fof(f213,plain,
    ( ~ relation(sK10)
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_1 ),
    inference(resolution,[],[f199,f107]) ).

fof(f215,plain,
    ( ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_1 ),
    inference(forward_subsumption_resolution,[],[f213,f141]) ).

fof(f216,plain,
    ( ~ relation(sK11)
    | ~ function(sK11)
    | spl12_1 ),
    inference(forward_subsumption_resolution,[],[f215,f140]) ).

fof(f217,plain,
    ( ~ function(sK11)
    | spl12_1 ),
    inference(forward_subsumption_resolution,[],[f216,f143]) ).

fof(f218,plain,
    ( $false
    | spl12_1 ),
    inference(forward_subsumption_resolution,[],[f217,f142]) ).

fof(f219,plain,
    spl12_1,
    inference(avatar_contradiction_clause,[],[f218]) ).

fof(f225,plain,
    ( ~ relation(sK10)
    | ~ relation(sK11)
    | spl12_2 ),
    inference(resolution,[],[f203,f101]) ).

fof(f227,plain,
    ( ~ relation(sK11)
    | spl12_2 ),
    inference(forward_subsumption_resolution,[],[f225,f141]) ).

fof(f229,plain,
    ( $false
    | spl12_2 ),
    inference(forward_subsumption_resolution,[],[f227,f143]) ).

fof(f230,plain,
    spl12_2,
    inference(avatar_contradiction_clause,[],[f229]) ).

fof(f232,plain,
    ( empty_set != empty_set
    | in(apply(sK10,sK9),relation_dom(sK11))
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(superposition,[],[f211,f154]) ).

fof(f233,plain,
    ( in(apply(sK10,sK9),relation_dom(sK11))
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(trivial_inequality_removal,[],[f232]) ).

fof(f234,plain,
    ( in(apply(sK10,sK9),relation_dom(sK11))
    | ~ function(sK11)
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f233,f143]) ).

fof(f235,plain,
    ( in(apply(sK10,sK9),relation_dom(sK11))
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f234,f142]) ).

fof(f244,plain,
    ( ~ in(sK9,relation_dom(sK10))
    | in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ relation(sK10)
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(resolution,[],[f138,f235]) ).

fof(f247,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ relation(sK10)
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f244,f144]) ).

fof(f248,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f247,f141]) ).

fof(f249,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ relation(sK11)
    | ~ function(sK11)
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f248,f140]) ).

fof(f250,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | ~ function(sK11)
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f249,f143]) ).

fof(f251,plain,
    ( in(sK9,relation_dom(relation_composition(sK10,sK11)))
    | spl12_4 ),
    inference(forward_subsumption_resolution,[],[f250,f142]) ).

fof(f252,plain,
    ( spl12_3
    | spl12_4 ),
    inference(avatar_split_clause,[],[f251,f209,f205]) ).

fof(f254,plain,
    ( apply(relation_composition(sK10,sK11),sK9) = apply(sK11,apply(sK10,sK9))
    | ~ relation(sK10)
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | ~ spl12_3 ),
    inference(resolution,[],[f207,f139]) ).

fof(f263,plain,
    ( ~ relation(sK10)
    | ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | ~ spl12_3 ),
    inference(forward_subsumption_resolution,[],[f254,f145]) ).

fof(f265,plain,
    ( ~ function(sK10)
    | ~ relation(sK11)
    | ~ function(sK11)
    | ~ spl12_3 ),
    inference(forward_subsumption_resolution,[],[f263,f141]) ).

fof(f266,plain,
    ( ~ relation(sK11)
    | ~ function(sK11)
    | ~ spl12_3 ),
    inference(forward_subsumption_resolution,[],[f265,f140]) ).

fof(f267,plain,
    ( ~ function(sK11)
    | ~ spl12_3 ),
    inference(forward_subsumption_resolution,[],[f266,f143]) ).

fof(f268,plain,
    ( $false
    | ~ spl12_3 ),
    inference(forward_subsumption_resolution,[],[f267,f142]) ).

fof(f269,plain,
    ~ spl12_3,
    inference(avatar_contradiction_clause,[],[f268]) ).

cnf(s1,plain,
    ( ~ spl12_1
    | ~ spl12_2
    | spl12_3
    | ~ spl12_4 ),
    inference(sat_conversion,[],[f212]) ).

cnf(s2,plain,
    spl12_1,
    inference(sat_conversion,[],[f219]) ).

cnf(s3,plain,
    spl12_2,
    inference(sat_conversion,[],[f230]) ).

cnf(s4,plain,
    ( spl12_3
    | spl12_4 ),
    inference(sat_conversion,[],[f252]) ).

cnf(s5,plain,
    ~ spl12_3,
    inference(sat_conversion,[],[f269]) ).

cnf(s6,plain,
    spl12_4,
    inference(rat,[],[s4,s5]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s1,s6,s5,s3,s2]) ).

fof(f270,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU215+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n010.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 04:05:47 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 2.57/1.28  % (1545885)Detected formulas, will run a generic FOF schedule.
% 2.57/1.28  % (1545896)dis-21_1_sil=8000:lcm=predicate:random_seed=1249031072: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.57/1.28  % (1545891)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=2052602658:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.57/1.28  % (1545893)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2181042169:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.57/1.28  % (1545892)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=727619687:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.57/1.28  % (1545894)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1205990401:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.57/1.28  % (1545890)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=4136687219:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.57/1.28  % (1545895)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1887107625:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.57/1.28  % (1545896)Instruction limit reached! 
% 2.57/1.28  % (1545896)------------------------------
% 2.57/1.28  % (1545896)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.28  % (1545896)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.28  % (1545896)CaDiCaL version: 2.1.3
% 2.57/1.28  % (1545896)Termination reason: Instruction limit
% 2.57/1.28  % (1545896)Termination phase: Saturation
% 2.57/1.28  % (1545896)Time elapsed: 0.041 s
% 2.57/1.28  % (1545896)Peak memory usage: 90 MB
% 2.57/1.28  % (1545896)Instructions burned: 130 (million)
% 2.57/1.28  % (1545893)Refutation not found, incomplete strategy
% 2.57/1.28  % (1545893)------------------------------
% 2.57/1.28  % (1545893)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.28  % (1545893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.28  % (1545893)CaDiCaL version: 2.1.3
% 2.57/1.28  % (1545893)Termination reason: Refutation not found, incomplete strategy
% 2.57/1.28  % (1545893)Time elapsed: 0.002 s
% 2.57/1.28  % (1545893)Peak memory usage: 88 MB
% 2.57/1.28  % (1545893)Instructions burned: 2 (million)
% 2.57/1.28  % (1545895)First to succeed.
% 2.57/1.28  % (1545895)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1545885"
% 2.57/1.28  % (1545894)Instruction limit reached! 
% 2.57/1.28  % (1545894)------------------------------
% 2.57/1.28  % (1545894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.28  % (1545894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.28  % (1545894)CaDiCaL version: 2.1.3
% 2.57/1.28  % (1545894)Termination reason: Instruction limit
% 2.57/1.28  % (1545894)Termination phase: Saturation
% 2.57/1.28  % (1545894)Time elapsed: 0.064 s
% 2.57/1.28  % (1545894)Peak memory usage: 88 MB
% 2.57/1.28  % (1545894)Instructions burned: 120 (million)
% 2.57/1.28  % (1545904)lrs+10_1_sil=8000:sp=occurrence:random_seed=629862461:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.57/1.28  % (1545905)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3252619737:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.57/1.28  % (1545893)------------------------------
% 2.57/1.28  % (1545893)------------------------------
% 2.57/1.28  % (1545895)Refutation found. Thanks to Tanya!
% 2.57/1.28  % SZS status Theorem for theBenchmark
% 2.57/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.49  % (1545895)------------------------------
% 3.59/1.49  % (1545895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.49  % (1545895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.49  % (1545895)CaDiCaL version: 2.1.3
% 3.59/1.49  % (1545895)Termination reason: Refutation
% 3.59/1.49  % (1545895)Time elapsed: 0.008 s
% 3.59/1.49  % (1545895)Peak memory usage: 90 MB
% 3.59/1.49  % (1545895)Instructions burned: 9 (million)
% 3.59/1.49  % (1545895)------------------------------
% 3.59/1.49  % (1545895)------------------------------
% 3.59/1.49  % (1545885)Success in time 0.428 s
% 3.59/1.49  % Vampire exiting
%------------------------------------------------------------------------------