↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n012.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:48 PM UTC 2026

% Result   : Unsatisfiable 1.61s 0.60s
% Output   : Refutation 2.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   96 (  21 unt;   9 def)
%            Number of atoms       :  273 (  21 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  339 ( 162   ~; 168   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  29   !;   0   ?)

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

fof(f71,axiom,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause71) ).

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

fof(f101,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

fof(f151,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause140) ).

fof(f152,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X2,X0),X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause141) ).

fof(f170,axiom,
    ! [X2,X0,X1] :
      ( ~ memberP(app(X0,X1),X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssItem(X2)
      | memberP(X1,X2)
      | memberP(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause158) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

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

fof(f206,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    memberP(sk1,sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ~ memberP(sk2,sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( ssItem(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f212,negated_conjecture,
    ( app(cons(sk6,nil),sk7) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f213,plain,
    ( sk3 = app(cons(sk6,nil),sk7)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f212]) ).

fof(f214,negated_conjecture,
    ( app(sk7,cons(sk6,nil)) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f215,plain,
    ( sk4 = app(sk7,cons(sk6,nil))
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f214]) ).

fof(f218,plain,
    memberP(sk3,sk5),
    inference(definition_unfolding,[],[f207,f205]) ).

fof(f219,plain,
    ~ memberP(sk4,sk5),
    inference(definition_unfolding,[],[f208,f204]) ).

fof(f231,definition,
    ( spl0_1
  <=> neq(sk4,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f233,plain,
    ( ~ neq(sk4,nil)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f231]) ).

fof(f235,definition,
    ( spl0_2
  <=> sk4 = app(sk7,cons(sk6,nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f237,plain,
    ( sk4 = app(sk7,cons(sk6,nil))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f235]) ).

fof(f238,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f215,f235,f231]) ).

fof(f240,definition,
    ( spl0_3
  <=> sk3 = app(cons(sk6,nil),sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f242,plain,
    ( sk3 = app(cons(sk6,nil),sk7)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f240]) ).

fof(f243,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f213,f240,f231]) ).

fof(f245,definition,
    ( spl0_4
  <=> ssList(sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f247,plain,
    ( ssList(sk7)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f248,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f211,f245,f231]) ).

fof(f250,definition,
    ( spl0_5
  <=> ssItem(sk6) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f252,plain,
    ( ssItem(sk6)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f253,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f210,f250,f231]) ).

fof(f255,definition,
    ( spl0_6
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f257,plain,
    ( nil != sk4
    | spl0_6 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f259,definition,
    ( spl0_7
  <=> nil = sk3 ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f261,plain,
    ( nil = sk3
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f262,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f209,f259,f255]) ).

fof(f279,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil = sk4
    | spl0_1 ),
    inference(resolution,[],[f102,f233]) ).

fof(f284,plain,
    ( ~ ssList(nil)
    | nil = sk4
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f279,f203]) ).

fof(f285,plain,
    ( nil = sk4
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f284,f8]) ).

fof(f286,plain,
    ( $false
    | spl0_1
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f285,f257]) ).

fof(f287,plain,
    ( spl0_1
    | spl0_6 ),
    inference(avatar_contradiction_clause,[],[f286]) ).

fof(f295,plain,
    ( memberP(nil,sk5)
    | ~ spl0_7 ),
    inference(superposition,[],[f218,f261]) ).

fof(f302,plain,
    ( ~ ssItem(sk5)
    | ~ spl0_7 ),
    inference(resolution,[],[f295,f71]) ).

fof(f303,plain,
    ( $false
    | ~ spl0_7 ),
    inference(forward_subsumption_resolution,[],[f302,f206]) ).

fof(f304,plain,
    ~ spl0_7,
    inference(avatar_contradiction_clause,[],[f303]) ).

fof(f338,plain,
    ( ! [X0] :
        ( memberP(sk4,X0)
        | ~ ssList(cons(sk6,nil))
        | ~ ssList(sk7)
        | ~ ssItem(X0)
        | ~ memberP(sk7,X0) )
    | ~ spl0_2 ),
    inference(superposition,[],[f151,f237]) ).

fof(f345,plain,
    ( ! [X0] :
        ( memberP(sk4,X0)
        | ~ ssList(cons(sk6,nil))
        | ~ ssItem(X0)
        | ~ memberP(sk7,X0) )
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f338,f247]) ).

fof(f347,definition,
    ( spl0_8
  <=> ssList(cons(sk6,nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f348,plain,
    ( ssList(cons(sk6,nil))
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f347]) ).

fof(f349,plain,
    ( ~ ssList(cons(sk6,nil))
    | spl0_8 ),
    inference(avatar_component_clause,[],[f347]) ).

fof(f355,definition,
    ( spl0_10
  <=> ! [X0] :
        ( memberP(sk4,X0)
        | ~ memberP(sk7,X0)
        | ~ ssItem(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f356,plain,
    ( ! [X0] :
        ( ~ memberP(sk7,X0)
        | memberP(sk4,X0)
        | ~ ssItem(X0) )
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f355]) ).

fof(f357,plain,
    ( ~ spl0_8
    | spl0_10
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f345,f245,f235,f355,f347]) ).

fof(f358,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sk6)
    | spl0_8 ),
    inference(resolution,[],[f349,f86]) ).

fof(f359,plain,
    ( ~ ssItem(sk6)
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f358,f8]) ).

fof(f360,plain,
    ( $false
    | ~ spl0_5
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f359,f252]) ).

fof(f361,plain,
    ( ~ spl0_5
    | spl0_8 ),
    inference(avatar_contradiction_clause,[],[f360]) ).

fof(f367,plain,
    ( ! [X0] :
        ( memberP(sk4,X0)
        | ~ ssList(cons(sk6,nil))
        | ~ ssList(sk7)
        | ~ ssItem(X0)
        | ~ memberP(cons(sk6,nil),X0) )
    | ~ spl0_2 ),
    inference(superposition,[],[f152,f237]) ).

fof(f374,plain,
    ( ! [X0] :
        ( memberP(sk4,X0)
        | ~ ssList(sk7)
        | ~ ssItem(X0)
        | ~ memberP(cons(sk6,nil),X0) )
    | ~ spl0_2
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f367,f348]) ).

fof(f376,plain,
    ( ! [X0] :
        ( ~ memberP(cons(sk6,nil),X0)
        | ~ ssItem(X0)
        | memberP(sk4,X0) )
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f374,f247]) ).

fof(f535,plain,
    ( ! [X0] :
        ( ~ memberP(sk3,X0)
        | ~ ssList(sk7)
        | ~ ssList(cons(sk6,nil))
        | ~ ssItem(X0)
        | memberP(sk7,X0)
        | memberP(cons(sk6,nil),X0) )
    | ~ spl0_3 ),
    inference(superposition,[],[f170,f242]) ).

fof(f539,plain,
    ( ! [X0] :
        ( ~ memberP(sk3,X0)
        | ~ ssList(cons(sk6,nil))
        | ~ ssItem(X0)
        | memberP(sk7,X0)
        | memberP(cons(sk6,nil),X0) )
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f535,f247]) ).

fof(f541,plain,
    ( ! [X0] :
        ( memberP(cons(sk6,nil),X0)
        | ~ ssItem(X0)
        | memberP(sk7,X0)
        | ~ memberP(sk3,X0) )
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f539,f348]) ).

fof(f754,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sk7,X0)
        | ~ memberP(sk3,X0)
        | ~ ssItem(X0)
        | memberP(sk4,X0) )
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(resolution,[],[f541,f376]) ).

fof(f757,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | memberP(sk7,X0)
        | ~ memberP(sk3,X0)
        | memberP(sk4,X0) )
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(duplicate_literal_removal,[],[f754]) ).

fof(f759,plain,
    ( ! [X0] :
        ( ~ memberP(sk3,X0)
        | ~ ssItem(X0)
        | memberP(sk4,X0) )
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f757,f356]) ).

fof(f797,plain,
    ( ~ ssItem(sk5)
    | memberP(sk4,sk5)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(resolution,[],[f759,f218]) ).

fof(f799,plain,
    ( memberP(sk4,sk5)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f797,f206]) ).

fof(f800,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f799,f219]) ).

fof(f801,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(avatar_contradiction_clause,[],[f800]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f238]) ).

cnf(s2,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f243]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f253]) ).

cnf(s5,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(sat_conversion,[],[f262]) ).

cnf(s6,plain,
    ( spl0_1
    | spl0_6 ),
    inference(sat_conversion,[],[f287]) ).

cnf(s8,plain,
    ~ spl0_7,
    inference(sat_conversion,[],[f304]) ).

cnf(s10,plain,
    ( ~ spl0_2
    | ~ spl0_4
    | ~ spl0_8
    | spl0_10 ),
    inference(sat_conversion,[],[f357]) ).

cnf(s11,plain,
    ( ~ spl0_5
    | spl0_8 ),
    inference(sat_conversion,[],[f361]) ).

cnf(s23,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(sat_conversion,[],[f801]) ).

cnf(s26,plain,
    ~ spl0_6,
    inference(rat,[],[s5,s8]) ).

cnf(s28,plain,
    spl0_1,
    inference(rat,[],[s6,s26]) ).

cnf(s29,plain,
    spl0_5,
    inference(rat,[],[s4,s28]) ).

cnf(s30,plain,
    spl0_8,
    inference(rat,[],[s11,s29]) ).

cnf(s31,plain,
    spl0_4,
    inference(rat,[],[s3,s28]) ).

cnf(s32,plain,
    spl0_3,
    inference(rat,[],[s2,s28]) ).

cnf(s34,plain,
    spl0_2,
    inference(rat,[],[s1,s28]) ).

cnf(s35,plain,
    ~ spl0_10,
    inference(rat,[],[s23,s32,s30,s31,s34]) ).

cnf(s36,plain,
    $false,
    inference(rat,[],[s10,s31,s30,s35,s34]) ).

fof(f802,plain,
    $false,
    inference(avatar_sat_refutation,[],[s36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWC397-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Mon Sep 28 09:27:19 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.00/0.11  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.12  Running first-order theorem proving
% 0.08/0.12  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
% 1.61/0.60  % (3257050)Input is clausal, will run a generic CNF schedule.
% 1.61/0.60  % (3257057)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3745151367:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.61/0.60  % (3257058)lrs+10_1_sil=8000:sp=occurrence:random_seed=1107202715:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.61/0.60  % (3257056)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4062180707:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.61/0.60  % (3257059)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2228954327:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.61/0.60  % (3257055)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=1255045805:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.61/0.60  % (3257061)dis-21_1_sil=8000:lcm=predicate:random_seed=2125656972: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)
% 1.61/0.60  % (3257060)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=661373347:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.61/0.60  % (3257058)First to succeed.
% 1.61/0.60  % (3257058)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3257050"
% 1.61/0.60  % (3257061)Instruction limit reached! 
% 1.61/0.60  % (3257061)------------------------------
% 1.61/0.60  % (3257061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.61/0.60  % (3257061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.60  % (3257061)CaDiCaL version: 2.1.3
% 1.61/0.60  % (3257061)Termination reason: Instruction limit
% 1.61/0.60  % (3257061)Termination phase: Saturation
% 1.61/0.60  % (3257061)Time elapsed: 0.034 s
% 1.61/0.60  % (3257061)Peak memory usage: 89 MB
% 1.61/0.60  % (3257061)Instructions burned: 117 (million)
% 1.61/0.60  % (3257059)Instruction limit reached! 
% 1.61/0.60  % (3257059)------------------------------
% 1.61/0.60  % (3257059)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.61/0.60  % (3257059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.60  % (3257059)CaDiCaL version: 2.1.3
% 1.61/0.60  % (3257059)Termination reason: Instruction limit
% 1.61/0.60  % (3257059)Termination phase: Saturation
% 1.61/0.60  % (3257059)Time elapsed: 0.036 s
% 1.61/0.60  % (3257059)Peak memory usage: 89 MB
% 1.61/0.60  % (3257059)Instructions burned: 115 (million)
% 1.61/0.60  % (3257060)Instruction limit reached! 
% 1.61/0.60  % (3257060)------------------------------
% 1.61/0.60  % (3257060)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.61/0.60  % (3257060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/0.60  % (3257060)CaDiCaL version: 2.1.3
% 1.61/0.60  % (3257060)Termination reason: Instruction limit
% 1.61/0.60  % (3257060)Termination phase: Saturation
% 1.61/0.60  % (3257060)Time elapsed: 0.066 s
% 1.61/0.60  % (3257060)Peak memory usage: 90 MB
% 1.61/0.60  % (3257060)Instructions burned: 182 (million)
% 1.61/0.60  % (3257069)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=4274366858:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 1.61/0.60  % (3257070)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2080773755:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2998 on theBenchmark for (2998ds/189Mi)
% 1.61/0.60  % (3257069)Also succeeded, but the first one will report.
% 1.61/0.60  % (3257071)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3196378043:st=4:i=219:sd=3:ss=axioms_2998 on theBenchmark for (2998ds/219Mi)
% 1.61/0.60  % (3257071)Also succeeded, but the first one will report.
% 1.61/0.60  % (3257058)Refutation found. Thanks to Tanya!
% 1.61/0.60  % SZS status Unsatisfiable for theBenchmark
% 1.61/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 2.14/0.69  % (3257058)------------------------------
% 2.14/0.69  % (3257058)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.14/0.69  % (3257058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.14/0.69  % (3257058)CaDiCaL version: 2.1.3
% 2.14/0.69  % (3257058)Termination reason: Refutation
% 2.14/0.69  % (3257058)Time elapsed: 0.008 s
% 2.14/0.69  % (3257058)Peak memory usage: 89 MB
% 2.14/0.69  % (3257058)Instructions burned: 21 (million)
% 2.14/0.69  % (3257058)------------------------------
% 2.14/0.69  % (3257058)------------------------------
% 2.14/0.69  % (3257050)Success in time 0.282 s
% 2.14/0.69  % Vampire exiting
%------------------------------------------------------------------------------