details

property	value
status	complete
benchmark	random-185.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	matchbox-2019-03-17
configuration	std.sh
runtime (wallclock)	1.33717 seconds
cpu usage	5.06066
user time	4.4057
system time	0.654962
max virtual memory	1.16682116E8
max residence set size	338344.0

stage attributes

key	value
starexec-result	YES

output

3.60/0.95 YES 3.60/0.95 property Termination 3.60/0.95 has value True 3.77/0.97 for SRS ( [a, a, a, a] -> [b, a, b, b], [b, b, a, a] -> [a, a, b, b], [b, a, b, b] -> [a, a, b, b]) 3.77/0.97 reason 3.77/0.97 remap for 3 rules 3.77/0.97 property Termination 3.77/0.97 has value True 3.77/0.97 for SRS ( [0, 0, 0, 0] -> [1, 0, 1, 1], [1, 1, 0, 0] -> [0, 0, 1, 1], [1, 0, 1, 1] -> [0, 0, 1, 1]) 3.77/0.97 reason 3.77/0.97 DP transform 3.77/0.97 property Termination 3.77/0.97 has value True 3.77/0.98 for SRS ( [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1], [0#, 0, 0, 0] |-> [1#, 0, 1, 1], [0#, 0, 0, 0] |-> [0#, 1, 1], [0#, 0, 0, 0] |-> [1#, 1], [0#, 0, 0, 0] |-> [1#], [1#, 1, 0, 0] |-> [0#, 0, 1, 1], [1#, 1, 0, 0] |-> [0#, 1, 1], [1#, 1, 0, 0] |-> [1#, 1], [1#, 1, 0, 0] |-> [1#], [1#, 0, 1, 1] |-> [0#, 0, 1, 1]) 3.77/0.98 reason 3.77/0.98 remap for 12 rules 3.77/0.98 property Termination 3.77/0.98 has value True 3.77/0.99 for SRS ( [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1], [2, 0, 0, 0] |-> [3, 0, 1, 1], [2, 0, 0, 0] |-> [2, 1, 1], [2, 0, 0, 0] |-> [3, 1], [2, 0, 0, 0] |-> [3], [3, 1, 0, 0] |-> [2, 0, 1, 1], [3, 1, 0, 0] |-> [2, 1, 1], [3, 1, 0, 0] |-> [3, 1], [3, 1, 0, 0] |-> [3], [3, 0, 1, 1] |-> [2, 0, 1, 1]) 3.77/0.99 reason 3.77/0.99 weights 3.77/0.99 Map [(0, 1/12), (1, 1/12)] 3.77/0.99 3.77/0.99 property Termination 3.77/0.99 has value True 3.77/1.00 for SRS ( [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1], [2, 0, 0, 0] |-> [3, 0, 1, 1], [3, 1, 0, 0] |-> [2, 0, 1, 1], [3, 0, 1, 1] |-> [2, 0, 1, 1]) 3.77/1.00 reason 3.77/1.00 EDG has 1 SCCs 3.77/1.00 property Termination 3.77/1.00 has value True 3.77/1.01 for SRS ( [2, 0, 0, 0] |-> [3, 0, 1, 1], [3, 0, 1, 1] |-> [2, 0, 1, 1], [3, 1, 0, 0] |-> [2, 0, 1, 1], [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1]) 3.77/1.01 reason 3.77/1.01 Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.77/1.01 interpretation 3.77/1.01 0 / 2A 4A \ 3.77/1.01 \ 2A 2A / 3.77/1.01 1 / 2A 2A \ 3.77/1.01 \ 2A 2A / 3.77/1.01 2 / 21A 23A \ 3.77/1.01 \ 21A 23A / 3.77/1.01 3 / 23A 23A \ 3.77/1.01 \ 23A 23A / 3.77/1.01 [2, 0, 0, 0] |-> [3, 0, 1, 1] 3.77/1.01 lhs rhs ge gt 3.77/1.01 / 31A 31A \ / 31A 31A \ True False 3.77/1.01 \ 31A 31A / \ 31A 31A / 3.77/1.02 [3, 0, 1, 1] |-> [2, 0, 1, 1] 3.77/1.02 lhs rhs ge gt 3.77/1.02 / 31A 31A \ / 29A 29A \ True True 3.77/1.02 \ 31A 31A / \ 29A 29A / 3.77/1.02 [3, 1, 0, 0] |-> [2, 0, 1, 1] 3.77/1.02 lhs rhs ge gt 3.77/1.02 / 31A 31A \ / 29A 29A \ True True 3.77/1.02 \ 31A 31A / \ 29A 29A / 3.77/1.02 [0, 0, 0, 0] ->= [1, 0, 1, 1] 3.77/1.02 lhs rhs ge gt 3.77/1.02 / 12A 12A \ / 10A 10A \ True False 3.77/1.02 \ 10A 12A / \ 10A 10A / 3.77/1.02 [1, 1, 0, 0] ->= [0, 0, 1, 1] 3.77/1.02 lhs rhs ge gt 3.77/1.02 / 10A 10A \ / 10A 10A \ True False 3.77/1.02 \ 10A 10A / \ 10A 10A / 3.77/1.02 [1, 0, 1, 1] ->= [0, 0, 1, 1] 3.77/1.02 lhs rhs ge gt 3.77/1.02 / 10A 10A \ / 10A 10A \ True False 3.77/1.02 \ 10A 10A / \ 10A 10A / 3.77/1.02 property Termination 3.77/1.02 has value True 3.77/1.02 for SRS ( [2, 0, 0, 0] |-> [3, 0, 1, 1], [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1]) 3.77/1.02 reason 3.77/1.02 weights 3.77/1.02 Map [(2, 1/1)] 3.77/1.02 3.77/1.02 property Termination 3.77/1.02 has value True 3.77/1.02 for SRS ( [0, 0, 0, 0] ->= [1, 0, 1, 1], [1, 1, 0, 0] ->= [0, 0, 1, 1], [1, 0, 1, 1] ->= [0, 0, 1, 1]) 3.77/1.02 reason 3.77/1.02 EDG has 0 SCCs 3.77/1.02 3.77/1.02 ************************************************** 3.77/1.02 summary 3.77/1.02 ************************************************** 3.77/1.02 SRS with 3 rules on 2 letters Remap { tracing = False} 3.77/1.02 SRS with 3 rules on 2 letters DP transform 3.77/1.02 SRS with 12 rules on 4 letters Remap { tracing = False} 3.77/1.02 SRS with 12 rules on 4 letters weights 3.77/1.02 SRS with 6 rules on 4 letters EDG 3.77/1.02 SRS with 6 rules on 4 letters Matrix { monotone = Weak, domain = Arctic, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = True} 3.77/1.03 SRS with 4 rules on 4 letters weights 3.77/1.03 SRS with 3 rules on 2 letters EDG 3.77/1.03 3.77/1.03 ************************************************** 4.01/1.05 (3, 2)\Deepee(12, 4)\Weight(6, 4)\Matrix{\Arctic}{2}(4, 4)\Weight(3, 2)\EDG[] 4.01/1.05 ************************************************** 4.82/1.28 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]} 4.82/1.28 in Apply (Worker Remap) (First_Of ([ yeah] <> noh)) 5.04/1.33 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