details

property	value
status	complete
benchmark	4374.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n173.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	1.78771 seconds
cpu usage	6.90127
user time	5.47432
system time	1.42695
max virtual memory	1.16544564E8
max residence set size	328360.0

stage attributes

key	value
starexec-result	YES

output

6.62/1.73 YES 6.62/1.73 property Termination 6.62/1.73 has value True 6.62/1.73 for SRS ( [3, 3, 0] -> [3, 0, 2, 1, 0, 0, 1, 2, 1, 0], [5, 1, 5] -> [4, 4, 1, 0, 0, 3, 4, 1, 0, 2], [0, 5, 0, 0] -> [2, 3, 0, 3, 5, 2, 2, 3, 4, 1], [3, 1, 0, 0] -> [3, 5, 5, 3, 5, 0, 0, 0, 0, 0], [0, 2, 2, 5, 5] -> [2, 5, 4, 3, 0, 4, 1, 3, 5, 4], [2, 3, 3, 2, 4] -> [2, 1, 2, 5, 0, 1, 0, 5, 5, 4], [4, 0, 3, 0, 0] -> [4, 3, 5, 2, 4, 1, 2, 1, 2, 0], [4, 5, 2, 5, 2] -> [5, 2, 1, 1, 1, 0, 2, 5, 0, 2], [0, 0, 2, 2, 5, 0] -> [0, 2, 5, 3, 4, 0, 1, 2, 5, 0], [1, 3, 2, 2, 5, 2] -> [1, 3, 5, 2, 4, 5, 2, 3, 4, 4], [1, 5, 2, 5, 3, 1] -> [2, 5, 4, 1, 1, 0, 2, 5, 3, 2], [2, 2, 4, 5, 2, 5] -> [2, 2, 4, 3, 5, 4, 5, 5, 2, 5], [2, 4, 0, 2, 0, 0] -> [2, 0, 0, 2, 5, 4, 1, 1, 2, 1], [2, 4, 5, 2, 5, 4] -> [2, 4, 1, 0, 0, 4, 4, 3, 5, 4], [3, 1, 5, 1, 3, 2] -> [1, 1, 5, 3, 5, 1, 2, 4, 1, 5], [3, 2, 0, 3, 0, 0] -> [3, 4, 1, 3, 4, 0, 2, 0, 4, 1], [4, 5, 2, 3, 1, 2] -> [4, 4, 4, 0, 1, 2, 4, 2, 0, 2], [4, 5, 2, 5, 3, 2] -> [4, 1, 3, 4, 3, 2, 4, 4, 0, 2], [5, 0, 5, 2, 5, 2] -> [5, 4, 2, 4, 4, 3, 4, 5, 0, 0], [5, 2, 5, 2, 2, 5] -> [4, 4, 5, 5, 1, 0, 5, 2, 1, 2], [0, 0, 5, 2, 4, 2, 5] -> [0, 2, 0, 4, 2, 1, 2, 1, 3, 3], [0, 5, 2, 0, 3, 2, 2] -> [2, 1, 2, 4, 3, 5, 2, 2, 2, 2], [0, 5, 2, 0, 4, 3, 0] -> [1, 1, 1, 2, 4, 3, 3, 4, 5, 4], [1, 0, 3, 2, 1, 3, 2] -> [1, 1, 1, 1, 5, 5, 3, 5, 1, 5], [2, 0, 1, 4, 5, 2, 0] -> [2, 2, 1, 0, 0, 0, 3, 3, 4, 4], [2, 1, 5, 5, 0, 1, 1] -> [0, 1, 2, 3, 4, 4, 3, 3, 4, 0], [2, 4, 1, 3, 0, 5, 2] -> [2, 4, 4, 1, 5, 3, 4, 4, 4, 0], [2, 4, 4, 3, 1, 0, 0] -> [2, 4, 2, 1, 3, 5, 4, 4, 0, 1], [3, 1, 4, 2, 3, 0, 0] -> [1, 0, 3, 4, 3, 3, 4, 2, 4, 1], [3, 2, 1, 4, 2, 1, 4] -> [3, 5, 4, 2, 3, 0, 1, 1, 5, 5], [3, 2, 2, 2, 2, 4, 2] -> [3, 1, 3, 0, 1, 1, 4, 2, 1, 0], [3, 2, 5, 0, 0, 3, 0] -> [4, 3, 4, 1, 2, 2, 0, 2, 5, 4], [3, 3, 5, 2, 2, 5, 2] -> [3, 0, 1, 0, 5, 1, 5, 5, 4, 2], [4, 2, 1, 5, 1, 5, 0] -> [4, 4, 5, 4, 0, 2, 3, 4, 5, 0], [5, 0, 0, 3, 1, 5, 0] -> [4, 0, 0, 4, 0, 5, 4, 4, 1, 0], [5, 0, 0, 4, 4, 5, 0] -> [4, 2, 1, 1, 3, 4, 4, 0, 5, 0], [5, 0, 3, 0, 5, 0, 1] -> [5, 1, 3, 3, 4, 5, 3, 0, 4, 1], [5, 0, 3, 2, 0, 5, 0] -> [5, 1, 2, 4, 0, 0, 1, 5, 1, 0], [5, 0, 3, 3, 2, 2, 0] -> [4, 2, 2, 2, 2, 5, 3, 5, 1, 0], [5, 1, 4, 2, 0, 5, 2] -> [4, 0, 5, 1, 0, 4, 4, 0, 4, 2], [5, 3, 3, 2, 1, 5, 5] -> [1, 3, 5, 0, 2, 1, 2, 0, 2, 3], [5, 5, 0, 3, 2, 0, 3] -> [0, 4, 4, 0, 2, 5, 4, 1, 0, 3]) 6.62/1.73 reason 6.62/1.73 remap for 42 rules 6.62/1.73 property Termination 6.62/1.73 has value True 6.62/1.74 for SRS ( [0, 0, 1] -> [0, 1, 2, 3, 1, 1, 3, 2, 3, 1], [4, 3, 4] -> [5, 5, 3, 1, 1, 0, 5, 3, 1, 2], [1, 4, 1, 1] -> [2, 0, 1, 0, 4, 2, 2, 0, 5, 3], [0, 3, 1, 1] -> [0, 4, 4, 0, 4, 1, 1, 1, 1, 1], [1, 2, 2, 4, 4] -> [2, 4, 5, 0, 1, 5, 3, 0, 4, 5], [2, 0, 0, 2, 5] -> [2, 3, 2, 4, 1, 3, 1, 4, 4, 5], [5, 1, 0, 1, 1] -> [5, 0, 4, 2, 5, 3, 2, 3, 2, 1], [5, 4, 2, 4, 2] -> [4, 2, 3, 3, 3, 1, 2, 4, 1, 2], [1, 1, 2, 2, 4, 1] -> [1, 2, 4, 0, 5, 1, 3, 2, 4, 1], [3, 0, 2, 2, 4, 2] -> [3, 0, 4, 2, 5, 4, 2, 0, 5, 5], [3, 4, 2, 4, 0, 3] -> [2, 4, 5, 3, 3, 1, 2, 4, 0, 2], [2, 2, 5, 4, 2, 4] -> [2, 2, 5, 0, 4, 5, 4, 4, 2, 4], [2, 5, 1, 2, 1, 1] -> [2, 1, 1, 2, 4, 5, 3, 3, 2, 3], [2, 5, 4, 2, 4, 5] -> [2, 5, 3, 1, 1, 5, 5, 0, 4, 5], [0, 3, 4, 3, 0, 2] -> [3, 3, 4, 0, 4, 3, 2, 5, 3, 4], [0, 2, 1, 0, 1, 1] -> [0, 5, 3, 0, 5, 1, 2, 1, 5, 3], [5, 4, 2, 0, 3, 2] -> [5, 5, 5, 1, 3, 2, 5, 2, 1, 2], [5, 4, 2, 4, 0, 2] -> [5, 3, 0, 5, 0, 2, 5, 5, 1, 2], [4, 1, 4, 2, 4, 2] -> [4, 5, 2, 5, 5, 0, 5, 4, 1, 1], [4, 2, 4, 2, 2, 4] -> [5, 5, 4, 4, 3, 1, 4, 2, 3, 2], [1, 1, 4, 2, 5, 2, 4] -> [1, 2, 1, 5, 2, 3, 2, 3, 0, 0], [1, 4, 2, 1, 0, 2, 2] -> [2, 3, 2, 5, 0, 4, 2, 2, 2, 2], [1, 4, 2, 1, 5, 0, 1] -> [3, 3, 3, 2, 5, 0, 0, 5, 4, 5], [3, 1, 0, 2, 3, 0, 2] -> [3, 3, 3, 3, 4, 4, 0, 4, 3, 4], [2, 1, 3, 5, 4, 2, 1] -> [2, 2, 3, 1, 1, 1, 0, 0, 5, 5], [2, 3, 4, 4, 1, 3, 3] -> [1, 3, 2, 0, 5, 5, 0, 0, 5, 1], [2, 5, 3, 0, 1, 4, 2] -> [2, 5, 5, 3, 4, 0, 5, 5, 5, 1], [2, 5, 5, 0, 3, 1, 1] -> [2, 5, 2, 3, 0, 4, 5, 5, 1, 3], [0, 3, 5, 2, 0, 1, 1] -> [3, 1, 0, 5, 0, 0, 5, 2, 5, 3], [0, 2, 3, 5, 2, 3, 5] -> [0, 4, 5, 2, 0, 1, 3, 3, 4, 4], [0, 2, 2, 2, 2, 5, 2] -> [0, 3, 0, 1, 3, 3, 5, 2, 3, 1], [0, 2, 4, 1, 1, 0, 1] -> [5, 0, 5, 3, 2, 2, 1, 2, 4, 5], [0, 0, 4, 2, 2, 4, 2] -> [0, 1, 3, 1, 4, 3, 4, 4, 5, 2], [5, 2, 3, 4, 3, 4, 1] -> [5, 5, 4, 5, 1, 2, 0, 5, 4, 1], [4, 1, 1, 0, 3, 4, 1] -> [5, 1, 1, 5, 1, 4, 5, 5, 3, 1], [4, 1, 1, 5, 5, 4, 1] -> [5, 2, 3, 3, 0, 5, 5, 1, 4, 1], [4, 1, 0, 1, 4, 1, 3] -> [4, 3, 0, 0, 5, 4, 0, 1, 5, 3], [4, 1, 0, 2, 1, 4, 1] -> [4, 3, 2, 5, 1, 1, 3, 4, 3, 1], [4, 1, 0, 0, 2, 2, 1] -> [5, 2, 2, 2, 2, 4, 0, 4, 3, 1], [4, 3, 5, 2, 1, 4, 2] -> [5, 1, 4, 3, 1, 5, 5, 1, 5, 2], [4, 0, 0, 2, 3, 4, 4] -> [3, 0, 4, 1, 2, 3, 2, 1, 2, 0], [4, 4, 1, 0, 2, 1, 0] -> [1, 5, 5, 1, 2, 4, 5, 3, 1, 0]) 6.62/1.74 reason 6.62/1.74 matchbound 2 certified by automaton with 1287 states 6.62/1.74 6.62/1.74 6.62/1.74 ************************************************** 6.62/1.74 summary 6.62/1.74 ************************************************** 6.62/1.74 SRS with 42 rules on 6 letters Remap { tracing = False} 6.62/1.74 SRS with 42 rules on 6 letters Matchbound { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1287 states 6.62/1.74 6.62/1.74 ************************************************** 6.62/1.74 (42, 6)\Rfcmatchbound[] 6.62/1.74 ************************************************** 6.62/1.75 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]} 6.62/1.75 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 6.89/1.78 EOF popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29