/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 5 letters EDG SRS with 4 strict rules and 3 weak rules on 5 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 2 strict rules and 3 weak rules on 5 letters EDG SRS with 2 rules on 4 letters Usable SRS with 2 rules on 4 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b, b] {- Input 0 -} [b, b, c] -> [c, b, c, a] {- Input 1 -} [c, c] -> [] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [b, b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [a#] |-> [b#, b] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} [b#, b, c] |-> [b#, c, a] {- DP (Top 1) (Input 1) -} [b#, b, c] |-> [c#, a] {- DP (Top 2) (Input 1) -} [b#, b, c] |-> [c#, b, c, a] {- DP (Top 0) (Input 1) -} reason (a#, 1/2) (b#, 1/2) property Termination has value Just True for SRS [a] ->= [b, b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [a#] |-> [b#, b] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} [b#, b, c] |-> [b#, c, a] {- DP (Top 1) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [b#, b, c] |-> [b#, c, a] {- DP (Top 1) (Input 1) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} [a#] |-> [b#, b] {- DP (Top 0) (Input 0) -} [a] ->= [b, b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A - - 3A \ | 0A 0A - 3A | | 0A 0A 0A 3A | \ - - - 0A / ) ( b , Wk / - 0A - 3A \ | 0A - - - | | 0A 0A 0A - | \ - - - 0A / ) ( c , Wk / 1A 0A 0A 4A \ | 0A - - - | | - 0A 0A - | \ - - - 0A / ) ( a# , Wk / 4A 3A 3A 7A \ | - - - - | | - - - - | \ - - - 0A / ) ( b# , Wk / - 3A 2A 6A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} [a] ->= [b, b] {- DP Nontop (Input 0) -} [b, b, c] ->= [c, b, c, a] {- DP Nontop (Input 1) -} [c, c] ->= [] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} reason Usable property Termination has value Just True for SRS [a#] |-> [b#] {- DP (Top 1) (Input 0) -} [b#, b, c] |-> [a#] {- DP (Top 3) (Input 1) -} reason (b, 1/1) (c, 1/1) (a#, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (3,3)\Deepee(6/3,6)\Weight\EDG(4/3,5)\Matrix{\Arctic}{4}(2/3,5)\EDG\Usable(2,4)\Weight(0,0)[] ************************************************** 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.378477373000 min duration 1.079544783000 total durat. 2.458022156000 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 = 22} , self = 59 , parent = Just 11 , duration = 1.079544783000 , status = Fail , start = 2021-07-13 23:47:32.558122713 UTC , finish = 2021-07-13 23:47:33.637667496 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '7' ] , 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 = 5 , total_length = 27} , self = 60 , parent = Just 16 , duration = 1.378477373000 , status = Fail , start = 2021-07-13 23:47:32.56065417 UTC , finish = 2021-07-13 23:47:33.939131543 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '0' ] , 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 11.029371176000 min duration 11.029371176000 total durat. 11.029371176000 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 = 5 , total_length = 27} , self = 85 , parent = Just 16 , duration = 11.029371176000 , status = Success , start = 2021-07-13 23:47:33.939372395 UTC , finish = 2021-07-13 23:47:44.968743571 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '5' ] , 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 12.071446209000 min duration 12.071446209000 total durat. 12.071446209000 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 27} , self = 92 , parent = Just 16 , duration = 12.071446209000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:47:32.924731441 UTC , finish = 2021-07-13 23:47:44.99617765 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.774651373000 min duration 1.371308921000 total durat. 3.145960294000 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 = 22} , self = 63 , parent = Just 11 , duration = 1.371308921000 , status = Fail , start = 2021-07-13 23:47:32.860655629 UTC , finish = 2021-07-13 23:47:34.23196455 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '6' ] , 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 = 5 , total_length = 27} , self = 66 , parent = Just 16 , duration = 1.774651373000 , status = Fail , start = 2021-07-13 23:47:32.979614264 UTC , finish = 2021-07-13 23:47:34.754265637 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 8.710489653000 min duration 5.186546891000 total durat. 13.897036544000 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 = 22} , self = 78 , parent = Just 11 , duration = 5.186546891000 , status = Fail , start = 2021-07-13 23:47:34.232230305 UTC , finish = 2021-07-13 23:47:39.418777196 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '9' ] , 0 , True )} Info { what = QPI { dim = 6 , 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 = 5 , total_length = 27} , self = 82 , parent = Just 16 , duration = 8.710489653000 , status = Fail , start = 2021-07-13 23:47:34.756066473 UTC , finish = 2021-07-13 23:47:43.466556126 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '4' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.509861751000 min duration 1.509861751000 total durat. 1.509861751000 Info { what = QPI { dim = 8 , 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 = 5 , total_length = 27} , self = 88 , parent = Just 16 , duration = 1.509861751000 , status = Fail , start = 2021-07-13 23:47:43.466727801 UTC , finish = 2021-07-13 23:47:44.976589552 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '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 3 max duration 0.802748458000 min duration 0.056543165000 total durat. 1.255092094000 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 4.478206534000 min duration 4.478206534000 total durat. 4.478206534000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 73 , parent = Just 0 , duration = 4.478206534000 , status = Success , start = 2021-07-13 23:47:32.563767484 UTC , finish = 2021-07-13 23:47:37.041974018 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '9' ] , 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 3 max duration 2.315770443000 min duration 0.083640569000 total durat. 3.582386226000 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 = 29 , num_strict_rules = 29 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 185} , self = 64 , parent = Just 55 , duration = 1.182975214000 , status = Success , start = 2021-07-13 23:47:33.274197465 UTC , finish = 2021-07-13 23:47:34.457172679 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '2' ] , 3 , True )} 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 = 36 , num_strict_rules = 36 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 12 , total_length = 216} , self = 67 , parent = Just 31 , duration = 2.315770443000 , status = Success , start = 2021-07-13 23:47:32.731509623 UTC , finish = 2021-07-13 23:47:35.047280066 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '9' ] , 3 , True )} 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 4.410800921000 min duration 4.410800921000 total durat. 4.410800921000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 71 , parent = Just 0 , duration = 4.410800921000 , status = Success , start = 2021-07-13 23:47:32.563608544 UTC , finish = 2021-07-13 23:47:36.974409465 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '3' ] , 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 10.271723181000 min duration 0.166049416000 total durat. 14.395852726000 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 = 54 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 47 , alphabet_size = 16 , total_length = 334} , self = 69 , parent = Just 45 , duration = 3.790345753000 , status = Success , start = 2021-07-13 23:47:33.126462836 UTC , finish = 2021-07-13 23:47:36.916808589 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 = 66 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 54 , alphabet_size = 20 , total_length = 393} , self = 83 , parent = Just 47 , duration = 10.271723181000 , status = Success , start = 2021-07-13 23:47:33.202494848 UTC , finish = 2021-07-13 23:47:43.474218029 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '6' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 10 max duration 5.358101056000 min duration 0.000165959000 total durat. 10.404332417000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 275 , num_strict_rules = 275 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 45 , total_length = 2375} , self = 75 , parent = Just 62 , duration = 4.146692176000 , status = Success , start = 2021-07-13 23:47:34.085664436 UTC , finish = 2021-07-13 23:47:38.232356612 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '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 = 275 , num_strict_rules = 275 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 45 , total_length = 2375} , self = 80 , parent = Just 65 , duration = 5.358101056000 , status = Success , start = 2021-07-13 23:47:34.457382106 UTC , finish = 2021-07-13 23:47:39.815483162 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '2' ] , 3 , False )} **************************************************