/export/starexec/sandbox/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 1 rules on 2 letters looping SRS derivation Closure source : abababbababbbbbbabbb target : bbbbbbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbababababbababbbbbbabbbbbbabababab steps : 32 strict : True last_rule_app_source : 0 last_rule_app_target : 199 ************************************************** proof ************************************************** property Termination has value Just False for SRS [b, a, b, a, b, a, a] -> [a, a, a, a, a, b, a, b, a, b, a, b, a] {- Input 0 -} reason Nontermination looping SRS derivation Closure source : abababbababbbbbbabbb target : bbbbbbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbabbbbbbababbbbbbabbbbbbabbbbbbabbbbbbababababbababbbbbbabbbbbbabababab steps : 32 strict : True last_rule_app_source : 0 last_rule_app_target : 199 reason : Overlap (Right 6) Overlap (Right 4) Overlap (Inside 174) Overlap (Inside 167) Overlap (Inside 160) Overlap (Inside 153) Overlap (Right 6) Overlap (Inside 144) Overlap (Inside 137) Overlap (Inside 130) Overlap (Inside 123) Overlap (Inside 116) Overlap (Right 6) Overlap (Inside 107) Overlap (Inside 100) Overlap (Inside 93) Overlap (Inside 86) Overlap (Inside 79) Overlap (Right 6) Overlap (Inside 70) Overlap (Inside 63) Overlap (Inside 56) Overlap (Inside 49) Overlap (Inside 42) Overlap (Right 6) Overlap (Inside 33) Overlap (Inside 26) Overlap (Inside 19) Overlap (Inside 12) Overlap (Inside 5) Overlap (Right 2) 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)])