details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.0214109420776 seconds
cpu usage	0.018079326
max memory	1523712.0

stage attributes

key	value
output-size	1328
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. a : [] --> o b : [] --> o f : [o] --> o g : [o] --> o g(b) => f(b) f(a) => g(a) b => a We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): g(b) >? f(b) f(a) >? g(a) b >? a We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: a = 1 b = 3 f = \y0.3 + y0 g = \y0.3y0 Using this interpretation, the requirements translate to: [[g(b)]] = 9 > 6 = [[f(b)]] [[f(a)]] = 4 > 3 = [[g(a)]] [[b]] = 3 > 1 = [[a]] We can thus remove the following rules: g(b) => f(b) f(a) => g(a) b => a All rules were succesfully removed. Thus, termination of the original system has been reduced to termination of the beta-rule, which is well-known to hold. +++ Citations +++ [Kop12] C. Kop. Higher Order Termination. PhD Thesis, 2012. popout

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

job log

popout

actions

all output return to TRS Stand 20472