details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	0.302466154099 seconds
cpu usage	0.371409711
max memory	1.73662208E8

stage attributes

key	value
output-size	2821
starexec-result	"NO"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: a__zeros() -> cons(0(),zeros()) 2: a__and(tt(),X) -> mark(X) 3: a__length(nil()) -> 0() 4: a__length(cons(N,L)) -> s(a__length(mark(L))) 5: mark(zeros()) -> a__zeros() 6: mark(and(X1,X2)) -> a__and(mark(X1),X2) 7: mark(length(X)) -> a__length(mark(X)) 8: mark(cons(X1,X2)) -> cons(mark(X1),X2) 9: mark(0()) -> 0() 10: mark(tt()) -> tt() 11: mark(nil()) -> nil() 12: mark(s(X)) -> s(mark(X)) 13: a__zeros() -> zeros() 14: a__and(X1,X2) -> and(X1,X2) 15: a__length(X) -> length(X) Number of strict rules: 15 Direct Order(PosReal,>,Poly) ... removes: 3 2 s(x1) weight: x1 and(x1,x2) weight: (/ 35421 4) + x1 + x2 zeros() weight: 0 0() weight: 0 nil() weight: 0 mark(x1) weight: x1 cons(x1,x2) weight: x1 + 2 * x2 tt() weight: 0 a__and(x1,x2) weight: (/ 35421 4) + x1 + x2 length(x1) weight: (/ 1 4) + x1 a__zeros() weight: 0 a__length(x1) weight: (/ 1 4) + x1 Number of strict rules: 13 Direct Order(PosReal,>,Poly) ... removes: 15 14 6 s(x1) weight: x1 and(x1,x2) weight: 8855 + x1 + x2 zeros() weight: 0 0() weight: 0 nil() weight: 0 mark(x1) weight: 2 * x1 cons(x1,x2) weight: x1 + 2 * x2 tt() weight: 0 a__and(x1,x2) weight: (/ 70841 8) + x1 + 2 * x2 length(x1) weight: (/ 1 8) + x1 a__zeros() weight: 0 a__length(x1) weight: (/ 1 4) + x1 Number of strict rules: 10 Direct Order(PosReal,>,Poly) ... removes: 7 s(x1) weight: x1 and(x1,x2) weight: 8855 + x1 + x2 zeros() weight: 0 0() weight: 0 nil() weight: 0 mark(x1) weight: 2 * x1 cons(x1,x2) weight: x1 + 2 * x2 tt() weight: 0 a__and(x1,x2) weight: (/ 17711 2) + x1 + 2 * x2 length(x1) weight: (/ 2285 2) + x1 a__zeros() weight: 0 a__length(x1) weight: (/ 2285 2) + x1 Number of strict rules: 9 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #mark(s(X)) -> #mark(X) #2: #mark(zeros()) -> #a__zeros() #3: #mark(cons(X1,X2)) -> #mark(X1) #4: #a__length(cons(N,L)) -> #a__length(mark(L)) #5: #a__length(cons(N,L)) -> #mark(L) Number of SCCs: 2, DPs: 3, edges: 5 SCC { #4 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed. Removing edges: failed. Finding a loop... found. #a__length(cons(N,zeros())) -#4-> #a__length(mark(zeros())) --->* #a__length(cons(0(),zeros())) Looping with: [ N := 0(); ] popout

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

job log

popout

actions

all output return to TRS Standard