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


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


NO
**************************************************
summary
**************************************************
SRS with 1 rules on 2 letters       admits a non-terminating transport system
with pivot [a, a, a, a, a]
alphabet [[a], [a, b]]
pivot represented as [[a], [a], [a], [a], [a]]
derivations for transport system
  [a]
    [a] pivot ->^0 pivot [[a]]
    because of derivation
      [a, a, a, a, a, a] ->^0 [a, a, a, a, a, a]
      via steps 
  [a, b]
    [a, b] pivot ->^1 pivot [[a], [a, b], [a, b], [a, b], [a, b]]
    because of derivation
      [a, b, a, a, a, a, a] ->^1 [a, a, a, a, a, a, a, b, a, b, a, b, a, b]
      via steps Step   { rule = 0, position = 0}
infinite derivation starts at
  [[a, b], [a, b], [a, b], [a, b]] pivot ^ 6

**************************************************
proof
**************************************************
property Termination
has value Just False
for SRS
  [a, b, a, a, a, a, a] -> [ a , a , a , a , a , a , a , b , a , b , a , b , a , b ] {- Input 0 -}
reason
  admits a non-terminating transport system
  with pivot [a, a, a, a, a]
  alphabet [[a], [a, b]]
  pivot represented as [[a], [a], [a], [a], [a]]
  derivations for transport system
    [a]
      [a] pivot ->^0 pivot [[a]]
      because of derivation
        [a, a, a, a, a, a] ->^0 [a, a, a, a, a, a]
        via steps 
    [a, b]
      [a, b] pivot ->^1 pivot [[a], [a, b], [a, b], [a, b], [a, b]]
      because of derivation
        [a, b, a, a, a, a, a] ->^1 [a, a, a, a, a, a, a, b, a, b, a, b, a, b]
        via steps Step   { rule = 0, position = 0}
  infinite derivation starts at
    [[a, b], [a, b], [a, b], [a, b]] pivot ^ 6

**************************************************
skeleton: (1,2)\Transport{}[]
**************************************************
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)
**************************************************
Except [ 'A'
       , 's'
       , 'y'
       , 'n'
       , 'c'
       , 'C'
       , 'a'
       , 'n'
       , 'c'
       , 'e'
       , 'l'
       , 'l'
       , 'e'
       , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])})
  total number 1
  max duration 1.003836879000
  min duration 1.003836879000
  total durat. 1.003836879000
  Info
    { what = Simple (Config
      { tracing = False
      , verbose = False
      , closure = Forward
      , max_closure_length = Nothing
      , max_closure_width = Nothing
      , intermediates = All
      , priority = (Linear [ (1, Log2 Steps)
                           , (-1, Width_lhs)
                           , (-2, Log2 Width_rhs) ])})
    , input_size = Size
      { num_rules = 1
      , num_strict_rules = 1
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 21}
    , self = 87
    , parent = Just 0
    , duration = 1.003836879000
    , status = Except [ 'A'
                      , 's'
                      , 'y'
                      , 'n'
                      , 'c'
                      , 'C'
                      , 'a'
                      , 'n'
                      , 'c'
                      , 'e'
                      , 'l'
                      , 'l'
                      , 'e'
                      , 'd' ]
    , start = 2021-07-13 23:54:23.149421651 UTC
    , finish = 2021-07-13 23:54:24.15325853 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '3'
                          , '4' ]
                        , 1
                        , True )}
Success : Transport { mode = Standard, max_derivation_length = Nothing}
  total number 1
  max duration 1.003272388000
  min duration 1.003272388000
  total durat. 1.003272388000
  Info
    { what = Transport   { mode = Standard, max_derivation_length = Nothing}
    , input_size = Size
      { num_rules = 1
      , num_strict_rules = 1
      , num_top_rules = 0
      , num_weak_rules = 0
      , alphabet_size = 2
      , total_length = 21}
    , self = 86
    , parent = Just 0
    , duration = 1.003272388000
    , status = Success
    , start = 2021-07-13 23:54:23.149440619 UTC
    , finish = 2021-07-13 23:54:24.152713007 UTC
    , thread_cap_info = ( [ 'T'
                          , 'h'
                          , 'r'
                          , 'e'
                          , 'a'
                          , 'd'
                          , 'I'
                          , 'd'
                          , ' '
                          , '2'
                          , '5' ]
                        , 1
                        , True )}
**************************************************