/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 mirror SRS with 3 rules on 3 letters DP SRS with 6 strict rules and 3 weak rules on 6 letters weights SRS with 2 strict rules and 3 weak rules on 4 letters EDG SRS with 2 strict rules and 3 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 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b] {- Input 0 -} [a, c] -> [c, c, a, a, b] {- Input 1 -} [b, b] -> [] {- Input 2 -} reason mirror property Termination has value Just True for SRS [a] -> [b] {- Mirror (Input 0) -} [c, a] -> [b, a, a, c, c] {- Mirror (Input 1) -} [b, b] -> [] {- Mirror (Input 2) -} reason DP property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [a#] |-> [b#] {- DP (Top 0) (Mirror (Input 0)) -} [c#, a] |-> [a#, a, c, c] {- DP (Top 1) (Mirror (Input 1)) -} [c#, a] |-> [a#, c, c] {- DP (Top 2) (Mirror (Input 1)) -} [c#, a] |-> [b#, a, a, c, c] {- DP (Top 0) (Mirror (Input 1)) -} [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 1)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 1)) -} reason (a#, 1/1) (c#, 2/1) property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 1)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [c#, a] |-> [c#] {- DP (Top 4) (Mirror (Input 1)) -} [c#, a] |-> [c#, c] {- DP (Top 3) (Mirror (Input 1)) -} [a] ->= [b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} reason ( a , Wk / 0A 0A 1A - \ | 0A 1A 0A - | | - - 0A - | \ - - - 0A / ) ( b , Wk / 0A 0A 0A - \ | 0A - 0A - | | - - 0A - | \ - - - 0A / ) ( c , Wk / 0A 1A - - \ | - 0A - - | | - - - - | \ - - - 0A / ) ( c# , Wk / 0A 7A - - \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Mirror (Input 0)) -} [c, a] ->= [b, a, a, c, c] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} reason EDG ************************************************** skeleton: \Mirror(3,3)\Deepee(6/3,6)\Weight\EDG(2/3,4)\Matrix{\Arctic}{4}(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.110544899000 min duration 0.993757183000 total durat. 2.104302082000 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 = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 20} , self = 54 , parent = Just 11 , duration = 1.110544899000 , status = Fail , start = 2021-07-13 22:04:25.69296781 UTC , finish = 2021-07-13 22:04:26.803512709 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '6' ] , 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.015587384000 min duration 6.015587384000 total durat. 6.015587384000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 67 , parent = Just 18 , duration = 6.015587384000 , status = Success , start = 2021-07-13 22:04:26.690451844 UTC , finish = 2021-07-13 22:04:32.706039228 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '0' ] , 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 6.785210597000 min duration 6.785210597000 total durat. 6.785210597000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 71 , parent = Just 18 , duration = 6.785210597000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:04:25.961177038 UTC , finish = 2021-07-13 22:04:32.746387635 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.399409627000 min duration 1.257751664000 total durat. 2.657161291000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 55 , parent = Just 18 , duration = 1.257751664000 , status = Fail , start = 2021-07-13 22:04:25.982935163 UTC , finish = 2021-07-13 22:04:27.240686827 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 20} , self = 56 , parent = Just 11 , duration = 1.399409627000 , status = Fail , start = 2021-07-13 22:04:26.007601974 UTC , finish = 2021-07-13 22:04:27.407011601 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 1 max duration 4.306020921000 min duration 4.306020921000 total durat. 4.306020921000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 66 , parent = Just 18 , duration = 4.306020921000 , status = Fail , start = 2021-07-13 22:04:27.240899207 UTC , finish = 2021-07-13 22:04:31.546920128 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.191103662000 min duration 1.191103662000 total durat. 1.191103662000 Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 18} , self = 70 , parent = Just 18 , duration = 1.191103662000 , status = Fail , start = 2021-07-13 22:04:31.547145517 UTC , finish = 2021-07-13 22:04:32.738249179 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 1.562601710000 min duration 0.053635401000 total durat. 1.616237111000 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 = 42 , num_strict_rules = 42 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 14 , total_length = 228} , self = 57 , parent = Just 32 , duration = 1.562601710000 , status = Success , start = 2021-07-13 22:04:25.866600867 UTC , finish = 2021-07-13 22:04:27.429202577 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 1.960569189000 min duration 0.052588126000 total durat. 2.013157315000 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 = 42 , num_strict_rules = 42 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 14 , total_length = 228} , self = 59 , parent = Just 32 , duration = 1.960569189000 , status = Success , start = 2021-07-13 22:04:25.830848853 UTC , finish = 2021-07-13 22:04:27.791418042 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '1' ] , 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 5.485453723000 min duration 5.485453723000 total durat. 5.485453723000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 20} , self = 65 , parent = Just 11 , duration = 5.485453723000 , status = Fail , start = 2021-07-13 22:04:25.701592727 UTC , finish = 2021-07-13 22:04:31.18704645 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '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 4 max duration 4.525751966000 min duration 0.110120337000 total durat. 8.440282535000 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 = 58 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 52 , alphabet_size = 18 , total_length = 316} , self = 61 , parent = Just 45 , duration = 3.692488842000 , status = Success , start = 2021-07-13 22:04:26.133415568 UTC , finish = 2021-07-13 22:04:29.82590441 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 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 = 61 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 53 , alphabet_size = 18 , total_length = 344} , self = 63 , parent = Just 46 , duration = 4.525751966000 , status = Success , start = 2021-07-13 22:04:26.141605683 UTC , finish = 2021-07-13 22:04:30.667357649 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '5' ] , 3 , True )} **************************************************