/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 2 rules on 3 letters looping SRS derivation steps : 32 from : (17) bbbbbbccbbbbcbbbb to : (33) ccbccbbccbccbbbbbbccbbbbcbbbbbbbb ************************************************** proof ************************************************** property Termination has value Just False for SRS [a] -> [b] {- Input 0 -} [b, b, b, c] -> [c, c, a, b, a, a] {- Input 1 -} reason Nontermination looping SRS derivation steps : 32 from : (17) bbbbbbccbbbbcbbbb to : (33) ccbccbbccbccbbbbbbccbbbbcbbbbbbbb ************************************************** skeleton: (2,3)\Loop{32}[] ************************************************** 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.069942896000 min duration 1.388919665000 total durat. 3.458862561000 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 = 66 , parent = Just 15 , duration = 1.388919665000 , status = Fail , start = 2021-07-13 23:03:22.587535704 UTC , finish = 2021-07-13 23:03:23.976455369 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '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 = 7 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 2 , alphabet_size = 5 , total_length = 40} , self = 68 , parent = Just 11 , duration = 2.069942896000 , status = Fail , start = 2021-07-13 23:03:22.58666958 UTC , finish = 2021-07-13 23:03:24.656612476 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '7' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 2.925157727000 min duration 1.581556689000 total durat. 4.506714416000 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 = 67 , parent = Just 15 , duration = 1.581556689000 , status = Fail , start = 2021-07-13 23:03:22.935819659 UTC , finish = 2021-07-13 23:03:24.517376348 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '2' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 2 , alphabet_size = 5 , total_length = 40} , self = 92 , parent = Just 11 , duration = 2.925157727000 , status = Fail , start = 2021-07-13 23:03:23.115325633 UTC , finish = 2021-07-13 23:03:26.04048336 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '8' ] , 0 , True )} Success : 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.791698446000 min duration 3.791698446000 total durat. 3.791698446000 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 93 , parent = Just 0 , duration = 3.791698446000 , status = Success , start = 2021-07-13 23:03:22.585368806 UTC , finish = 2021-07-13 23:03:26.377067252 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '6' ] , 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.792173780000 min duration 3.792173780000 total durat. 3.792173780000 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 = 2 , num_strict_rules = 2 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 94 , parent = Just 0 , duration = 3.792173780000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:03:22.585336441 UTC , finish = 2021-07-13 23:03:26.377510221 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '1' ] , 1 , 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 2.323676890000 min duration 2.323676890000 total durat. 2.323676890000 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 = 3 , total_length = 12} , self = 69 , parent = Just 0 , duration = 2.323676890000 , status = Success , start = 2021-07-13 23:03:22.591210429 UTC , finish = 2021-07-13 23:03:24.914887319 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '2' ] , 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.600758794000 min duration 0.058126636000 total durat. 1.049300353000 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 2.354169250000 min duration 2.354169250000 total durat. 2.354169250000 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 = 3 , total_length = 12} , self = 73 , parent = Just 0 , duration = 2.354169250000 , status = Success , start = 2021-07-13 23:03:22.589494425 UTC , finish = 2021-07-13 23:03:24.943663675 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '7' ] , 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 2.039567499000 min duration 0.141142684000 total durat. 4.276502689000 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 = 37 , num_strict_rules = 13 , num_top_rules = 13 , num_weak_rules = 24 , alphabet_size = 15 , total_length = 271} , self = 75 , parent = Just 53 , duration = 1.862710688000 , status = Success , start = 2021-07-13 23:03:23.131143162 UTC , finish = 2021-07-13 23:03:24.99385385 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '4' ] , 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 = 30 , num_strict_rules = 6 , num_top_rules = 6 , num_weak_rules = 24 , alphabet_size = 13 , total_length = 237} , self = 71 , parent = Just 39 , duration = 2.039567499000 , status = Success , start = 2021-07-13 23:03:22.896041999 UTC , finish = 2021-07-13 23:03:24.935609498 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '3' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 7 max duration 2.128252475000 min duration 0.001230340000 total durat. 4.594819586000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 156 , num_strict_rules = 156 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 37 , total_length = 1608} , self = 87 , parent = Just 65 , duration = 2.091437353000 , status = Success , start = 2021-07-13 23:03:23.618669381 UTC , finish = 2021-07-13 23:03:25.710106734 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '1' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 156 , num_strict_rules = 156 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 37 , total_length = 1608} , self = 85 , parent = Just 63 , duration = 2.128252475000 , status = Success , start = 2021-07-13 23:03:23.369742988 UTC , finish = 2021-07-13 23:03:25.497995463 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '9' ] , 3 , False )} **************************************************