details

property	value
status	complete
benchmark	2-matchbox.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n148.star.cs.uiowa.edu
space	Secret_06_SRS

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	1.1931 seconds
cpu usage	4.29188
user time	3.76052
system time	0.531362
max virtual memory	1.16614528E8
max residence set size	128728.0

stage attributes

key	value
starexec-result	YES

output

2.23/0.60 YES 2.23/0.60 property Termination 2.23/0.60 has value True 2.40/0.62 for SRS ( [c, c] -> [a, a, a, b, b, b], [b, b, b, a] -> [b, b, b, b, b, b, b, b], [b, b, c, c] -> [c, c, c, a, a, a, a]) 2.40/0.62 reason 2.40/0.62 remap for 3 rules 2.40/0.62 property Termination 2.40/0.62 has value True 2.40/0.62 for SRS ( [0, 0] -> [1, 1, 1, 2, 2, 2], [2, 2, 2, 1] -> [2, 2, 2, 2, 2, 2, 2, 2], [2, 2, 0, 0] -> [0, 0, 0, 1, 1, 1, 1]) 2.40/0.62 reason 2.40/0.62 reverse each lhs and rhs 2.40/0.62 property Termination 2.40/0.62 has value True 2.40/0.62 for SRS ( [0, 0] -> [2, 2, 2, 1, 1, 1], [1, 2, 2, 2] -> [2, 2, 2, 2, 2, 2, 2, 2], [0, 0, 2, 2] -> [1, 1, 1, 1, 0, 0, 0]) 2.40/0.62 reason 2.75/0.74 matchbound 6 certified by automaton with 5266 states 2.75/0.74 2.75/0.74 2.75/0.74 ************************************************** 2.75/0.74 summary 2.75/0.75 ************************************************** 2.75/0.75 SRS with 3 rules on 3 letters Remap { tracing = False} 2.75/0.75 SRS with 3 rules on 3 letters reverse each lhs and rhs 2.75/0.75 SRS with 3 rules on 3 letters Matchbound { method = RFC, max_size = Nothing, verbose = False, tracing = False} matchbound 6 certified by automaton with 5266 states 2.75/0.75 2.75/0.75 ************************************************** 2.75/0.76 (3, 3)\Rfcmatchbound[] 2.75/0.76 ************************************************** 3.94/1.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]} 3.94/1.15 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 4.27/1.19 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