↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC290-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 : n015.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:18 PM UTC 2026

% Result   : Unsatisfiable 3.95s 1.34s
% Output   : Refutation 3.95s
% 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/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f22,axiom,
    ! [X0] : ssList(skaf73(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).

fof(f23,axiom,
    ! [X0] : ssList(skaf72(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).

fof(f24,axiom,
    ! [X0] : ssList(skaf71(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).

fof(f25,axiom,
    ! [X0] : ssItem(skaf70(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).

fof(f26,axiom,
    ! [X0] : ssItem(skaf69(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).

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

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

fof(f90,axiom,
    ! [X0] :
      ( ~ lt(skaf69(X0),skaf70(X0))
      | ~ ssList(X0)
      | strictorderedP(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause90) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',clause149) ).

fof(f176,axiom,
    ! [X0] :
      ( app(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))),cons(skaf70(X0),skaf73(X0))) = X0
      | strictorderedP(X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause163) ).

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/sandbox/benchmark/theBenchmark.p',clause175) ).

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

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/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)
      | lt(X3,X0)
      | ~ memberP(X1,X3) ),
    file('/export/starexec/sandbox/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)
      | lt(X3,X0)
      | ~ memberP(X1,X3) ),
    inference(reorient_equations,[],[f208]) ).

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

fof(f212,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(f222,plain,
    ~ strictorderedP(sk3),
    inference(superposition,[],[f210,f205]) ).

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

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

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

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

fof(f377,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))))
      | ~ ssList(skaf73(X0))
      | ~ ssItem(skaf70(X0))
      | ~ ssItem(X1)
      | lt(X1,skaf70(X0))
      | ~ memberP(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))),X1)
      | ~ ssList(cons(skaf70(X0),nil))
      | strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f340,f176]) ).

fof(f381,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))))
      | ~ ssItem(skaf70(X0))
      | ~ ssItem(X1)
      | lt(X1,skaf70(X0))
      | ~ memberP(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))),X1)
      | ~ ssList(cons(skaf70(X0),nil))
      | strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f377,f22]) ).

fof(f387,plain,
    ! [X0,X1] :
      ( sk3 != X0
      | ~ ssList(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))))
      | ~ ssItem(X1)
      | lt(X1,skaf70(X0))
      | ~ memberP(app(skaf71(X0),cons(skaf69(X0),skaf72(X0))),X1)
      | ~ ssList(cons(skaf70(X0),nil))
      | strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f381,f25]) ).

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

fof(f425,plain,
    ( ~ ssList(cons(skaf70(sk3),nil))
    | spl0_5 ),
    inference(avatar_component_clause,[],[f424]) ).

fof(f430,definition,
    ( spl0_7
  <=> ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f431,plain,
    ( ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | spl0_7 ),
    inference(avatar_component_clause,[],[f430]) ).

fof(f456,plain,
    ( ~ ssList(nil)
    | ~ ssItem(skaf70(sk3))
    | spl0_5 ),
    inference(resolution,[],[f425,f86]) ).

fof(f457,plain,
    ( ~ ssItem(skaf70(sk3))
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f456,f8]) ).

fof(f458,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f457,f25]) ).

fof(f459,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f458]) ).

fof(f460,plain,
    ( ~ ssList(skaf71(sk3))
    | ~ ssList(cons(skaf69(sk3),skaf72(sk3)))
    | spl0_7 ),
    inference(resolution,[],[f431,f85]) ).

fof(f461,plain,
    ( ~ ssList(cons(skaf69(sk3),skaf72(sk3)))
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f460,f24]) ).

fof(f462,plain,
    ( ~ ssList(skaf72(sk3))
    | ~ ssItem(skaf69(sk3))
    | spl0_7 ),
    inference(resolution,[],[f461,f86]) ).

fof(f463,plain,
    ( ~ ssItem(skaf69(sk3))
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f462,f23]) ).

fof(f464,plain,
    ( $false
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f463,f26]) ).

fof(f465,plain,
    spl0_7,
    inference(avatar_contradiction_clause,[],[f464]) ).

fof(f495,plain,
    ! [X0] :
      ( ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
      | ~ ssItem(X0)
      | lt(X0,skaf70(sk3))
      | ~ memberP(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))),X0)
      | ~ ssList(cons(skaf70(sk3),nil))
      | strictorderedP(sk3)
      | ~ ssList(sk3) ),
    inference(equality_resolution,[],[f387]) ).

fof(f496,plain,
    ! [X0] :
      ( ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
      | ~ ssItem(X0)
      | lt(X0,skaf70(sk3))
      | ~ memberP(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))),X0)
      | ~ ssList(cons(skaf70(sk3),nil))
      | ~ ssList(sk3) ),
    inference(forward_subsumption_resolution,[],[f495,f222]) ).

fof(f497,plain,
    ! [X0] :
      ( ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
      | ~ ssItem(X0)
      | lt(X0,skaf70(sk3))
      | ~ memberP(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))),X0)
      | ~ ssList(cons(skaf70(sk3),nil)) ),
    inference(forward_subsumption_resolution,[],[f496,f202]) ).

fof(f499,definition,
    ( spl0_8
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ memberP(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))),X0)
        | lt(X0,skaf70(sk3)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f500,plain,
    ( ! [X0] :
        ( ~ memberP(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))),X0)
        | ~ ssItem(X0)
        | lt(X0,skaf70(sk3)) )
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f499]) ).

fof(f501,plain,
    ( ~ spl0_5
    | spl0_8
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f497,f430,f499,f424]) ).

fof(f502,plain,
    ( ~ ssItem(skaf69(sk3))
    | lt(skaf69(sk3),skaf70(sk3))
    | ~ ssList(skaf71(sk3))
    | ~ ssItem(skaf69(sk3))
    | ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | ~ ssList(skaf72(sk3))
    | ~ spl0_8 ),
    inference(resolution,[],[f500,f212]) ).

fof(f507,plain,
    ( ~ ssItem(skaf69(sk3))
    | lt(skaf69(sk3),skaf70(sk3))
    | ~ ssList(skaf71(sk3))
    | ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | ~ ssList(skaf72(sk3))
    | ~ spl0_8 ),
    inference(duplicate_literal_removal,[],[f502]) ).

fof(f510,plain,
    ( lt(skaf69(sk3),skaf70(sk3))
    | ~ ssList(skaf71(sk3))
    | ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | ~ ssList(skaf72(sk3))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f507,f26]) ).

fof(f522,plain,
    ( lt(skaf69(sk3),skaf70(sk3))
    | ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | ~ ssList(skaf72(sk3))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f510,f24]) ).

fof(f523,plain,
    ( lt(skaf69(sk3),skaf70(sk3))
    | ~ ssList(app(skaf71(sk3),cons(skaf69(sk3),skaf72(sk3))))
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f522,f23]) ).

fof(f525,definition,
    ( spl0_12
  <=> lt(skaf69(sk3),skaf70(sk3)) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f526,plain,
    ( lt(skaf69(sk3),skaf70(sk3))
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f525]) ).

fof(f527,plain,
    ( ~ spl0_7
    | spl0_12
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f523,f499,f525,f430]) ).

fof(f533,plain,
    ( ~ ssList(sk3)
    | strictorderedP(sk3)
    | ~ spl0_12 ),
    inference(resolution,[],[f526,f90]) ).

fof(f542,plain,
    ( strictorderedP(sk3)
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f533,f202]) ).

fof(f547,plain,
    ( $false
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f542,f222]) ).

fof(f548,plain,
    ~ spl0_12,
    inference(avatar_contradiction_clause,[],[f547]) ).

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

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

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

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

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

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

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

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

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

fof(f549,plain,
    $false,
    inference(avatar_sat_refutation,[],[s16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC290-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.19  % Computer : n015.cluster.edu
% 0.11/0.19  % Model    : x86_64 x86_64
% 0.11/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19  % Memory   : 8046.5625MB
% 0.11/0.19  % OS       : Linux 6.8.0-71-generic
% 0.11/0.19  % CPULimit : 300
% 0.11/0.19  % WCLimit  : 300
% 0.11/0.19  % DateTime : Mon Sep 28 08:57:02 UTC 2026
% 0.11/0.19  % CPUTime  : 
% 0.11/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.23  Running first-order theorem proving
% 0.11/0.23  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
% 3.40/1.14  % (2482177)Input is clausal, will run a generic CNF schedule.
% 3.40/1.14  % (2482185)lrs+10_1_sil=8000:sp=occurrence:random_seed=1870744891:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.40/1.14  % (2482185)Instruction limit reached! 
% 3.40/1.14  % (2482185)------------------------------
% 3.40/1.14  % (2482185)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.14  % (2482185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.14  % (2482185)CaDiCaL version: 2.1.3
% 3.40/1.14  % (2482185)Termination reason: Instruction limit
% 3.40/1.14  % (2482185)Termination phase: Saturation
% 3.40/1.14  % (2482185)Time elapsed: 0.036 s
% 3.40/1.14  % (2482185)Peak memory usage: 90 MB
% 3.40/1.14  % (2482185)Instructions burned: 109 (million)
% 3.40/1.14  % (2482188)dis-21_1_sil=8000:lcm=predicate:random_seed=1102534692: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.40/1.14  % (2482182)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=2474781053:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.40/1.14  % (2482186)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2766125539:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.40/1.14  % (2482184)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=855617268:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.40/1.14  % (2482187)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3988409798:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.40/1.14  % (2482183)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=119659892:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.40/1.14  % (2482188)Instruction limit reached! 
% 3.40/1.14  % (2482188)------------------------------
% 3.40/1.14  % (2482188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.14  % (2482188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.14  % (2482188)CaDiCaL version: 2.1.3
% 3.40/1.14  % (2482188)Termination reason: Instruction limit
% 3.40/1.14  % (2482188)Termination phase: Saturation
% 3.40/1.14  % (2482188)Time elapsed: 0.052 s
% 3.40/1.14  % (2482188)Peak memory usage: 89 MB
% 3.40/1.14  % (2482188)Instructions burned: 118 (million)
% 3.40/1.14  % (2482186)Instruction limit reached! 
% 3.40/1.14  % (2482186)------------------------------
% 3.40/1.14  % (2482186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.14  % (2482186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.14  % (2482186)CaDiCaL version: 2.1.3
% 3.40/1.14  % (2482186)Termination reason: Instruction limit
% 3.40/1.14  % (2482186)Termination phase: Saturation
% 3.40/1.14  % (2482186)Time elapsed: 0.058 s
% 3.40/1.14  % (2482186)Peak memory usage: 88 MB
% 3.40/1.14  % (2482186)Instructions burned: 117 (million)
% 3.40/1.14  % (2482187)Instruction limit reached! 
% 3.40/1.14  % (2482187)------------------------------
% 3.40/1.14  % (2482187)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.14  % (2482187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.14  % (2482187)CaDiCaL version: 2.1.3
% 3.40/1.14  % (2482187)Termination reason: Instruction limit
% 3.40/1.14  % (2482187)Termination phase: Saturation
% 3.40/1.14  % (2482187)Time elapsed: 0.122 s
% 3.40/1.14  % (2482187)Peak memory usage: 90 MB
% 3.40/1.14  % (2482187)Instructions burned: 181 (million)
% 3.40/1.14  % (2482190)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=2589364121:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.40/1.14  % (2482190)First to succeed.
% 3.40/1.14  % (2482190)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2482177"
% 3.40/1.14  % (2482197)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3154914981: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.40/1.14  % (2482198)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2711793568:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.40/1.14  % (2482200)lrs+10_64_to=lpo:sil=8000:random_seed=1770395962:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.95/1.34  % (2482190)Refutation found. Thanks to Tanya!
% 3.95/1.34  % SZS status Unsatisfiable for theBenchmark
% 3.95/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 3.95/1.34  % (2482190)------------------------------
% 3.95/1.34  % (2482190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.95/1.34  % (2482190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.34  % (2482190)CaDiCaL version: 2.1.3
% 3.95/1.34  % (2482190)Termination reason: Refutation
% 3.95/1.34  % (2482190)Time elapsed: 0.008 s
% 3.95/1.34  % (2482190)Peak memory usage: 89 MB
% 3.95/1.34  % (2482190)Instructions burned: 21 (million)
% 3.95/1.34  % (2482190)------------------------------
% 3.95/1.34  % (2482190)------------------------------
% 3.95/1.34  % (2482177)Success in time 0.467 s
% 3.95/1.34  % Vampire exiting
%------------------------------------------------------------------------------