/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 7 rules on 4 letters weights SRS with 6 rules on 4 letters remove some, by Config { method = Backward,width = 2,unlabel = True} SRS with 5 rules on 4 letters remove some, by Config { method = Backward,width = 8,unlabel = True} SRS with 1 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [b, b, d, d, b, b] -> [c, c, d, d, b, b] {- Input 0 -} [b, b, a, a, c, c] -> [b, b, c, c] {- Input 1 -} [a, a, d, d] -> [d, d, c, c] {- Input 2 -} [b, b, b, b, b, b] -> [a, a, b, b, c, c] {- Input 3 -} [d, d, c, c] -> [b, b, d, d] {- Input 4 -} [d, d, c, c] -> [d, d, b, b, d, d] {- Input 5 -} [d, d, a, a, c, c] -> [b, b, b, b] {- Input 6 -} reason (b, 1/3) (c, 1/3) (a, 1/3) property Termination has value Just True for SRS [b, b, d, d, b, b] -> [c, c, d, d, b, b] {- Input 0 -} [a, a, d, d] -> [d, d, c, c] {- Input 2 -} [b, b, b, b, b, b] -> [a, a, b, b, c, c] {- Input 3 -} [d, d, c, c] -> [b, b, d, d] {- Input 4 -} [d, d, c, c] -> [d, d, b, b, d, d] {- Input 5 -} [d, d, a, a, c, c] -> [b, b, b, b] {- Input 6 -} reason Tiling { method = Backward, width = 2, state_type = Bit64, 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} steps 1 using 22 tiles remove some unmatched rules steps: 1 property Termination has value Just True for SRS [b, b, d, d, b, b] -> [c, c, d, d, b, b] {- Input 0 -} [b, b, b, b, b, b] -> [a, a, b, b, c, c] {- Input 3 -} [d, d, c, c] -> [b, b, d, d] {- Input 4 -} [d, d, c, c] -> [d, d, b, b, d, d] {- Input 5 -} [d, d, a, a, c, c] -> [b, b, b, b] {- Input 6 -} reason Tiling { method = Backward, width = 8, state_type = Bit64, 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} steps 2 using 254 tiles remove some unmatched rules steps: 2 property Termination has value Just True for SRS [b, b, d, d, b, b] -> [c, c, d, d, b, b] {- Input 0 -} reason (b, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (7,4)\Weight(6,4)\TileRemoveRFCrev{2}(5,4)\TileRemoveRFCrev{8}(1,3)\Weight(0,0)[] ************************************************** 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' ] : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 2.970571301000 min duration 0.833591280000 total durat. 3.804162581000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 70} , self = 89 , parent = Just 43 , duration = 2.970571301000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:31.493053569 UTC , finish = 2021-07-13 23:40:34.46362487 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '3' ] , 0 , True )} Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 1.069298508000 min duration 1.012554558000 total durat. 2.081853066000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 72} , self = 50 , parent = Just 21 , duration = 1.012554558000 , status = Fail , start = 2021-07-13 23:40:30.677527219 UTC , finish = 2021-07-13 23:40:31.690081777 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '9' ] , 0 , True )} Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 70} , self = 59 , parent = Just 43 , duration = 1.069298508000 , status = Fail , start = 2021-07-13 23:40:31.493068446 UTC , finish = 2021-07-13 23:40:32.562366954 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '5' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 1.046363339000 min duration 1.046363339000 total durat. 1.046363339000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 8 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 79} , self = 51 , parent = Just 14 , duration = 1.046363339000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:40:30.652006715 UTC , finish = 2021-07-13 23:40:31.698370054 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '7' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.838365021000 min duration 0.808394142000 total durat. 1.646759163000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.131823038000 min duration 2.131823038000 total durat. 2.131823038000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 70} , self = 88 , parent = Just 43 , duration = 2.131823038000 , status = Fail , start = 2021-07-13 23:40:32.331548022 UTC , finish = 2021-07-13 23:40:34.46337106 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '0' ] , 0 , True )} Success : 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 3.687519962000 min duration 3.687519962000 total durat. 3.687519962000 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 = 5 , num_strict_rules = 5 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 52} , self = 84 , parent = Just 28 , duration = 3.687519962000 , status = Success , start = 2021-07-13 23:40:30.747756858 UTC , finish = 2021-07-13 23:40:34.43527682 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '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 3 max duration 0.678077435000 min duration 0.186601159000 total durat. 1.400031919000 Success : Tiling { method = Overlap , 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 4 max duration 2.657090990000 min duration 1.131938960000 total durat. 8.331429447000 Info { what = Tiling { method = Overlap , 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 = 8 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 79} , self = 52 , parent = Just 14 , duration = 1.131938960000 , status = Success , start = 2021-07-13 23:40:30.660901878 UTC , finish = 2021-07-13 23:40:31.792840838 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '8' ] , 3 , True )} Info { what = Tiling { method = Overlap , 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 = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 72} , self = 60 , parent = Just 21 , duration = 2.183292469000 , status = Success , start = 2021-07-13 23:40:30.692828356 UTC , finish = 2021-07-13 23:40:32.876120825 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '2' ] , 3 , True )} Info { what = Tiling { method = Overlap , 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 = 7 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 5 , alphabet_size = 5 , total_length = 71} , self = 75 , parent = Just 53 , duration = 2.359107028000 , status = Success , start = 2021-07-13 23:40:31.816520329 UTC , finish = 2021-07-13 23:40:34.175627357 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '3' ] , 3 , True )} Info { what = Tiling { method = Overlap , 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 = 7 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 6 , alphabet_size = 5 , total_length = 70} , self = 72 , parent = Just 43 , duration = 2.657090990000 , status = Success , start = 2021-07-13 23:40:31.505585138 UTC , finish = 2021-07-13 23:40:34.162676128 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '5' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 6 max duration 2.210391424000 min duration 0.001103574000 total durat. 4.382022862000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 110 , num_strict_rules = 110 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 22 , total_length = 1380} , self = 66 , parent = Just 37 , duration = 2.136518011000 , status = Success , start = 2021-07-13 23:40:31.176290314 UTC , finish = 2021-07-13 23:40:33.312808325 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 110 , num_strict_rules = 110 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 22 , total_length = 1380} , self = 67 , parent = Just 39 , duration = 2.210391424000 , status = Success , start = 2021-07-13 23:40:31.278368423 UTC , finish = 2021-07-13 23:40:33.488759847 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '5' ] , 3 , False )} **************************************************