details

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

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	1.86022 seconds
cpu usage	7.13536
user time	6.04144
system time	1.09392
max virtual memory	1.16545788E8
max residence set size	487928.0

stage attributes

key	value
starexec-result	YES

output

6.44/1.67 YES 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [a, a, a, b] -> [b, a, b, a, a, a], [b, a] -> []) 6.44/1.67 reason 6.44/1.67 remap for 2 rules 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [0, 0, 0, 1] -> [1, 0, 1, 0, 0, 0], [1, 0] -> []) 6.44/1.67 reason 6.44/1.67 reverse each lhs and rhs 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [1, 0, 0, 0] -> [0, 0, 0, 1, 0, 1], [0, 1] -> []) 6.44/1.67 reason 6.44/1.67 DP transform 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [1, 0, 0, 0] ->= [0, 0, 0, 1, 0, 1], [0, 1] ->= [], [1#, 0, 0, 0] |-> [0#, 0, 0, 1, 0, 1], [1#, 0, 0, 0] |-> [0#, 0, 1, 0, 1], [1#, 0, 0, 0] |-> [0#, 1, 0, 1], [1#, 0, 0, 0] |-> [1#, 0, 1], [1#, 0, 0, 0] |-> [0#, 1], [1#, 0, 0, 0] |-> [1#]) 6.44/1.67 reason 6.44/1.67 remap for 8 rules 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [1, 0] ->= [], [2, 1, 1, 1] |-> [3, 1, 1, 0, 1, 0], [2, 1, 1, 1] |-> [3, 1, 0, 1, 0], [2, 1, 1, 1] |-> [3, 0, 1, 0], [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [3, 0], [2, 1, 1, 1] |-> [2]) 6.44/1.67 reason 6.44/1.67 weights 6.44/1.67 Map [(2, 4/1)] 6.44/1.67 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [1, 0] ->= [], [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2]) 6.44/1.67 reason 6.44/1.67 EDG has 1 SCCs 6.44/1.67 property Termination 6.44/1.67 has value True 6.44/1.67 for SRS ( [2, 1, 1, 1] |-> [2, 1, 0], [2, 1, 1, 1] |-> [2], [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [1, 0] ->= []) 6.44/1.67 reason 6.44/1.67 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 6.44/1.67 interpretation 6.44/1.67 0 / 0A 0A 3A \ 6.44/1.67 | -3A -3A 0A | 6.44/1.67 \ -3A -3A 0A / 6.44/1.67 1 / 0A 0A 3A \ 6.44/1.67 | 0A 0A 0A | 6.44/1.67 \ -3A 0A 0A / 6.44/1.67 2 / 24A 26A 27A \ 6.44/1.68 | 24A 26A 27A | 6.44/1.68 \ 24A 26A 27A / 6.44/1.69 [2, 1, 1, 1] |-> [2, 1, 0] 6.44/1.69 lhs rhs ge gt 6.44/1.69 / 27A 29A 30A \ / 26A 26A 29A \ True True 6.44/1.69 | 27A 29A 30A | | 26A 26A 29A | 6.44/1.69 \ 27A 29A 30A / \ 26A 26A 29A / 6.44/1.69 [2, 1, 1, 1] |-> [2] 6.44/1.69 lhs rhs ge gt 6.44/1.69 / 27A 29A 30A \ / 24A 26A 27A \ True True 6.44/1.69 | 27A 29A 30A | | 24A 26A 27A | 6.44/1.69 \ 27A 29A 30A / \ 24A 26A 27A / 6.44/1.69 [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0] 6.44/1.69 lhs rhs ge gt 6.44/1.69 / 3A 3A 6A \ / 3A 3A 6A \ True False 6.44/1.69 | 0A 0A 3A | | 0A 0A 3A | 6.44/1.69 \ 0A 0A 3A / \ 0A 0A 3A / 6.44/1.69 [1, 0] ->= [] 6.44/1.69 lhs rhs ge gt 6.44/1.69 / 0A 0A 3A \ / 0A - - \ True False 6.44/1.69 | 0A 0A 3A | | - 0A - | 6.44/1.69 \ -3A -3A 0A / \ - - 0A / 6.44/1.69 property Termination 6.44/1.69 has value True 6.44/1.69 for SRS ( [0, 1, 1, 1] ->= [1, 1, 1, 0, 1, 0], [1, 0] ->= []) 6.44/1.69 reason 6.44/1.69 EDG has 0 SCCs 6.44/1.69 6.44/1.69 ************************************************** 6.44/1.69 summary 6.44/1.69 ************************************************** 6.44/1.69 SRS with 2 rules on 2 letters Remap { tracing = False} 6.44/1.69 SRS with 2 rules on 2 letters reverse each lhs and rhs 6.65/1.70 SRS with 2 rules on 2 letters DP transform 6.65/1.70 SRS with 8 rules on 4 letters Remap { tracing = False} 6.65/1.70 SRS with 8 rules on 4 letters weights 6.65/1.70 SRS with 4 rules on 3 letters EDG 6.65/1.70 SRS with 4 rules on 3 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = True} 6.65/1.70 SRS with 2 rules on 2 letters EDG 6.65/1.70 6.65/1.70 ************************************************** 6.65/1.70 (2, 2)\Deepee(8, 4)\Weight(4, 3)\Matrix{\Arctic}{3}(2, 2)\EDG[] 6.65/1.70 ************************************************** 6.91/1.80 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.91/1.80 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 6.91/1.86 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