/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 2 rules on 2 letters mirror SRS with 2 rules on 2 letters DP SRS with 3 strict rules and 2 weak rules on 3 letters weights SRS with 2 strict rules and 2 weak rules on 3 letters EDG SRS with 2 strict rules and 2 weak rules on 3 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 3, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, a, b] -> [b, a, a, a] {- Input 0 -} [b, b] -> [a, b, a, b] {- Input 1 -} reason mirror property Termination has value Just True for SRS [b, a, a, a] -> [a, a, a, b] {- Mirror (Input 0) -} [b, b] -> [b, a, b, a] {- Mirror (Input 1) -} reason DP property Termination has value Just True for SRS [b, a, a, a] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, b] ->= [b, a, b, a] {- DP Nontop (Mirror (Input 1)) -} [b#, a, a, a] |-> [b#] {- DP (Top 3) (Mirror (Input 0)) -} [b#, b] |-> [b#, a] {- DP (Top 2) (Mirror (Input 1)) -} [b#, b] |-> [b#, a, b, a] {- DP (Top 0) (Mirror (Input 1)) -} reason (b, 1/1) property Termination has value Just True for SRS [b, a, a, a] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, b] ->= [b, a, b, a] {- DP Nontop (Mirror (Input 1)) -} [b#, a, a, a] |-> [b#] {- DP (Top 3) (Mirror (Input 0)) -} [b#, b] |-> [b#, a, b, a] {- DP (Top 0) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [b#, a, a, a] |-> [b#] {- DP (Top 3) (Mirror (Input 0)) -} [b#, b] |-> [b#, a, b, a] {- DP (Top 0) (Mirror (Input 1)) -} [b, a, a, a] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, b] ->= [b, a, b, a] {- DP Nontop (Mirror (Input 1)) -} reason ( b , Wk / 0 0 1 0 \ | 0 0 1 0 | | 0 3 2 2 | \ 0 0 0 1 / ) ( a , Wk / 0 0 2 1 \ | 1 0 0 0 | | 0 1 0 0 | \ 0 0 0 1 / ) ( b# , Wk / 0 0 2 3 \ | 0 0 0 0 | | 0 0 0 0 | \ 0 0 0 1 / ) property Termination has value Just True for SRS [b, a, a, a] ->= [a, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, b] ->= [b, a, b, a] {- DP Nontop (Mirror (Input 1)) -} reason EDG ************************************************** skeleton: \Mirror(2,2)\Deepee(3/2,3)\Weight\EDG(2/2,3)\Matrix{\Natural}{4}(0/2,2)\EDG[] ************************************************** 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) ************************************************** Fail : 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.671362725000 min duration 1.774711617000 total durat. 4.446074342000 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 = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 25} , self = 86 , parent = Just 11 , duration = 1.774711617000 , status = Fail , start = 2021-07-13 23:39:53.990159183 UTC , finish = 2021-07-13 23:39:55.7648708 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '6' ] , 0 , True )} 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 = 5 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 33} , self = 94 , parent = Just 16 , duration = 2.671362725000 , status = Fail , start = 2021-07-13 23:39:53.993618995 UTC , finish = 2021-07-13 23:39:56.66498172 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '6' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 8.006803511000 min duration 8.006803511000 total durat. 8.006803511000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 25} , self = 128 , parent = Just 11 , duration = 8.006803511000 , status = Success , start = 2021-07-13 23:39:54.385595357 UTC , finish = 2021-07-13 23:40:02.392398868 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '0' ] , 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 0.619745681000 min duration 0.395229152000 total durat. 1.014974833000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.512714623000 min duration 1.707455810000 total durat. 4.220170433000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 25} , self = 87 , parent = Just 11 , duration = 1.707455810000 , status = Fail , start = 2021-07-13 23:39:54.359363774 UTC , finish = 2021-07-13 23:39:56.066819584 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '5' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 33} , self = 97 , parent = Just 16 , duration = 2.512714623000 , status = Fail , start = 2021-07-13 23:39:54.516892803 UTC , finish = 2021-07-13 23:39:57.029607426 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '4' ] , 0 , 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 4 max duration 3.049485956000 min duration 0.036576858000 total durat. 3.573396991000 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 = 90 , num_strict_rules = 90 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 20 , total_length = 972} , self = 102 , parent = Just 68 , duration = 3.049485956000 , status = Success , start = 2021-07-13 23:39:55.243731627 UTC , finish = 2021-07-13 23:39:58.293217583 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '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 5 max duration 6.355500602000 min duration 0.042707601000 total durat. 7.353733226000 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 = 90 , num_strict_rules = 90 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 20 , total_length = 972} , self = 123 , parent = Just 68 , duration = 6.355500602000 , status = Success , start = 2021-07-13 23:39:55.550906722 UTC , finish = 2021-07-13 23:40:01.906407324 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '5' ] , 3 , True )} 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 6 max duration 3.057214271000 min duration 0.128188317000 total durat. 8.342593353000 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 = 26 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 21 , alphabet_size = 10 , total_length = 224} , self = 76 , parent = Just 41 , duration = 1.231292267000 , status = Success , start = 2021-07-13 23:39:54.238997147 UTC , finish = 2021-07-13 23:39:55.470289414 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '1' ] , 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 = 23 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 18 , alphabet_size = 9 , total_length = 200} , self = 98 , parent = Just 77 , duration = 1.574933918000 , status = Success , start = 2021-07-13 23:39:55.537105297 UTC , finish = 2021-07-13 23:39:57.112039215 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '9' ] , 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 = 33 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 25 , alphabet_size = 13 , total_length = 285} , self = 88 , parent = Just 43 , duration = 2.208202295000 , status = Success , start = 2021-07-13 23:39:54.264757569 UTC , finish = 2021-07-13 23:39:56.472959864 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 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 = 26 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 20 , alphabet_size = 12 , total_length = 230} , self = 113 , parent = Just 89 , duration = 3.057214271000 , status = Success , start = 2021-07-13 23:39:56.547680838 UTC , finish = 2021-07-13 23:39:59.604895109 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '6' , '8' ] , 3 , True )} Success : Tiling { method = Overlap , width = 4 , 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 2 max duration 3.424984927000 min duration 2.715491807000 total durat. 6.140476734000 Info { what = Tiling { method = Overlap , width = 4 , 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 = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 3 , total_length = 25} , self = 95 , parent = Just 11 , duration = 2.715491807000 , status = Success , start = 2021-07-13 23:39:53.997569736 UTC , finish = 2021-07-13 23:39:56.713061543 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '7' ] , 3 , True )} Info { what = Tiling { method = Overlap , width = 4 , 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 = 3 , num_top_rules = 3 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 33} , self = 100 , parent = Just 16 , duration = 3.424984927000 , status = Success , start = 2021-07-13 23:39:53.999582323 UTC , finish = 2021-07-13 23:39:57.42456725 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '1' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 12 max duration 4.314065999000 min duration 0.000637696000 total durat. 13.807213984000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 222 , num_strict_rules = 18 , num_top_rules = 18 , num_weak_rules = 204 , alphabet_size = 40 , total_length = 2430} , self = 121 , parent = Just 114 , duration = 1.894902517000 , status = Success , start = 2021-07-13 23:39:59.60511224 UTC , finish = 2021-07-13 23:40:01.500014757 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '4' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 197 , num_strict_rules = 17 , num_top_rules = 17 , num_weak_rules = 180 , alphabet_size = 35 , total_length = 2142} , self = 112 , parent = Just 99 , duration = 2.489621127000 , status = Success , start = 2021-07-13 23:39:57.112217902 UTC , finish = 2021-07-13 23:39:59.601839029 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '9' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 285 , num_strict_rules = 285 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 37 , total_length = 3720} , self = 108 , parent = Just 67 , duration = 4.288914047000 , status = Success , start = 2021-07-13 23:39:54.913638652 UTC , finish = 2021-07-13 23:39:59.202552699 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '1' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 285 , num_strict_rules = 285 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 37 , total_length = 3720} , self = 109 , parent = Just 71 , duration = 4.314065999000 , status = Success , start = 2021-07-13 23:39:54.955128325 UTC , finish = 2021-07-13 23:39:59.269194324 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '2' ] , 3 , False )} **************************************************