/export/starexec/sandbox2/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 1 rules on 2 letters admits a non-terminating transport system with pivot [a, a, a, a, a, a, a, a, a] alphabet [[a], [a, b]] pivot represented as [[a], [a], [a], [a], [a], [a], [a], [a], [a]] derivations for transport system [a] [a] pivot ->^0 pivot [[a]] because of derivation [a, a, a, a, a, a, a, a, a, a] ->^0 [a, a, a, a, a, a, a, a, a, a] via steps [a, b] [a, b] pivot ->^1 pivot [[a], [a, b], [a, b]] because of derivation [a, b, a, a, a, a, a, a, a, a, a] ->^1 [a, a, a, a, a, a, a, a, a, a, a, b, a, b] via steps Step { rule = 0, position = 0} infinite derivation starts at [[a, b], [a, b]] pivot ^ 12 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a, b, a, a, a, a, a, a, a, a, a] -> [ a , a , a , a , a , a , a , a , a , a , a , b , a , b ] {- Input 0 -} reason admits a non-terminating transport system with pivot [a, a, a, a, a, a, a, a, a] alphabet [[a], [a, b]] pivot represented as [[a], [a], [a], [a], [a], [a], [a], [a], [a]] derivations for transport system [a] [a] pivot ->^0 pivot [[a]] because of derivation [a, a, a, a, a, a, a, a, a, a] ->^0 [a, a, a, a, a, a, a, a, a, a] via steps [a, b] [a, b] pivot ->^1 pivot [[a], [a, b], [a, b]] because of derivation [a, b, a, a, a, a, a, a, a, a, a] ->^1 [a, a, a, a, a, a, a, a, a, a, a, b, a, b] via steps Step { rule = 0, position = 0} infinite derivation starts at [[a, b], [a, b]] pivot ^ 12 ************************************************** skeleton: (1,2)\Transport{}[] ************************************************** 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' ] : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 1.233080003000 min duration 1.233080003000 total durat. 1.233080003000 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 = 13 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 258} , self = 75 , parent = Just 13 , duration = 1.233080003000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:51:05.465969572 UTC , finish = 2021-07-13 23:51:06.699049575 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '1' ] , 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 1.210664012000 min duration 0.534684432000 total durat. 1.745348444000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 10 , num_top_rules = 10 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 200} , self = 71 , parent = Just 17 , duration = 1.210664012000 , status = Fail , start = 2021-07-13 23:51:05.466382523 UTC , finish = 2021-07-13 23:51:06.677046535 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '0' ] , 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 = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 1.233226411000 min duration 1.233226411000 total durat. 1.233226411000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 13 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 258} , self = 76 , parent = Just 13 , duration = 1.233226411000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:51:05.466026293 UTC , finish = 2021-07-13 23:51:06.699252704 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '4' ] , 0 , True )} Success : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 1.230807022000 min duration 1.230807022000 total durat. 1.230807022000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 13 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 258} , self = 72 , parent = Just 13 , duration = 1.230807022000 , status = Success , start = 2021-07-13 23:51:05.465885247 UTC , finish = 2021-07-13 23:51:06.696692269 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '9' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.844135803000 min duration 0.442662392000 total durat. 1.286798195000 Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 3.647997850000 min duration 3.647997850000 total durat. 3.647997850000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 1 , num_strict_rules = 1 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 25} , self = 139 , parent = Just 0 , duration = 3.647997850000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:51:05.463953355 UTC , finish = 2021-07-13 23:51:09.111951205 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '5' ] , 1 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 3.647999706000 min duration 3.647999706000 total durat. 3.647999706000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 1 , num_strict_rules = 1 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 25} , self = 138 , parent = Just 0 , duration = 3.647999706000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:51:05.463928912 UTC , finish = 2021-07-13 23:51:09.111928618 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' ] , 1 , 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 5 max duration 2.333573076000 min duration 0.050295784000 total durat. 3.379077954000 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 = 24 , num_strict_rules = 24 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 10 , total_length = 696} , self = 130 , parent = Just 55 , duration = 2.333573076000 , status = Success , start = 2021-07-13 23:51:06.594522092 UTC , finish = 2021-07-13 23:51:08.928095168 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '2' ] , 3 , 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 2 max duration 1.346890548000 min duration 0.213779195000 total durat. 1.560669743000 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 = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 108} , self = 112 , parent = Just 42 , duration = 1.346890548000 , status = Success , start = 2021-07-13 23:51:05.964509611 UTC , finish = 2021-07-13 23:51:07.311400159 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 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 5 max duration 1.122310192000 min duration 0.030822439000 total durat. 2.397313311000 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 = 12 , num_strict_rules = 12 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 7 , total_length = 348} , self = 124 , parent = Just 89 , duration = 1.122310192000 , status = Success , start = 2021-07-13 23:51:07.112938121 UTC , finish = 2021-07-13 23:51:08.235248313 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' , '6' ] , 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 2 max duration 0.955300697000 min duration 0.204101655000 total durat. 1.159402352000 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 1.609645375000 min duration 0.509902144000 total durat. 4.154098409000 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 = 11 , num_strict_rules = 10 , num_top_rules = 10 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 200} , self = 82 , parent = Just 17 , duration = 1.370087036000 , status = Success , start = 2021-07-13 23:51:05.474674851 UTC , finish = 2021-07-13 23:51:06.844761887 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '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 = 13 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 258} , self = 94 , parent = Just 13 , duration = 1.609645375000 , status = Success , start = 2021-07-13 23:51:05.487788631 UTC , finish = 2021-07-13 23:51:07.097434006 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '7' ] , 3 , True )} Success : Tiling { method = Overlap , 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 2 max duration 1.887622318000 min duration 1.428913487000 total durat. 3.316535805000 Info { what = Tiling { method = Overlap , 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 = 2 , num_top_rules = 2 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 53} , self = 122 , parent = Just 74 , duration = 1.428913487000 , status = Success , start = 2021-07-13 23:51:06.706380479 UTC , finish = 2021-07-13 23:51:08.135293966 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '5' ] , 3 , True )} Info { what = Tiling { method = Overlap , 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 = 2 , num_top_rules = 2 , num_weak_rules = 1 , alphabet_size = 3 , total_length = 53} , self = 135 , parent = Just 101 , duration = 1.887622318000 , status = Success , start = 2021-07-13 23:51:07.205254683 UTC , finish = 2021-07-13 23:51:09.092877001 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '2' , '4' ] , 3 , True )} Success : Transport { mode = Standard, max_derivation_length = Nothing} total number 1 max duration 3.643034009000 min duration 3.643034009000 total durat. 3.643034009000 Info { what = Transport { mode = Standard, max_derivation_length = Nothing} , input_size = Size { num_rules = 1 , num_strict_rules = 1 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 25} , self = 137 , parent = Just 0 , duration = 3.643034009000 , status = Success , start = 2021-07-13 23:51:05.463967253 UTC , finish = 2021-07-13 23:51:09.107001262 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '7' ] , 1 , True )} Fail : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 23 max duration 0.960818219000 min duration 0.000137645000 total durat. 2.664754833000 **************************************************