↑ Up

Vampire---5.0.1.THM-Ref.s

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

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

% Result   : Theorem 0.19s 1.71s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   55 (  22 unt;   0 def)
%            Number of atoms       :  184 (  35 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  239 ( 110   ~;  87   |;  42   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   1 con; 0-2 aty)
%            Number of variables   :  161 ( 134   !;  27   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( ~ r1(X1)
        & X1 != X0 )
      | ( r1(X1)
        & X1 = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f2,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( ~ r2(X0,X2)
        & X2 != X1 )
      | ( r2(X0,X2)
        & X2 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f3,axiom,
    ! [X0,X1] :
    ? [X2] :
    ! [X3] :
      ( ( ~ r3(X0,X1,X3)
        & X3 != X2 )
      | ( r3(X0,X1,X3)
        & X3 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f5,axiom,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X3] :
          ( ? [X4] :
              ( r2(X1,X4)
              & r3(X0,X4,X3) )
          & X3 = X2 )
      & ? [X5] :
          ( r2(X5,X2)
          & r3(X0,X1,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1a) ).

fof(f8,axiom,
    ! [X0] :
    ? [X1] :
      ( ? [X2] :
          ( r1(X2)
          & r3(X0,X2,X1) )
      & X1 = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4a) ).

fof(f12,conjecture,
    ? [X0] :
      ( ? [X1] :
          ( X0 = X1
          & ? [X2] :
              ( r2(X2,X1)
              & ? [X3] :
                  ( r2(X3,X2)
                  & ? [X4] :
                      ( r2(X4,X3)
                      & ? [X5] :
                          ( r1(X5)
                          & r2(X5,X4) ) ) ) ) )
      & ? [X6] :
          ( r3(X6,X6,X0)
          & ? [X7] :
              ( r2(X7,X6)
              & ? [X8] :
                  ( r1(X8)
                  & r2(X8,X7) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',twoplustwoeqfour) ).

fof(f13,negated_conjecture,
    ~ ? [X0] :
        ( ? [X1] :
            ( X0 = X1
            & ? [X2] :
                ( r2(X2,X1)
                & ? [X3] :
                    ( r2(X3,X2)
                    & ? [X4] :
                        ( r2(X4,X3)
                        & ? [X5] :
                            ( r1(X5)
                            & r2(X5,X4) ) ) ) ) )
        & ? [X6] :
            ( r3(X6,X6,X0)
            & ? [X7] :
                ( r2(X7,X6)
                & ? [X8] :
                    ( r1(X8)
                    & r2(X8,X7) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 != X1
          | ! [X2] :
              ( ~ r2(X2,X1)
              | ! [X3] :
                  ( ~ r2(X3,X2)
                  | ! [X4] :
                      ( ~ r2(X4,X3)
                      | ! [X5] :
                          ( ~ r1(X5)
                          | ~ r2(X5,X4) ) ) ) ) )
      | ! [X6] :
          ( ~ r3(X6,X6,X0)
          | ! [X7] :
              ( ~ r2(X7,X6)
              | ! [X8] :
                  ( ~ r1(X8)
                  | ~ r2(X8,X7) ) ) ) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f15,plain,
    ! [X1] :
      ( ( ~ r1(X1)
        & sK0 != X1 )
      | ( r1(X1)
        & sK0 = X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).

fof(f16,plain,
    ! [X0,X2] :
      ( ( ~ r2(X0,X2)
        & sK1(X0) != X2 )
      | ( r2(X0,X2)
        & sK1(X0) = X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f2]) ).

fof(f17,plain,
    ! [X0,X1,X3] :
      ( ( ~ r3(X0,X1,X3)
        & sK2(X0,X1) != X3 )
      | ( r3(X0,X1,X3)
        & sK2(X0,X1) = X3 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f3]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( r2(X1,sK6(X0,X1))
      & r3(X0,sK6(X0,X1),sK5(X0,X1))
      & sK4(X0,X1) = sK5(X0,X1)
      & r2(sK7(X0,X1),sK4(X0,X1))
      & r3(X0,X1,sK7(X0,X1)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1)),skolemize(X5,sK7(X0,X1))],[f5]) ).

fof(f21,plain,
    ! [X0] :
      ( r1(sK13(X0))
      & r3(X0,sK13(X0),sK12(X0))
      & sK12(X0) = X0 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f8]) ).

fof(f25,plain,
    ! [X1] :
      ( sK0 != X1
      | r1(X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f26,plain,
    ! [X1] :
      ( ~ r1(X1)
      | sK0 = X1 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f29,plain,
    ! [X2,X0] :
      ( sK1(X0) != X2
      | r2(X0,X2) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f30,plain,
    ! [X2,X0] :
      ( ~ r2(X0,X2)
      | sK1(X0) = X2 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f33,plain,
    ! [X3,X0,X1] :
      ( sK2(X0,X1) != X3
      | r3(X0,X1,X3) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f34,plain,
    ! [X3,X0,X1] :
      ( ~ r3(X0,X1,X3)
      | sK2(X0,X1) = X3 ),
    inference(cnf_transformation,[],[f17]) ).

fof(f40,plain,
    ! [X0,X1] : r3(X0,X1,sK7(X0,X1)),
    inference(cnf_transformation,[],[f19]) ).

fof(f41,plain,
    ! [X0,X1] : r2(sK7(X0,X1),sK4(X0,X1)),
    inference(cnf_transformation,[],[f19]) ).

fof(f42,plain,
    ! [X0,X1] : sK4(X0,X1) = sK5(X0,X1),
    inference(cnf_transformation,[],[f19]) ).

fof(f43,plain,
    ! [X0,X1] : r3(X0,sK6(X0,X1),sK5(X0,X1)),
    inference(cnf_transformation,[],[f19]) ).

fof(f44,plain,
    ! [X0,X1] : r2(X1,sK6(X0,X1)),
    inference(cnf_transformation,[],[f19]) ).

fof(f51,plain,
    ! [X0] : sK12(X0) = X0,
    inference(cnf_transformation,[],[f21]) ).

fof(f52,plain,
    ! [X0] : r3(X0,sK13(X0),sK12(X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f53,plain,
    ! [X0] : r1(sK13(X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f63,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( X0 != X1
      | ~ r2(X2,X1)
      | ~ r2(X3,X2)
      | ~ r2(X4,X3)
      | ~ r1(X5)
      | ~ r2(X5,X4)
      | ~ r3(X6,X6,X0)
      | ~ r2(X7,X6)
      | ~ r1(X8)
      | ~ r2(X8,X7) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f64,plain,
    r1(sK0),
    inference(equality_resolution,[],[f25]) ).

fof(f66,plain,
    ! [X0] : r2(X0,sK1(X0)),
    inference(equality_resolution,[],[f29]) ).

fof(f68,plain,
    ! [X0,X1] : r3(X0,X1,sK2(X0,X1)),
    inference(equality_resolution,[],[f33]) ).

fof(f74,plain,
    ! [X2,X3,X1,X8,X6,X7,X4,X5] :
      ( ~ r2(X8,X7)
      | ~ r2(X3,X2)
      | ~ r2(X4,X3)
      | ~ r1(X5)
      | ~ r2(X5,X4)
      | ~ r3(X6,X6,X1)
      | ~ r2(X7,X6)
      | ~ r1(X8)
      | ~ r2(X2,X1) ),
    inference(equality_resolution,[],[f63]) ).

fof(f118,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ r3(X4,X4,X5)
      | ~ r2(X2,X0)
      | ~ r1(X3)
      | ~ r2(X3,X2)
      | ~ r2(X0,X1)
      | ~ r2(sK1(X6),X4)
      | ~ r1(X6)
      | ~ r2(X1,X5) ),
    inference(resolution,[],[f66,f74]) ).

fof(f127,plain,
    ! [X0] : sK0 = sK13(X0),
    inference(resolution,[],[f26,f53]) ).

fof(f159,plain,
    ! [X0] : r3(X0,sK13(X0),X0),
    inference(forward_demodulation,[],[f52,f51]) ).

fof(f163,plain,
    ! [X0,X1] : sK1(X0) = sK6(X1,X0),
    inference(resolution,[],[f30,f44]) ).

fof(f175,plain,
    ! [X0,X1] : r3(X0,sK6(X0,X1),sK4(X0,X1)),
    inference(forward_demodulation,[],[f43,f42]) ).

fof(f179,plain,
    ! [X0,X1] : sK2(X0,X1) = sK7(X0,X1),
    inference(resolution,[],[f34,f40]) ).

fof(f181,plain,
    ! [X0] : sK2(X0,sK13(X0)) = X0,
    inference(resolution,[],[f34,f159]) ).

fof(f182,plain,
    ! [X0,X1] : sK4(X0,X1) = sK2(X0,sK6(X0,X1)),
    inference(resolution,[],[f34,f175]) ).

fof(f209,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ r2(X3,sK2(X5,X5))
      | ~ r1(X2)
      | ~ r2(X2,X0)
      | ~ r2(X1,X3)
      | ~ r2(sK1(X4),X5)
      | ~ r1(X4)
      | ~ r2(X0,X1) ),
    inference(resolution,[],[f118,f68]) ).

fof(f270,plain,
    ! [X0] : sK2(X0,sK0) = X0,
    inference(forward_demodulation,[],[f181,f127]) ).

fof(f380,plain,
    ! [X0,X1] : sK4(X0,X1) = sK2(X0,sK1(X1)),
    inference(forward_demodulation,[],[f182,f163]) ).

fof(f388,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ r2(X1,sK4(sK1(X0),X0))
      | ~ r1(X2)
      | ~ r2(X2,X3)
      | ~ r2(X4,X1)
      | ~ r2(sK1(X5),sK1(X0))
      | ~ r1(X5)
      | ~ r2(X3,X4) ),
    inference(superposition,[],[f209,f380]) ).

fof(f412,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r2(X2,sK7(sK1(X3),X3))
      | ~ r2(sK1(X4),sK1(X3))
      | ~ r1(X4)
      | ~ r2(X1,X2) ),
    inference(resolution,[],[f388,f41]) ).

fof(f417,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ r2(sK1(X4),sK1(X3))
      | ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r2(X2,sK2(sK1(X3),X3))
      | ~ r1(X4)
      | ~ r2(X1,X2) ),
    inference(forward_demodulation,[],[f412,f179]) ).

fof(f419,plain,
    ! [X2,X3,X0,X1] :
      ( ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r2(X2,sK2(sK1(sK1(X3)),sK1(X3)))
      | ~ r1(X3)
      | ~ r2(X1,X2) ),
    inference(resolution,[],[f417,f66]) ).

fof(f424,plain,
    ! [X2,X3,X0,X1] :
      ( ~ r2(X2,sK4(sK1(sK1(X3)),X3))
      | ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r1(X3)
      | ~ r2(X1,X2) ),
    inference(forward_demodulation,[],[f419,f380]) ).

fof(f425,plain,
    ! [X2,X0,X1] :
      ( ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r1(X2)
      | ~ r2(X1,sK7(sK1(sK1(X2)),X2)) ),
    inference(resolution,[],[f424,f41]) ).

fof(f429,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X1,sK2(sK1(sK1(X2)),X2))
      | ~ r1(X0)
      | ~ r2(X0,X1)
      | ~ r1(X2) ),
    inference(forward_demodulation,[],[f425,f179]) ).

fof(f435,plain,
    ! [X0,X1] :
      ( ~ r2(X0,sK1(sK1(sK0)))
      | ~ r1(X1)
      | ~ r2(X1,X0)
      | ~ r1(sK0) ),
    inference(superposition,[],[f429,f270]) ).

fof(f437,plain,
    ! [X0,X1] :
      ( ~ r2(X0,sK1(sK1(sK0)))
      | ~ r1(X1)
      | ~ r2(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f435,f64]) ).

fof(f438,plain,
    ! [X0] :
      ( ~ r2(X0,sK1(sK0))
      | ~ r1(X0) ),
    inference(resolution,[],[f437,f66]) ).

fof(f442,plain,
    ~ r1(sK0),
    inference(resolution,[],[f438,f66]) ).

fof(f443,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f442,f64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUN057+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  % Computer : n020.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 21:52:35 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.45  Running first-order theorem proving
% 0.13/0.45  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
% 4.19/1.47  % (3796133)Detected formulas, will run a generic FOF schedule.
% 4.19/1.47  % (3796150)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=540248311:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.19/1.47  % (3796147)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=4060501789:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.19/1.47  % (3796149)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3889155605:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.19/1.47  % (3796148)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=283625848:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.19/1.47  % (3796146)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=3672469267:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.19/1.47  % (3796151)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=711090025:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.19/1.47  % (3796149)Refutation not found, incomplete strategy
% 4.19/1.47  % (3796149)------------------------------
% 4.19/1.47  % (3796149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.47  % (3796149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.47  % (3796149)CaDiCaL version: 2.1.3
% 4.19/1.47  % (3796149)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.47  % (3796149)Time elapsed: 0.006 s
% 4.19/1.47  % (3796149)Peak memory usage: 88 MB
% 4.19/1.47  % (3796149)Instructions burned: 4 (million)
% 4.19/1.47  % (3796150)Instruction limit reached! 
% 4.19/1.47  % (3796150)------------------------------
% 4.19/1.47  % (3796150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.47  % (3796150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.47  % (3796150)CaDiCaL version: 2.1.3
% 4.19/1.47  % (3796150)Termination reason: Instruction limit
% 4.19/1.47  % (3796150)Termination phase: Saturation
% 4.19/1.47  % (3796150)Time elapsed: 0.072 s
% 4.19/1.47  % (3796150)Peak memory usage: 88 MB
% 4.19/1.47  % (3796150)Instructions burned: 119 (million)
% 4.19/1.47  % (3796152)dis-21_1_sil=8000:lcm=predicate:random_seed=2957168500: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)
% 4.19/1.47  % (3796151)First to succeed.
% 4.19/1.47  % (3796151)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3796133"
% 4.19/1.47  % (3796152)Instruction limit reached! 
% 4.19/1.47  % (3796152)------------------------------
% 4.19/1.47  % (3796152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.47  % (3796152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.47  % (3796152)CaDiCaL version: 2.1.3
% 4.19/1.47  % (3796152)Termination reason: Instruction limit
% 4.19/1.47  % (3796152)Termination phase: Saturation
% 4.19/1.47  % (3796152)Time elapsed: 0.109 s
% 4.19/1.47  % (3796152)Peak memory usage: 88 MB
% 4.19/1.47  % (3796152)Instructions burned: 129 (million)
% 4.19/1.47  % (3796163)lrs+10_1_sil=8000:sp=occurrence:random_seed=1870860918:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.19/1.48  % (3796165)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2728353712:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 4.19/1.48  % (3796163)Instruction limit reached! 
% 4.19/1.48  % (3796163)------------------------------
% 4.19/1.48  % (3796163)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.48  % (3796163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.48  % (3796163)CaDiCaL version: 2.1.3
% 4.19/1.48  % (3796163)Termination reason: Instruction limit
% 4.19/1.48  % (3796163)Termination phase: Saturation
% 4.19/1.48  % (3796163)Time elapsed: 0.141 s
% 4.19/1.48  % (3796163)Peak memory usage: 91 MB
% 4.19/1.48  % (3796163)Instructions burned: 286 (million)
% 4.19/1.48  % (3796165)Instruction limit reached! 
% 4.19/1.48  % (3796165)------------------------------
% 4.19/1.48  % (3796165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.48  % (3796165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.71  % (3796165)CaDiCaL version: 2.1.3
% 0.19/1.71  % (3796165)Termination reason: Instruction limit
% 0.19/1.71  % (3796165)Termination phase: Saturation
% 0.19/1.71  % (3796165)Time elapsed: 0.096 s
% 0.19/1.71  % (3796165)Peak memory usage: 91 MB
% 0.19/1.71  % (3796165)Instructions burned: 158 (million)
% 0.19/1.71  % (3796149)------------------------------
% 0.19/1.71  % (3796149)------------------------------
% 0.19/1.71  % (3796151)Refutation found. Thanks to Tanya!
% 0.19/1.71  % SZS status Theorem for theBenchmark
% 0.19/1.71  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/1.71  % (3796151)------------------------------
% 0.19/1.71  % (3796151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.71  % (3796151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.71  % (3796151)CaDiCaL version: 2.1.3
% 0.19/1.71  % (3796151)Termination reason: Refutation
% 0.19/1.71  % (3796151)Time elapsed: 0.034 s
% 0.19/1.71  % (3796151)Peak memory usage: 89 MB
% 0.19/1.71  % (3796151)Instructions burned: 29 (million)
% 0.19/1.71  % (3796151)------------------------------
% 0.19/1.71  % (3796151)------------------------------
% 0.19/1.71  % (3796133)Success in time 0.651 s
% 0.19/1.71  % Vampire exiting
%------------------------------------------------------------------------------