details

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

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	0.662418 seconds
cpu usage	2.46597
user time	2.11714
system time	0.348831
max virtual memory	1.16545788E8
max residence set size	160696.0

stage attributes

key	value
starexec-result	YES

output

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