↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC180-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 : n005.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:02:49 PM UTC 2026

% Result   : Unsatisfiable 2.76s 1.31s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   77 (  20 unt;   5 def)
%            Number of atoms       :  245 (  18 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  336 ( 168   ~; 163   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   12 (  10 usr;   6 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   77 (   0 sgn  77   !;   0   ?)

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

fof(f18,axiom,
    ! [X0] : ssList(skaf77(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).

fof(f19,axiom,
    ! [X0] : ssList(skaf76(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).

fof(f20,axiom,
    ! [X0] : ssList(skaf75(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).

fof(f21,axiom,
    ! [X0] : ssItem(skaf74(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).

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

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(f114,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause111) ).

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(f175,axiom,
    ! [X0] :
      ( app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0
      | duplicatefreeP(X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause162) ).

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(f200,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

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)
      | lt(X3,X0)
      | ~ memberP(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f211,plain,
    ! [X1] :
      ( ~ lt(X1,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X1) ),
    inference(equality_resolution,[],[f114]) ).

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(f217,plain,
    ! [X1] :
      ( ~ lt(X1,X1)
      | ~ ssItem(X1) ),
    inference(duplicate_literal_removal,[],[f211]) ).

fof(f220,plain,
    ! [X0] :
      ( duplicatefreeP(sk1)
      | ssItem(X0) ),
    inference(resolution,[],[f200,f72]) ).

fof(f222,definition,
    ( spl0_1
  <=> ! [X0] : ssItem(X0) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f223,plain,
    ( ! [X0] : ssItem(X0)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f222]) ).

fof(f225,definition,
    ( spl0_2
  <=> duplicatefreeP(sk1) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f226,plain,
    ( duplicatefreeP(sk1)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f225]) ).

fof(f227,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f220,f225,f222]) ).

fof(f244,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f226,f210]) ).

fof(f245,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f244]) ).

fof(f246,plain,
    ~ duplicatefreeP(sk3),
    inference(superposition,[],[f210,f205]) ).

fof(f266,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(X1)
        | ~ ssList(X2)
        | sk3 != app(app(X1,cons(X0,nil)),X2)
        | lt(X3,X0)
        | ~ memberP(X1,X3) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f209,f223]) ).

fof(f267,plain,
    ( ! [X2,X3,X0,X1] :
        ( sk3 != app(app(X1,cons(X0,nil)),X2)
        | ~ ssList(X2)
        | ~ ssList(X1)
        | lt(X3,X0)
        | ~ memberP(X1,X3) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f266,f223]) ).

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

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

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

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

fof(f333,plain,
    ( ! [X2,X3,X0,X1] :
        ( sk3 != app(X2,cons(X0,X1))
        | ~ ssList(X1)
        | ~ ssList(X2)
        | lt(X3,X0)
        | ~ memberP(X2,X3)
        | ~ ssList(cons(X0,nil)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f329,f223]) ).

fof(f372,definition,
    ( spl0_6
  <=> ssList(cons(skaf74(sk3),nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f373,plain,
    ( ~ ssList(cons(skaf74(sk3),nil))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f372]) ).

fof(f378,definition,
    ( spl0_8
  <=> ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f379,plain,
    ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | spl0_8 ),
    inference(avatar_component_clause,[],[f378]) ).

fof(f381,plain,
    ( ~ ssList(nil)
    | ~ ssItem(skaf74(sk3))
    | spl0_6 ),
    inference(resolution,[],[f373,f86]) ).

fof(f382,plain,
    ( ~ ssItem(skaf74(sk3))
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f381,f8]) ).

fof(f383,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f382,f21]) ).

fof(f384,plain,
    spl0_6,
    inference(avatar_contradiction_clause,[],[f383]) ).

fof(f405,plain,
    ( ~ ssList(skaf75(sk3))
    | ~ ssList(cons(skaf74(sk3),skaf76(sk3)))
    | spl0_8 ),
    inference(resolution,[],[f379,f85]) ).

fof(f406,plain,
    ( ~ ssList(cons(skaf74(sk3),skaf76(sk3)))
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f405,f20]) ).

fof(f407,plain,
    ( ~ ssList(skaf76(sk3))
    | ~ ssItem(skaf74(sk3))
    | spl0_8 ),
    inference(resolution,[],[f406,f86]) ).

fof(f408,plain,
    ( ~ ssItem(skaf74(sk3))
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f407,f19]) ).

fof(f409,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f408,f21]) ).

fof(f410,plain,
    spl0_8,
    inference(avatar_contradiction_clause,[],[f409]) ).

fof(f417,plain,
    ( ! [X0,X1] :
        ( sk3 != X0
        | ~ ssList(skaf77(X0))
        | ~ ssList(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))))
        | lt(X1,skaf74(X0))
        | ~ memberP(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),X1)
        | ~ ssList(cons(skaf74(X0),nil))
        | duplicatefreeP(X0)
        | ~ ssList(X0) )
    | ~ spl0_1 ),
    inference(superposition,[],[f333,f175]) ).

fof(f420,plain,
    ( ! [X0,X1] :
        ( sk3 != X0
        | ~ ssList(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))))
        | lt(X1,skaf74(X0))
        | ~ memberP(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),X1)
        | ~ ssList(cons(skaf74(X0),nil))
        | duplicatefreeP(X0)
        | ~ ssList(X0) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f417,f18]) ).

fof(f429,plain,
    ( ! [X0] :
        ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
        | lt(X0,skaf74(sk3))
        | ~ memberP(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),X0)
        | ~ ssList(cons(skaf74(sk3),nil))
        | duplicatefreeP(sk3)
        | ~ ssList(sk3) )
    | ~ spl0_1 ),
    inference(equality_resolution,[],[f420]) ).

fof(f430,plain,
    ( ! [X0] :
        ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
        | lt(X0,skaf74(sk3))
        | ~ memberP(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),X0)
        | ~ ssList(cons(skaf74(sk3),nil))
        | ~ ssList(sk3) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f429,f246]) ).

fof(f431,plain,
    ( ! [X0] :
        ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
        | lt(X0,skaf74(sk3))
        | ~ memberP(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),X0)
        | ~ ssList(cons(skaf74(sk3),nil)) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f430,f202]) ).

fof(f433,definition,
    ( spl0_9
  <=> ! [X0] :
        ( lt(X0,skaf74(sk3))
        | ~ memberP(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f434,plain,
    ( ! [X0] :
        ( ~ memberP(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),X0)
        | lt(X0,skaf74(sk3)) )
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f433]) ).

fof(f435,plain,
    ( ~ spl0_6
    | spl0_9
    | ~ spl0_8
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f431,f222,f378,f433,f372]) ).

fof(f436,plain,
    ( lt(skaf74(sk3),skaf74(sk3))
    | ~ ssList(skaf75(sk3))
    | ~ ssItem(skaf74(sk3))
    | ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | ~ ssList(skaf76(sk3))
    | ~ spl0_9 ),
    inference(resolution,[],[f434,f212]) ).

fof(f441,plain,
    ( ~ ssList(skaf75(sk3))
    | ~ ssItem(skaf74(sk3))
    | ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | ~ ssList(skaf76(sk3))
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f436,f217]) ).

fof(f444,plain,
    ( ~ ssItem(skaf74(sk3))
    | ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | ~ ssList(skaf76(sk3))
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f441,f20]) ).

fof(f456,plain,
    ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | ~ ssList(skaf76(sk3))
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f444,f21]) ).

fof(f457,plain,
    ( ~ ssList(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))))
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f456,f19]) ).

fof(f458,plain,
    ( ~ spl0_8
    | ~ spl0_9 ),
    inference(avatar_split_clause,[],[f457,f433,f378]) ).

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

cnf(s5,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f245]) ).

cnf(s7,plain,
    spl0_6,
    inference(sat_conversion,[],[f384]) ).

cnf(s8,plain,
    spl0_8,
    inference(sat_conversion,[],[f410]) ).

cnf(s9,plain,
    ( ~ spl0_1
    | ~ spl0_6
    | ~ spl0_8
    | spl0_9 ),
    inference(sat_conversion,[],[f435]) ).

cnf(s12,plain,
    ( ~ spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f458]) ).

cnf(s13,plain,
    ~ spl0_9,
    inference(rat,[],[s12,s8]) ).

cnf(s14,plain,
    ~ spl0_1,
    inference(rat,[],[s9,s13,s8,s7]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s1,s5,s14]) ).

fof(f459,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC180-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.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 28 08:18:50 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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
% 2.76/1.31  % (637378)Input is clausal, will run a generic CNF schedule.
% 2.76/1.31  % (637389)dis-21_1_sil=8000:lcm=predicate:random_seed=2358215963: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)
% 2.76/1.31  % (637389)Instruction limit reached! 
% 2.76/1.31  % (637389)------------------------------
% 2.76/1.31  % (637389)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.31  % (637389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.31  % (637389)CaDiCaL version: 2.1.3
% 2.76/1.31  % (637389)Termination reason: Instruction limit
% 2.76/1.31  % (637389)Termination phase: Saturation
% 2.76/1.31  % (637389)Time elapsed: 0.038 s
% 2.76/1.31  % (637389)Peak memory usage: 90 MB
% 2.76/1.31  % (637389)Instructions burned: 118 (million)
% 2.76/1.31  % (637383)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=1680992562:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.76/1.31  % (637385)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3388303613:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.76/1.31  % (637386)lrs+10_1_sil=8000:sp=occurrence:random_seed=2203320051:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.76/1.31  % (637387)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3813856935:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.76/1.31  % (637384)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3406229225:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.76/1.31  % (637388)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=385816944:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.76/1.31  % (637387)Instruction limit reached! 
% 2.76/1.31  % (637387)------------------------------
% 2.76/1.31  % (637387)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.31  % (637387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.31  % (637387)CaDiCaL version: 2.1.3
% 2.76/1.31  % (637387)Termination reason: Instruction limit
% 2.76/1.31  % (637387)Termination phase: Saturation
% 2.76/1.31  % (637387)Time elapsed: 0.061 s
% 2.76/1.31  % (637387)Peak memory usage: 88 MB
% 2.76/1.31  % (637387)Instructions burned: 115 (million)
% 2.76/1.31  % (637386)Instruction limit reached! 
% 2.76/1.31  % (637386)------------------------------
% 2.76/1.31  % (637386)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.31  % (637386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.31  % (637386)CaDiCaL version: 2.1.3
% 2.76/1.31  % (637386)Termination reason: Instruction limit
% 2.76/1.31  % (637386)Termination phase: Saturation
% 2.76/1.31  % (637386)Time elapsed: 0.065 s
% 2.76/1.31  % (637386)Peak memory usage: 90 MB
% 2.76/1.31  % (637386)Instructions burned: 107 (million)
% 2.76/1.31  % (637391)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=3987885013:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.76/1.31  % (637391)First to succeed.
% 2.76/1.31  % (637391)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-637378"
% 2.76/1.31  % (637388)Instruction limit reached! 
% 2.76/1.31  % (637388)------------------------------
% 2.76/1.31  % (637388)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.31  % (637388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.31  % (637388)CaDiCaL version: 2.1.3
% 2.76/1.31  % (637388)Termination reason: Instruction limit
% 2.76/1.31  % (637388)Termination phase: Saturation
% 2.76/1.31  % (637388)Time elapsed: 0.124 s
% 2.76/1.31  % (637388)Peak memory usage: 90 MB
% 2.76/1.31  % (637388)Instructions burned: 181 (million)
% 2.76/1.31  % (637399)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1715971737:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.76/1.31  % (637398)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=992963725: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)
% 2.76/1.31  % (637391)Refutation found. Thanks to Tanya!
% 2.76/1.31  % SZS status Unsatisfiable for theBenchmark
% 2.76/1.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.51  % (637391)------------------------------
% 0.16/1.51  % (637391)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.51  % (637391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.51  % (637391)CaDiCaL version: 2.1.3
% 0.16/1.51  % (637391)Termination reason: Refutation
% 0.16/1.51  % (637391)Time elapsed: 0.007 s
% 0.16/1.51  % (637391)Peak memory usage: 89 MB
% 0.16/1.51  % (637391)Instructions burned: 16 (million)
% 0.16/1.51  % (637391)------------------------------
% 0.16/1.51  % (637391)------------------------------
% 0.16/1.51  % (637378)Success in time 0.461 s
% 0.16/1.51  % Vampire exiting
%------------------------------------------------------------------------------