/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 2 rules on 3 letters mirror SRS with 2 rules on 3 letters DP SRS with 5 strict rules and 2 weak rules on 5 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 0 strict rules and 2 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, b] -> [] {- Input 0 -} [a, b, c] -> [b, c, b, c, a, a, b] {- Input 1 -} reason mirror property Termination has value Just True for SRS [b, a] -> [] {- Mirror (Input 0) -} [c, b, a] -> [b, a, a, c, b, c, b] {- Mirror (Input 1) -} reason DP property Termination has value Just True for SRS [b, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [c, b, a] ->= [b, a, a, c, b, c, b] {- DP Nontop (Mirror (Input 1)) -} [c#, b, a] |-> [b#] {- DP (Top 6) (Mirror (Input 1)) -} [c#, b, a] |-> [b#, a, a, c, b, c, b] {- DP (Top 0) (Mirror (Input 1)) -} [c#, b, a] |-> [b#, c, b] {- DP (Top 4) (Mirror (Input 1)) -} [c#, b, a] |-> [c#, b] {- DP (Top 5) (Mirror (Input 1)) -} [c#, b, a] |-> [c#, b, c, b] {- DP (Top 3) (Mirror (Input 1)) -} reason (c#, 3/1) property Termination has value Just True for SRS [b, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [c, b, a] ->= [b, a, a, c, b, c, b] {- DP Nontop (Mirror (Input 1)) -} [c#, b, a] |-> [c#, b] {- DP (Top 5) (Mirror (Input 1)) -} [c#, b, a] |-> [c#, b, c, b] {- DP (Top 3) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [c#, b, a] |-> [c#, b] {- DP (Top 5) (Mirror (Input 1)) -} [c#, b, a] |-> [c#, b, c, b] {- DP (Top 3) (Mirror (Input 1)) -} [b, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [c, b, a] ->= [b, a, a, c, b, c, b] {- DP Nontop (Mirror (Input 1)) -} reason ( b , Wk / 0A 0A 0A 0A \ | -4A -4A 0A 0A | | -4A -4A -4A 0A | \ -4A -4A -4A 0A / ) ( a , Wk / 0A 0A 4A 4A \ | 0A 0A 4A 4A | | 0A 0A 4A 4A | \ -4A 0A 0A 0A / ) ( c , Wk / 0A 4A 4A 4A \ | 0A 4A 4A 4A | | -4A 0A 0A 0A | \ -4A 0A 0A 0A / ) ( c# , Wk / 21A 22A 22A 25A \ | 21A 22A 22A 25A | | 21A 22A 22A 25A | \ 21A 22A 22A 25A / ) property Termination has value Just True for SRS [b, a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [c, b, a] ->= [b, a, a, c, b, c, b] {- DP Nontop (Mirror (Input 1)) -} reason EDG ************************************************** skeleton: \Mirror(2,3)\Deepee(5/2,5)\Weight\EDG(2/2,4)\Matrix{\Arctic}{4}(0/2,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) ************************************************** 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.497810730000 min duration 1.454032026000 total durat. 2.951842756000 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 = 23} , self = 59 , parent = Just 12 , duration = 1.454032026000 , status = Fail , start = 2021-07-13 23:27:51.236332923 UTC , finish = 2021-07-13 23:27:52.690364949 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '3' ] , 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 = 24} , self = 60 , parent = Just 16 , duration = 1.497810730000 , status = Fail , start = 2021-07-13 23:27:51.238034479 UTC , finish = 2021-07-13 23:27:52.735845209 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 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 1.544483642000 min duration 1.544483642000 total durat. 1.544483642000 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 = 23} , self = 66 , parent = Just 12 , duration = 1.544483642000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:27:51.651708593 UTC , finish = 2021-07-13 23:27:53.196192235 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '4' ] , 0 , True )} Success : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.571852330000 min duration 1.564455435000 total durat. 3.136307765000 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 = 23} , self = 61 , parent = Just 12 , duration = 1.564455435000 , status = Success , start = 2021-07-13 23:27:51.629144623 UTC , finish = 2021-07-13 23:27:53.193600058 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 0 , True )} 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 = 24} , self = 69 , parent = Just 16 , duration = 1.571852330000 , status = Success , start = 2021-07-13 23:27:51.629180758 UTC , finish = 2021-07-13 23:27:53.201033088 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '1' ] , 0 , 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 1.172480084000 min duration 0.040327238000 total durat. 1.212807322000 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 = 23 , num_strict_rules = 23 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 11 , total_length = 188} , self = 57 , parent = Just 31 , duration = 1.172480084000 , status = Success , start = 2021-07-13 23:27:51.339266012 UTC , finish = 2021-07-13 23:27:52.511746096 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '9' ] , 3 , True )} **************************************************