details

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

run statistics

property	value
solver	matchbox-2020-06-25
configuration	tc20-std.sh
runtime (wallclock)	8.18258810043 seconds
cpu usage	32.190202303
max memory	1.077600256E9

stage attributes

key	value
output-size	4315
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ************************************************** summary ************************************************** SRS with 4 rules on 3 letters looping SRS derivation Closure source : abbbbbbb target : bbabbbbbbbcaca steps : 20 strict : True last_rule_app_source : 0 last_rule_app_target : 8 ************************************************** proof ************************************************** property Termination has value Just False for SRS [a] -> [] {- Input 0 -} [a, b] -> [b, b, c, a] {- Input 1 -} [b] -> [] {- Input 2 -} [c, c, b] -> [a] {- Input 3 -} reason Nontermination looping SRS derivation Closure source : abbbbbbb target : bbabbbbbbbcaca steps : 20 strict : True last_rule_app_source : 0 last_rule_app_target : 8 reason : Overlap (Inside 8) Overlap (Inside 8) Overlap (Right 1) Overlap (Inside 9) Overlap (Inside 6) Overlap (Inside 6) Overlap (Right 1) Overlap (Inside 7) Overlap (Inside 4) Overlap (Inside 4) Overlap (Right 1) Overlap (Inside 5) Overlap (Inside 5) Overlap (Right 1) Overlap (Inside 2) Overlap (Right 1) Overlap (Inside 3) Overlap (Inside 3) Overlap (Right 1) Rule 1 Rule 1 Rule 2 Rule 2 Rule 1 Rule 3 Rule 1 Rule 2 Rule 2 Rule 1 Rule 3 Rule 1 Rule 0 Rule 1 Rule 3 Rule 1 Rule 0 Rule 1 Rule 3 Rule 1 ************************************************** skeleton: (4,3)\Loop{}[] ************************************************** 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