/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 : abbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa target : aaaaaaaaabbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabb steps : 64 strict : True last_rule_app_source : 0 last_rule_app_target : 51 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a, b, b, a, a, a, a, a, a, a] -> [ a , a , a , a , a , a , a , a , a , b , b , a , b , b ] {- Input 0 -} reason Nontermination looping SRS derivation Closure source : abbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa target : aaaaaaaaabbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabbaaaaabbabbaabbabbaaabbabbaabbabbaaaabbabbaabbabbaaabbabbaabbabb steps : 64 strict : True last_rule_app_source : 0 last_rule_app_target : 51 reason : Overlap (Inside 51) Overlap (Inside 54) Overlap (Inside 58) Overlap (Inside 61) Overlap (Inside 66) Overlap (Inside 69) Overlap (Inside 73) Overlap (Inside 76) Overlap (Inside 82) Overlap (Inside 85) Overlap (Inside 89) Overlap (Inside 92) Overlap (Inside 97) Overlap (Inside 100) Overlap (Inside 104) Overlap (Inside 107) Overlap (Inside 114) Overlap (Inside 117) Overlap (Inside 121) Overlap (Inside 124) Overlap (Inside 129) Overlap (Inside 132) Overlap (Inside 136) Overlap (Inside 139) Overlap (Inside 145) Overlap (Inside 148) Overlap (Inside 152) Overlap (Inside 155) Overlap (Inside 160) Overlap (Inside 163) Overlap (Inside 167) Overlap (Right 3) Overlap (Inside 43) Overlap (Inside 46) Overlap (Inside 50) Overlap (Inside 53) Overlap (Inside 58) Overlap (Inside 61) Overlap (Inside 65) Overlap (Inside 68) Overlap (Inside 74) Overlap (Inside 77) Overlap (Inside 81) Overlap (Inside 84) Overlap (Inside 89) Overlap (Inside 92) Overlap (Inside 96) Overlap (Right 3) Overlap (Inside 35) Overlap (Inside 38) Overlap (Inside 42) Overlap (Inside 45) Overlap (Inside 50) Overlap (Inside 53) Overlap (Inside 57) Overlap (Right 3) Overlap (Inside 27) Overlap (Inside 30) Overlap (Inside 34) Overlap (Right 3) Overlap (Inside 19) 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,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)])