/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 2 rules on 2 letters mirror SRS with 2 rules on 2 letters DP SRS with 7 strict rules and 2 weak rules on 4 letters weights SRS with 2 strict rules and 2 weak rules on 4 letters EDG SRS with 2 strict rules and 2 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 4, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 2 weak rules on 4 letters weights SRS with 0 strict rules and 2 weak rules on 2 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a, a, a] -> [b, a, a, b] {- Input 0 -} [b, a, b] -> [a, b, a] {- Input 1 -} reason mirror property Termination has value Just True for SRS [a, a, a, a] -> [b, a, a, b] {- Mirror (Input 0) -} [b, a, b] -> [a, b, a] {- Mirror (Input 1) -} reason DP property Termination has value Just True for SRS [a, a, a, a] ->= [b, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b] ->= [a, b, a] {- DP Nontop (Mirror (Input 1)) -} [a#, a, a, a] |-> [a#, a, b] {- DP (Top 1) (Mirror (Input 0)) -} [a#, a, a, a] |-> [a#, b] {- DP (Top 2) (Mirror (Input 0)) -} [a#, a, a, a] |-> [b#] {- DP (Top 3) (Mirror (Input 0)) -} [a#, a, a, a] |-> [b#, a, a, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b] |-> [a#] {- DP (Top 2) (Mirror (Input 1)) -} [b#, a, b] |-> [a#, b, a] {- DP (Top 0) (Mirror (Input 1)) -} [b#, a, b] |-> [b#, a] {- DP (Top 1) (Mirror (Input 1)) -} reason (a, 1/2) (b, 1/2) property Termination has value Just True for SRS [a, a, a, a] ->= [b, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b] ->= [a, b, a] {- DP Nontop (Mirror (Input 1)) -} [a#, a, a, a] |-> [b#, a, a, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b] |-> [a#, b, a] {- DP (Top 0) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [a#, a, a, a] |-> [b#, a, a, b] {- DP (Top 0) (Mirror (Input 0)) -} [b#, a, b] |-> [a#, b, a] {- DP (Top 0) (Mirror (Input 1)) -} [a, a, a, a] ->= [b, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b] ->= [a, b, a] {- DP Nontop (Mirror (Input 1)) -} reason ( a , Wk / 0A 4A 4A 4A \ | 0A 0A 4A 4A | | 0A 0A 0A 4A | \ 0A 0A 0A 4A / ) ( b , Wk / 0A 4A 4A 4A \ | 0A 4A 4A 4A | | 0A 4A 4A 4A | \ -4A 0A 0A 0A / ) ( a# , Wk / 20A 20A 20A 22A \ | 20A 20A 20A 22A | | 20A 20A 20A 22A | \ 20A 20A 20A 22A / ) ( b# , Wk / 17A 20A 20A 20A \ | 17A 20A 20A 20A | | 17A 20A 20A 20A | \ 17A 20A 20A 20A / ) property Termination has value Just True for SRS [b#, a, b] |-> [a#, b, a] {- DP (Top 0) (Mirror (Input 1)) -} [a, a, a, a] ->= [b, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b] ->= [a, b, a] {- DP Nontop (Mirror (Input 1)) -} reason (b#, 1/1) property Termination has value Just True for SRS [a, a, a, a] ->= [b, a, a, b] {- DP Nontop (Mirror (Input 0)) -} [b, a, b] ->= [a, b, a] {- DP Nontop (Mirror (Input 1)) -} reason EDG ************************************************** skeleton: \Mirror(2,2)\Deepee(7/2,4)\Weight\EDG(2/2,4)\Matrix{\Arctic}{4}(1/2,4)\Weight(0/2,2)\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 2.641502343000 min duration 2.636242462000 total durat. 5.277744805000 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 = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 28} , self = 71 , parent = Just 17 , duration = 2.636242462000 , status = Fail , start = 2021-07-13 12:00:08.640184601 UTC , finish = 2021-07-13 12:00:11.276427063 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '2' ] , 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 = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 28} , self = 72 , parent = Just 11 , duration = 2.641502343000 , status = Fail , start = 2021-07-13 12:00:08.634932644 UTC , finish = 2021-07-13 12:00:11.276434987 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '7' ] , 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 2.202816341000 min duration 2.202816341000 total durat. 2.202816341000 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 = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 28} , self = 81 , parent = Just 11 , duration = 2.202816341000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 12:00:09.206592144 UTC , finish = 2021-07-13 12:00:11.409408485 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 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 2 max duration 0.571347433000 min duration 0.566472584000 total durat. 1.137820017000 Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.293943317000 min duration 2.293943317000 total durat. 2.293943317000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 28} , self = 75 , parent = Just 11 , duration = 2.293943317000 , status = Success , start = 2021-07-13 12:00:09.111614435 UTC , finish = 2021-07-13 12:00:11.405557752 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '6' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.289327951000 min duration 2.289327951000 total durat. 2.289327951000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 4 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 2 , alphabet_size = 4 , total_length = 28} , self = 79 , parent = Just 17 , duration = 2.289327951000 , status = Fail , start = 2021-07-13 12:00:09.119929701 UTC , finish = 2021-07-13 12:00:11.409257652 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 0 , True )} 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 1.577325313000 min duration 1.577325313000 total durat. 1.577325313000 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 14} , self = 57 , parent = Just 0 , duration = 1.577325313000 , status = Success , start = 2021-07-13 12:00:08.63978554 UTC , finish = 2021-07-13 12:00:10.217110853 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '6' ] , 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 0.860112430000 min duration 0.044659046000 total durat. 1.327825814000 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 1.628505308000 min duration 1.628505308000 total durat. 1.628505308000 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 14} , self = 59 , parent = Just 0 , duration = 1.628505308000 , status = Success , start = 2021-07-13 12:00:08.637588806 UTC , finish = 2021-07-13 12:00:10.266094114 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '7' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 5 max duration 1.250871057000 min duration 0.000360447000 total durat. 2.426705526000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 162 , num_strict_rules = 162 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 28 , total_length = 1782} , self = 65 , parent = Just 56 , duration = 1.172314735000 , status = Success , start = 2021-07-13 12:00:09.59271847 UTC , finish = 2021-07-13 12:00:10.765033205 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '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 = 162 , num_strict_rules = 162 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 28 , total_length = 1782} , self = 61 , parent = Just 54 , duration = 1.250871057000 , status = Success , start = 2021-07-13 12:00:09.332954478 UTC , finish = 2021-07-13 12:00:10.583825535 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '7' ] , 3 , False )} **************************************************