/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 4 rules on 3 letters mirror SRS with 4 rules on 3 letters DP SRS with 5 strict rules and 4 weak rules on 6 letters weights SRS with 2 strict rules and 4 weak rules on 4 letters EDG SRS with 2 strict rules and 4 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 4 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, b] -> [b, b, a, a, c] {- Input 1 -} [b] -> [] {- Input 2 -} [c, c] -> [] {- Input 3 -} reason mirror property Termination has value Just True for SRS [a] -> [] {- Mirror (Input 0) -} [b, a] -> [c, a, a, b, b] {- Mirror (Input 1) -} [b] -> [] {- Mirror (Input 2) -} [c, c] -> [] {- Mirror (Input 3) -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} [b#, a] |-> [a#, a, b, b] {- DP (Top 1) (Mirror (Input 1)) -} [b#, a] |-> [a#, b, b] {- DP (Top 2) (Mirror (Input 1)) -} [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} [b#, a] |-> [c#, a, a, b, b] {- DP (Top 0) (Mirror (Input 1)) -} reason (b#, 3/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason ( a , Wk / 3A 0A 0A 0A \ | - 0A - - | | 3A 3A 0A - | \ - - - 0A / ) ( b , Wk / 0A - - - \ | 3A 0A - - | | 2A - 0A - | \ - - - 0A / ) ( c , Wk / - 0A - 0A \ | 0A - 0A - | | - 0A - - | \ - - - 0A / ) ( b# , Wk / 0A - - - \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason EDG ************************************************** skeleton: \Mirror(4,3)\Deepee(5/4,6)\Weight\EDG(2/4,4)\Matrix{\Arctic}{4}(0/4,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.118112652000 min duration 0.890486575000 total durat. 2.008599227000 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 = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 20} , self = 54 , parent = Just 16 , duration = 1.118112652000 , status = Fail , start = 2021-07-13 22:03:26.882029522 UTC , finish = 2021-07-13 22:03:28.000142174 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 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 6.247841914000 min duration 6.247841914000 total durat. 6.247841914000 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 18} , self = 69 , parent = Just 12 , duration = 6.247841914000 , status = Success , start = 2021-07-13 22:03:27.771475675 UTC , finish = 2021-07-13 22:03:34.019317589 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 = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 4.008935348000 min duration 3.104376337000 total durat. 7.113311685000 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 18} , self = 61 , parent = Just 12 , duration = 3.104376337000 , status = Fail , start = 2021-07-13 22:03:27.155481496 UTC , finish = 2021-07-13 22:03:30.259857833 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '4' ] , 0 , True )} 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 20} , self = 62 , parent = Just 16 , duration = 4.008935348000 , status = Fail , start = 2021-07-13 22:03:27.203720937 UTC , finish = 2021-07-13 22:03:31.212656285 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.529196473000 min duration 1.265558541000 total durat. 2.794755014000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 18} , self = 55 , parent = Just 12 , duration = 1.265558541000 , status = Fail , start = 2021-07-13 22:03:27.17878415 UTC , finish = 2021-07-13 22:03:28.444342691 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 20} , self = 56 , parent = Just 16 , duration = 1.529196473000 , status = Fail , start = 2021-07-13 22:03:27.201172779 UTC , finish = 2021-07-13 22:03:28.730369252 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 5.277909048000 min duration 4.244904861000 total durat. 9.522813909000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 18} , self = 63 , parent = Just 12 , duration = 4.244904861000 , status = Fail , start = 2021-07-13 22:03:28.444580451 UTC , finish = 2021-07-13 22:03:32.689485312 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 20} , self = 68 , parent = Just 16 , duration = 5.277909048000 , status = Fail , start = 2021-07-13 22:03:28.730468489 UTC , finish = 2021-07-13 22:03:34.008377537 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '1' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.332704363000 min duration 0.013930893000 total durat. 1.346635256000 Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 18} , self = 73 , parent = Just 12 , duration = 1.332704363000 , status = Fail , start = 2021-07-13 22:03:32.689751825 UTC , finish = 2021-07-13 22:03:34.022456188 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '7' ] , 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 2.358168558000 min duration 0.067380579000 total durat. 2.425549137000 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 = 61 , num_strict_rules = 61 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 294} , self = 59 , parent = Just 35 , duration = 2.358168558000 , status = Success , start = 2021-07-13 22:03:27.106923689 UTC , finish = 2021-07-13 22:03:29.465092247 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '0' ] , 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.332961653000 min duration 0.063511417000 total durat. 2.396473070000 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 = 61 , num_strict_rules = 61 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 294} , self = 57 , parent = Just 35 , duration = 2.332961653000 , status = Success , start = 2021-07-13 22:03:27.106779754 UTC , finish = 2021-07-13 22:03:29.439741407 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '4' ] , 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 4 max duration 5.710455123000 min duration 0.117712788000 total durat. 11.583816944000 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 = 81 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 74 , alphabet_size = 19 , total_length = 399} , self = 64 , parent = Just 45 , duration = 5.635174274000 , status = Success , start = 2021-07-13 22:03:27.298169936 UTC , finish = 2021-07-13 22:03:32.93334421 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 = 82 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 74 , alphabet_size = 19 , total_length = 412} , self = 66 , parent = Just 46 , duration = 5.710455123000 , status = Success , start = 2021-07-13 22:03:27.271364546 UTC , finish = 2021-07-13 22:03:32.981819669 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 3 , True )} **************************************************