/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 4 rules on 2 letters DP SRS with 7 strict rules and 4 weak rules on 4 letters EDG SRS with 7 strict rules and 4 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 1 strict rules and 4 weak rules on 4 letters weights SRS with 0 strict rules and 4 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, b, a] -> [a] {- Input 1 -} [b, a, a, b] -> [a, a, a, a, b, b, b] {- Input 2 -} [a, a, a, a] -> [b] {- Input 3 -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b, a] ->= [a] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [a, a, a, a, b, b, b] {- DP Nontop (Input 2) -} [a, a, a, a] ->= [b] {- DP Nontop (Input 3) -} [a#, a, a, a] |-> [b#] {- DP (Top 0) (Input 3) -} [b#, a, a, b] |-> [a#, a, a, a, b, b, b] {- DP (Top 0) (Input 2) -} [b#, a, a, b] |-> [a#, a, a, b, b, b] {- DP (Top 1) (Input 2) -} [b#, a, a, b] |-> [a#, a, b, b, b] {- DP (Top 2) (Input 2) -} [b#, a, a, b] |-> [a#, b, b, b] {- DP (Top 3) (Input 2) -} [b#, a, a, b] |-> [b#, b] {- DP (Top 5) (Input 2) -} [b#, a, a, b] |-> [b#, b, b] {- DP (Top 4) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a, a, a] |-> [b#] {- DP (Top 0) (Input 3) -} [b#, a, a, b] |-> [b#, b, b] {- DP (Top 4) (Input 2) -} [b#, a, a, b] |-> [b#, b] {- DP (Top 5) (Input 2) -} [b#, a, a, b] |-> [a#, b, b, b] {- DP (Top 3) (Input 2) -} [b#, a, a, b] |-> [a#, a, b, b, b] {- DP (Top 2) (Input 2) -} [b#, a, a, b] |-> [a#, a, a, b, b, b] {- DP (Top 1) (Input 2) -} [b#, a, a, b] |-> [a#, a, a, a, b, b, b] {- DP (Top 0) (Input 2) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, b, a] ->= [a] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [a, a, a, a, b, b, b] {- DP Nontop (Input 2) -} [a, a, a, a] ->= [b] {- DP Nontop (Input 3) -} reason ( a , Wk / 0A 0A 0A 4A \ | 0A 0A 0A 0A | | -4A 0A 0A 0A | \ -4A -4A 0A 0A / ) ( b , Wk / 0A 0A 0A 4A \ | 0A 0A 0A 4A | | 0A 0A 0A 4A | \ -4A -4A -4A 0A / ) ( a# , Wk / 13A 13A 17A 17A \ | 13A 13A 17A 17A | | 13A 13A 17A 17A | \ 13A 13A 17A 17A / ) ( b# , Wk / 17A 17A 17A 21A \ | 17A 17A 17A 21A | | 17A 17A 17A 21A | \ 17A 17A 17A 21A / ) property Termination has value Just True for SRS [a#, a, a, a] |-> [b#] {- DP (Top 0) (Input 3) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, b, a] ->= [a] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [a, a, a, a, b, b, b] {- DP Nontop (Input 2) -} [a, a, a, a] ->= [b] {- DP Nontop (Input 3) -} reason (a#, 1/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b, a] ->= [a] {- DP Nontop (Input 1) -} [b, a, a, b] ->= [a, a, a, a, b, b, b] {- DP Nontop (Input 2) -} [a, a, a, a] ->= [b] {- DP Nontop (Input 3) -} reason EDG ************************************************** skeleton: (4,2)\Deepee\EDG(7/4,4)\Matrix{\Arctic}{4}(1/4,4)\Weight(0/4,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.957469607000 min duration 3.541676709000 total durat. 7.499146316000 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 = 10 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 61} , self = 113 , parent = Just 63 , duration = 3.541676709000 , status = Fail , start = 2021-07-13 22:00:11.523556949 UTC , finish = 2021-07-13 22:00:15.065233658 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '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 = 11 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 77} , self = 106 , parent = Just 13 , duration = 3.957469607000 , status = Fail , start = 2021-07-13 22:00:10.733057883 UTC , finish = 2021-07-13 22:00:14.69052749 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '6' ] , 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 1 max duration 3.519183758000 min duration 3.519183758000 total durat. 3.519183758000 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 = 11 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 77} , self = 118 , parent = Just 13 , duration = 3.519183758000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:00:11.671107045 UTC , finish = 2021-07-13 22:00:15.190290803 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '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 0.937826577000 min duration 0.690247944000 total durat. 1.628074521000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.786169839000 min duration 0.643876630000 total durat. 1.430046469000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 3.664871512000 min duration 3.664871512000 total durat. 3.664871512000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 11 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 77} , self = 114 , parent = Just 13 , duration = 3.664871512000 , status = Success , start = 2021-07-13 22:00:11.519330252 UTC , finish = 2021-07-13 22:00:15.184201764 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '5' ] , 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.538528704000 min duration 1.538528704000 total durat. 1.538528704000 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 = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 21} , self = 84 , parent = Just 0 , duration = 1.538528704000 , status = Success , start = 2021-07-13 22:00:10.733327181 UTC , finish = 2021-07-13 22:00:12.271855885 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '8' ] , 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.949825134000 min duration 0.055611620000 total durat. 2.086617240000 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.484791860000 min duration 1.484791860000 total durat. 1.484791860000 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 = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 21} , self = 82 , parent = Just 0 , duration = 1.484791860000 , status = Success , start = 2021-07-13 22:00:10.733018777 UTC , finish = 2021-07-13 22:00:12.217810637 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '6' , '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.453074998000 min duration 0.313231130000 total durat. 8.441183187000 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 = 59 , num_strict_rules = 14 , num_top_rules = 14 , num_weak_rules = 45 , alphabet_size = 14 , total_length = 482} , self = 103 , parent = Just 54 , duration = 3.146686709000 , status = Success , start = 2021-07-13 22:00:11.484273856 UTC , finish = 2021-07-13 22:00:14.630960565 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '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 = 71 , num_strict_rules = 20 , num_top_rules = 20 , num_weak_rules = 51 , alphabet_size = 14 , total_length = 591} , self = 107 , parent = Just 47 , duration = 3.453074998000 , status = Success , start = 2021-07-13 22:00:11.254322555 UTC , finish = 2021-07-13 22:00:14.707397553 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 9 max duration 1.204304885000 min duration 0.000349487000 total durat. 3.502582893000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 265 , num_strict_rules = 265 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 29 , total_length = 2423} , self = 92 , parent = Just 73 , duration = 1.172540571000 , status = Success , start = 2021-07-13 22:00:11.710533259 UTC , finish = 2021-07-13 22:00:12.88307383 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '5' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 265 , num_strict_rules = 265 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 29 , total_length = 2423} , self = 94 , parent = Just 75 , duration = 1.204304885000 , status = Success , start = 2021-07-13 22:00:11.866659041 UTC , finish = 2021-07-13 22:00:13.070963926 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '6' ] , 3 , False )} **************************************************