/export/starexec/sandbox/solver/bin/starexec_run_tc20-rel.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO
**************************************************
summary
**************************************************
SRS with 3 strict rules and 3 weak rules on 3 letters       looping SRS derivation
Closure source : abaabcccb
target : abaabcccb
steps  : 13
strict  : True
last_rule_app_source  : 0
last_rule_app_target  : 4



**************************************************
proof
**************************************************
property Termination
has value Just False
for SRS
  [b, b, b] -> [c, a, a] {- Input 0 -}
  [a, a, b] -> [c, b, a] {- Input 1 -}
  [c, c, c] -> [a, b, c] {- Input 2 -}
  [a, c, a] ->= [b, a, c] {- Input 3 -}
  [c, c, a] ->= [c, a, a] {- Input 4 -}
  [b, c, b] ->= [b, b, b] {- Input 5 -}
reason
  Nontermination
    looping SRS derivation
    Closure source : abaabcccb
    target : abaabcccb
    steps  : 13
    strict  : True
    last_rule_app_source  : 0
    last_rule_app_target  : 4
    reason : Overlap (Inside 4)
      Overlap (Inside 4)
        Overlap (Inside 5)
          Overlap (Right 2)
            Overlap (Inside 4)
              Overlap (Inside 3)
                Overlap (Inside 2)
                  Overlap (Inside 3)
                    Overlap (Right 2)
                      Overlap (Right 2)
                        Overlap (Right 1)
                          Overlap (Right 2)
                            Rule 5
                            Rule 0
                          Rule 3
                        Rule 3
                      Rule 3
                    Rule 0
                  Rule 3
                Rule 3
              Rule 3
            Rule 2
          Rule 1
        Rule 5
      Rule 0
    

**************************************************
skeleton: (3/3,3)\Loop{}[]
**************************************************
let {}
in let {done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 100000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,tracing = True})) (Worker Remap));matrix = \ mo dom dim bits -> when_small (weighted (Worker (Matrix {monotone = mo,domain = dom,dim = dim,bits = bits,shape = Corner})));kbo = \ b -> when_medium (weighted (Worker (KBO {bits = b,solver = Minisatapi})));yeah = Apply wop (Tree_Search_Preemptive 0 done ([ ] <> ([ kbo 1, And_Then (Worker Mirror) (kbo 1)] <> ((for [ 3, 4] (\ d -> matrix Strict Natural d 3)) <> (for [ 2, 3, 5] (\ w -> tiling Overlap w))))));noh = [ Timeout 5 (Worker (Enumerate {closure = Forward})), Timeout 5 (Worker (Enumerate {closure = Backward}))]}
  in Apply (Worker Remap) (First_Of ([ yeah] <> noh))