/export/starexec/sandbox2/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
**************************************************
summary
**************************************************
SRS with 44 rules on 6 letters       mirror
SRS with 44 rules on 6 letters       Matchbound   { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1328 states

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [0, 5, 3] -> [3, 0, 4, 3, 0, 4, 1, 4, 4, 4] {- Input 0 -}
  [1, 3, 4] -> [0, 4, 3, 5, 5, 1, 0, 3, 4, 4] {- Input 1 -}
  [4, 5, 3] -> [3, 4, 3, 2, 2, 3, 0, 3, 3, 4] {- Input 2 -}
  [1, 5, 3, 1] -> [2, 1, 0, 1, 1, 1, 5, 1, 1, 2] {- Input 3 -}
  [3, 0, 0, 5] -> [4, 2, 0, 2, 1, 2, 4, 0, 3, 5] {- Input 4 -}
  [4, 1, 3, 5] -> [3, 0, 3, 4, 4, 2, 5, 5, 2, 2] {- Input 5 -}
  [0, 0, 4, 5, 1] -> [0, 3, 5, 2, 2, 0, 0, 3, 2, 1] {- Input 6 -}
  [0, 1, 0, 2, 5] -> [1, 0, 3, 0, 2, 3, 1, 1, 5, 2] {- Input 7 -}
  [0, 1, 4, 5, 4] -> [1, 0, 3, 3, 1, 0, 2, 3, 1, 4] {- Input 8 -}
  [1, 0, 5, 4, 0] -> [1, 1, 2, 0, 4, 0, 0, 3, 1, 0] {- Input 9 -}
  [1, 5, 3, 5, 4] -> [2, 0, 2, 1, 4, 4, 1, 0, 1, 4] {- Input 10 -}
  [3, 5, 0, 5, 3] -> [3, 2, 2, 2, 0, 0, 2, 2, 0, 4] {- Input 11 -}
  [4, 5, 3, 1, 3] -> [2, 0, 3, 5, 5, 5, 0, 2, 4, 3] {- Input 12 -}
  [4, 5, 3, 3, 5] -> [3, 3, 4, 1, 0, 1, 5, 2, 5, 5] {- Input 13 -}
  [4, 5, 4, 5, 3] -> [2, 3, 0, 3, 3, 4, 1, 5, 2, 1] {- Input 14 -}
  [5, 3, 3, 5, 3] -> [5, 4, 4, 5, 4, 0, 2, 0, 3, 3] {- Input 15 -}
  [0, 0, 1, 4, 5, 3] -> [1, 1, 1, 4, 4, 3, 1, 1, 5, 4] {- Input 16 -}
  [0, 0, 5, 1, 3, 3] -> [0, 2, 0, 1, 4, 4, 5, 5, 4, 4] {- Input 17 -}
  [0, 1, 3, 5, 0, 1] -> [1, 5, 0, 4, 3, 3, 5, 2, 3, 5] {- Input 18 -}
  [0, 5, 3, 0, 2, 3] -> [0, 0, 3, 2, 3, 5, 5, 0, 4, 3] {- Input 19 -}
  [1, 0, 0, 5, 5, 1] -> [0, 3, 1, 1, 1, 4, 4, 4, 0, 1] {- Input 20 -}
  [1, 3, 4, 5, 4, 5] -> [1, 4, 5, 0, 4, 3, 3, 3, 1, 5] {- Input 21 -}
  [1, 4, 0, 5, 4, 0] -> [1, 0, 2, 5, 5, 0, 3, 0, 4, 0] {- Input 22 -}
  [2, 5, 4, 0, 5, 3] -> [5, 3, 4, 3, 2, 4, 3, 2, 5, 2] {- Input 23 -}
  [4, 0, 1, 3, 4, 5] -> [3, 0, 5, 0, 4, 4, 4, 3, 3, 5] {- Input 24 -}
  [4, 1, 0, 5, 3, 1] -> [2, 0, 3, 4, 1, 5, 0, 2, 5, 1] {- Input 25 -}
  [4, 5, 4, 5, 3, 2] -> [0, 3, 5, 3, 4, 4, 4, 2, 1, 2] {- Input 26 -}
  [5, 1, 2, 4, 5, 3] -> [0, 2, 1, 1, 1, 0, 1, 1, 5, 4] {- Input 27 -}
  [5, 1, 3, 4, 5, 1] -> [2, 0, 2, 4, 4, 3, 0, 1, 1, 1] {- Input 28 -}
  [0, 0, 1, 1, 3, 5, 3] -> [1, 2, 1, 5, 1, 3, 0, 3, 5, 3] {- Input 29 -}
  [0, 1, 4, 0, 5, 2, 4] -> [1, 1, 0, 1, 0, 3, 2, 5, 1, 4] {- Input 30 -}
  [1, 3, 4, 0, 0, 0, 0] -> [0, 1, 0, 2, 3, 2, 4, 3, 3, 3] {- Input 31 -}
  [1, 4, 0, 0, 5, 3, 5] -> [0, 0, 1, 3, 1, 4, 4, 2, 2, 5] {- Input 32 -}
  [1, 4, 0, 5, 4, 2, 1] -> [0, 0, 1, 5, 4, 3, 3, 3, 3, 5] {- Input 33 -}
  [1, 5, 1, 5, 0, 5, 1] -> [2, 2, 2, 1, 1, 5, 4, 5, 5, 1] {- Input 34 -}
  [2, 5, 4, 5, 4, 0, 1] -> [5, 3, 0, 4, 5, 0, 4, 4, 3, 1] {- Input 35 -}
  [3, 1, 0, 5, 3, 5, 3] -> [4, 4, 0, 3, 4, 5, 3, 4, 2, 3] {- Input 36 -}
  [4, 1, 5, 3, 3, 5, 3] -> [3, 1, 3, 1, 1, 5, 4, 3, 4, 2] {- Input 37 -}
  [4, 5, 3, 5, 1, 2, 5] -> [3, 3, 2, 1, 1, 5, 1, 5, 5, 5] {- Input 38 -}
  [4, 5, 3, 5, 5, 0, 1] -> [4, 3, 2, 2, 0, 2, 2, 4, 5, 1] {- Input 39 -}
  [5, 0, 0, 0, 0, 0, 5] -> [1, 5, 1, 1, 4, 4, 2, 0, 2, 5] {- Input 40 -}
  [5, 1, 3, 2, 5, 3, 0] -> [5, 0, 4, 3, 5, 1, 3, 3, 1, 0] {- Input 41 -}
  [5, 1, 4, 2, 4, 5, 3] -> [0, 1, 0, 2, 3, 2, 1, 0, 0, 3] {- Input 42 -}
  [5, 1, 4, 5, 2, 4, 2] -> [2, 5, 0, 1, 5, 1, 5, 2, 0, 2] {- Input 43 -}
reason
  mirror
   property Termination
has value Just True
for SRS
  [3, 5, 0] -> [4, 4, 4, 1, 4, 0, 3, 4, 0, 3] {- Mirror (Input 0) -}
  [4, 3, 1] -> [4, 4, 3, 0, 1, 5, 5, 3, 4, 0] {- Mirror (Input 1) -}
  [3, 5, 4] -> [4, 3, 3, 0, 3, 2, 2, 3, 4, 3] {- Mirror (Input 2) -}
  [1, 3, 5, 1] -> [2, 1, 1, 5, 1, 1, 1, 0, 1, 2] {- Mirror (Input 3) -}
  [5, 0, 0, 3] -> [5, 3, 0, 4, 2, 1, 2, 0, 2, 4] {- Mirror (Input 4) -}
  [5, 3, 1, 4] -> [2, 2, 5, 5, 2, 4, 4, 3, 0, 3] {- Mirror (Input 5) -}
  [1, 5, 4, 0, 0] -> [1, 2, 3, 0, 0, 2, 2, 5, 3, 0] {- Mirror (Input 6) -}
  [5, 2, 0, 1, 0] -> [2, 5, 1, 1, 3, 2, 0, 3, 0, 1] {- Mirror (Input 7) -}
  [4, 5, 4, 1, 0] -> [4, 1, 3, 2, 0, 1, 3, 3, 0, 1] {- Mirror (Input 8) -}
  [0, 4, 5, 0, 1] -> [0, 1, 3, 0, 0, 4, 0, 2, 1, 1] {- Mirror (Input 9) -}
  [4, 5, 3, 5, 1] -> [4, 1, 0, 1, 4, 4, 1, 2, 0, 2] {- Mirror (Input 10) -}
  [3, 5, 0, 5, 3] -> [4, 0, 2, 2, 0, 0, 2, 2, 2, 3] {- Mirror (Input 11) -}
  [3, 1, 3, 5, 4] -> [3, 4, 2, 0, 5, 5, 5, 3, 0, 2] {- Mirror (Input 12) -}
  [5, 3, 3, 5, 4] -> [5, 5, 2, 5, 1, 0, 1, 4, 3, 3] {- Mirror (Input 13) -}
  [3, 5, 4, 5, 4] -> [1, 2, 5, 1, 4, 3, 3, 0, 3, 2] {- Mirror (Input 14) -}
  [3, 5, 3, 3, 5] -> [3, 3, 0, 2, 0, 4, 5, 4, 4, 5] {- Mirror (Input 15) -}
  [3, 5, 4, 1, 0, 0] -> [4, 5, 1, 1, 3, 4, 4, 1, 1, 1] {- Mirror (Input 16) -}
  [3, 3, 1, 5, 0, 0] -> [4, 4, 5, 5, 4, 4, 1, 0, 2, 0] {- Mirror (Input 17) -}
  [1, 0, 5, 3, 1, 0] -> [5, 3, 2, 5, 3, 3, 4, 0, 5, 1] {- Mirror (Input 18) -}
  [3, 2, 0, 3, 5, 0] -> [3, 4, 0, 5, 5, 3, 2, 3, 0, 0] {- Mirror (Input 19) -}
  [1, 5, 5, 0, 0, 1] -> [1, 0, 4, 4, 4, 1, 1, 1, 3, 0] {- Mirror (Input 20) -}
  [5, 4, 5, 4, 3, 1] -> [5, 1, 3, 3, 3, 4, 0, 5, 4, 1] {- Mirror (Input 21) -}
  [0, 4, 5, 0, 4, 1] -> [0, 4, 0, 3, 0, 5, 5, 2, 0, 1] {- Mirror (Input 22) -}
  [3, 5, 0, 4, 5, 2] -> [2, 5, 2, 3, 4, 2, 3, 4, 3, 5] {- Mirror (Input 23) -}
  [5, 4, 3, 1, 0, 4] -> [5, 3, 3, 4, 4, 4, 0, 5, 0, 3] {- Mirror (Input 24) -}
  [1, 3, 5, 0, 1, 4] -> [1, 5, 2, 0, 5, 1, 4, 3, 0, 2] {- Mirror (Input 25) -}
  [2, 3, 5, 4, 5, 4] -> [2, 1, 2, 4, 4, 4, 3, 5, 3, 0] {- Mirror (Input 26) -}
  [3, 5, 4, 2, 1, 5] -> [4, 5, 1, 1, 0, 1, 1, 1, 2, 0] {- Mirror (Input 27) -}
  [1, 5, 4, 3, 1, 5] -> [1, 1, 1, 0, 3, 4, 4, 2, 0, 2] {- Mirror (Input 28) -}
  [3, 5, 3, 1, 1, 0, 0] -> [3, 5, 3, 0, 3, 1, 5, 1, 2, 1] {- Mirror (Input 29) -}
  [4, 2, 5, 0, 4, 1, 0] -> [4, 1, 5, 2, 3, 0, 1, 0, 1, 1] {- Mirror (Input 30) -}
  [0, 0, 0, 0, 4, 3, 1] -> [3, 3, 3, 4, 2, 3, 2, 0, 1, 0] {- Mirror (Input 31) -}
  [5, 3, 5, 0, 0, 4, 1] -> [5, 2, 2, 4, 4, 1, 3, 1, 0, 0] {- Mirror (Input 32) -}
  [1, 2, 4, 5, 0, 4, 1] -> [5, 3, 3, 3, 3, 4, 5, 1, 0, 0] {- Mirror (Input 33) -}
  [1, 5, 0, 5, 1, 5, 1] -> [1, 5, 5, 4, 5, 1, 1, 2, 2, 2] {- Mirror (Input 34) -}
  [1, 0, 4, 5, 4, 5, 2] -> [1, 3, 4, 4, 0, 5, 4, 0, 3, 5] {- Mirror (Input 35) -}
  [3, 5, 3, 5, 0, 1, 3] -> [3, 2, 4, 3, 5, 4, 3, 0, 4, 4] {- Mirror (Input 36) -}
  [3, 5, 3, 3, 5, 1, 4] -> [2, 4, 3, 4, 5, 1, 1, 3, 1, 3] {- Mirror (Input 37) -}
  [5, 2, 1, 5, 3, 5, 4] -> [5, 5, 5, 1, 5, 1, 1, 2, 3, 3] {- Mirror (Input 38) -}
  [1, 0, 5, 5, 3, 5, 4] -> [1, 5, 4, 2, 2, 0, 2, 2, 3, 4] {- Mirror (Input 39) -}
  [5, 0, 0, 0, 0, 0, 5] -> [5, 2, 0, 2, 4, 4, 1, 1, 5, 1] {- Mirror (Input 40) -}
  [0, 3, 5, 2, 3, 1, 5] -> [0, 1, 3, 3, 1, 5, 3, 4, 0, 5] {- Mirror (Input 41) -}
  [3, 5, 4, 2, 4, 1, 5] -> [3, 0, 0, 1, 2, 3, 2, 0, 1, 0] {- Mirror (Input 42) -}
  [2, 4, 2, 5, 4, 1, 5] -> [2, 0, 2, 5, 1, 5, 1, 0, 5, 2] {- Mirror (Input 43) -}
reason
  Matchbound
    Matchbound   { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1328 states

**************************************************
skeleton: \Mirror(44,6)\Rfcmatchbound{2}[]
**************************************************
let {}
in let {trac ?= False;loop_cap = 1;match_cap = 2;tile_cap = 3;matrix_cap = 4;mo = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;done = Worker No_Strict_Rules;dont = \ p -> Fail;tiling = \ m w -> On tile_cap (weighted (And_Then (Worker (Tiling {method = m,width = w,map_type = Enum,max_num_tiles = Just 1000,max_num_rules = Just 100000})) (Worker Remap)));tile_roc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Overlap w)) <> [ Worker Unlabel];mb = \ size -> On match_cap (Apply (Worker (Matchbound {method = RFC,max_size = Just size})) done);mbs = \ size -> First_Of [ mb size, Apply (Worker Mirror) (mb size)];tile_rfc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Forward w)) <> ((for ws (\ w -> tiling Backward w)) <> [ Worker Unlabel]);solver = Minisatapi;qpi = \ dim bits -> On matrix_cap (weighted (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));qpis = Seq [ Timeout 10 (qpi 2 3), Timeout 30 (qpi 4 3), Timeout 50 (qpi 6 3), qpi 8 3];kbo = \ b -> On matrix_cap (weighted (Worker (KBO {bits = b,solver = solver})));matrix = \ dom dim bits -> On matrix_cap (weighted (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,encoding = Ersatz_Binary,tracing = trac,verbose = True,solver = solver})));arctics = Seq [ Timeout 10 (matrix Arctic 2 16), Timeout 30 (matrix Arctic 4 8), Timeout 50 (matrix Arctic 6 4), matrix Arctic 8 2];naturals = Seq [ Timeout 10 (matrix Natural 2 4), Timeout 30 (matrix Natural 4 3), Timeout 50 (matrix Natural 6 2), matrix Natural 8 1];remove = First_Of [ qpis, arctics, naturals, As_Transformer tile_roc];remove_wop = And_Then wop (Or_Else (As_Transformer (Worker No_Strict_Rules)) remove);deepee = Apply (And_Then (Worker DP) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = False,usable = True})) remove_wop));when_small = \ m -> Apply (Worker (SizeAtmost 1000)) m;yeah = First_Of [ when_small (First_Of [ deepee, Apply (Worker Mirror) deepee]), tile_rfc, mbs 100000];noh_for = \ side -> Worker (Simple (Config {closure = side,max_closure_width = Nothing,intermediates = All,priority = Linear [ ( 1, Log2 Steps), ( -1, Width_lhs), ( -2, Log2 Width_rhs)]}));noh = First_Of [ On loop_cap (noh_for Forward), On loop_cap (noh_for Backward), On loop_cap (Worker Transport)]}
  in Apply (Worker Remap) (Apply wop (Seq [ Worker KKST01, First_Of [ yeah, noh]]))
**************************************************
statistics on proof search (nodes types that (together) took more than 1.000000000000)
**************************************************
Success : EDG { usable = True, tracing = False}
  total number 2
  max duration 2.387844675000
  min duration 0.132823108000
  total durat. 2.520667783000
  Info
    { what = EDG   { usable = True, tracing = False}
    , input_size = Size
      { num_rules = 451
      , num_strict_rules = 407
      , num_top_rules = 407
      , num_weak_rules = 44
      , alphabet_size = 12
      , total_length = 5415}
    , self = 25
    , parent = Just 6
    , duration = 2.387844675000
    , status = Success
    , start = 2021-07-13 21:24:01.056624389 UTC
    , finish = 2021-07-13 21:24:03.444469064 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '4' ]
                        , 3
                        , False )}
Success : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False}
  total number 1
  max duration 4.905403039000
  min duration 4.905403039000
  total durat. 4.905403039000
  Info
    { what = Matchbound
      { method = RFC
      , max_size = Just 100000
      , max_bound = Nothing
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 44
      , num_strict_rules = 44
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 6
      , total_length = 694}
    , self = 38
    , parent = Just 4
    , duration = 4.905403039000
    , status = Success
    , start = 2021-07-13 21:24:00.807048059 UTC
    , finish = 2021-07-13 21:24:05.712451098 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '4'
                          , '4' ]
                        , 2
                        , True )}
Except [ 'A'
       , 's'
       , 'y'
       , 'n'
       , 'c'
       , 'C'
       , 'a'
       , 'n'
       , 'c'
       , 'e'
       , 'l'
       , 'l'
       , 'e'
       , 'd' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False}
  total number 1
  max duration 4.908145921000
  min duration 4.908145921000
  total durat. 4.908145921000
  Info
    { what = Matchbound
      { method = RFC
      , max_size = Just 100000
      , max_bound = Nothing
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 44
      , num_strict_rules = 44
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 6
      , total_length = 694}
    , self = 40
    , parent = Just 0
    , duration = 4.908145921000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 21:24:00.807035695 UTC
    , finish = 2021-07-13 21:24:05.715181616 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '4'
                          , '2' ]
                        , 2
                        , True )}
Success : Tiling { method = Backward , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False}
  total number 1
  max duration 3.139584629000
  min duration 3.139584629000
  total durat. 3.139584629000
  Info
    { what = Tiling
      { method = Backward
      , width = 2
      , state_type = Best
      , map_type = Enum
      , unlabel = True
      , print_completion_steps = False
      , print_tiles = False
      , max_num_tiles = Just 1000
      , max_num_rules = Just 100000
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 44
      , num_strict_rules = 44
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 6
      , total_length = 694}
    , self = 29
    , parent = Just 0
    , duration = 3.139584629000
    , status = Success
    , start = 2021-07-13 21:24:00.83316543 UTC
    , finish = 2021-07-13 21:24:03.972750059 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '8'
                          , '7' ]
                        , 3
                        , True )}
Fail : Tiling { method = Backward , width = 8 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False}
  total number 1
  max duration 4.833770931000
  min duration 4.833770931000
  total durat. 4.833770931000
  Info
    { what = Tiling
      { method = Backward
      , width = 8
      , state_type = Best
      , map_type = Enum
      , unlabel = True
      , print_completion_steps = False
      , print_tiles = False
      , max_num_tiles = Just 1000
      , max_num_rules = Just 100000
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 44
      , num_strict_rules = 44
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 6
      , total_length = 694}
    , self = 37
    , parent = Just 0
    , duration = 4.833770931000
    , status = Fail
    , start = 2021-07-13 21:24:00.833005956 UTC
    , finish = 2021-07-13 21:24:05.666776887 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '7'
                          , '5' ]
                        , 3
                        , True )}
Success : Tiling { method = Forward , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False}
  total number 1
  max duration 4.673665076000
  min duration 4.673665076000
  total durat. 4.673665076000
  Info
    { what = Tiling
      { method = Forward
      , width = 2
      , state_type = Best
      , map_type = Enum
      , unlabel = True
      , print_completion_steps = False
      , print_tiles = False
      , max_num_tiles = Just 1000
      , max_num_rules = Just 100000
      , verbose = False
      , tracing = False}
    , input_size = Size
      { num_rules = 44
      , num_strict_rules = 44
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 6
      , total_length = 694}
    , self = 35
    , parent = Just 0
    , duration = 4.673665076000
    , status = Success
    , start = 2021-07-13 21:24:00.822890948 UTC
    , finish = 2021-07-13 21:24:05.496556024 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '6'
                          , '3' ]
                        , 3
                        , True )}
**************************************************