/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 5 strict rules and 3 weak rules on 5 letters weights SRS with 3 strict rules and 3 weak rules on 4 letters EDG SRS with 3 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 1 strict rules and 3 weak rules on 4 letters EDG SRS with 1 rules on 3 letters Usable SRS with 1 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b] {- Input 0 -} [a, b] -> [] {- Input 1 -} [c, c, a] -> [a, c, a, c, c] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Input 0) -} [a, b] ->= [] {- DP Nontop (Input 1) -} [c, c, a] ->= [a, c, a, c, c] {- DP Nontop (Input 2) -} [c#, c, a] |-> [a#, c, a, c, c] {- DP (Top 0) (Input 2) -} [c#, c, a] |-> [a#, c, c] {- DP (Top 2) (Input 2) -} [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} [c#, c, a] |-> [c#, a, c, c] {- DP (Top 1) (Input 2) -} [c#, c, a] |-> [c#, c] {- DP (Top 3) (Input 2) -} reason (c#, 2/1) property Termination has value Just True for SRS [a] ->= [b] {- DP Nontop (Input 0) -} [a, b] ->= [] {- DP Nontop (Input 1) -} [c, c, a] ->= [a, c, a, c, c] {- DP Nontop (Input 2) -} [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} [c#, c, a] |-> [c#, a, c, c] {- DP (Top 1) (Input 2) -} [c#, c, a] |-> [c#, c] {- DP (Top 3) (Input 2) -} reason EDG property Termination has value Just True for SRS [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} [c#, c, a] |-> [c#, c] {- DP (Top 3) (Input 2) -} [c#, c, a] |-> [c#, a, c, c] {- DP (Top 1) (Input 2) -} [a] ->= [b] {- DP Nontop (Input 0) -} [a, b] ->= [] {- DP Nontop (Input 1) -} [c, c, a] ->= [a, c, a, c, c] {- DP Nontop (Input 2) -} reason ( a , Wk / 2A 0A 0A 4A \ | 0A - - - | | 0A 0A - - | \ - - - 0A / ) ( b , Wk / 0A 0A 0A - \ | - - - - | | - - - - | \ - - - 0A / ) ( c , Wk / - 0A - 0A \ | 0A - - 0A | | 0A 0A 0A - | \ - - - 0A / ) ( c# , Wk / 0A 5A 0A 7A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} [a] ->= [b] {- DP Nontop (Input 0) -} [a, b] ->= [] {- DP Nontop (Input 1) -} [c, c, a] ->= [a, c, a, c, c] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} reason Usable property Termination has value Just True for SRS [c#, c, a] |-> [c#] {- DP (Top 4) (Input 2) -} reason (a, 1/1) (c, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (3,3)\Deepee(5/3,5)\Weight\EDG(3/3,4)\Matrix{\Arctic}{4}(1/3,4)\EDG\Usable(1,3)\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.520600887000 min duration 1.107141649000 total durat. 2.627742536000 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 = 53 , parent = Just 12 , duration = 1.107141649000 , status = Fail , start = 2021-07-13 23:23:20.920061907 UTC , finish = 2021-07-13 23:23:22.027203556 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '0' ] , 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 = 4 , total_length = 28} , self = 54 , parent = Just 16 , duration = 1.520600887000 , status = Fail , start = 2021-07-13 23:23:20.921192015 UTC , finish = 2021-07-13 23:23:22.441792902 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 8.958123127000 min duration 8.958123127000 total durat. 8.958123127000 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 28} , self = 68 , parent = Just 16 , duration = 8.958123127000 , status = Success , start = 2021-07-13 23:23:22.442068635 UTC , finish = 2021-07-13 23:23:31.400191762 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.841034263000 min duration 1.413253825000 total durat. 3.254288088000 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 = 55 , parent = Just 12 , duration = 1.413253825000 , status = Fail , start = 2021-07-13 23:23:21.210465353 UTC , finish = 2021-07-13 23:23:22.623719178 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 28} , self = 58 , parent = Just 16 , duration = 1.841034263000 , status = Fail , start = 2021-07-13 23:23:21.306431885 UTC , finish = 2021-07-13 23:23:23.147466148 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 7.713833309000 min duration 5.047336884000 total durat. 12.761170193000 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 = 66 , parent = Just 12 , duration = 5.047336884000 , status = Fail , start = 2021-07-13 23:23:22.623988753 UTC , finish = 2021-07-13 23:23:27.671325637 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '7' ] , 0 , True )} Info { what = QPI { dim = 6 , 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 = 4 , total_length = 28} , self = 67 , parent = Just 16 , duration = 7.713833309000 , status = Fail , start = 2021-07-13 23:23:23.147742507 UTC , finish = 2021-07-13 23:23:30.861575816 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '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 1.678276469000 min duration 0.076482473000 total durat. 1.754758942000 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 = 56 , parent = Just 31 , duration = 1.678276469000 , status = Success , start = 2021-07-13 23:23:21.105227401 UTC , finish = 2021-07-13 23:23:22.78350387 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '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 2 max duration 2.235084481000 min duration 0.081636893000 total durat. 2.316721374000 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 = 59 , parent = Just 31 , duration = 2.235084481000 , status = Success , start = 2021-07-13 23:23:21.105129677 UTC , finish = 2021-07-13 23:23:23.340214158 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '2' ] , 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.874244606000 min duration 0.156406030000 total durat. 9.438846428000 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 = 50 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 42 , alphabet_size = 16 , total_length = 318} , self = 61 , parent = Just 49 , duration = 4.189566927000 , status = Success , start = 2021-07-13 23:23:21.415014117 UTC , finish = 2021-07-13 23:23:25.604581044 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '3' ] , 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 = 54 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 47 , alphabet_size = 17 , total_length = 334} , self = 63 , parent = Just 43 , duration = 4.874244606000 , status = Success , start = 2021-07-13 23:23:21.318074815 UTC , finish = 2021-07-13 23:23:26.192319421 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 3 , True )} Fail : Tiling { method = Overlap , width = 8 , 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.452761056000 min duration 5.452761056000 total durat. 5.452761056000 Info { what = Tiling { method = Overlap , width = 8 , 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 = 22} , self = 65 , parent = Just 12 , duration = 5.452761056000 , status = Fail , start = 2021-07-13 23:23:20.92354793 UTC , finish = 2021-07-13 23:23:26.376308986 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '1' ] , 3 , True )} **************************************************