/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 2 letters looping SRS derivation Closure source : ababababababababababababb target : bbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababababababababababababbbbbbabababab steps : 44 strict : True last_rule_app_source : 0 last_rule_app_target : 290 ************************************************** proof ************************************************** property Termination has value Just False for SRS [b, a, b, a, b, a, a] -> [ a , a , a , a , a , a , b , a , b , a , b , a , b , a ] {- Input 0 -} reason Nontermination looping SRS derivation Closure source : ababababababababababababb target : bbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbabbbbbbbababababababababababababbbbbbabababab steps : 44 strict : True last_rule_app_source : 0 last_rule_app_target : 290 reason : Overlap (Inside 290) Overlap (Inside 282) Overlap (Inside 274) Overlap (Inside 266) Overlap (Inside 258) Overlap (Inside 250) Overlap (Inside 256) Overlap (Inside 240) Overlap (Inside 232) Overlap (Inside 224) Overlap (Inside 216) Overlap (Inside 208) Overlap (Inside 200) Overlap (Inside 206) Overlap (Inside 190) Overlap (Inside 182) Overlap (Inside 174) Overlap (Inside 166) Overlap (Inside 158) Overlap (Inside 150) Overlap (Inside 156) Overlap (Inside 140) Overlap (Inside 132) Overlap (Inside 124) Overlap (Inside 116) Overlap (Inside 108) Overlap (Inside 100) Overlap (Inside 106) Overlap (Inside 90) Overlap (Inside 82) Overlap (Inside 74) Overlap (Inside 66) Overlap (Inside 58) Overlap (Inside 50) Overlap (Inside 56) Overlap (Inside 40) Overlap (Inside 32) Overlap (Inside 24) Overlap (Inside 16) Overlap (Inside 8) Overlap (Left 1) Overlap (Left 1) Overlap (Left 1) 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,2)\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)])