/export/starexec/sandbox2/solver/bin/starexec_run_tc20-rel.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 2 strict rules and 4 weak rules on 3 letters weights SRS with 2 strict rules and 2 weak rules on 3 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 2 strict rules and 1 weak rules on 2 letters tile all, by Config { method = Overlap,width = 2,unlabel = True} SRS with 12 strict rules and 9 weak rules on 7 letters weights SRS with 4 strict rules and 9 weak rules on 7 letters remove some, by Config { method = Overlap,width = 2,unlabel = True} SRS with 4 strict rules and 6 weak rules on 6 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 6 weak rules on 5 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, c] -> [a, a, a] {- Input 0 -} [c, a, c] -> [a, a, a] {- Input 1 -} [b, b, a] ->= [c, c, c] {- Input 2 -} [c, b, a] ->= [a, c, b] {- Input 3 -} [b, b, b] ->= [b, c, b] {- Input 4 -} [c, a, a] ->= [c, c, a] {- Input 5 -} reason (b, 2/1) property Termination has value Just True for SRS [a, a, c] -> [a, a, a] {- Input 0 -} [c, a, c] -> [a, a, a] {- Input 1 -} [c, b, a] ->= [a, c, b] {- Input 3 -} [c, a, a] ->= [c, c, a] {- Input 5 -} reason ( a , St / 1 1 \ \ 0 1 / ) ( c , St / 1 1 \ \ 0 1 / ) ( b , St / 2 0 \ \ 0 1 / ) property Termination has value Just True for SRS [a, a, c] -> [a, a, a] {- Input 0 -} [c, a, c] -> [a, a, a] {- Input 1 -} [c, a, a] ->= [c, c, a] {- Input 5 -} 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 7 tiles tile all rules steps: 1 property Termination has value Just True for SRS [[<, a], [a, a], [a, c], [c, a]] -> [ [<, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 0 (Concon 0 (Input 0)) -} [[<, a], [a, a], [a, c], [c, c]] -> [ [<, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 0 (Concon 1 (Input 0)) -} [[a, a], [a, a], [a, c], [c, a]] -> [ [a, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 1 (Concon 0 (Input 0)) -} [[a, a], [a, a], [a, c], [c, c]] -> [ [a, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 1 (Concon 1 (Input 0)) -} [[c, a], [a, a], [a, c], [c, a]] -> [ [c, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 2 (Concon 0 (Input 0)) -} [[c, a], [a, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -} [[<, c], [c, a], [a, c], [c, a]] -> [ [<, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 0 (Concon 0 (Input 1)) -} [[<, c], [c, a], [a, c], [c, c]] -> [ [<, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 0 (Concon 1 (Input 1)) -} [[a, c], [c, a], [a, c], [c, a]] -> [ [a, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 1 (Concon 0 (Input 1)) -} [[a, c], [c, a], [a, c], [c, c]] -> [ [a, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 1 (Concon 1 (Input 1)) -} [[c, c], [c, a], [a, c], [c, a]] -> [ [c, a] , [a, a] , [a, a] , [ a , a ] ] {- Semlab 2 (Concon 0 (Input 1)) -} [[c, c], [c, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 1)) -} [[<, c], [c, a], [a, a], [a, >]] ->= [ [<, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 0 (Concon 0 (Input 5)) -} [[<, c], [c, a], [a, a], [a, a]] ->= [ [<, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 0 (Concon 1 (Input 5)) -} [[<, c], [c, a], [a, a], [a, c]] ->= [ [<, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 0 (Concon 2 (Input 5)) -} [[a, c], [c, a], [a, a], [a, >]] ->= [ [a, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 1 (Concon 0 (Input 5)) -} [[a, c], [c, a], [a, a], [a, a]] ->= [ [a, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 1 (Concon 1 (Input 5)) -} [[a, c], [c, a], [a, a], [a, c]] ->= [ [a, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 1 (Concon 2 (Input 5)) -} [[c, c], [c, a], [a, a], [a, >]] ->= [ [c, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 2 (Concon 0 (Input 5)) -} [[c, c], [c, a], [a, a], [a, a]] ->= [ [c, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 2 (Concon 1 (Input 5)) -} [[c, c], [c, a], [a, a], [a, c]] ->= [ [c, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 2 (Concon 2 (Input 5)) -} reason ([a, c], 7/1) ([c, a], 8/1) ([<, c], 2/1) property Termination has value Just True for SRS [[<, a], [a, a], [a, c], [c, c]] -> [ [<, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 0 (Concon 1 (Input 0)) -} [[a, a], [a, a], [a, c], [c, c]] -> [ [a, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 1 (Concon 1 (Input 0)) -} [[c, a], [a, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -} [[c, c], [c, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 1)) -} [[<, c], [c, a], [a, a], [a, >]] ->= [ [<, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 0 (Concon 0 (Input 5)) -} [[<, c], [c, a], [a, a], [a, a]] ->= [ [<, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 0 (Concon 1 (Input 5)) -} [[<, c], [c, a], [a, a], [a, c]] ->= [ [<, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 0 (Concon 2 (Input 5)) -} [[a, c], [c, a], [a, a], [a, >]] ->= [ [a, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 1 (Concon 0 (Input 5)) -} [[a, c], [c, a], [a, a], [a, a]] ->= [ [a, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 1 (Concon 1 (Input 5)) -} [[a, c], [c, a], [a, a], [a, c]] ->= [ [a, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 1 (Concon 2 (Input 5)) -} [[c, c], [c, a], [a, a], [a, >]] ->= [ [c, c] , [c, c] , [c, a] , [ a , > ] ] {- Semlab 2 (Concon 0 (Input 5)) -} [[c, c], [c, a], [a, a], [a, a]] ->= [ [c, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 2 (Concon 1 (Input 5)) -} [[c, c], [c, a], [a, a], [a, c]] ->= [ [c, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 2 (Concon 2 (Input 5)) -} 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 21 tiles remove some unmatched rules steps: 1 property Termination has value Just True for SRS [[<, a], [a, a], [a, c], [c, c]] -> [ [<, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 0 (Concon 1 (Input 0)) -} [[a, a], [a, a], [a, c], [c, c]] -> [ [a, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 1 (Concon 1 (Input 0)) -} [[c, a], [a, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 0)) -} [[c, c], [c, a], [a, c], [c, c]] -> [ [c, a] , [a, a] , [a, a] , [ a , c ] ] {- Semlab 2 (Concon 1 (Input 1)) -} [[<, c], [c, a], [a, a], [a, a]] ->= [ [<, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 0 (Concon 1 (Input 5)) -} [[<, c], [c, a], [a, a], [a, c]] ->= [ [<, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 0 (Concon 2 (Input 5)) -} [[a, c], [c, a], [a, a], [a, a]] ->= [ [a, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 1 (Concon 1 (Input 5)) -} [[a, c], [c, a], [a, a], [a, c]] ->= [ [a, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 1 (Concon 2 (Input 5)) -} [[c, c], [c, a], [a, a], [a, a]] ->= [ [c, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 2 (Concon 1 (Input 5)) -} [[c, c], [c, a], [a, a], [a, c]] ->= [ [c, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 2 (Concon 2 (Input 5)) -} reason ( [<, a] , St / 2 0 \ \ 0 1 / ) ( [a, a] , St / 2 1 \ \ 0 1 / ) ( [a, c] , St / 2 0 \ \ 0 1 / ) ( [c, c] , St / 2 1 \ \ 0 1 / ) ( [c, a] , St / 1 0 \ \ 0 1 / ) ( [<, c] , St / 2 0 \ \ 0 1 / ) property Termination has value Just True for SRS [[<, c], [c, a], [a, a], [a, a]] ->= [ [<, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 0 (Concon 1 (Input 5)) -} [[<, c], [c, a], [a, a], [a, c]] ->= [ [<, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 0 (Concon 2 (Input 5)) -} [[a, c], [c, a], [a, a], [a, a]] ->= [ [a, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 1 (Concon 1 (Input 5)) -} [[a, c], [c, a], [a, a], [a, c]] ->= [ [a, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 1 (Concon 2 (Input 5)) -} [[c, c], [c, a], [a, a], [a, a]] ->= [ [c, c] , [c, c] , [c, a] , [ a , a ] ] {- Semlab 2 (Concon 1 (Input 5)) -} [[c, c], [c, a], [a, a], [a, c]] ->= [ [c, c] , [c, c] , [c, a] , [ a , c ] ] {- Semlab 2 (Concon 2 (Input 5)) -} reason ([a, a], 6/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (2/4,3)\Weight(2/2,3)\Matrix{\Natural}{2}(2/1,2)\TileAllROC{2}(12/9,7)\Weight(4/9,7)\TileRemoveROC{2}(4/6,6)\Matrix{\Natural}{2}(0/6,5)\Weight(0,0)[] ************************************************** 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))