details

property	value
status	complete
benchmark	worm_fixed.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n182.star.cs.uiowa.edu
space	Hydras

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.318452 seconds
cpu usage	0.108509
user time	0.073022
system time	0.035487
max virtual memory	113188.0
max residence set size	6084.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: .(.(x,y),z) -> .(x,.(y,z)) 2: a(f(x)) -> f(a(x)) 3: a(.(x,y)) -> .(a(x),y) 4: a(b1(x)) -> b1(a(x)) 5: f(b(x)) -> b(f(x)) 6: .(b(x),y) -> b(.(x,y)) 7: b1(b(x)) -> b(b(x)) 8: a(f(.(0(),x))) -> b1(.(f(.(0(),x)),.(0(),f(x)))) 9: a(f(0())) -> b1(.(f(0()),0())) 10: f(.(0(),x)) -> b(.(0(),f(x))) 11: f(0()) -> b(0()) 12: c(b(x)) -> c(a(x)) 13: a(b(x)) -> b(a(x)) 14: .(0(),x) -> x Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a(f(x)) -> #f(a(x)) #2: #a(f(x)) -> #a(x) #3: #.(b(x),y) -> #.(x,y) #4: #a(b(x)) -> #a(x) #5: #a(f(0())) -> #b1(.(f(0()),0())) #6: #a(f(0())) -> #.(f(0()),0()) #7: #c(b(x)) -> #c(a(x)) #8: #c(b(x)) -> #a(x) #9: #f(.(0(),x)) -> #.(0(),f(x)) #10: #f(.(0(),x)) -> #f(x) #11: #f(b(x)) -> #f(x) #12: #a(.(x,y)) -> #.(a(x),y) #13: #a(.(x,y)) -> #a(x) #14: #.(.(x,y),z) -> #.(x,.(y,z)) #15: #.(.(x,y),z) -> #.(y,z) #16: #a(f(.(0(),x))) -> #b1(.(f(.(0(),x)),.(0(),f(x)))) #17: #a(f(.(0(),x))) -> #.(f(.(0(),x)),.(0(),f(x))) #18: #a(f(.(0(),x))) -> #.(0(),f(x)) #19: #a(f(.(0(),x))) -> #f(x) #20: #a(b1(x)) -> #b1(a(x)) #21: #a(b1(x)) -> #a(x) Number of SCCs: 4, DPs: 10 SCC { #7 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard