/export/starexec/sandbox/solver/bin/starexec_run_tc20-rel.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
**************************************************
summary
**************************************************
SRS with 2 strict rules and 1 weak rules on 3 letters       tile all, by Config   { method = Overlap,width = 2,unlabel = True}
SRS with 28 strict rules and 12 weak rules on 12 letters       weights
SRS with 2 strict rules and 12 weak rules on 9 letters       remove some, by Config   { method = Overlap,width = 2,unlabel = True}
SRS with 2 strict rules and 10 weak rules on 9 letters       Matrix   { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False}
SRS with 0 strict rules and 10 weak rules on 8 letters       weights
SRS with 0 strict rules and 4 weak rules on 6 letters       no strict rules

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [a, c, b] -> [b, a, b, a] {- Input 0 -}
  [a, a] -> [a, b, a] {- Input 1 -}
  [b] ->= [b, c] {- Input 2 -}
reason
  Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 2
  using 13 tiles
  tile all rules
  steps: 2
  
   property Termination
has value Just True
for SRS
  [[<, a], [a, c], [c, b], [b, a]] -> [ [<, b] , [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 0 (Concon 0 (Input 0)) -}
  [[<, a], [a, c], [c, b], [b, c]] -> [ [<, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 0 (Concon 1 (Input 0)) -}
  [[<, a], [a, c], [c, b], [b, b]] -> [ [<, b] , [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 0 (Concon 2 (Input 0)) -}
  [[a, a], [a, c], [c, b], [b, a]] -> [ [a, b] , [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 1 (Concon 0 (Input 0)) -}
  [[a, a], [a, c], [c, b], [b, c]] -> [ [a, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 1 (Concon 1 (Input 0)) -}
  [[a, a], [a, c], [c, b], [b, b]] -> [ [a, b] , [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 1 (Concon 2 (Input 0)) -}
  [[c, a], [a, c], [c, b], [b, a]] -> [ [c, b] , [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 2 (Concon 0 (Input 0)) -}
  [[c, a], [a, c], [c, b], [b, c]] -> [ [c, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -}
  [[c, a], [a, c], [c, b], [b, b]] -> [ [c, b] , [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 2 (Concon 2 (Input 0)) -}
  [[b, a], [a, c], [c, b], [b, a]] -> [ [b, b] , [b, a] , [a, b] , [b, a] , [ a , a ] ] {- Semlab 3 (Concon 0 (Input 0)) -}
  [[b, a], [a, c], [c, b], [b, c]] -> [ [b, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 3 (Concon 1 (Input 0)) -}
  [[b, a], [a, c], [c, b], [b, b]] -> [ [b, b] , [b, a] , [a, b] , [b, a] , [ a , b ] ] {- Semlab 3 (Concon 2 (Input 0)) -}
  [[<, a], [a, a], [a, >]] -> [ [<, a] , [a, b] , [b, a] , [a, >] ] {- Semlab 0 (Concon 0 (Input 1)) -}
  [[<, a], [a, a], [a, a]] -> [ [<, a] , [a, b] , [b, a] , [a, a] ] {- Semlab 0 (Concon 1 (Input 1)) -}
  [[<, a], [a, a], [a, c]] -> [ [<, a] , [a, b] , [b, a] , [a, c] ] {- Semlab 0 (Concon 2 (Input 1)) -}
  [[<, a], [a, a], [a, b]] -> [ [<, a] , [a, b] , [b, a] , [a, b] ] {- Semlab 0 (Concon 3 (Input 1)) -}
  [[a, a], [a, a], [a, >]] -> [ [a, a] , [a, b] , [b, a] , [a, >] ] {- Semlab 1 (Concon 0 (Input 1)) -}
  [[a, a], [a, a], [a, a]] -> [ [a, a] , [a, b] , [b, a] , [a, a] ] {- Semlab 1 (Concon 1 (Input 1)) -}
  [[a, a], [a, a], [a, c]] -> [ [a, a] , [a, b] , [b, a] , [a, c] ] {- Semlab 1 (Concon 2 (Input 1)) -}
  [[a, a], [a, a], [a, b]] -> [ [a, a] , [a, b] , [b, a] , [a, b] ] {- Semlab 1 (Concon 3 (Input 1)) -}
  [[c, a], [a, a], [a, >]] -> [ [c, a] , [a, b] , [b, a] , [a, >] ] {- Semlab 2 (Concon 0 (Input 1)) -}
  [[c, a], [a, a], [a, a]] -> [ [c, a] , [a, b] , [b, a] , [a, a] ] {- Semlab 2 (Concon 1 (Input 1)) -}
  [[c, a], [a, a], [a, c]] -> [ [c, a] , [a, b] , [b, a] , [a, c] ] {- Semlab 2 (Concon 2 (Input 1)) -}
  [[c, a], [a, a], [a, b]] -> [ [c, a] , [a, b] , [b, a] , [a, b] ] {- Semlab 2 (Concon 3 (Input 1)) -}
  [[b, a], [a, a], [a, >]] -> [ [b, a] , [a, b] , [b, a] , [a, >] ] {- Semlab 3 (Concon 0 (Input 1)) -}
  [[b, a], [a, a], [a, a]] -> [ [b, a] , [a, b] , [b, a] , [a, a] ] {- Semlab 3 (Concon 1 (Input 1)) -}
  [[b, a], [a, a], [a, c]] -> [ [b, a] , [a, b] , [b, a] , [a, c] ] {- Semlab 3 (Concon 2 (Input 1)) -}
  [[b, a], [a, a], [a, b]] -> [ [b, a] , [a, b] , [b, a] , [a, b] ] {- Semlab 3 (Concon 3 (Input 1)) -}
  [[<, b], [b, a]] ->= [ [<, b] , [b, c] , [c, a] ] {- Semlab 0 (Concon 0 (Input 2)) -}
  [[<, b], [b, c]] ->= [ [<, b] , [b, c] , [c, c] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[<, b], [b, b]] ->= [ [<, b] , [b, c] , [c, b] ] {- Semlab 0 (Concon 2 (Input 2)) -}
  [[a, b], [b, a]] ->= [ [a, b] , [b, c] , [c, a] ] {- Semlab 1 (Concon 0 (Input 2)) -}
  [[a, b], [b, c]] ->= [ [a, b] , [b, c] , [c, c] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[a, b], [b, b]] ->= [ [a, b] , [b, c] , [c, b] ] {- Semlab 1 (Concon 2 (Input 2)) -}
  [[c, b], [b, a]] ->= [ [c, b] , [b, c] , [c, a] ] {- Semlab 2 (Concon 0 (Input 2)) -}
  [[c, b], [b, c]] ->= [ [c, b] , [b, c] , [c, c] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[c, b], [b, b]] ->= [ [c, b] , [b, c] , [c, b] ] {- Semlab 2 (Concon 2 (Input 2)) -}
  [[b, b], [b, a]] ->= [ [b, b] , [b, c] , [c, a] ] {- Semlab 3 (Concon 0 (Input 2)) -}
  [[b, b], [b, c]] ->= [ [b, b] , [b, c] , [c, c] ] {- Semlab 3 (Concon 1 (Input 2)) -}
  [[b, b], [b, b]] ->= [ [b, b] , [b, c] , [c, b] ] {- Semlab 3 (Concon 2 (Input 2)) -}
reason
  ([<, a], 18/1)
  ([a, c], 48/1)
  ([a, a], 17/1)
   property Termination
has value Just True
for SRS
  [[c, a], [a, c], [c, b], [b, c]] -> [ [c, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -}
  [[b, a], [a, c], [c, b], [b, c]] -> [ [b, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 3 (Concon 1 (Input 0)) -}
  [[<, b], [b, a]] ->= [ [<, b] , [b, c] , [c, a] ] {- Semlab 0 (Concon 0 (Input 2)) -}
  [[<, b], [b, c]] ->= [ [<, b] , [b, c] , [c, c] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[<, b], [b, b]] ->= [ [<, b] , [b, c] , [c, b] ] {- Semlab 0 (Concon 2 (Input 2)) -}
  [[a, b], [b, a]] ->= [ [a, b] , [b, c] , [c, a] ] {- Semlab 1 (Concon 0 (Input 2)) -}
  [[a, b], [b, c]] ->= [ [a, b] , [b, c] , [c, c] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[a, b], [b, b]] ->= [ [a, b] , [b, c] , [c, b] ] {- Semlab 1 (Concon 2 (Input 2)) -}
  [[c, b], [b, a]] ->= [ [c, b] , [b, c] , [c, a] ] {- Semlab 2 (Concon 0 (Input 2)) -}
  [[c, b], [b, c]] ->= [ [c, b] , [b, c] , [c, c] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[c, b], [b, b]] ->= [ [c, b] , [b, c] , [c, b] ] {- Semlab 2 (Concon 2 (Input 2)) -}
  [[b, b], [b, a]] ->= [ [b, b] , [b, c] , [c, a] ] {- Semlab 3 (Concon 0 (Input 2)) -}
  [[b, b], [b, c]] ->= [ [b, b] , [b, c] , [c, c] ] {- Semlab 3 (Concon 1 (Input 2)) -}
  [[b, b], [b, b]] ->= [ [b, b] , [b, c] , [c, b] ] {- Semlab 3 (Concon 2 (Input 2)) -}
reason
  Tiling   { method = Overlap, width = 2, state_type = Bit64, map_type = Enum, unlabel = True, print_completion_steps = False, print_tiles = False, verbose = False, tracing = True}
  steps 1
  using 31 tiles
  remove some unmatched rules
  steps: 1
  
   property Termination
has value Just True
for SRS
  [[c, a], [a, c], [c, b], [b, c]] -> [ [c, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -}
  [[b, a], [a, c], [c, b], [b, c]] -> [ [b, b] , [b, a] , [a, b] , [b, a] , [ a , c ] ] {- Semlab 3 (Concon 1 (Input 0)) -}
  [[<, b], [b, c]] ->= [ [<, b] , [b, c] , [c, c] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[a, b], [b, a]] ->= [ [a, b] , [b, c] , [c, a] ] {- Semlab 1 (Concon 0 (Input 2)) -}
  [[a, b], [b, c]] ->= [ [a, b] , [b, c] , [c, c] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[a, b], [b, b]] ->= [ [a, b] , [b, c] , [c, b] ] {- Semlab 1 (Concon 2 (Input 2)) -}
  [[c, b], [b, a]] ->= [ [c, b] , [b, c] , [c, a] ] {- Semlab 2 (Concon 0 (Input 2)) -}
  [[c, b], [b, c]] ->= [ [c, b] , [b, c] , [c, c] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[c, b], [b, b]] ->= [ [c, b] , [b, c] , [c, b] ] {- Semlab 2 (Concon 2 (Input 2)) -}
  [[b, b], [b, a]] ->= [ [b, b] , [b, c] , [c, a] ] {- Semlab 3 (Concon 0 (Input 2)) -}
  [[b, b], [b, c]] ->= [ [b, b] , [b, c] , [c, c] ] {- Semlab 3 (Concon 1 (Input 2)) -}
  [[b, b], [b, b]] ->= [ [b, b] , [b, c] , [c, b] ] {- Semlab 3 (Concon 2 (Input 2)) -}
reason
  ( [c, a]
  , St  / 1 0 \
        \ 0 1 / )
  ( [a, c]
  , St  / 2 0 \
        \ 0 1 / )
  ( [c, b]
  , St  / 1 1 \
        \ 0 1 / )
  ( [b, c]
  , St  / 1 0 \
        \ 0 1 / )
  ( [b, a]
  , St  / 1 0 \
        \ 0 1 / )
  ( [a, b]
  , St  / 1 0 \
        \ 0 1 / )
  ( [b, b]
  , St  / 1 1 \
        \ 0 1 / )
  ( [<, b]
  , St  / 2 0 \
        \ 0 1 / )
  ( [c, c]
  , St  / 1 0 \
        \ 0 1 / )
   property Termination
has value Just True
for SRS
  [[<, b], [b, c]] ->= [ [<, b] , [b, c] , [c, c] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[a, b], [b, a]] ->= [ [a, b] , [b, c] , [c, a] ] {- Semlab 1 (Concon 0 (Input 2)) -}
  [[a, b], [b, c]] ->= [ [a, b] , [b, c] , [c, c] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[a, b], [b, b]] ->= [ [a, b] , [b, c] , [c, b] ] {- Semlab 1 (Concon 2 (Input 2)) -}
  [[c, b], [b, a]] ->= [ [c, b] , [b, c] , [c, a] ] {- Semlab 2 (Concon 0 (Input 2)) -}
  [[c, b], [b, c]] ->= [ [c, b] , [b, c] , [c, c] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[c, b], [b, b]] ->= [ [c, b] , [b, c] , [c, b] ] {- Semlab 2 (Concon 2 (Input 2)) -}
  [[b, b], [b, a]] ->= [ [b, b] , [b, c] , [c, a] ] {- Semlab 3 (Concon 0 (Input 2)) -}
  [[b, b], [b, c]] ->= [ [b, b] , [b, c] , [c, c] ] {- Semlab 3 (Concon 1 (Input 2)) -}
  [[b, b], [b, b]] ->= [ [b, b] , [b, c] , [c, b] ] {- Semlab 3 (Concon 2 (Input 2)) -}
reason
  ([b, a], 3/1)
  ([b, b], 3/1)
   property Termination
has value Just True
for SRS
  [[<, b], [b, c]] ->= [ [<, b] , [b, c] , [c, c] ] {- Semlab 0 (Concon 1 (Input 2)) -}
  [[a, b], [b, c]] ->= [ [a, b] , [b, c] , [c, c] ] {- Semlab 1 (Concon 1 (Input 2)) -}
  [[c, b], [b, c]] ->= [ [c, b] , [b, c] , [c, c] ] {- Semlab 2 (Concon 1 (Input 2)) -}
  [[b, b], [b, c]] ->= [ [b, b] , [b, c] , [c, c] ] {- Semlab 3 (Concon 1 (Input 2)) -}
reason
  no strict rules

**************************************************
skeleton: (2/1,3)\TileAllROC{2}(28/12,12)\Weight(2/12,9)\TileRemoveROC{2}(2/10,9)\Matrix{\Natural}{2}(0/10,8)\Weight(0/4,6)[]
**************************************************
let {}
in let {done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 100000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,tracing = True})) (Worker Remap));matrix = \ mo dom dim bits -> when_small (weighted (Worker (Matrix {monotone = mo,domain = dom,dim = dim,bits = bits,shape = Corner})));kbo = \ b -> when_medium (weighted (Worker (KBO {bits = b,solver = Minisatapi})));yeah = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ kbo 1, And_Then (Worker Mirror) (kbo 1)] <> ((for [ 3, 4] (\ d -> matrix Strict Natural d 3)) <> (for [ 2, 3, 5] (\ w -> tiling Overlap w))))));noh = [ Timeout 5 (Worker (Enumerate {closure = Forward})), Timeout 5 (Worker (Enumerate {closure = Backward}))]}
  in Apply (Worker Remap) (First_Of ([ yeah] <> noh))