↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n007.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 01:03:11 PM UTC 2026

% Result   : Unsatisfiable 3.83s 1.34s
% Output   : Refutation 3.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   70 (  20 unt;   4 def)
%            Number of atoms       :  233 (  15 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  322 ( 159   ~; 159   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   11 (   9 usr;   5 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn  60   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f27,axiom,
    ! [X0] : ssList(skaf68(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).

fof(f28,axiom,
    ! [X0] : ssList(skaf67(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).

fof(f29,axiom,
    ! [X0] : ssList(skaf66(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).

fof(f30,axiom,
    ! [X0] : ssItem(skaf65(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).

fof(f31,axiom,
    ! [X0] : ssItem(skaf64(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).

fof(f91,axiom,
    ! [X0] :
      ( ~ leq(skaf64(X0),skaf65(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause91) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).

fof(f126,plain,
    ! [X0,X1] :
      ( cons(X0,X1) = app(cons(X0,nil),X1)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(reorient_equations,[],[f125]) ).

fof(f161,axiom,
    ! [X2,X0,X1] :
      ( app(app(X2,X1),X0) = app(X2,app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause149) ).

fof(f177,axiom,
    ! [X0] :
      ( app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause164) ).

fof(f189,axiom,
    ! [X2,X3,X0,X1] :
      ( app(X0,cons(X1,X2)) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | memberP(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause175) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f208,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk3
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f209,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(app(X1,cons(X0,nil)),X2)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssItem(X0)
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X1,X3) ),
    inference(reorient_equations,[],[f208]) ).

fof(f210,negated_conjecture,
    ~ totalorderedP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f211,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X0,cons(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f189]) ).

fof(f220,plain,
    ~ totalorderedP(sk3),
    inference(superposition,[],[f210,f205]) ).

fof(f236,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(X0,app(cons(X1,nil),X2))
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X3)
      | leq(X3,X1)
      | ~ memberP(X0,X3)
      | ~ ssList(cons(X1,nil))
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(superposition,[],[f209,f161]) ).

fof(f238,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(X0,app(cons(X1,nil),X2))
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X3)
      | leq(X3,X1)
      | ~ memberP(X0,X3)
      | ~ ssList(cons(X1,nil)) ),
    inference(duplicate_literal_removal,[],[f236]) ).

fof(f331,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(X2,cons(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X2,X3)
      | ~ ssList(cons(X0,nil))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f238,f126]) ).

fof(f338,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(X2,cons(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X2,X3)
      | ~ ssList(cons(X0,nil)) ),
    inference(duplicate_literal_removal,[],[f331]) ).

fof(f375,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))))
      | ~ ssList(skaf68(X0))
      | ~ ssItem(skaf65(X0))
      | ~ ssItem(X1)
      | leq(X1,skaf65(X0))
      | ~ memberP(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),X1)
      | ~ ssList(cons(skaf65(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f338,f177]) ).

fof(f379,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))))
      | ~ ssItem(skaf65(X0))
      | ~ ssItem(X1)
      | leq(X1,skaf65(X0))
      | ~ memberP(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),X1)
      | ~ ssList(cons(skaf65(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f375,f27]) ).

fof(f385,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))))
      | ~ ssItem(X1)
      | leq(X1,skaf65(X0))
      | ~ memberP(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),X1)
      | ~ ssList(cons(skaf65(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f379,f30]) ).

fof(f422,definition,
    ( spl0_5
  <=> ssList(cons(skaf65(sk3),nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f423,plain,
    ( ~ ssList(cons(skaf65(sk3),nil))
    | spl0_5 ),
    inference(avatar_component_clause,[],[f422]) ).

fof(f428,definition,
    ( spl0_7
  <=> ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f429,plain,
    ( ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | spl0_7 ),
    inference(avatar_component_clause,[],[f428]) ).

fof(f454,plain,
    ( ~ ssList(nil)
    | ~ ssItem(skaf65(sk3))
    | spl0_5 ),
    inference(resolution,[],[f423,f86]) ).

fof(f455,plain,
    ( ~ ssItem(skaf65(sk3))
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f454,f8]) ).

fof(f456,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f455,f30]) ).

fof(f457,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f456]) ).

fof(f458,plain,
    ( ~ ssList(skaf66(sk3))
    | ~ ssList(cons(skaf64(sk3),skaf67(sk3)))
    | spl0_7 ),
    inference(resolution,[],[f429,f85]) ).

fof(f459,plain,
    ( ~ ssList(cons(skaf64(sk3),skaf67(sk3)))
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f458,f29]) ).

fof(f460,plain,
    ( ~ ssList(skaf67(sk3))
    | ~ ssItem(skaf64(sk3))
    | spl0_7 ),
    inference(resolution,[],[f459,f86]) ).

fof(f461,plain,
    ( ~ ssItem(skaf64(sk3))
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f460,f28]) ).

fof(f462,plain,
    ( $false
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f461,f31]) ).

fof(f463,plain,
    spl0_7,
    inference(avatar_contradiction_clause,[],[f462]) ).

fof(f493,plain,
    ! [X0] :
      ( ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
      | ~ ssItem(X0)
      | leq(X0,skaf65(sk3))
      | ~ memberP(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),X0)
      | ~ ssList(cons(skaf65(sk3),nil))
      | totalorderedP(sk3)
      | ~ ssList(sk3) ),
    inference(equality_resolution,[],[f385]) ).

fof(f494,plain,
    ! [X0] :
      ( ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
      | ~ ssItem(X0)
      | leq(X0,skaf65(sk3))
      | ~ memberP(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),X0)
      | ~ ssList(cons(skaf65(sk3),nil))
      | ~ ssList(sk3) ),
    inference(forward_subsumption_resolution,[],[f493,f220]) ).

fof(f495,plain,
    ! [X0] :
      ( ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
      | ~ ssItem(X0)
      | leq(X0,skaf65(sk3))
      | ~ memberP(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),X0)
      | ~ ssList(cons(skaf65(sk3),nil)) ),
    inference(forward_subsumption_resolution,[],[f494,f202]) ).

fof(f497,definition,
    ( spl0_8
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ memberP(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),X0)
        | leq(X0,skaf65(sk3)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f498,plain,
    ( ! [X0] :
        ( ~ memberP(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),X0)
        | ~ ssItem(X0)
        | leq(X0,skaf65(sk3)) )
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f497]) ).

fof(f499,plain,
    ( ~ spl0_5
    | spl0_8
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f495,f428,f497,f422]) ).

fof(f500,plain,
    ( ~ ssItem(skaf64(sk3))
    | leq(skaf64(sk3),skaf65(sk3))
    | ~ ssList(skaf66(sk3))
    | ~ ssItem(skaf64(sk3))
    | ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | ~ ssList(skaf67(sk3))
    | ~ spl0_8 ),
    inference(resolution,[],[f498,f211]) ).

fof(f505,plain,
    ( ~ ssItem(skaf64(sk3))
    | leq(skaf64(sk3),skaf65(sk3))
    | ~ ssList(skaf66(sk3))
    | ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | ~ ssList(skaf67(sk3))
    | ~ spl0_8 ),
    inference(duplicate_literal_removal,[],[f500]) ).

fof(f508,plain,
    ( leq(skaf64(sk3),skaf65(sk3))
    | ~ ssList(skaf66(sk3))
    | ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | ~ ssList(skaf67(sk3))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f505,f31]) ).

fof(f520,plain,
    ( leq(skaf64(sk3),skaf65(sk3))
    | ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | ~ ssList(skaf67(sk3))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f508,f29]) ).

fof(f521,plain,
    ( leq(skaf64(sk3),skaf65(sk3))
    | ~ ssList(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f520,f28]) ).

fof(f523,definition,
    ( spl0_12
  <=> leq(skaf64(sk3),skaf65(sk3)) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f524,plain,
    ( leq(skaf64(sk3),skaf65(sk3))
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f523]) ).

fof(f525,plain,
    ( ~ spl0_7
    | spl0_12
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f521,f497,f523,f428]) ).

fof(f531,plain,
    ( ~ ssList(sk3)
    | totalorderedP(sk3)
    | ~ spl0_12 ),
    inference(resolution,[],[f524,f91]) ).

fof(f536,plain,
    ( totalorderedP(sk3)
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f531,f202]) ).

fof(f539,plain,
    ( $false
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f536,f220]) ).

fof(f540,plain,
    ~ spl0_12,
    inference(avatar_contradiction_clause,[],[f539]) ).

cnf(s6,plain,
    spl0_5,
    inference(sat_conversion,[],[f457]) ).

cnf(s7,plain,
    spl0_7,
    inference(sat_conversion,[],[f463]) ).

cnf(s8,plain,
    ( ~ spl0_5
    | ~ spl0_7
    | spl0_8 ),
    inference(sat_conversion,[],[f499]) ).

cnf(s11,plain,
    ( ~ spl0_7
    | ~ spl0_8
    | spl0_12 ),
    inference(sat_conversion,[],[f525]) ).

cnf(s12,plain,
    ~ spl0_12,
    inference(sat_conversion,[],[f540]) ).

cnf(s14,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(rat,[],[s11,s12]) ).

cnf(s15,plain,
    ~ spl0_8,
    inference(rat,[],[s14,s7]) ).

cnf(s16,plain,
    ~ spl0_5,
    inference(rat,[],[s8,s15,s7]) ).

cnf(s17,plain,
    $false,
    inference(rat,[],[s6,s16]) ).

fof(f548,plain,
    $false,
    inference(avatar_sat_refutation,[],[s17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC263-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17  % Computer : n007.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Mon Sep 28 08:43:40 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running first-order theorem proving
% 0.07/0.21  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
% 3.00/1.12  % (2250471)Input is clausal, will run a generic CNF schedule.
% 3.00/1.12  % (2250479)lrs+10_1_sil=8000:sp=occurrence:random_seed=3300935273:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.00/1.12  % (2250479)Instruction limit reached! 
% 3.00/1.12  % (2250479)------------------------------
% 3.00/1.12  % (2250479)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.12  % (2250479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.12  % (2250479)CaDiCaL version: 2.1.3
% 3.00/1.12  % (2250479)Termination reason: Instruction limit
% 3.00/1.12  % (2250479)Termination phase: Saturation
% 3.00/1.12  % (2250479)Time elapsed: 0.036 s
% 3.00/1.12  % (2250479)Peak memory usage: 90 MB
% 3.00/1.12  % (2250479)Instructions burned: 109 (million)
% 3.00/1.12  % (2250481)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3925098974:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.00/1.12  % (2250480)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2387452997:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.00/1.12  % (2250478)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1125688144:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.00/1.12  % (2250476)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=1663860784:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.00/1.12  % (2250482)dis-21_1_sil=8000:lcm=predicate:random_seed=3182741288:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.00/1.12  % (2250477)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2832102452:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.00/1.12  % (2250482)Instruction limit reached! 
% 3.00/1.12  % (2250482)------------------------------
% 3.00/1.12  % (2250482)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.12  % (2250482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.12  % (2250482)CaDiCaL version: 2.1.3
% 3.00/1.12  % (2250482)Termination reason: Instruction limit
% 3.00/1.12  % (2250482)Termination phase: Saturation
% 3.00/1.12  % (2250482)Time elapsed: 0.052 s
% 3.00/1.12  % (2250482)Peak memory usage: 89 MB
% 3.00/1.12  % (2250482)Instructions burned: 119 (million)
% 3.00/1.12  % (2250480)Instruction limit reached! 
% 3.00/1.12  % (2250480)------------------------------
% 3.00/1.12  % (2250480)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.12  % (2250480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.12  % (2250480)CaDiCaL version: 2.1.3
% 3.00/1.12  % (2250480)Termination reason: Instruction limit
% 3.00/1.12  % (2250480)Termination phase: Saturation
% 3.00/1.12  % (2250480)Time elapsed: 0.057 s
% 3.00/1.12  % (2250480)Peak memory usage: 88 MB
% 3.00/1.12  % (2250480)Instructions burned: 116 (million)
% 3.00/1.12  % (2250484)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=208564060:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.00/1.12  % (2250481)Instruction limit reached! 
% 3.00/1.12  % (2250481)------------------------------
% 3.00/1.12  % (2250481)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.12  % (2250481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.12  % (2250481)CaDiCaL version: 2.1.3
% 3.00/1.12  % (2250481)Termination reason: Instruction limit
% 3.00/1.12  % (2250481)Termination phase: Saturation
% 3.00/1.12  % (2250481)Time elapsed: 0.120 s
% 3.00/1.12  % (2250481)Peak memory usage: 90 MB
% 3.00/1.12  % (2250481)Instructions burned: 180 (million)
% 3.00/1.12  % (2250484)First to succeed.
% 3.00/1.12  % (2250484)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2250471"
% 3.00/1.12  % (2250492)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4160299500:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.00/1.12  % (2250491)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3192374352:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.00/1.12  % (2250484)Refutation found. Thanks to Tanya!
% 3.83/1.34  % SZS status Unsatisfiable for theBenchmark
% 3.83/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 3.83/1.34  % (2250484)------------------------------
% 3.83/1.34  % (2250484)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.83/1.34  % (2250484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.83/1.34  % (2250484)CaDiCaL version: 2.1.3
% 3.83/1.34  % (2250484)Termination reason: Refutation
% 3.83/1.34  % (2250484)Time elapsed: 0.009 s
% 3.83/1.34  % (2250484)Peak memory usage: 89 MB
% 3.83/1.34  % (2250484)Instructions burned: 23 (million)
% 3.83/1.34  % (2250484)------------------------------
% 3.83/1.34  % (2250484)------------------------------
% 3.83/1.34  % (2250471)Success in time 0.453 s
% 3.83/1.34  % Vampire exiting
%------------------------------------------------------------------------------