/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 4 rules on 3 letters DP SRS with 5 strict rules and 4 weak rules on 6 letters weights SRS with 4 strict rules and 4 weak rules on 5 letters EDG SRS with 4 strict rules and 4 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 1 strict rules and 4 weak rules on 5 letters weights 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, c, b, a] {- Input 1 -} [b] -> [a] {- Input 2 -} [c, c, c] -> [] {- Input 3 -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [a] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} [a#, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, b] |-> [b#, a] {- DP (Top 2) (Input 1) -} [a#, b] |-> [b#, c, b, a] {- DP (Top 0) (Input 1) -} [a#, b] |-> [c#, b, a] {- DP (Top 1) (Input 1) -} [b#] |-> [a#] {- DP (Top 0) (Input 2) -} reason (a#, 1/2) (b#, 1/2) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [a] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} [a#, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, b] |-> [b#, a] {- DP (Top 2) (Input 1) -} [a#, b] |-> [b#, c, b, a] {- DP (Top 0) (Input 1) -} [b#] |-> [a#] {- DP (Top 0) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, b] |-> [a#] {- DP (Top 3) (Input 1) -} [a#, b] |-> [b#, c, b, a] {- DP (Top 0) (Input 1) -} [b#] |-> [a#] {- DP (Top 0) (Input 2) -} [a#, b] |-> [b#, a] {- DP (Top 2) (Input 1) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [a] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} reason ( a , Wk / 0A 1A 1A - \ | - 0A 0A - | | - 0A 1A - | \ - - - 0A / ) ( b , Wk / 0A 1A 1A 2A \ | - 0A 0A - | | 0A 1A 2A 2A | \ - - - 0A / ) ( c , Wk / 0A - 0A - \ | 0A 0A - - | | - 0A - - | \ - - - 0A / ) ( a# , Wk / 1A - 4A 2A \ | - - - - | | - - - - | \ - - - 0A / ) ( b# , Wk / 1A - 4A 3A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [b#] |-> [a#] {- DP (Top 0) (Input 2) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [a] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} reason (b#, 1/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, b] ->= [b, c, b, a] {- DP Nontop (Input 1) -} [b] ->= [a] {- DP Nontop (Input 2) -} [c, c, c] ->= [] {- DP Nontop (Input 3) -} reason EDG ************************************************** skeleton: (4,3)\Deepee(5/4,6)\Weight\EDG(4/4,5)\Matrix{\Arctic}{4}(1/4,5)\Weight(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) ************************************************** 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 7.277846718000 min duration 7.277846718000 total durat. 7.277846718000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 80 , parent = Just 0 , duration = 7.277846718000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:11:34.448343563 UTC , finish = 2021-07-13 22:11:41.726190281 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' ] , 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.232392343000 min duration 0.937247596000 total durat. 2.169639939000 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 = 8 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 4 , alphabet_size = 5 , total_length = 27} , self = 54 , parent = Just 15 , duration = 1.232392343000 , status = Fail , start = 2021-07-13 22:11:34.449788969 UTC , finish = 2021-07-13 22:11:35.682181312 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '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 2 max duration 6.035364837000 min duration 5.382631815000 total durat. 11.417996652000 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 = 20} , self = 63 , parent = Just 11 , duration = 5.382631815000 , status = Success , start = 2021-07-13 22:11:35.387353036 UTC , finish = 2021-07-13 22:11:40.769984851 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '9' ] , 0 , True )} 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 = 8 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 4 , alphabet_size = 5 , total_length = 27} , self = 77 , parent = Just 15 , duration = 6.035364837000 , status = Success , start = 2021-07-13 22:11:35.682476682 UTC , finish = 2021-07-13 22:11:41.717841519 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '3' ] , 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 = 2 , encoding = Ersatz_Binary , dim = 6 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 2.260362044000 min duration 2.260362044000 total durat. 2.260362044000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 2 , encoding = Ersatz_Binary , dim = 6 , 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 = 70 , parent = Just 11 , duration = 2.260362044000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:11:38.521829077 UTC , finish = 2021-07-13 22:11:40.782191121 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 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.277335978000 min duration 3.761260042000 total durat. 8.038596020000 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 = 61 , parent = Just 11 , duration = 3.761260042000 , status = Fail , start = 2021-07-13 22:11:34.760266249 UTC , finish = 2021-07-13 22:11:38.521526291 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '2' ] , 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 = 8 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 4 , alphabet_size = 5 , total_length = 27} , self = 62 , parent = Just 15 , duration = 4.277335978000 , status = Fail , start = 2021-07-13 22:11:34.871216894 UTC , finish = 2021-07-13 22:11:39.148552872 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 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 3 max duration 0.666105912000 min duration 0.310162747000 total durat. 1.397485692000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.715382162000 min duration 0.351701899000 total durat. 1.527860227000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.769825404000 min duration 1.336817451000 total durat. 3.106642855000 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 = 55 , parent = Just 11 , duration = 1.336817451000 , status = Fail , start = 2021-07-13 22:11:34.801824811 UTC , finish = 2021-07-13 22:11:36.138642262 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 = 8 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 4 , alphabet_size = 5 , total_length = 27} , self = 56 , parent = Just 15 , duration = 1.769825404000 , status = Fail , start = 2021-07-13 22:11:34.910856786 UTC , finish = 2021-07-13 22:11:36.68068219 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 1 max duration 4.642748907000 min duration 4.642748907000 total durat. 4.642748907000 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 = 69 , parent = Just 11 , duration = 4.642748907000 , status = Fail , start = 2021-07-13 22:11:36.138890319 UTC , finish = 2021-07-13 22:11:40.781639226 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '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.513618274000 min duration 0.091014517000 total durat. 2.604632791000 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 = 62 , num_strict_rules = 62 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 312} , self = 57 , parent = Just 33 , duration = 2.513618274000 , status = Success , start = 2021-07-13 22:11:34.74062898 UTC , finish = 2021-07-13 22:11:37.254247254 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 3.169387405000 min duration 0.081669598000 total durat. 3.251057003000 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 = 62 , num_strict_rules = 62 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 312} , self = 59 , parent = Just 33 , duration = 3.169387405000 , status = Success , start = 2021-07-13 22:11:34.740574006 UTC , finish = 2021-07-13 22:11:37.909961411 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '5' ] , 3 , True )} **************************************************