details

property	value
status	complete
benchmark	incList.itrs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	Ctrl
configuration	Itrs
runtime (wallclock)	0.0815958976746 seconds
cpu usage	0.044681042
max memory	8069120.0

stage attributes

key	value
output-size	613
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Itrs /export/starexec/sandbox/benchmark/theBenchmark.itrs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES DP problem for innermost termination. P = g#(x, cons(y, ys)) -> g#(x, ys) R = g(x, cons(y, ys)) -> cons(x + y, g(x, ys)) We use the subterm criterion with the projection function NU: NU[g#(x0,x1)] = x1 This gives the following inequalities: cons(y, ys) |> ys All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed. popout

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

job log

popout

actions

all output return to Integer TRS Innermost