↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n006.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:15:08 PM UTC 2026

% Result   : Theorem 0.95s 1.00s
% Output   : Refutation 3.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   87 (  19 unt;   9 def)
%            Number of atoms       :  259 (  33 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  298 ( 126   ~; 120   |;  34   &)
%                                         (  14 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   69 (   0 sgn  62   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => aInteger0(smndt0(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( ( aInteger0(X0)
        & aInteger0(X1) )
     => aInteger0(sdtpldt0(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).

fof(f18,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => ! [X1] :
          ( aDivisorOf0(X1,X0)
        <=> ( aInteger0(X1)
            & X1 != sz00
            & ? [X2] :
                ( aInteger0(X2)
                & sdtasdt0(X1,X2) = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).

fof(f19,axiom,
    ! [X0,X1,X2] :
      ( ( aInteger0(X0)
        & aInteger0(X1)
        & aInteger0(X2)
        & X2 != sz00 )
     => ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
      <=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).

fof(f22,axiom,
    ( aInteger0(xa)
    & aInteger0(xb)
    & aInteger0(xq)
    & xq != sz00
    & aInteger0(xc) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).

fof(f23,axiom,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & sdteqdtlpzmzozddtrp0(xb,xc,xq) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__853) ).

fof(f24,conjecture,
    ? [X0] :
      ( aInteger0(X0)
      & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f25,negated_conjecture,
    ~ ? [X0] :
        ( aInteger0(X0)
        & sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) ),
    inference(negated_conjecture,[status(cth)],[f24]) ).

fof(f27,plain,
    ! [X0] :
      ( aInteger0(smndt0(X0))
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(flattening,[],[f28]) ).

fof(f49,plain,
    ! [X0] :
      ( ! [X1] :
          ( aDivisorOf0(X1,X0)
        <=> ( aInteger0(X1)
            & X1 != sz00
            & ? [X2] :
                ( aInteger0(X2)
                & sdtasdt0(X1,X2) = X0 ) ) )
      | ~ aInteger0(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f50,plain,
    ! [X0,X1,X2] :
      ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
      <=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | sz00 = X2 ),
    inference(ennf_transformation,[],[f19]) ).

fof(f51,plain,
    ! [X0,X1,X2] :
      ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
      <=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | sz00 = X2 ),
    inference(flattening,[],[f50]) ).

fof(f56,plain,
    ! [X0] :
      ( ~ aInteger0(X0)
      | sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb)) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f57,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aDivisorOf0(X1,X0)
            | ~ aInteger0(X1)
            | sz00 = X1
            | ! [X2] :
                ( ~ aInteger0(X2)
                | sdtasdt0(X1,X2) != X0 ) )
          & ( ( aInteger0(X1)
              & X1 != sz00
              & ? [X2] :
                  ( aInteger0(X2)
                  & sdtasdt0(X1,X2) = X0 ) )
            | ~ aDivisorOf0(X1,X0) ) )
      | ~ aInteger0(X0) ),
    inference(nnf_transformation,[],[f49]) ).

fof(f58,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aDivisorOf0(X1,X0)
            | ~ aInteger0(X1)
            | sz00 = X1
            | ! [X2] :
                ( ~ aInteger0(X2)
                | sdtasdt0(X1,X2) != X0 ) )
          & ( ( aInteger0(X1)
              & X1 != sz00
              & ? [X2] :
                  ( aInteger0(X2)
                  & sdtasdt0(X1,X2) = X0 ) )
            | ~ aDivisorOf0(X1,X0) ) )
      | ~ aInteger0(X0) ),
    inference(flattening,[],[f57]) ).

fof(f59,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aDivisorOf0(X1,X0)
            | ~ aInteger0(X1)
            | sz00 = X1
            | ! [X2] :
                ( ~ aInteger0(X2)
                | sdtasdt0(X1,X2) != X0 ) )
          & ( ( aInteger0(X1)
              & X1 != sz00
              & ? [X3] :
                  ( aInteger0(X3)
                  & sdtasdt0(X1,X3) = X0 ) )
            | ~ aDivisorOf0(X1,X0) ) )
      | ~ aInteger0(X0) ),
    inference(rectify,[],[f58]) ).

fof(f60,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aDivisorOf0(X1,X0)
            | ~ aInteger0(X1)
            | sz00 = X1
            | ! [X2] :
                ( ~ aInteger0(X2)
                | sdtasdt0(X1,X2) != X0 ) )
          & ( ( aInteger0(X1)
              & X1 != sz00
              & aInteger0(sK0(X0,X1))
              & sdtasdt0(X1,sK0(X0,X1)) = X0 )
            | ~ aDivisorOf0(X1,X0) ) )
      | ~ aInteger0(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f59]) ).

fof(f61,plain,
    ! [X0,X1,X2] :
      ( ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
          | ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
        & ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
          | ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ) )
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | sz00 = X2 ),
    inference(nnf_transformation,[],[f51]) ).

fof(f64,plain,
    ! [X0] :
      ( aInteger0(smndt0(X0))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( aInteger0(sdtpldt0(X0,X1))
      | ~ aInteger0(X0)
      | ~ aInteger0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( sdtasdt0(X1,sK0(X0,X1)) = X0
      | ~ aDivisorOf0(X1,X0)
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ~ aDivisorOf0(X1,X0)
      | aInteger0(sK0(X0,X1))
      | ~ aInteger0(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f89,plain,
    ! [X2,X0,X1] :
      ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
      | ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | sz00 = X2 ),
    inference(cnf_transformation,[],[f61]) ).

fof(f94,plain,
    sz00 != xq,
    inference(cnf_transformation,[],[f22]) ).

fof(f95,plain,
    aInteger0(xq),
    inference(cnf_transformation,[],[f22]) ).

fof(f96,plain,
    aInteger0(xb),
    inference(cnf_transformation,[],[f22]) ).

fof(f97,plain,
    aInteger0(xa),
    inference(cnf_transformation,[],[f22]) ).

fof(f99,plain,
    sdteqdtlpzmzozddtrp0(xa,xb,xq),
    inference(cnf_transformation,[],[f23]) ).

fof(f100,plain,
    ! [X0] :
      ( ~ aInteger0(X0)
      | sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xb)) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f103,definition,
    ! [X0,X1] :
      ( sQ1_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(definition,[new_symbols(definition,[sQ1_eqProxy])],[equality_proxy_definition]) ).

fof(f122,plain,
    ! [X0,X1] :
      ( sQ1_eqProxy(sdtasdt0(X1,sK0(X0,X1)),X0)
      | ~ aDivisorOf0(X1,X0)
      | ~ aInteger0(X0) ),
    inference(equality_proxy_replacement,[],[f84,f103]) ).

fof(f124,plain,
    ! [X2,X0,X1] :
      ( sQ1_eqProxy(sz00,X2)
      | ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ),
    inference(equality_proxy_replacement,[],[f89,f103]) ).

fof(f127,plain,
    ~ sQ1_eqProxy(sz00,xq),
    inference(equality_proxy_replacement,[],[f94,f103]) ).

fof(f128,plain,
    ! [X0] :
      ( ~ sQ1_eqProxy(sdtasdt0(xq,X0),sdtpldt0(xa,smndt0(xb)))
      | ~ aInteger0(X0) ),
    inference(equality_proxy_replacement,[],[f100,f103]) ).

fof(f137,definition,
    ( spl2_1
  <=> aInteger0(xq) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f138,plain,
    ( ~ aInteger0(xq)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f137]) ).

fof(f143,plain,
    ( $false
    | spl2_1 ),
    inference(resolution,[],[f138,f95]) ).

fof(f144,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f143]) ).

fof(f145,plain,
    ( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
    | ~ aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),xq)) ),
    inference(resolution,[],[f122,f128]) ).

fof(f147,definition,
    ( spl2_3
  <=> aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),xq)) ),
    introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).

fof(f150,definition,
    ( spl2_4
  <=> aInteger0(sdtpldt0(xa,smndt0(xb))) ),
    introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).

fof(f151,plain,
    ( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
    | spl2_4 ),
    inference(avatar_component_clause,[],[f150]) ).

fof(f153,definition,
    ( spl2_5
  <=> aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).

fof(f155,plain,
    ( ~ spl2_3
    | ~ spl2_4
    | ~ spl2_5 ),
    inference(avatar_split_clause,[],[f145,f153,f150,f147]) ).

fof(f199,plain,
    ! [X0,X1] :
      ( ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
      | ~ aInteger0(X0)
      | ~ aInteger0(X1)
      | ~ aInteger0(xq)
      | aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1))) ),
    inference(resolution,[],[f124,f127]) ).

fof(f202,definition,
    ( spl2_11
  <=> ! [X0,X1] :
        ( ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
        | aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
        | ~ aInteger0(X1)
        | ~ aInteger0(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl2_11])],[avatar_definition]) ).

fof(f203,plain,
    ( ! [X0,X1] :
        ( ~ sdteqdtlpzmzozddtrp0(X0,X1,xq)
        | aDivisorOf0(xq,sdtpldt0(X0,smndt0(X1)))
        | ~ aInteger0(X1)
        | ~ aInteger0(X0) )
    | ~ spl2_11 ),
    inference(avatar_component_clause,[],[f202]) ).

fof(f204,plain,
    ( ~ spl2_1
    | spl2_11 ),
    inference(avatar_split_clause,[],[f199,f202,f137]) ).

fof(f206,plain,
    ( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    | ~ aInteger0(xb)
    | ~ aInteger0(xa)
    | ~ spl2_11 ),
    inference(resolution,[],[f203,f99]) ).

fof(f214,definition,
    ( spl2_12
  <=> aInteger0(xa) ),
    introduced(definition,[new_symbols(definition,[spl2_12])],[avatar_definition]) ).

fof(f215,plain,
    ( ~ aInteger0(xa)
    | spl2_12 ),
    inference(avatar_component_clause,[],[f214]) ).

fof(f217,definition,
    ( spl2_13
  <=> aInteger0(xb) ),
    introduced(definition,[new_symbols(definition,[spl2_13])],[avatar_definition]) ).

fof(f218,plain,
    ( ~ aInteger0(xb)
    | spl2_13 ),
    inference(avatar_component_clause,[],[f217]) ).

fof(f219,plain,
    ( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    | ~ spl2_5 ),
    inference(avatar_component_clause,[],[f153]) ).

fof(f220,plain,
    ( ~ spl2_12
    | ~ spl2_13
    | spl2_5
    | ~ spl2_11 ),
    inference(avatar_split_clause,[],[f206,f202,f153,f217,f214]) ).

fof(f228,plain,
    ( $false
    | spl2_13 ),
    inference(resolution,[],[f218,f96]) ).

fof(f229,plain,
    spl2_13,
    inference(avatar_contradiction_clause,[],[f228]) ).

fof(f230,plain,
    ( $false
    | spl2_12 ),
    inference(resolution,[],[f215,f97]) ).

fof(f231,plain,
    spl2_12,
    inference(avatar_contradiction_clause,[],[f230]) ).

fof(f232,plain,
    ( aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),xq))
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
    | ~ spl2_5 ),
    inference(resolution,[],[f219,f85]) ).

fof(f235,plain,
    ( ~ spl2_4
    | spl2_3
    | ~ spl2_5 ),
    inference(avatar_split_clause,[],[f232,f153,f147,f150]) ).

fof(f236,plain,
    ( ~ aInteger0(xa)
    | ~ aInteger0(smndt0(xb))
    | spl2_4 ),
    inference(resolution,[],[f151,f65]) ).

fof(f238,definition,
    ( spl2_16
  <=> aInteger0(smndt0(xb)) ),
    introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).

fof(f239,plain,
    ( ~ aInteger0(smndt0(xb))
    | spl2_16 ),
    inference(avatar_component_clause,[],[f238]) ).

fof(f240,plain,
    ( ~ spl2_16
    | ~ spl2_12
    | spl2_4 ),
    inference(avatar_split_clause,[],[f236,f150,f214,f238]) ).

fof(f241,plain,
    ( ~ aInteger0(xb)
    | spl2_16 ),
    inference(resolution,[],[f239,f64]) ).

fof(f242,plain,
    ( ~ spl2_13
    | spl2_16 ),
    inference(avatar_split_clause,[],[f241,f238,f217]) ).

cnf(s2,plain,
    spl2_1,
    inference(sat_conversion,[],[f144]) ).

cnf(s3,plain,
    ( ~ spl2_3
    | ~ spl2_4
    | ~ spl2_5 ),
    inference(sat_conversion,[],[f155]) ).

cnf(s9,plain,
    ( ~ spl2_1
    | spl2_11 ),
    inference(sat_conversion,[],[f204]) ).

cnf(s10,plain,
    ( spl2_5
    | ~ spl2_11
    | ~ spl2_12
    | ~ spl2_13 ),
    inference(sat_conversion,[],[f220]) ).

cnf(s12,plain,
    spl2_13,
    inference(sat_conversion,[],[f229]) ).

cnf(s13,plain,
    spl2_12,
    inference(sat_conversion,[],[f231]) ).

cnf(s14,plain,
    ( spl2_3
    | ~ spl2_4
    | ~ spl2_5 ),
    inference(sat_conversion,[],[f235]) ).

cnf(s15,plain,
    ( spl2_4
    | ~ spl2_12
    | ~ spl2_16 ),
    inference(sat_conversion,[],[f240]) ).

cnf(s16,plain,
    ( ~ spl2_13
    | spl2_16 ),
    inference(sat_conversion,[],[f242]) ).

cnf(s17,plain,
    spl2_16,
    inference(rat,[],[s16,s12]) ).

cnf(s18,plain,
    spl2_4,
    inference(rat,[],[s15,s13,s17]) ).

cnf(s20,plain,
    ( spl2_5
    | ~ spl2_11 ),
    inference(rat,[],[s10,s12,s13]) ).

cnf(s22,plain,
    ( ~ spl2_3
    | ~ spl2_5 ),
    inference(rat,[],[s3,s18]) ).

cnf(s23,plain,
    spl2_11,
    inference(rat,[],[s9,s2]) ).

cnf(s27,plain,
    spl2_5,
    inference(rat,[],[s20,s23]) ).

cnf(s28,plain,
    spl2_3,
    inference(rat,[],[s14,s18,s27]) ).

cnf(s29,plain,
    $false,
    inference(rat,[],[s22,s27,s28]) ).

fof(f243,plain,
    $false,
    inference(avatar_sat_refutation,[],[s29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM429+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n006.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 19:51:41 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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
% 0.95/1.00  % (3277137)Detected formulas, will run a generic FOF schedule.
% 0.95/1.00  % (3277147)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2578735414:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.95/1.00  % (3277145)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1905783627:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.95/1.00  % (3277146)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=696762205:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.95/1.00  % (3277148)dis-21_1_sil=8000:lcm=predicate:random_seed=1284100632: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)
% 0.95/1.00  % (3277143)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=2464303638:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.95/1.00  % (3277142)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=1266833578:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.95/1.00  % (3277144)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=3058251443:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.95/1.00  % (3277148)First to succeed.
% 0.95/1.00  % (3277148)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3277137"
% 0.95/1.00  % (3277145)Instruction limit reached! 
% 0.95/1.00  % (3277145)------------------------------
% 0.95/1.00  % (3277145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.95/1.00  % (3277145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/1.00  % (3277145)CaDiCaL version: 2.1.3
% 0.95/1.00  % (3277145)Termination reason: Instruction limit
% 0.95/1.00  % (3277145)Termination phase: Saturation
% 0.95/1.00  % (3277145)Time elapsed: 0.065 s
% 0.95/1.00  % (3277145)Peak memory usage: 89 MB
% 0.95/1.00  % (3277145)Instructions burned: 109 (million)
% 0.95/1.00  % (3277146)Instruction limit reached! 
% 0.95/1.00  % (3277146)------------------------------
% 0.95/1.00  % (3277146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.95/1.00  % (3277146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/1.00  % (3277146)CaDiCaL version: 2.1.3
% 0.95/1.00  % (3277146)Termination reason: Instruction limit
% 0.95/1.00  % (3277146)Termination phase: Saturation
% 0.95/1.00  % (3277146)Time elapsed: 0.065 s
% 0.95/1.00  % (3277146)Peak memory usage: 88 MB
% 0.95/1.00  % (3277146)Instructions burned: 120 (million)
% 0.95/1.00  % (3277147)Instruction limit reached! 
% 0.95/1.00  % (3277147)------------------------------
% 0.95/1.00  % (3277147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.95/1.00  % (3277147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/1.00  % (3277147)CaDiCaL version: 2.1.3
% 0.95/1.00  % (3277147)Termination reason: Instruction limit
% 0.95/1.00  % (3277147)Termination phase: Saturation
% 0.95/1.00  % (3277147)Time elapsed: 0.084 s
% 0.95/1.00  % (3277147)Peak memory usage: 89 MB
% 0.95/1.00  % (3277147)Instructions burned: 139 (million)
% 0.95/1.00  % (3277156)lrs+10_1_sil=8000:sp=occurrence:random_seed=976278163:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 0.95/1.00  % (3277157)lrs+10_1_sil=32000:urr=on:br=off:random_seed=226801199:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.95/1.00  % (3277158)lrs+1011_1_sil=32000:sp=occurrence:random_seed=251454494:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 0.95/1.00  % (3277148)Refutation found. Thanks to Tanya!
% 0.95/1.00  % SZS status Theorem for theBenchmark
% 0.95/1.00  % SZS output start Proof for theBenchmark
% See solution above
% 3.02/1.09  % (3277148)------------------------------
% 3.02/1.09  % (3277148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.02/1.09  % (3277148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.02/1.09  % (3277148)CaDiCaL version: 2.1.3
% 3.02/1.09  % (3277148)Termination reason: Refutation
% 3.02/1.09  % (3277148)Time elapsed: 0.005 s
% 3.02/1.09  % (3277148)Peak memory usage: 89 MB
% 3.02/1.09  % (3277148)Instructions burned: 5 (million)
% 3.02/1.09  % (3277148)------------------------------
% 3.02/1.09  % (3277148)------------------------------
% 3.02/1.09  % (3277137)Success in time 0.39 s
% 3.02/1.09  % Vampire exiting
%------------------------------------------------------------------------------