0.00/0.14 YES 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [b, a, b] -> [a, b, a], [b, b, a] -> [b, b, b], [c, a] -> [a, b, c], [c, b] -> [b, a, c]) 0.00/0.14 reason 0.00/0.14 remap for 4 rules 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 0] -> [1, 0, 1], [0, 0, 1] -> [0, 0, 0], [2, 1] -> [1, 0, 2], [2, 0] -> [0, 1, 2]) 0.00/0.14 reason 0.00/0.14 reverse each lhs and rhs 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 0] -> [1, 0, 1], [1, 0, 0] -> [0, 0, 0], [1, 2] -> [2, 0, 1], [0, 2] -> [2, 1, 0]) 0.00/0.14 reason 0.00/0.14 DP transform 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [1, 2] ->= [2, 0, 1], [0, 2] ->= [2, 1, 0], [0#, 1, 0] |-> [1#, 0, 1], [0#, 1, 0] |-> [0#, 1], [0#, 1, 0] |-> [1#], [1#, 0, 0] |-> [0#, 0, 0], [1#, 2] |-> [0#, 1], [1#, 2] |-> [1#], [0#, 2] |-> [1#, 0], [0#, 2] |-> [0#]) 0.00/0.14 reason 0.00/0.14 remap for 12 rules 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [1, 2] ->= [2, 0, 1], [0, 2] ->= [2, 1, 0], [3, 1, 0] |-> [4, 0, 1], [3, 1, 0] |-> [3, 1], [3, 1, 0] |-> [4], [4, 0, 0] |-> [3, 0, 0], [4, 2] |-> [3, 1], [4, 2] |-> [4], [3, 2] |-> [4, 0], [3, 2] |-> [3]) 0.00/0.14 reason 0.00/0.14 weights 0.00/0.14 Map [(2, 4/1)] 0.00/0.14 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [1, 2] ->= [2, 0, 1], [0, 2] ->= [2, 1, 0], [3, 1, 0] |-> [4, 0, 1], [3, 1, 0] |-> [3, 1], [3, 1, 0] |-> [4], [4, 0, 0] |-> [3, 0, 0]) 0.00/0.14 reason 0.00/0.14 EDG has 1 SCCs 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [3, 1, 0] |-> [4, 0, 1], [4, 0, 0] |-> [3, 0, 0], [3, 1, 0] |-> [4], [3, 1, 0] |-> [3, 1], [0, 1, 0] ->= [1, 0, 1], [1, 0, 0] ->= [0, 0, 0], [1, 2] ->= [2, 0, 1], [0, 2] ->= [2, 1, 0]) 0.00/0.14 reason 0.00/0.14 reverse each lhs and rhs 0.00/0.14 property Termination 0.00/0.14 has value True 0.00/0.14 for SRS ( [0, 1, 3] ->| [1, 0, 4], [0, 0, 4] ->| [0, 0, 3], [0, 1, 3] ->| [4], [0, 1, 3] ->| [1, 3], [0, 1, 0] ->= [1, 0, 1], [0, 0, 1] ->= [0, 0, 0], [2, 1] ->= [1, 0, 2], [2, 0] ->= [0, 1, 2]) 0.00/0.14 reason 0.00/0.14 Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.14 interpretation 0.00/0.14 0 / 1 1 \ 0.00/0.14 \ 0 1 / 0.00/0.14 1 / 1 1 \ 0.00/0.14 \ 0 1 / 0.00/0.14 2 / 2 1 \ 0.00/0.14 \ 0 1 / 0.00/0.14 3 / 1 0 \ 0.00/0.14 \ 0 1 / 0.00/0.14 4 / 1 0 \ 0.00/0.14 \ 0 1 / 0.00/0.14 [0, 1, 3] ->| [1, 0, 4] 0.00/0.14 lhs rhs ge gt 0.00/0.14 / 1 2 \ / 1 2 \ True False 0.00/0.14 \ 0 1 / \ 0 1 / 0.00/0.14 [0, 0, 4] ->| [0, 0, 3] 0.00/0.14 lhs rhs ge gt 0.00/0.14 / 1 2 \ / 1 2 \ True False 0.00/0.14 \ 0 1 / \ 0 1 / 0.00/0.14 [0, 1, 3] ->| [4] 0.00/0.14 lhs rhs ge gt 0.00/0.14 / 1 2 \ / 1 0 \ True True 0.00/0.14 \ 0 1 / \ 0 1 / 0.00/0.14 [0, 1, 3] ->| [1, 3] 0.00/0.14 lhs rhs ge gt 0.00/0.14 / 1 2 \ / 1 1 \ True True 0.00/0.14 \ 0 1 / \ 0 1 / 0.00/0.14 [0, 1, 0] ->= [1, 0, 1] 0.00/0.14 lhs rhs ge gt 0.00/0.14 / 1 3 \ / 1 3 \ True False 0.00/0.14 \ 0 1 / \ 0 1 / 0.00/0.14 [0, 0, 1] ->= [0, 0, 0] 0.00/0.15 lhs rhs ge gt 0.00/0.15 / 1 3 \ / 1 3 \ True False 0.00/0.15 \ 0 1 / \ 0 1 / 0.00/0.15 [2, 1] ->= [1, 0, 2] 0.00/0.15 lhs rhs ge gt 0.00/0.15 / 2 3 \ / 2 3 \ True False 0.00/0.15 \ 0 1 / \ 0 1 / 0.00/0.15 [2, 0] ->= [0, 1, 2] 0.00/0.15 lhs rhs ge gt 0.00/0.15 / 2 3 \ / 2 3 \ True False 0.00/0.15 \ 0 1 / \ 0 1 / 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.15 for SRS ( [0, 1, 3] ->| [1, 0, 4], [0, 0, 4] ->| [0, 0, 3], [0, 1, 0] ->= [1, 0, 1], [0, 0, 1] ->= [0, 0, 0], [2, 1] ->= [1, 0, 2], [2, 0] ->= [0, 1, 2]) 0.00/0.15 reason 0.00/0.15 EDG has 0 SCCs 0.00/0.15 0.00/0.15 ************************************************** 0.00/0.15 summary 0.00/0.15 ************************************************** 0.00/0.15 SRS with 4 rules on 3 letters Remap { tracing = False} 0.00/0.15 SRS with 4 rules on 3 letters reverse each lhs and rhs 0.00/0.15 SRS with 4 rules on 3 letters DP transform 0.00/0.15 SRS with 12 rules on 5 letters Remap { tracing = False} 0.00/0.15 SRS with 12 rules on 5 letters weights 0.00/0.15 SRS with 8 rules on 5 letters EDG 0.00/0.15 SRS with 8 rules on 5 letters reverse each lhs and rhs 0.00/0.15 SRS with 8 rules on 5 letters Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.15 SRS with 6 rules on 5 letters EDG 0.00/0.15 0.00/0.15 ************************************************** 0.00/0.15 (4, 3)\Deepee(12, 5)\Weight(8, 5)\Matrix{\Natural}{2}(6, 5)\EDG[] 0.00/0.15 ************************************************** 0.00/0.15 let { 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})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 100)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI { tracing = True,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix { monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = False,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]] <> ([ matrix Arctic 4 3, matrix Natural 4 3] <> [ kbo 1, And_Then (Worker Mirror) (kbo 1)])));remove_tile = Seq [ remove, tiling Overlap 3];dp = As_Transformer (Apply (And_Then (Worker (DP { tracing = False})) (Worker Remap)) (Apply wop (Branch (Worker (EDG { tracing = False})) remove_tile)));noh = [ Timeout 10 (Worker (Enumerate { closure = Forward})), Timeout 10 (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]} 0.00/0.15 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.17 EOF