/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 31 rules on 9 letters       looping SRS derivation
Closure source : abc
target : aabc
steps  : 1
strict  : True
last_rule_app_source  : 0
last_rule_app_target  : 0



**************************************************
proof
**************************************************
property Termination
has value Just False
for SRS
  [0, q0, 0] -> [0, 0, q0] {- Input 0 -}
  [0, q0, h] -> [0, 0, q0, h] {- Input 1 -}
  [0, q0, 1] -> [0, 1, q0] {- Input 2 -}
  [1, q0, 0] -> [0, 0, q1] {- Input 3 -}
  [1, q0, h] -> [0, 0, q1, h] {- Input 4 -}
  [1, q0, 1] -> [0, 1, q1] {- Input 5 -}
  [1, q1, 0] -> [1, 0, q1] {- Input 6 -}
  [1, q1, h] -> [1, 0, q1, h] {- Input 7 -}
  [1, q1, 1] -> [1, 1, q1] {- Input 8 -}
  [0, q1, 0] -> [0, 0, q2] {- Input 9 -}
  [0, q1, h] -> [0, 0, q2, h] {- Input 10 -}
  [0, q1, 1] -> [0, 1, q2] {- Input 11 -}
  [1, q2, 0] -> [1, 0, q2] {- Input 12 -}
  [1, q2, h] -> [1, 0, q2, h] {- Input 13 -}
  [1, q2, 1] -> [1, 1, q2] {- Input 14 -}
  [0, q2] -> [q3, 1] {- Input 15 -}
  [1, q3] -> [q3, 1] {- Input 16 -}
  [0, q3] -> [q4, 0] {- Input 17 -}
  [1, q4] -> [q4, 1] {- Input 18 -}
  [0, q4, 0] -> [1, 0, q5] {- Input 19 -}
  [0, q4, h] -> [1, 0, q5, h] {- Input 20 -}
  [0, q4, 1] -> [1, 1, q5] {- Input 21 -}
  [1, q5, 0] -> [0, 0, q1] {- Input 22 -}
  [1, q5, h] -> [0, 0, q1, h] {- Input 23 -}
  [1, q5, 1] -> [0, 1, q1] {- Input 24 -}
  [h, q0] -> [h, 0, q0] {- Input 25 -}
  [h, q1] -> [h, 0, q1] {- Input 26 -}
  [h, q2] -> [h, 0, q2] {- Input 27 -}
  [h, q3] -> [h, 0, q3] {- Input 28 -}
  [h, q4] -> [h, 0, q4] {- Input 29 -}
  [h, q5] -> [h, 0, q5] {- Input 30 -}
reason
  Nontermination
    looping SRS derivation
    Closure source : abc
    target : aabc
    steps  : 1
    strict  : True
    last_rule_app_source  : 0
    last_rule_app_target  : 0
    reason : Rule 1
    

**************************************************
skeleton: (31,9)\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)])