↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n011.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:24:17 PM UTC 2026

% Result   : Theorem 2.24s 0.84s
% Output   : Refutation 2.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   58 (  21 unt;   3 def)
%            Number of atoms       :  177 (  47 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :  200 (  81   ~;  76   |;  34   &)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   58 (  51   !;   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(f25,conjecture,
    ? [X0] :
      ( aInteger0(X0)
      & sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xc)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

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

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

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

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

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

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(ennf_transformation,[],[f19]) ).

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

fof(f57,plain,
    ! [X0] :
      ( ~ aInteger0(X0)
      | sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc)) ),
    inference(ennf_transformation,[],[f26]) ).

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(nnf_transformation,[],[f50]) ).

fof(f59,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,[],[f58]) ).

fof(f60,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,[],[f59]) ).

fof(f61,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))],[f60]) ).

fof(f62,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,[],[f52]) ).

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

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

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

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

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

fof(f94,plain,
    aInteger0(xc),
    inference(cnf_transformation,[],[f22]) ).

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

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

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

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

fof(f103,plain,
    ! [X0] :
      ( ~ aInteger0(X0)
      | sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xc)) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f106,definition,
    ! [X0] : sF1(X0) = sdtasdt0(xq,X0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f107,plain,
    ! [X0] : sdtasdt0(xq,X0) = sF1(X0),
    inference(reorient_equations,[],[f106]) ).

fof(f108,definition,
    sF2 = smndt0(xc),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f109,plain,
    smndt0(xc) = sF2,
    inference(reorient_equations,[],[f108]) ).

fof(f110,definition,
    sF3 = sdtpldt0(xb,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f111,plain,
    sdtpldt0(xb,sF2) = sF3,
    inference(reorient_equations,[],[f110]) ).

fof(f112,plain,
    ! [X0] :
      ( sF1(X0) != sF3
      | ~ aInteger0(X0) ),
    inference(definition_folding,[],[f103,f111,f109,f107]) ).

fof(f113,plain,
    ( aInteger0(sF2)
    | ~ aInteger0(xc) ),
    inference(superposition,[],[f65,f109]) ).

fof(f114,plain,
    aInteger0(sF2),
    inference(forward_subsumption_resolution,[],[f113,f94]) ).

fof(f183,plain,
    ( aInteger0(sF3)
    | ~ aInteger0(xb)
    | ~ aInteger0(sF2) ),
    inference(superposition,[],[f66,f111]) ).

fof(f188,plain,
    ( aInteger0(sF3)
    | ~ aInteger0(sF2) ),
    inference(forward_subsumption_resolution,[],[f183,f97]) ).

fof(f189,plain,
    aInteger0(sF3),
    inference(forward_subsumption_resolution,[],[f188,f114]) ).

fof(f558,plain,
    ( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    | ~ aInteger0(xb)
    | ~ aInteger0(xc)
    | ~ aInteger0(xq)
    | sz00 = xq ),
    inference(resolution,[],[f90,f99]) ).

fof(f582,plain,
    ( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    | ~ aInteger0(xc)
    | ~ aInteger0(xq)
    | sz00 = xq ),
    inference(forward_subsumption_resolution,[],[f558,f97]) ).

fof(f591,plain,
    ( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    | ~ aInteger0(xq)
    | sz00 = xq ),
    inference(forward_subsumption_resolution,[],[f582,f94]) ).

fof(f624,plain,
    ( aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))
    | sz00 = xq ),
    inference(forward_subsumption_resolution,[],[f591,f96]) ).

fof(f629,plain,
    aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))),
    inference(forward_subsumption_resolution,[],[f624,f95]) ).

fof(f631,plain,
    aDivisorOf0(xq,sdtpldt0(xb,sF2)),
    inference(forward_demodulation,[],[f629,f109]) ).

fof(f633,plain,
    aDivisorOf0(xq,sF3),
    inference(forward_demodulation,[],[f631,f111]) ).

fof(f763,plain,
    ( sF3 = sdtasdt0(xq,sK0(sF3,xq))
    | ~ aInteger0(sF3) ),
    inference(resolution,[],[f633,f85]) ).

fof(f765,plain,
    sF3 = sdtasdt0(xq,sK0(sF3,xq)),
    inference(forward_subsumption_resolution,[],[f763,f189]) ).

fof(f766,plain,
    sF3 = sF1(sK0(sF3,xq)),
    inference(forward_demodulation,[],[f765,f107]) ).

fof(f14226,plain,
    ( sF3 != sF3
    | ~ aInteger0(sK0(sF3,xq)) ),
    inference(superposition,[],[f112,f766]) ).

fof(f14227,plain,
    ~ aInteger0(sK0(sF3,xq)),
    inference(trivial_inequality_removal,[],[f14226]) ).

fof(f14234,plain,
    ( ~ aDivisorOf0(xq,sF3)
    | ~ aInteger0(sF3) ),
    inference(resolution,[],[f14227,f86]) ).

fof(f14235,plain,
    ~ aInteger0(sF3),
    inference(forward_subsumption_resolution,[],[f14234,f633]) ).

fof(f14236,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f14235,f189]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM430+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n011.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 19:53:01 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.24/0.84  % (2718458)Will run a generic schedule for satisfiability detection.
% 2.24/0.84  % (2718468)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=619080934:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.24/0.84  % (2718464)% WARNING: option uhcvi not known.
% 2.24/0.84  % (2718463)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1104189613_2999 on theBenchmark for (2999ds/0Mi)
% 2.24/0.84  % (2718464)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3549116000:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.24/0.84  % (2718465)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2061712631:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.24/0.84  % (2718466)dis+10_1_sil=32000:sp=arity:random_seed=3281417098:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.24/0.84  % (2718467)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=400657817:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.24/0.84  % (2718469)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2079778820:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.24/0.84  % TRYING [1]
% 2.24/0.84  % TRYING [2]
% 2.24/0.84  % TRYING [3]
% 2.24/0.84  % TRYING [4]
% 2.24/0.84  % (2718468)Instruction limit reached! 
% 2.24/0.84  % (2718468)------------------------------
% 2.24/0.84  % (2718468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718468)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718468)Termination reason: Instruction limit
% 2.24/0.84  % (2718468)Termination phase: Saturation
% 2.24/0.84  % (2718468)Time elapsed: 0.038 s
% 2.24/0.84  % (2718468)Peak memory usage: 13 MB
% 2.24/0.84  % (2718468)Instructions burned: 134 (million)
% 2.24/0.84  % TRYING [5]
% 2.24/0.84  % (2718477)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3020640095:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.24/0.84  % TRYING [1]
% 2.24/0.84  % TRYING [2]
% 2.24/0.84  % TRYING [3]
% 2.24/0.84  % TRYING [4]
% 2.24/0.84  % (2718466)Instruction limit reached! 
% 2.24/0.84  % (2718466)------------------------------
% 2.24/0.84  % (2718466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718466)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718466)Termination reason: Instruction limit
% 2.24/0.84  % (2718466)Termination phase: Saturation
% 2.24/0.84  % (2718466)Time elapsed: 0.059 s
% 2.24/0.84  % (2718466)Peak memory usage: 12 MB
% 2.24/0.84  % (2718466)Instructions burned: 103 (million)
% 2.24/0.84  % TRYING [5]
% 2.24/0.84  % (2718467)Instruction limit reached! 
% 2.24/0.84  % (2718467)------------------------------
% 2.24/0.84  % (2718467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718467)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718467)Termination reason: Instruction limit
% 2.24/0.84  % (2718467)Termination phase: Saturation
% 2.24/0.84  % (2718467)Time elapsed: 0.063 s
% 2.24/0.84  % (2718467)Peak memory usage: 13 MB
% 2.24/0.84  % (2718467)Instructions burned: 118 (million)
% 2.24/0.84  % (2718479)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1006161110:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.24/0.84  % (2718480)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3948527475:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.24/0.84  % (2718469)Instruction limit reached! 
% 2.24/0.84  % (2718469)------------------------------
% 2.24/0.84  % (2718469)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718469)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718469)Termination reason: Instruction limit
% 2.24/0.84  % (2718469)Termination phase: Saturation
% 2.24/0.84  % (2718469)Time elapsed: 0.101 s
% 2.24/0.84  % (2718469)Peak memory usage: 14 MB
% 2.24/0.84  % (2718469)Instructions burned: 160 (million)
% 2.24/0.84  % TRYING [6]
% 2.24/0.84  % TRYING [6]
% 2.24/0.84  % (2718483)ott-21_1_sil=16000:fs=off:random_seed=1931045479:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.24/0.84  % (2718479)Instruction limit reached! 
% 2.24/0.84  % (2718479)------------------------------
% 2.24/0.84  % (2718479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718479)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718479)Termination reason: Instruction limit
% 2.24/0.84  % (2718479)Termination phase: Saturation
% 2.24/0.84  % (2718479)Time elapsed: 0.067 s
% 2.24/0.84  % (2718479)Peak memory usage: 12 MB
% 2.24/0.84  % (2718479)Instructions burned: 133 (million)
% 2.24/0.84  % (2718485)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1541837298:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.24/0.84  % (2718483)Instruction limit reached! 
% 2.24/0.84  % (2718483)------------------------------
% 2.24/0.84  % (2718483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718483)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718483)Termination reason: Instruction limit
% 2.24/0.84  % (2718483)Termination phase: Saturation
% 2.24/0.84  % (2718483)Time elapsed: 0.091 s
% 2.24/0.84  % (2718483)Peak memory usage: 13 MB
% 2.24/0.84  % (2718483)Instructions burned: 180 (million)
% 2.24/0.84  % (2718477)Instruction limit reached! 
% 2.24/0.84  % (2718477)------------------------------
% 2.24/0.84  % (2718477)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718477)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718477)Termination reason: Instruction limit
% 2.24/0.84  % (2718477)Termination phase: Finite model building SAT solving
% 2.24/0.84  % (2718477)Time elapsed: 0.179 s
% 2.24/0.84  % (2718477)Peak memory usage: 32 MB
% 2.24/0.84  % (2718477)Instructions burned: 716 (million)
% 2.24/0.84  % (2718488)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=505772085:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.24/0.84  % (2718487)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=814369608:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.24/0.84  % TRYING [1]
% 2.24/0.84  % TRYING [2]
% 2.24/0.84  % TRYING [3]
% 2.24/0.84  % TRYING [4]
% 2.24/0.84  % TRYING [5]
% 2.24/0.84  % (2718488) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2718458-2718488"...
% 2.24/0.84  % (2718488)...printing done.
% 2.24/0.84  % (2718488)Refutation found. Thanks to Tanya!
% 2.24/0.84  % SZS status Theorem for theBenchmark
% 2.24/0.84  % SZS output start Proof for theBenchmark
% See solution above
% 2.24/0.84  % (2718488)------------------------------
% 2.24/0.84  % (2718488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.24/0.84  % (2718488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.24/0.84  % (2718488)CaDiCaL version: 2.1.3
% 2.24/0.84  % (2718488)Termination reason: Refutation
% 2.24/0.84  % (2718488)Time elapsed: 0.143 s
% 2.24/0.84  % (2718488)Peak memory usage: 18 MB
% 2.24/0.84  % (2718488)Instructions burned: 476 (million)
% 2.24/0.84  % (2718458)Success in time 0.424 s
% 2.24/0.84  % Vampire exiting
%------------------------------------------------------------------------------