details

property	value
status	complete
benchmark	size-12-alpha-3-num-9.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n031.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	0.624752 seconds
cpu usage	2.32529
user time	2.02075
system time	0.304544
max virtual memory	1.16545212E8
max residence set size	158996.0

stage attributes

key	value
starexec-result	YES

output

2.11/0.57 YES 2.11/0.57 property Termination 2.11/0.57 has value True 2.11/0.58 for SRS ( [a] -> [], [a] -> [b], [a, b, c] -> [c, c, a, b, a], [b] -> []) 2.11/0.58 reason 2.11/0.58 remap for 4 rules 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] -> [], [0] -> [1], [0, 1, 2] -> [2, 2, 0, 1, 0], [1] -> []) 2.11/0.58 reason 2.11/0.58 reverse each lhs and rhs 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] -> [], [0] -> [1], [2, 1, 0] -> [0, 1, 0, 2, 2], [1] -> []) 2.11/0.58 reason 2.11/0.58 DP transform 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [1] ->= [], [0#] |-> [1#], [2#, 1, 0] |-> [0#, 1, 0, 2, 2], [2#, 1, 0] |-> [1#, 0, 2, 2], [2#, 1, 0] |-> [0#, 2, 2], [2#, 1, 0] |-> [2#, 2], [2#, 1, 0] |-> [2#]) 2.11/0.58 reason 2.11/0.58 remap for 10 rules 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [1] ->= [], [3] |-> [4], [5, 1, 0] |-> [3, 1, 0, 2, 2], [5, 1, 0] |-> [4, 0, 2, 2], [5, 1, 0] |-> [3, 2, 2], [5, 1, 0] |-> [5, 2], [5, 1, 0] |-> [5]) 2.11/0.58 reason 2.11/0.58 weights 2.11/0.58 Map [(3, 1/1), (5, 2/1)] 2.11/0.58 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [1] ->= [], [5, 1, 0] |-> [5, 2], [5, 1, 0] |-> [5]) 2.11/0.58 reason 2.11/0.58 EDG has 1 SCCs 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [5, 1, 0] |-> [5, 2], [5, 1, 0] |-> [5], [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [1] ->= []) 2.11/0.58 reason 2.11/0.58 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.11/0.58 interpretation 2.11/0.58 0 / 0A 2A \ 2.11/0.58 \ 0A 0A / 2.11/0.58 1 / 0A 0A \ 2.11/0.58 \ 0A 0A / 2.11/0.58 2 / 0A 2A \ 2.11/0.58 \ -2A 0A / 2.11/0.58 5 / 11A 13A \ 2.11/0.58 \ 11A 13A / 2.11/0.58 [5, 1, 0] |-> [5, 2] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 13A 15A \ / 11A 13A \ True True 2.11/0.58 \ 13A 15A / \ 11A 13A / 2.11/0.58 [5, 1, 0] |-> [5] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 13A 15A \ / 11A 13A \ True True 2.11/0.58 \ 13A 15A / \ 11A 13A / 2.11/0.58 [0] ->= [] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 0A 2A \ / 0A - \ True False 2.11/0.58 \ 0A 0A / \ - 0A / 2.11/0.58 [0] ->= [1] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 0A 2A \ / 0A 0A \ True False 2.11/0.58 \ 0A 0A / \ 0A 0A / 2.11/0.58 [2, 1, 0] ->= [0, 1, 0, 2, 2] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 2A 4A \ / 2A 4A \ True False 2.11/0.58 \ 0A 2A / \ 0A 2A / 2.11/0.58 [1] ->= [] 2.11/0.58 lhs rhs ge gt 2.11/0.58 / 0A 0A \ / 0A - \ True False 2.11/0.58 \ 0A 0A / \ - 0A / 2.11/0.58 property Termination 2.11/0.58 has value True 2.11/0.58 for SRS ( [0] ->= [], [0] ->= [1], [2, 1, 0] ->= [0, 1, 0, 2, 2], [1] ->= []) 2.11/0.58 reason 2.11/0.58 EDG has 0 SCCs 2.11/0.58 2.11/0.58 ************************************************** 2.11/0.58 summary 2.11/0.58 ************************************************** 2.11/0.58 SRS with 4 rules on 3 letters Remap { tracing = False} 2.11/0.58 SRS with 4 rules on 3 letters reverse each lhs and rhs 2.11/0.58 SRS with 4 rules on 3 letters DP transform 2.11/0.58 SRS with 10 rules on 6 letters Remap { tracing = False} 2.11/0.58 SRS with 10 rules on 6 letters weights 2.11/0.58 SRS with 6 rules on 4 letters EDG 2.11/0.58 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 2.11/0.58 SRS with 4 rules on 3 letters EDG 2.11/0.58 2.11/0.58 ************************************************** 2.11/0.58 (4, 3)\Deepee(10, 6)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 3)\EDG[] 2.11/0.58 ************************************************** 2.11/0.59 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]} 2.11/0.59 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 2.31/0.62 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