/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 3 rules on 3 letters DP SRS with 6 strict rules and 3 weak rules on 6 letters weights SRS with 4 strict rules and 3 weak rules on 6 letters EDG SRS with 4 strict rules and 3 weak rules on 6 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 3 strict rules and 3 weak rules on 6 letters weights SRS with 0 strict rules and 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b, c] {- Input 0 -} [b, a, b] -> [c] {- Input 1 -} [c, c] -> [a, a, b] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, a, b] ->= [c] {- DP Nontop (Input 1) -} [c, c] ->= [a, a, b] {- DP Nontop (Input 2) -} [a#] |-> [b#, c] {- DP (Top 0) (Input 0) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [b#, a, b] |-> [c#] {- DP (Top 0) (Input 1) -} [c#, c] |-> [a#, a, b] {- DP (Top 0) (Input 2) -} [c#, c] |-> [a#, b] {- DP (Top 1) (Input 2) -} [c#, c] |-> [b#] {- DP (Top 2) (Input 2) -} reason (a, 1/4) (c, 1/4) (a#, 1/4) (c#, 1/4) property Termination has value Just True for SRS [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, a, b] ->= [c] {- DP Nontop (Input 1) -} [c, c] ->= [a, a, b] {- DP Nontop (Input 2) -} [a#] |-> [b#, c] {- DP (Top 0) (Input 0) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [b#, a, b] |-> [c#] {- DP (Top 0) (Input 1) -} [c#, c] |-> [a#, a, b] {- DP (Top 0) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#] |-> [b#, c] {- DP (Top 0) (Input 0) -} [b#, a, b] |-> [c#] {- DP (Top 0) (Input 1) -} [c#, c] |-> [a#, a, b] {- DP (Top 0) (Input 2) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, a, b] ->= [c] {- DP Nontop (Input 1) -} [c, c] ->= [a, a, b] {- DP Nontop (Input 2) -} reason ( a , Wk / 1A 3A 4A 4A \ | - 2A 0A - | | 0A 1A - - | \ - - - 0A / ) ( b , Wk / 0A 0A 3A 3A \ | - - 1A - | | - - 0A - | \ - - - 0A / ) ( c , Wk / 1A 3A 4A - \ | 1A 1A 4A 4A | | - 0A - - | \ - - - 0A / ) ( a# , Wk / - 1A - 1A \ | - - - - | | - - - - | \ - - - 0A / ) ( b# , Wk / - - 1A 0A \ | - - - - | | - - - - | \ - - - 0A / ) ( c# , Wk / - 1A - 1A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a#] |-> [b#, c] {- DP (Top 0) (Input 0) -} [b#, a, b] |-> [c#] {- DP (Top 0) (Input 1) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, a, b] ->= [c] {- DP Nontop (Input 1) -} [c, c] ->= [a, a, b] {- DP Nontop (Input 2) -} reason (a#, 2/1) (b#, 1/1) property Termination has value Just True for SRS [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, a, b] ->= [c] {- DP Nontop (Input 1) -} [c, c] ->= [a, a, b] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,3)\Deepee(6/3,6)\Weight\EDG(4/3,6)\Matrix{\Arctic}{4}(3/3,6)\Weight(0/3,3)\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 1.778105452000 min duration 1.490175749000 total durat. 3.268281201000 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 = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 26} , self = 45 , parent = Just 16 , duration = 1.490175749000 , status = Fail , start = 2021-07-13 23:28:07.526732307 UTC , finish = 2021-07-13 23:28:09.016908056 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 28} , self = 50 , parent = Just 15 , duration = 1.778105452000 , status = Fail , start = 2021-07-13 23:28:07.526400031 UTC , finish = 2021-07-13 23:28:09.304505483 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '1' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 8.119783972000 min duration 8.119783972000 total durat. 8.119783972000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 26} , self = 63 , parent = Just 16 , duration = 8.119783972000 , status = Success , start = 2021-07-13 23:28:09.017151111 UTC , finish = 2021-07-13 23:28:17.136935083 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.472912759000 min duration 1.780356754000 total durat. 4.253269513000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 26} , self = 53 , parent = Just 16 , duration = 1.780356754000 , status = Fail , start = 2021-07-13 23:28:07.981312783 UTC , finish = 2021-07-13 23:28:09.761669537 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '7' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 28} , self = 60 , parent = Just 15 , duration = 2.472912759000 , status = Fail , start = 2021-07-13 23:28:08.013856176 UTC , finish = 2021-07-13 23:28:10.486768935 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 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 2 max duration 1.712328174000 min duration 0.064068660000 total durat. 1.776396834000 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 = 44 , num_strict_rules = 44 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 14 , total_length = 268} , self = 51 , parent = Just 28 , duration = 1.712328174000 , status = Success , start = 2021-07-13 23:28:07.756673161 UTC , finish = 2021-07-13 23:28:09.469001335 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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 2 max duration 2.061501888000 min duration 0.041694285000 total durat. 2.103196173000 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 = 44 , num_strict_rules = 44 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 14 , total_length = 268} , self = 54 , parent = Just 28 , duration = 2.061501888000 , status = Success , start = 2021-07-13 23:28:07.75663926 UTC , finish = 2021-07-13 23:28:09.818141148 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '3' ] , 3 , True )} Fail : Tiling { method = Overlap , width = 12 , 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 4.288584341000 min duration 4.288584341000 total durat. 4.288584341000 Info { what = Tiling { method = Overlap , width = 12 , 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 = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 26} , self = 61 , parent = Just 16 , duration = 4.288584341000 , status = Fail , start = 2021-07-13 23:28:07.535222617 UTC , finish = 2021-07-13 23:28:11.823806958 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '9' ] , 3 , True )} Fail : Tiling { method = Overlap , 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 6.875868950000 min duration 6.875868950000 total durat. 6.875868950000 Info { what = Tiling { method = Overlap , 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 6 , total_length = 28} , self = 62 , parent = Just 15 , duration = 6.875868950000 , status = Fail , start = 2021-07-13 23:28:07.535040049 UTC , finish = 2021-07-13 23:28:14.410908999 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '1' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 5 max duration 2.342244219000 min duration 0.000385826000 total durat. 3.714213003000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 91 , num_strict_rules = 14 , num_top_rules = 14 , num_weak_rules = 77 , alphabet_size = 27 , total_length = 548} , self = 46 , parent = Just 35 , duration = 1.365536588000 , status = Success , start = 2021-07-13 23:28:07.734580801 UTC , finish = 2021-07-13 23:28:09.100117389 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '7' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 95 , num_strict_rules = 15 , num_top_rules = 15 , num_weak_rules = 80 , alphabet_size = 27 , total_length = 575} , self = 56 , parent = Just 38 , duration = 2.342244219000 , status = Success , start = 2021-07-13 23:28:07.73956113 UTC , finish = 2021-07-13 23:28:10.081805349 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '8' ] , 3 , False )} **************************************************