details

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

run statistics

property	value
solver	matchbox-2020-06-25
configuration	tc20-std.sh
runtime (wallclock)	0.576298952103 seconds
cpu usage	2.116322784
max memory	6.1411328E7

stage attributes

key	value
output-size	5129
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 46 rules on 6 letters Matchbound { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 636 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 1, 2] -> [1, 0, 0, 2] {- Input 0 -} [0, 1, 2] -> [1, 0, 3, 2] {- Input 1 -} [0, 1, 2] -> [1, 0, 0, 3, 2] {- Input 2 -} [0, 1, 2] -> [4, 5, 1, 0, 2] {- Input 3 -} [0, 5, 2] -> [5, 0, 0, 2] {- Input 4 -} [0, 5, 2] -> [5, 5, 0, 2] {- Input 5 -} [0, 5, 2] -> [5, 0, 3, 3, 2] {- Input 6 -} [0, 5, 3] -> [5, 0, 0, 3] {- Input 7 -} [0, 5, 3] -> [5, 5, 0, 3] {- Input 8 -} [0, 0, 5, 2] -> [0, 2, 0, 3, 5, 5] {- Input 9 -} [0, 1, 2, 3] -> [1, 3, 2, 0, 3] {- Input 10 -} [0, 1, 2, 4] -> [4, 5, 1, 0, 2] {- Input 11 -} [0, 1, 4, 2] -> [4, 4, 1, 0, 2] {- Input 12 -} [0, 4, 1, 2] -> [0, 4, 5, 5, 1, 2] {- Input 13 -} [0, 5, 2, 3] -> [5, 0, 3, 2, 3] {- Input 14 -} [1, 2, 1, 2] -> [1, 1, 5, 2, 2] {- Input 15 -} [4, 0, 1, 2] -> [4, 1, 0, 0, 2] {- Input 16 -} [4, 3, 0, 2] -> [4, 0, 0, 3, 2] {- Input 17 -} [4, 3, 1, 2] -> [3, 2, 5, 4, 1, 1] {- Input 18 -} [0, 0, 1, 2, 3] -> [3, 2, 1, 0, 0, 3] {- Input 19 -} [0, 0, 1, 3, 2] -> [1, 0, 2, 0, 0, 3] {- Input 20 -} [0, 0, 1, 3, 3] -> [0, 0, 3, 1, 0, 3] {- Input 21 -} [0, 0, 1, 5, 2] -> [1, 5, 0, 0, 3, 2] {- Input 22 -} [0, 1, 2, 1, 2] -> [1, 1, 0, 2, 2, 2] {- Input 23 -} [0, 1, 4, 5, 2] -> [4, 1, 0, 3, 2, 5] {- Input 24 -} [0, 5, 0, 1, 2] -> [1, 2, 0, 1, 5, 0] {- Input 25 -} [0, 5, 1, 0, 2] -> [1, 5, 0, 0, 3, 2] {- Input 26 -} [0, 5, 1, 4, 3] -> [1, 0, 3, 5, 4, 5] {- Input 27 -} [0, 5, 1, 4, 3] -> [4, 5, 5, 1, 0, 3] {- Input 28 -} [0, 5, 3, 1, 2] -> [0, 1, 5, 0, 2, 3] {- Input 29 -} [0, 5, 3, 1, 2] -> [5, 0, 1, 4, 3, 2] {- Input 30 -} [0, 5, 3, 4, 2] -> [3, 2, 0, 3, 5, 4] {- Input 31 -} [0, 5, 4, 3, 2] -> [0, 0, 4, 3, 2, 5] {- Input 32 -} [1, 2, 5, 2, 3] -> [5, 1, 2, 3, 3, 2] {- Input 33 -} [1, 3, 0, 5, 2] -> [0, 5, 1, 0, 3, 2] {- Input 34 -} [1, 3, 0, 5, 2] -> [1, 3, 0, 0, 2, 5] {- Input 35 -} [1, 3, 3, 4, 2] -> [5, 1, 3, 3, 2, 4] {- Input 36 -} [4, 3, 0, 2, 3] -> [0, 3, 3, 3, 2, 4] {- Input 37 -} [4, 3, 0, 5, 3] -> [5, 4, 3, 5, 0, 3] {- Input 38 -} [4, 3, 3, 1, 2] -> [1, 3, 0, 4, 3, 2] {- Input 39 -} [5, 2, 3, 0, 2] -> [4, 5, 0, 2, 3, 2] {- Input 40 -} [5, 2, 3, 1, 2] -> [2, 3, 2, 4, 1, 5] {- Input 41 -} [5, 3, 0, 2, 2] -> [5, 3, 3, 2, 0, 2] {- Input 42 -} [5, 3, 0, 5, 2] -> [5, 5, 3, 0, 2, 4] {- Input 43 -} [5, 3, 1, 2, 2] -> [5, 1, 3, 2, 2, 2] {- Input 44 -} [5, 3, 1, 5, 2] -> [2, 5, 5, 1, 5, 3] {- Input 45 -} reason Matchbound Matchbound { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 636 states ************************************************** skeleton: (46,6)\Rfcmatchbound{1}[] ************************************************** let {} in let {trac = False;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,unlabel = False})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 1000)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = trac,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]] <> ([ Seq [ matrix Arctic 2 5, matrix Arctic 3 4, matrix Arctic 4 3], Seq [ matrix Natural 2 5, matrix Natural 3 4, matrix Natural 4 3]] <> [ kbo 1, And_Then (Worker Mirror) (And_Then (kbo 1) (Worker Mirror))])));dp = As_Transformer (Apply (And_Then (Worker (DP {tracing = True})) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = True})) remove)));noh = [ Worker (Enumerate {closure = Forward}), 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, tiling Forward 2, And_Then (Worker Mirror) (tiling Forward 2)] <> [ Worker (Unlabel {verbose = True})])} in Apply (Worker Remap) (Seq [ Worker KKST01, First_Of ([ yeah] <> noh)]) popout

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

job log

popout

actions

all output return to SRS Standard