0.00/0.15 YES 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.15 for SRS ( [b, a, b, a] -> [b, b, a, b], [a, a, b, b] -> [b, b, b, a], [b, a, b, b] -> [b, b, a, a]) 0.00/0.15 reason 0.00/0.15 remap for 3 rules 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.15 for SRS ( [0, 1, 0, 1] -> [0, 0, 1, 0], [1, 1, 0, 0] -> [0, 0, 0, 1], [0, 1, 0, 0] -> [0, 0, 1, 1]) 0.00/0.15 reason 0.00/0.15 reverse each lhs and rhs 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.15 for SRS ( [1, 0, 1, 0] -> [0, 1, 0, 0], [0, 0, 1, 1] -> [1, 0, 0, 0], [0, 0, 1, 0] -> [1, 1, 0, 0]) 0.00/0.15 reason 0.00/0.15 DP transform 0.00/0.15 property Termination 0.00/0.15 has value True 0.00/0.16 for SRS ( [1, 0, 1, 0] ->= [0, 1, 0, 0], [0, 0, 1, 1] ->= [1, 0, 0, 0], [0, 0, 1, 0] ->= [1, 1, 0, 0], [1#, 0, 1, 0] |-> [0#, 1, 0, 0], [1#, 0, 1, 0] |-> [1#, 0, 0], [1#, 0, 1, 0] |-> [0#, 0], [0#, 0, 1, 1] |-> [1#, 0, 0, 0], [0#, 0, 1, 1] |-> [0#, 0, 0], [0#, 0, 1, 1] |-> [0#, 0], [0#, 0, 1, 1] |-> [0#], [0#, 0, 1, 0] |-> [1#, 1, 0, 0], [0#, 0, 1, 0] |-> [1#, 0, 0], [0#, 0, 1, 0] |-> [0#, 0]) 0.00/0.16 reason 0.00/0.16 remap for 13 rules 0.00/0.16 property Termination 0.00/0.16 has value True 0.00/0.16 for SRS ( [0, 1, 0, 1] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 1, 1, 1], [1, 1, 0, 1] ->= [0, 0, 1, 1], [2, 1, 0, 1] |-> [3, 0, 1, 1], [2, 1, 0, 1] |-> [2, 1, 1], [2, 1, 0, 1] |-> [3, 1], [3, 1, 0, 0] |-> [2, 1, 1, 1], [3, 1, 0, 0] |-> [3, 1, 1], [3, 1, 0, 0] |-> [3, 1], [3, 1, 0, 0] |-> [3], [3, 1, 0, 1] |-> [2, 0, 1, 1], [3, 1, 0, 1] |-> [2, 1, 1], [3, 1, 0, 1] |-> [3, 1]) 0.00/0.16 reason 0.00/0.16 weights 0.00/0.16 Map [(0, 1/12), (1, 1/12)] 0.00/0.16 0.00/0.16 property Termination 0.00/0.16 has value True 0.00/0.16 for SRS ( [0, 1, 0, 1] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 1, 1, 1], [1, 1, 0, 1] ->= [0, 0, 1, 1], [2, 1, 0, 1] |-> [3, 0, 1, 1], [3, 1, 0, 0] |-> [2, 1, 1, 1], [3, 1, 0, 1] |-> [2, 0, 1, 1]) 0.00/0.16 reason 0.00/0.16 EDG has 1 SCCs 0.00/0.16 property Termination 0.00/0.16 has value True 0.00/0.16 for SRS ( [2, 1, 0, 1] |-> [3, 0, 1, 1], [3, 1, 0, 1] |-> [2, 0, 1, 1], [3, 1, 0, 0] |-> [2, 1, 1, 1], [0, 1, 0, 1] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 1, 1, 1], [1, 1, 0, 1] ->= [0, 0, 1, 1]) 0.00/0.16 reason 0.00/0.16 Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.16 interpretation 0.00/0.16 0 / 2 1 \ 0.00/0.16 \ 0 1 / 0.00/0.16 1 / 2 0 \ 0.00/0.16 \ 0 1 / 0.00/0.16 2 / 1 0 \ 0.00/0.16 \ 0 1 / 0.00/0.16 3 / 1 0 \ 0.00/0.16 \ 0 1 / 0.00/0.16 [2, 1, 0, 1] |-> [3, 0, 1, 1] 0.00/0.16 lhs rhs ge gt 0.00/0.16 / 8 2 \ / 8 1 \ True True 0.00/0.16 \ 0 1 / \ 0 1 / 0.00/0.16 [3, 1, 0, 1] |-> [2, 0, 1, 1] 0.00/0.17 lhs rhs ge gt 0.00/0.17 / 8 2 \ / 8 1 \ True True 0.00/0.17 \ 0 1 / \ 0 1 / 0.00/0.17 [3, 1, 0, 0] |-> [2, 1, 1, 1] 0.00/0.17 lhs rhs ge gt 0.00/0.17 / 8 6 \ / 8 0 \ True True 0.00/0.17 \ 0 1 / \ 0 1 / 0.00/0.17 [0, 1, 0, 1] ->= [1, 0, 1, 1] 0.00/0.17 lhs rhs ge gt 0.00/0.17 / 16 5 \ / 16 2 \ True True 0.00/0.17 \ 0 1 / \ 0 1 / 0.00/0.17 [1, 1, 0, 0] ->= [0, 1, 1, 1] 0.00/0.17 lhs rhs ge gt 0.00/0.17 / 16 12 \ / 16 1 \ True True 0.00/0.17 \ 0 1 / \ 0 1 / 0.00/0.17 [1, 1, 0, 1] ->= [0, 0, 1, 1] 0.00/0.17 lhs rhs ge gt 0.00/0.17 / 16 4 \ / 16 3 \ True True 0.00/0.17 \ 0 1 / \ 0 1 / 0.00/0.17 property Termination 0.00/0.17 has value True 0.00/0.17 for SRS ( ) 0.00/0.17 reason 0.00/0.17 EDG has 0 SCCs 0.00/0.17 0.00/0.17 ************************************************** 0.00/0.17 summary 0.00/0.17 ************************************************** 0.00/0.17 SRS with 3 rules on 2 letters Remap { tracing = False} 0.00/0.17 SRS with 3 rules on 2 letters reverse each lhs and rhs 0.00/0.17 SRS with 3 rules on 2 letters DP transform 0.00/0.17 SRS with 13 rules on 4 letters Remap { tracing = False} 0.00/0.17 SRS with 13 rules on 4 letters weights 0.00/0.17 SRS with 6 rules on 4 letters EDG 0.00/0.17 SRS with 6 rules on 4 letters Matrix { monotone = Strict, domain = Natural, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False} 0.00/0.17 SRS with 0 rules on 0 letters EDG 0.00/0.17 0.00/0.17 ************************************************** 0.00/0.17 (3, 2)\Deepee(13, 4)\Weight(6, 4)\Matrix{\Natural}{2}(0, 0)\EDG[] 0.00/0.17 ************************************************** 0.00/0.17 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.17 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.18 EOF