/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 1 rules on 3 letters looping SRS derivation Closure source : abacccccccccccccccccccccccccccccccccccccccccc target : cccccccabaccccccccccccccccccccccccccccccccccccccccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabaccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabacccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabaccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaaba steps : 64 strict : True last_rule_app_source : 0 last_rule_app_target : 45 ************************************************** proof ************************************************** property Termination has value Just False for SRS [b, c, b, a, a, a, a, a, a] -> [ a , a , a , a , a , a , a , b , c , b , b , c , b ] {- Input 0 -} reason Nontermination looping SRS derivation Closure source : abacccccccccccccccccccccccccccccccccccccccccc target : cccccccabaccccccccccccccccccccccccccccccccccccccccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabaccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabacccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaabaccccabaabacabaabaccabaabacabaabacccabaabacabaabaccabaabacabaaba steps : 64 strict : True last_rule_app_source : 0 last_rule_app_target : 45 reason : Overlap (Inside 45) Overlap (Inside 48) Overlap (Inside 52) Overlap (Inside 55) Overlap (Inside 60) Overlap (Inside 63) Overlap (Inside 67) Overlap (Inside 70) Overlap (Inside 76) Overlap (Inside 79) Overlap (Inside 83) Overlap (Inside 86) Overlap (Inside 91) Overlap (Inside 94) Overlap (Inside 98) Overlap (Inside 101) Overlap (Inside 108) Overlap (Inside 111) Overlap (Inside 115) Overlap (Inside 118) Overlap (Inside 123) Overlap (Inside 126) Overlap (Inside 130) Overlap (Inside 133) Overlap (Inside 139) Overlap (Inside 142) Overlap (Inside 146) Overlap (Inside 149) Overlap (Inside 154) Overlap (Inside 157) Overlap (Inside 161) Overlap (Right 3) Overlap (Inside 38) Overlap (Inside 41) Overlap (Inside 45) Overlap (Inside 48) Overlap (Inside 53) Overlap (Inside 56) Overlap (Inside 60) Overlap (Inside 63) Overlap (Inside 69) Overlap (Inside 72) Overlap (Inside 76) Overlap (Inside 79) Overlap (Inside 84) Overlap (Inside 87) Overlap (Inside 91) Overlap (Right 3) Overlap (Inside 31) Overlap (Inside 34) Overlap (Inside 38) Overlap (Inside 41) Overlap (Inside 46) Overlap (Inside 49) Overlap (Inside 53) Overlap (Right 3) Overlap (Inside 24) Overlap (Inside 27) Overlap (Inside 31) Overlap (Right 3) Overlap (Inside 17) Overlap (Right 3) Overlap (Right 3) Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 Rule 0 ************************************************** skeleton: (1,3)\Loop{}[] ************************************************** let {} in let {trac = False;done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 10000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,unlabel = False})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 1000)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = trac,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO {bits = b,solver = solver})));mb = Worker (Matchbound {method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight {modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ Seq [ matrix Arctic 2 5, matrix Arctic 3 4, matrix Arctic 4 3], Seq [ matrix Natural 2 5, matrix Natural 3 4, matrix Natural 4 3]] <> [ kbo 1, And_Then (Worker Mirror) (And_Then (kbo 1) (Worker Mirror))])));dp = As_Transformer (Apply (And_Then (Worker (DP {tracing = True})) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = True})) remove)));noh = [ Worker (Enumerate {closure = Forward}), Worker (Enumerate {closure = Backward})];yeah = Tree_Search_Preemptive 0 done ([ Worker (Weight {modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp, tiling Forward 2, And_Then (Worker Mirror) (tiling Forward 2)] <> [ Worker (Unlabel {verbose = True})])} in Apply (Worker Remap) (Seq [ Worker KKST01, First_Of ([ yeah] <> noh)])