/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 3 rules on 3 letters looping SRS derivation Closure source : abcbc target : cbbbbbbcbbbbbbbbbbbbbbbcbbbbbbabcbcacba steps : 45 strict : True last_rule_app_source : 0 last_rule_app_target : 34 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a] -> [] {- Input 0 -} [a, b] -> [c, a, c] {- Input 1 -} [c, c] -> [b, b, b, a] {- Input 2 -} reason Nontermination looping SRS derivation Closure source : abcbc target : cbbbbbbcbbbbbbbbbbbbbbbcbbbbbbabcbcacba steps : 45 strict : True last_rule_app_source : 0 last_rule_app_target : 34 reason : Overlap (Inside 34) Overlap (Inside 32) Overlap (Inside 32) Overlap (Inside 27) Overlap (Inside 28) Overlap (Inside 27) Overlap (Inside 24) Overlap (Inside 25) Overlap (Inside 24) Overlap (Inside 25) Overlap (Inside 23) Overlap (Inside 25) Overlap (Inside 20) Overlap (Inside 21) Overlap (Inside 20) Overlap (Inside 17) Overlap (Inside 18) Overlap (Inside 17) Overlap (Inside 14) Overlap (Inside 16) Overlap (Inside 17) Overlap (Inside 15) Overlap (Inside 14) Overlap (Inside 16) Overlap (Inside 17) Overlap (Inside 18) Overlap (Inside 17) Overlap (Right 1) Overlap (Inside 11) Overlap (Inside 12) Overlap (Inside 11) Overlap (Inside 8) Overlap (Inside 9) Overlap (Inside 8) Overlap (Inside 9) Overlap (Right 1) Overlap (Inside 7) Overlap (Inside 4) Overlap (Inside 5) Overlap (Inside 4) Overlap (Inside 1) Overlap (Inside 2) Overlap (Inside 1) Overlap (Right 1) Rule 1 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 1 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 0 Rule 2 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 1 Rule 0 Rule 0 Rule 2 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 1 Rule 2 Rule 1 Rule 0 Rule 2 Rule 1 Rule 0 Rule 2 Rule 0 Rule 0 Rule 1 ************************************************** skeleton: (3,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)])