↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 4.48s 1.36s
% Output   : Refutation 5.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   94 (  20 unt;   8 def)
%            Number of atoms       :  263 (  40 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  327 ( 158   ~; 162   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   8 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   44 (   0 sgn  44   !;   0   ?)

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

fof(f52,axiom,
    ! [X0,X1] : ssList(skaf43(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).

fof(f53,axiom,
    ! [X0,X1] : ssList(skaf42(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause53) ).

fof(f79,axiom,
    ! [X0] :
      ( nil != X0
      | ~ ssList(X0)
      | segmentP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause79) ).

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

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

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(f182,axiom,
    ! [X0,X1] :
      ( app(skaf42(X0,X1),cons(X1,skaf43(X1,X0))) = X0
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause169) ).

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

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

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

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

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

fof(f206,negated_conjecture,
    ~ segmentP(sk2,sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

fof(f210,plain,
    ( sk3 = cons(sk5,nil)
    | nil = sk4 ),
    inference(reorient_equations,[],[f209]) ).

fof(f212,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f213,plain,
    ( sk3 = cons(sk5,nil)
    | nil = sk3 ),
    inference(reorient_equations,[],[f212]) ).

fof(f214,negated_conjecture,
    ( memberP(sk4,sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f217,plain,
    ~ segmentP(sk4,sk3),
    inference(definition_unfolding,[],[f206,f204,f205]) ).

fof(f218,plain,
    ( ~ ssList(nil)
    | segmentP(nil,nil) ),
    inference(equality_resolution,[],[f79]) ).

fof(f232,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

fof(f242,definition,
    sF0 = cons(sk5,nil),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f243,plain,
    cons(sk5,nil) = sF0,
    inference(reorient_equations,[],[f242]) ).

fof(f244,plain,
    ( sk3 = sF0
    | nil = sk4 ),
    inference(definition_folding,[],[f210,f243]) ).

fof(f245,plain,
    ( sk3 = sF0
    | nil = sk3 ),
    inference(definition_folding,[],[f213,f243]) ).

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

fof(f255,plain,
    ( nil = sk3
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f257,definition,
    ( spl1_2
  <=> memberP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f259,plain,
    ( memberP(sk4,sk5)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f260,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f214,f257,f253]) ).

fof(f262,definition,
    ( spl1_3
  <=> sk3 = sF0 ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

fof(f264,plain,
    ( sk3 = sF0
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f262]) ).

fof(f265,plain,
    ( spl1_1
    | spl1_3 ),
    inference(avatar_split_clause,[],[f245,f262,f253]) ).

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

fof(f269,plain,
    ( nil = sk4
    | ~ spl1_4 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f271,plain,
    ( spl1_4
    | spl1_3 ),
    inference(avatar_split_clause,[],[f244,f262,f267]) ).

fof(f273,definition,
    ( spl1_5
  <=> ssItem(sk5) ),
    introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).

fof(f275,plain,
    ( ssItem(sk5)
    | ~ spl1_5 ),
    inference(avatar_component_clause,[],[f273]) ).

fof(f276,plain,
    ( spl1_1
    | spl1_5 ),
    inference(avatar_split_clause,[],[f208,f273,f253]) ).

fof(f277,plain,
    ( spl1_4
    | spl1_5 ),
    inference(avatar_split_clause,[],[f207,f273,f267]) ).

fof(f283,definition,
    ( spl1_7
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).

fof(f284,plain,
    ( ssList(nil)
    | ~ spl1_7 ),
    inference(avatar_component_clause,[],[f283]) ).

fof(f306,definition,
    ( spl1_12
  <=> segmentP(nil,nil) ),
    introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition]) ).

fof(f308,plain,
    ( segmentP(nil,nil)
    | ~ spl1_12 ),
    inference(avatar_component_clause,[],[f306]) ).

fof(f309,plain,
    ( spl1_12
    | ~ spl1_7 ),
    inference(avatar_split_clause,[],[f218,f283,f306]) ).

fof(f319,plain,
    spl1_7,
    inference(avatar_split_clause,[],[f8,f283]) ).

fof(f320,plain,
    ( sk3 = cons(sk5,nil)
    | ~ spl1_3 ),
    inference(backward_demodulation,[],[f243,f264]) ).

fof(f339,plain,
    ( nil != sk3
    | ~ ssItem(sk5)
    | ~ ssList(nil)
    | ~ spl1_3 ),
    inference(superposition,[],[f99,f320]) ).

fof(f340,plain,
    ( nil != sk3
    | ~ ssList(nil)
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f339,f275]) ).

fof(f341,plain,
    ( nil != sk3
    | ~ spl1_3
    | ~ spl1_5
    | ~ spl1_7 ),
    inference(forward_subsumption_resolution,[],[f340,f284]) ).

fof(f342,plain,
    ( ~ spl1_1
    | ~ spl1_3
    | ~ spl1_5
    | ~ spl1_7 ),
    inference(avatar_split_clause,[],[f341,f283,f273,f262,f253]) ).

fof(f373,plain,
    ( ! [X0] :
        ( cons(sk5,X0) = app(sk3,X0)
        | ~ ssList(X0)
        | ~ ssItem(sk5) )
    | ~ spl1_3 ),
    inference(superposition,[],[f126,f320]) ).

fof(f388,plain,
    ( ! [X0] :
        ( cons(sk5,X0) = app(sk3,X0)
        | ~ ssList(X0) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f373,f275]) ).

fof(f460,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(X0,app(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(superposition,[],[f232,f161]) ).

fof(f472,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(X0,app(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2) ),
    inference(duplicate_literal_removal,[],[f460]) ).

fof(f500,plain,
    ( ! [X0,X1] :
        ( segmentP(app(X1,cons(sk5,X0)),sk3)
        | ~ ssList(X1)
        | ~ ssList(sk3)
        | ~ ssList(app(X1,cons(sk5,X0)))
        | ~ ssList(X0)
        | ~ ssList(X0) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(superposition,[],[f472,f388]) ).

fof(f506,plain,
    ( ! [X0,X1] :
        ( segmentP(app(X1,cons(sk5,X0)),sk3)
        | ~ ssList(X1)
        | ~ ssList(sk3)
        | ~ ssList(app(X1,cons(sk5,X0)))
        | ~ ssList(X0) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(duplicate_literal_removal,[],[f500]) ).

fof(f514,plain,
    ( ! [X0,X1] :
        ( segmentP(app(X1,cons(sk5,X0)),sk3)
        | ~ ssList(X1)
        | ~ ssList(app(X1,cons(sk5,X0)))
        | ~ ssList(X0) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f506,f202]) ).

fof(f525,plain,
    ( ! [X0] :
        ( segmentP(X0,sk3)
        | ~ ssList(skaf42(X0,sk5))
        | ~ ssList(X0)
        | ~ ssList(skaf43(sk5,X0))
        | ~ ssItem(sk5)
        | ~ ssList(X0)
        | ~ memberP(X0,sk5) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(superposition,[],[f514,f182]) ).

fof(f529,plain,
    ( ! [X0] :
        ( segmentP(X0,sk3)
        | ~ ssList(skaf42(X0,sk5))
        | ~ ssList(X0)
        | ~ ssList(skaf43(sk5,X0))
        | ~ ssItem(sk5)
        | ~ memberP(X0,sk5) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(duplicate_literal_removal,[],[f525]) ).

fof(f533,plain,
    ( ! [X0] :
        ( segmentP(X0,sk3)
        | ~ ssList(skaf42(X0,sk5))
        | ~ ssList(X0)
        | ~ ssList(skaf43(sk5,X0))
        | ~ memberP(X0,sk5) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f529,f275]) ).

fof(f537,plain,
    ( ! [X0] :
        ( segmentP(X0,sk3)
        | ~ ssList(X0)
        | ~ ssList(skaf43(sk5,X0))
        | ~ memberP(X0,sk5) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f533,f53]) ).

fof(f540,plain,
    ( ! [X0] :
        ( ~ memberP(X0,sk5)
        | ~ ssList(X0)
        | segmentP(X0,sk3) )
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f537,f52]) ).

fof(f541,plain,
    ( ~ ssList(sk4)
    | segmentP(sk4,sk3)
    | ~ spl1_2
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(resolution,[],[f540,f259]) ).

fof(f542,plain,
    ( segmentP(sk4,sk3)
    | ~ spl1_2
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f541,f203]) ).

fof(f543,plain,
    ( $false
    | ~ spl1_2
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(forward_subsumption_resolution,[],[f542,f217]) ).

fof(f544,plain,
    ( ~ spl1_2
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(avatar_contradiction_clause,[],[f543]) ).

fof(f592,plain,
    ( segmentP(sk3,sk3)
    | ~ spl1_1
    | ~ spl1_12 ),
    inference(backward_demodulation,[],[f308,f255]) ).

fof(f606,plain,
    ( sk3 = sk4
    | ~ spl1_1
    | ~ spl1_4 ),
    inference(forward_demodulation,[],[f269,f255]) ).

fof(f636,plain,
    ( ~ segmentP(sk3,sk3)
    | ~ spl1_1
    | ~ spl1_4 ),
    inference(backward_demodulation,[],[f217,f606]) ).

fof(f638,plain,
    ( $false
    | ~ spl1_1
    | ~ spl1_4
    | ~ spl1_12 ),
    inference(forward_subsumption_resolution,[],[f636,f592]) ).

fof(f639,plain,
    ( ~ spl1_1
    | ~ spl1_4
    | ~ spl1_12 ),
    inference(avatar_contradiction_clause,[],[f638]) ).

cnf(s1,plain,
    ( spl1_1
    | spl1_2 ),
    inference(sat_conversion,[],[f260]) ).

cnf(s2,plain,
    ( spl1_1
    | spl1_3 ),
    inference(sat_conversion,[],[f265]) ).

cnf(s4,plain,
    ( spl1_3
    | spl1_4 ),
    inference(sat_conversion,[],[f271]) ).

cnf(s5,plain,
    ( spl1_1
    | spl1_5 ),
    inference(sat_conversion,[],[f276]) ).

cnf(s6,plain,
    ( spl1_4
    | spl1_5 ),
    inference(sat_conversion,[],[f277]) ).

cnf(s12,plain,
    ( ~ spl1_7
    | spl1_12 ),
    inference(sat_conversion,[],[f309]) ).

cnf(s16,plain,
    spl1_7,
    inference(sat_conversion,[],[f319]) ).

cnf(s17,plain,
    ( ~ spl1_1
    | ~ spl1_3
    | ~ spl1_5
    | ~ spl1_7 ),
    inference(sat_conversion,[],[f342]) ).

cnf(s18,plain,
    ( ~ spl1_2
    | ~ spl1_3
    | ~ spl1_5 ),
    inference(sat_conversion,[],[f544]) ).

cnf(s19,plain,
    ( ~ spl1_1
    | ~ spl1_4
    | ~ spl1_12 ),
    inference(sat_conversion,[],[f639]) ).

cnf(s21,plain,
    spl1_12,
    inference(rat,[],[s12,s16]) ).

cnf(s25,plain,
    spl1_1,
    inference(rat,[],[s18,s1,s2,s5]) ).

cnf(s26,plain,
    ~ spl1_4,
    inference(rat,[],[s19,s21,s25]) ).

cnf(s27,plain,
    spl1_5,
    inference(rat,[],[s6,s26]) ).

cnf(s28,plain,
    spl1_3,
    inference(rat,[],[s4,s26]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s17,s16,s25,s27,s28]) ).

fof(f642,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC374-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.06/0.17  % Computer : n001.cluster.edu
% 0.06/0.17  % Model    : x86_64 x86_64
% 0.06/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17  % Memory   : 8046.5625MB
% 0.06/0.17  % OS       : Linux 6.8.0-71-generic
% 0.06/0.17  % CPULimit : 300
% 0.06/0.17  % WCLimit  : 300
% 0.06/0.17  % DateTime : Mon Sep 28 09:26:47 UTC 2026
% 0.06/0.17  % CPUTime  : 
% 0.06/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21  Running first-order theorem proving
% 0.06/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
% 4.48/1.36  % (237695)Input is clausal, will run a generic CNF schedule.
% 4.48/1.36  % (237702)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4247544289:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.48/1.36  % (237705)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4267667098:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.48/1.36  % (237706)dis-21_1_sil=8000:lcm=predicate:random_seed=3990628348: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)
% 4.48/1.36  % (237700)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=2874926956:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.48/1.36  % (237703)lrs+10_1_sil=8000:sp=occurrence:random_seed=3048782238:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.48/1.36  % (237701)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3260628588:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.48/1.36  % (237704)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2600224717:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.48/1.36  % (237706)Instruction limit reached! 
% 4.48/1.36  % (237706)------------------------------
% 4.48/1.36  % (237706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237706)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237706)Termination reason: Instruction limit
% 4.48/1.36  % (237706)Termination phase: Saturation
% 4.48/1.36  % (237706)Time elapsed: 0.048 s
% 4.48/1.36  % (237706)Peak memory usage: 88 MB
% 4.48/1.36  % (237706)Instructions burned: 117 (million)
% 4.48/1.36  % (237703)Instruction limit reached! 
% 4.48/1.36  % (237703)------------------------------
% 4.48/1.36  % (237703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237703)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237703)Termination reason: Instruction limit
% 4.48/1.36  % (237703)Termination phase: Saturation
% 4.48/1.36  % (237703)Time elapsed: 0.068 s
% 4.48/1.36  % (237703)Peak memory usage: 89 MB
% 4.48/1.36  % (237703)Instructions burned: 108 (million)
% 4.48/1.36  % (237704)Instruction limit reached! 
% 4.48/1.36  % (237704)------------------------------
% 4.48/1.36  % (237704)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237704)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237704)Termination reason: Instruction limit
% 4.48/1.36  % (237704)Termination phase: Saturation
% 4.48/1.36  % (237704)Time elapsed: 0.068 s
% 4.48/1.36  % (237704)Peak memory usage: 89 MB
% 4.48/1.36  % (237704)Instructions burned: 116 (million)
% 4.48/1.36  % (237705)Instruction limit reached! 
% 4.48/1.36  % (237705)------------------------------
% 4.48/1.36  % (237705)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237705)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237705)Termination reason: Instruction limit
% 4.48/1.36  % (237705)Termination phase: Saturation
% 4.48/1.36  % (237705)Time elapsed: 0.124 s
% 4.48/1.36  % (237705)Peak memory usage: 89 MB
% 4.48/1.36  % (237705)Instructions burned: 181 (million)
% 4.48/1.36  % (237714)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=481890472:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.48/1.36  % (237715)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3214526245: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)
% 4.48/1.36  % (237716)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1235868712:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.48/1.36  % (237717)lrs+10_64_to=lpo:sil=8000:random_seed=2729120651:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 4.48/1.36  % (237714)Instruction limit reached! 
% 4.48/1.36  % (237714)------------------------------
% 4.48/1.36  % (237714)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237714)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237714)Termination reason: Instruction limit
% 4.48/1.36  % (237714)Termination phase: Saturation
% 4.48/1.36  % (237714)Time elapsed: 0.094 s
% 4.48/1.36  % (237714)Peak memory usage: 89 MB
% 4.48/1.36  % (237714)Instructions burned: 143 (million)
% 4.48/1.36  % (237715)Instruction limit reached! 
% 4.48/1.36  % (237715)------------------------------
% 4.48/1.36  % (237715)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237715)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237715)Termination reason: Instruction limit
% 4.48/1.36  % (237715)Termination phase: Saturation
% 4.48/1.36  % (237715)Time elapsed: 0.097 s
% 4.48/1.36  % (237715)Peak memory usage: 91 MB
% 4.48/1.36  % (237715)Instructions burned: 190 (million)
% 4.48/1.36  % (237717)Instruction limit reached! 
% 4.48/1.36  % (237717)------------------------------
% 4.48/1.36  % (237717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237717)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237717)Termination reason: Instruction limit
% 4.48/1.36  % (237717)Termination phase: Saturation
% 4.48/1.36  % (237717)Time elapsed: 0.067 s
% 4.48/1.36  % (237717)Peak memory usage: 90 MB
% 4.48/1.36  % (237717)Instructions burned: 127 (million)
% 4.48/1.36  % (237702)First to succeed.
% 4.48/1.36  % (237702)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-237695"
% 4.48/1.36  % (237716)Instruction limit reached! 
% 4.48/1.36  % (237716)------------------------------
% 4.48/1.36  % (237716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.36  % (237716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.36  % (237716)CaDiCaL version: 2.1.3
% 4.48/1.36  % (237716)Termination reason: Instruction limit
% 4.48/1.36  % (237716)Termination phase: Saturation
% 4.48/1.36  % (237716)Time elapsed: 0.145 s
% 4.48/1.36  % (237716)Peak memory usage: 90 MB
% 4.48/1.36  % (237716)Instructions burned: 220 (million)
% 4.48/1.36  % (237722)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3220265024:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 4.48/1.36  % (237723)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=1153398258:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 4.48/1.36  % (237724)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=492842385:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 4.48/1.36  % (237702)Refutation found. Thanks to Tanya!
% 4.48/1.36  % SZS status Unsatisfiable for theBenchmark
% 4.48/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 5.39/1.45  % (237702)------------------------------
% 5.39/1.45  % (237702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.39/1.45  % (237702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.39/1.45  % (237702)CaDiCaL version: 2.1.3
% 5.39/1.45  % (237702)Termination reason: Refutation
% 5.39/1.45  % (237702)Time elapsed: 0.395 s
% 5.39/1.45  % (237702)Peak memory usage: 131 MB
% 5.39/1.45  % (237702)Instructions burned: 1018 (million)
% 5.39/1.45  % (237702)------------------------------
% 5.39/1.45  % (237702)------------------------------
% 5.39/1.45  % (237695)Success in time 0.692 s
% 5.39/1.45  % Vampire exiting
%------------------------------------------------------------------------------