/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 2 rules on 2 letters DP SRS with 8 strict rules and 2 weak rules on 4 letters EDG SRS with 8 strict rules and 2 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 7 strict rules and 2 weak rules on 4 letters EDG SRS with 7 strict rules and 2 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 6 strict rules and 2 weak rules on 4 letters EDG SRS with 6 strict rules and 2 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 4, solver = Minisatapi, verbose = False, tracing = False} SRS with 3 strict rules and 2 weak rules on 4 letters weights SRS with 0 strict rules and 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, b, a] -> [a, b, b, b] {- Input 0 -} [b, b, b] -> [b, a, a, a] {- Input 1 -} reason DP property Termination has value Just True for SRS [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} [a#, a, b, a] |-> [a#, b, b, b] {- DP (Top 0) (Input 0) -} [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [b#, b, b] |-> [b#, a, a, a] {- DP (Top 0) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a, b, a] |-> [a#, b, b, b] {- DP (Top 0) (Input 0) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [b#, a, a, a] {- DP (Top 0) (Input 1) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason ( a , Wk / 0A 0A \ \ -2A -2A / ) ( b , Wk / 0A 0A \ \ 0A 0A / ) ( a# , Wk / 16A 16A \ \ 16A 16A / ) ( b# , Wk / 14A 16A \ \ 14A 16A / ) property Termination has value Just True for SRS [a#, a, b, a] |-> [a#, b, b, b] {- DP (Top 0) (Input 0) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a, b, a] |-> [a#, b, b, b] {- DP (Top 0) (Input 0) -} [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason ( a , Wk / 0A 0A \ \ 0A 0A / ) ( b , Wk / 0A 0A \ \ -2A -2A / ) ( a# , Wk / 9A 10A \ \ 9A 10A / ) ( b# , Wk / 10A 10A \ \ 10A 10A / ) property Termination has value Just True for SRS [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [b#, b, b] |-> [a#, a, a] {- DP (Top 1) (Input 1) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [b#, b, b] |-> [a#, a] {- DP (Top 2) (Input 1) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [b#, b, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason ( a , Wk / 0A 0A 4A 4A \ | -4A -4A 0A 0A | | -4A -4A 0A 0A | \ -4A -4A 0A 0A / ) ( b , Wk / 0A 0A 0A 4A \ | 0A 0A 0A 0A | | 0A 0A 0A 0A | \ -4A -4A 0A 0A / ) ( a# , Wk / 17A 20A 20A 20A \ | 17A 20A 20A 20A | | 17A 20A 20A 20A | \ 17A 20A 20A 20A / ) ( b# , Wk / 20A 21A 21A 21A \ | 20A 21A 21A 21A | | 20A 21A 21A 21A | \ 20A 21A 21A 21A / ) property Termination has value Just True for SRS [a#, a, b, a] |-> [b#] {- DP (Top 3) (Input 0) -} [a#, a, b, a] |-> [b#, b, b] {- DP (Top 1) (Input 0) -} [a#, a, b, a] |-> [b#, b] {- DP (Top 2) (Input 0) -} [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason (a#, 3/1) property Termination has value Just True for SRS [a, a, b, a] ->= [a, b, b, b] {- DP Nontop (Input 0) -} [b, b, b] ->= [b, a, a, a] {- DP Nontop (Input 1) -} reason EDG ************************************************** skeleton: (2,2)\Deepee\EDG(8/2,4)\Matrix{\Arctic}{2}\EDG(7/2,4)\Matrix{\Arctic}{2}\EDG(6/2,4)\Matrix{\Arctic}{4}(3/2,4)\Weight(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 3.230425654000 min duration 2.825155211000 total durat. 6.055580865000 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 = 8 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 48} , self = 149 , parent = Just 86 , duration = 2.825155211000 , status = Fail , start = 2021-07-13 11:58:05.212449538 UTC , finish = 2021-07-13 11:58:08.037604749 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '1' , '3' ] , 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 = 8 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 54} , self = 124 , parent = Just 12 , duration = 3.230425654000 , status = Fail , start = 2021-07-13 11:58:03.754592437 UTC , finish = 2021-07-13 11:58:06.985018091 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '0' ] , 0 , True )} 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 3 max duration 1.250896703000 min duration 0.647587823000 total durat. 2.668217928000 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 = 6 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 41} , self = 159 , parent = Just 130 , duration = 1.250896703000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 11:58:07.379818983 UTC , finish = 2021-07-13 11:58:08.630715686 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '2' , '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 = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 2.768574970000 min duration 0.592998701000 total durat. 3.361573671000 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 = 8 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 54} , self = 131 , parent = Just 12 , duration = 2.768574970000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 11:58:04.608846748 UTC , finish = 2021-07-13 11:58:07.377421718 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '4' ] , 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 4 max duration 0.854114074000 min duration 0.608418112000 total durat. 2.767142084000 Success : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.765913569000 min duration 0.640233670000 total durat. 1.406147239000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.650326466000 min duration 0.514319258000 total durat. 1.758357536000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.970318061000 min duration 2.817250287000 total durat. 5.787568348000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 8 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 48} , self = 154 , parent = Just 86 , duration = 2.817250287000 , status = Success , start = 2021-07-13 11:58:05.806518805 UTC , finish = 2021-07-13 11:58:08.623769092 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '5' , '6' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 8 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 54} , self = 127 , parent = Just 12 , duration = 2.970318061000 , status = Success , start = 2021-07-13 11:58:04.404060888 UTC , finish = 2021-07-13 11:58:07.374378949 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '2' ] , 0 , True )} Success : Tiling { method = Backward , 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 1 max duration 1.484067902000 min duration 1.484067902000 total durat. 1.484067902000 Info { what = Tiling { method = Backward , 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 15} , self = 95 , parent = Just 0 , duration = 1.484067902000 , status = Success , start = 2021-07-13 11:58:03.754322994 UTC , finish = 2021-07-13 11:58:05.238390896 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '6' ] , 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 4 max duration 0.957015048000 min duration 0.034263016000 total durat. 2.217213516000 Success : Tiling { method = Forward , 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 1 max duration 1.794951430000 min duration 1.794951430000 total durat. 1.794951430000 Info { what = Tiling { method = Forward , 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 15} , self = 100 , parent = Just 0 , duration = 1.794951430000 , status = Success , start = 2021-07-13 11:58:03.754503856 UTC , finish = 2021-07-13 11:58:05.549455286 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '8' ] , 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 8 max duration 3.980101071000 min duration 0.135135680000 total durat. 7.186281415000 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 = 48 , num_strict_rules = 18 , num_top_rules = 18 , num_weak_rules = 30 , alphabet_size = 14 , total_length = 438} , self = 146 , parent = Just 38 , duration = 3.980101071000 , status = Success , start = 2021-07-13 11:58:04.043351494 UTC , finish = 2021-07-13 11:58:08.023452565 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '1' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 6 max duration 0.592530825000 min duration 0.000450485000 total durat. 1.901340870000 Fail : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 21 max duration 0.386380081000 min duration 0.000218704000 total durat. 1.017820001000 **************************************************