details

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

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	0.322432 seconds
cpu usage	1.18414
user time	0.966403
system time	0.217738
max virtual memory	113176.0
max residence set size	124704.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.30 YES 0.00/0.30 property Termination 0.00/0.30 has value True 0.00/0.30 for SRS ( [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2]) 0.00/0.30 reason 0.00/0.30 remap for 5 rules 0.00/0.30 property Termination 0.00/0.30 has value True 0.00/0.30 for SRS ( [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2], [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2]) 0.00/0.30 reason 0.00/0.30 matchbound 2 certified by automaton with 2973 states 0.00/0.30 0.00/0.30 0.00/0.30 ************************************************** 0.00/0.30 summary 0.00/0.30 ************************************************** 0.00/0.30 SRS with 5 rules on 3 letters Remap { tracing = False} 0.00/0.30 SRS with 5 rules on 3 letters Matchbound { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 2973 states 0.00/0.30 0.00/0.30 ************************************************** 0.00/0.30 (5, 3)\Rfcmatchbound[] 0.00/0.30 ************************************************** 0.00/0.30 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.30 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 0.00/0.32 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