/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 4 strict rules and 3 weak rules on 5 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 = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 3 weak rules on 4 letters EDG SRS with 1 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] -> [b, b] {- Input 1 -} [c, b] -> [a, c, c, a] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} [c#, b] |-> [a#] {- DP (Top 3) (Input 2) -} [c#, b] |-> [a#, c, c, a] {- DP (Top 0) (Input 2) -} [c#, b] |-> [c#, a] {- DP (Top 2) (Input 2) -} [c#, b] |-> [c#, c, a] {- DP (Top 1) (Input 2) -} reason (c#, 2/1) property Termination has value Just True for SRS [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} [c#, b] |-> [c#, a] {- DP (Top 2) (Input 2) -} [c#, b] |-> [c#, c, a] {- DP (Top 1) (Input 2) -} reason EDG property Termination has value Just True for SRS [c#, b] |-> [c#, a] {- DP (Top 2) (Input 2) -} [c#, b] |-> [c#, c, a] {- DP (Top 1) (Input 2) -} [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A 0A \ \ -2A -2A / ) ( b , Wk / 0A 2A \ \ 0A 0A / ) ( c , Wk / 2A 4A \ \ 0A 2A / ) ( c# , Wk / 7A 9A \ \ 7A 9A / ) property Termination has value Just True for SRS [c#, b] |-> [c#, c, a] {- DP (Top 1) (Input 2) -} [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [c#, b] |-> [c#, c, a] {- DP (Top 1) (Input 2) -} [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A - 0A 0A \ | 0A - - 0A | | 1A 0A 2A - | \ - - - 0A / ) ( b , Wk / - 0A - 1A \ | 2A - 0A 3A | | 0A 1A - - | \ - - - 0A / ) ( c , Wk / 0A 2A - 3A \ | - 0A - - | | 2A 4A 0A 4A | \ - - - 0A / ) ( c# , Wk / - 4A 0A 5A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a, b] ->= [] {- DP Nontop (Input 0) -} [a, c] ->= [b, b] {- DP Nontop (Input 1) -} [c, b] ->= [a, c, c, a] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,3)\Deepee(4/3,5)\Weight\EDG(2/3,4)\Matrix{\Arctic}{2}\EDG(1/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) ************************************************** Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 1 max duration 8.538611278000 min duration 8.538611278000 total durat. 8.538611278000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 100 , parent = Just 0 , duration = 8.538611278000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:16:54.478965921 UTC , finish = 2021-07-13 23:17:03.017577199 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '7' ] , 2 , True )} 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.459647769000 min duration 1.040382909000 total durat. 2.500030678000 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 = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 17} , self = 71 , parent = Just 38 , duration = 1.040382909000 , status = Fail , start = 2021-07-13 23:16:54.821481911 UTC , finish = 2021-07-13 23:16:55.86186482 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 24} , self = 75 , parent = Just 49 , duration = 1.459647769000 , status = Fail , start = 2021-07-13 23:16:54.891198087 UTC , finish = 2021-07-13 23:16:56.350845856 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '5' ] , 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 7.132633392000 min duration 7.132633392000 total durat. 7.132633392000 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 = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 17} , self = 96 , parent = Just 38 , duration = 7.132633392000 , status = Success , start = 2021-07-13 23:16:55.86229836 UTC , finish = 2021-07-13 23:17:02.994931752 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '0' , '7' ] , 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.394956201000 min duration 0.316348001000 total durat. 1.418711126000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.673288351000 min duration 1.148100746000 total durat. 2.821389097000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 17} , self = 73 , parent = Just 38 , duration = 1.148100746000 , status = Fail , start = 2021-07-13 23:16:55.145262303 UTC , finish = 2021-07-13 23:16:56.293363049 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '4' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 24} , self = 82 , parent = Just 49 , duration = 1.673288351000 , status = Fail , start = 2021-07-13 23:16:55.307761197 UTC , finish = 2021-07-13 23:16:56.981049548 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 4.471079561000 min duration 4.471079561000 total durat. 4.471079561000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 17} , self = 95 , parent = Just 38 , duration = 4.471079561000 , status = Fail , start = 2021-07-13 23:16:56.293768645 UTC , finish = 2021-07-13 23:17:00.764848206 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '1' , '2' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.239347531000 min duration 2.239347531000 total durat. 2.239347531000 Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 17} , self = 99 , parent = Just 38 , duration = 2.239347531000 , status = Fail , start = 2021-07-13 23:17:00.765502428 UTC , finish = 2021-07-13 23:17:03.004849959 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '5' , '2' ] , 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.472000076000 min duration 0.065759677000 total durat. 2.537759753000 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 = 37 , num_strict_rules = 37 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 220} , self = 87 , parent = Just 55 , duration = 2.472000076000 , status = Success , start = 2021-07-13 23:16:54.965732479 UTC , finish = 2021-07-13 23:16:57.437732555 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '1' ] , 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 3.547085056000 min duration 0.073696908000 total durat. 3.620781964000 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 = 37 , num_strict_rules = 37 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 220} , self = 93 , parent = Just 55 , duration = 3.547085056000 , status = Success , start = 2021-07-13 23:16:54.988636238 UTC , finish = 2021-07-13 23:16:58.535721294 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '5' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 7 max duration 2.555412548000 min duration 0.000872262000 total durat. 8.682792561000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 64 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 60 , alphabet_size = 21 , total_length = 388} , self = 78 , parent = Just 64 , duration = 1.496005780000 , status = Success , start = 2021-07-13 23:16:55.056578346 UTC , finish = 2021-07-13 23:16:56.552584126 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '8' , '9' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 68 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 60 , alphabet_size = 21 , total_length = 412} , self = 72 , parent = Just 32 , duration = 1.508068018000 , status = Success , start = 2021-07-13 23:16:54.621359412 UTC , finish = 2021-07-13 23:16:56.12942743 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 = 88 , num_strict_rules = 16 , num_top_rules = 16 , num_weak_rules = 72 , alphabet_size = 26 , total_length = 528} , self = 83 , parent = Just 34 , duration = 2.347872769000 , status = Success , start = 2021-07-13 23:16:54.684737339 UTC , finish = 2021-07-13 23:16:57.032610108 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '8' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 84 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 72 , alphabet_size = 26 , total_length = 504} , self = 89 , parent = Just 68 , duration = 2.555412548000 , status = Success , start = 2021-07-13 23:16:55.23109094 UTC , finish = 2021-07-13 23:16:57.786503488 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '7' ] , 3 , False )} **************************************************