/export/starexec/sandbox2/solver/bin/starexec_run_tc20-rel.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 3 strict rules and 12 weak rules on 7 letters weights SRS with 1 strict rules and 11 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 3, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 9 weak rules on 7 letters Matrix { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 3, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 9 weak rules on 6 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [n, s] -> [s] {- Input 0 -} [o, s] -> [s] {- Input 1 -} [n, o, p] -> [o, n] {- Input 2 -} [t] ->= [t, c, n] {- Input 3 -} [p, s] ->= [s] {- Input 4 -} [o, n] ->= [n, o] {- Input 5 -} [p, n] ->= [m, p] {- Input 6 -} [p, m] ->= [m, p] {- Input 7 -} [o, m] ->= [n, o] {- Input 8 -} [n, p] ->= [p, n] {- Input 9 -} [c, p] ->= [p, c] {- Input 10 -} [c, m] ->= [m, c] {- Input 11 -} [c, n] ->= [n, c] {- Input 12 -} [c, o] ->= [o, c] {- Input 13 -} [c, o] ->= [o] {- Input 14 -} reason (o, 1/1) (p, 2/1) property Termination has value Just True for SRS [n, s] -> [s] {- Input 0 -} [t] ->= [t, c, n] {- Input 3 -} [o, n] ->= [n, o] {- Input 5 -} [p, n] ->= [m, p] {- Input 6 -} [p, m] ->= [m, p] {- Input 7 -} [o, m] ->= [n, o] {- Input 8 -} [n, p] ->= [p, n] {- Input 9 -} [c, p] ->= [p, c] {- Input 10 -} [c, m] ->= [m, c] {- Input 11 -} [c, n] ->= [n, c] {- Input 12 -} [c, o] ->= [o, c] {- Input 13 -} [c, o] ->= [o] {- Input 14 -} reason ( n , St / 1 0 0 \ | 0 1 1 | \ 0 0 1 / ) ( s , St / 2 0 3 \ | 0 0 0 | \ 0 0 1 / ) ( o , St / 2 5 0 \ | 0 1 5 | \ 0 0 1 / ) ( p , St / 1 0 5 \ | 0 1 1 | \ 0 0 1 / ) ( t , St / 2 0 0 \ | 4 0 0 | \ 0 0 1 / ) ( c , St / 1 0 0 \ | 0 1 0 | \ 0 0 1 / ) ( m , St / 1 0 0 \ | 0 1 1 | \ 0 0 1 / ) property Termination has value Just True for SRS [n, s] -> [s] {- Input 0 -} [t] ->= [t, c, n] {- Input 3 -} [p, n] ->= [m, p] {- Input 6 -} [p, m] ->= [m, p] {- Input 7 -} [n, p] ->= [p, n] {- Input 9 -} [c, p] ->= [p, c] {- Input 10 -} [c, m] ->= [m, c] {- Input 11 -} [c, n] ->= [n, c] {- Input 12 -} [c, o] ->= [o, c] {- Input 13 -} [c, o] ->= [o] {- Input 14 -} reason ( n , St / 1 2 0 \ | 0 1 0 | \ 0 0 1 / ) ( s , St / 2 0 3 \ | 0 0 2 | \ 0 0 1 / ) ( o , St / 1 4 0 \ | 0 0 0 | \ 0 0 1 / ) ( p , St / 1 2 1 \ | 0 1 0 | \ 0 0 1 / ) ( t , St / 2 6 5 \ | 0 0 1 | \ 0 0 1 / ) ( c , St / 1 1 0 \ | 0 0 0 | \ 0 0 1 / ) ( m , St / 1 2 0 \ | 0 1 0 | \ 0 0 1 / ) property Termination has value Just True for SRS [t] ->= [t, c, n] {- Input 3 -} [p, n] ->= [m, p] {- Input 6 -} [p, m] ->= [m, p] {- Input 7 -} [n, p] ->= [p, n] {- Input 9 -} [c, p] ->= [p, c] {- Input 10 -} [c, m] ->= [m, c] {- Input 11 -} [c, n] ->= [n, c] {- Input 12 -} [c, o] ->= [o, c] {- Input 13 -} [c, o] ->= [o] {- Input 14 -} reason no strict rules ************************************************** skeleton: (3/12,7)\Weight(1/11,7)\Matrix{\Natural}{3}(1/9,7)\Matrix{\Natural}{3}(0/9,6)[] ************************************************** 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))