details

property	value
status	complete
benchmark	Applicative_AG01_innermost__#4.7.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	Uncurried_Applicative_11

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	1.31516 seconds
cpu usage	1.80617
user time	1.62965
system time	0.176514
max virtual memory	5157384.0
max residence set size	116924.0

stage attributes

key	value
starexec-result	NO

output

NO We consider the system theBenchmark. Alphabet: 0 : [] --> b 1 : [] --> b cons : [e * f] --> f f : [c] --> a false : [] --> d filter : [e -> d * f] --> f filter2 : [d * e -> d * e * f] --> f g : [b * b] --> c map : [e -> e * f] --> f nil : [] --> f s : [b] --> c true : [] --> d Rules: f(s(x)) => f(g(x, x)) g(0, 1) => s(0) 0 => 1 map(h, nil) => nil map(h, cons(x, y)) => cons(h x, map(h, y)) filter(h, nil) => nil filter(h, cons(x, y)) => filter2(h x, h, x, y) filter2(true, h, x, y) => cons(x, filter(h, y)) filter2(false, h, x, y) => filter(h, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). This system is non-terminating, as demonstrated by our external first-order non-termination checker: || The following well-typed term is terminating: f(g(0, 0)) || || proof of resources/system.trs || # AProVE Commit ID: 500ec9b2e2a919720cb177ef26031cb0220e008e fuhs 20130603 || || || Termination w.r.t. Q of the given QTRS could be disproven: || || (0) QTRS || (1) NonTerminationProof [EQUIVALENT, 0 ms] || (2) NO || || || ---------------------------------------- || || (0) || Obligation: || Q restricted rewrite system: || The TRS R consists of the following rules: || || f(s(%X)) -> f(g(%X, %X)) || g(0, 1) -> s(0) || 0 -> 1 || || Q is empty. || || ---------------------------------------- || || (1) NonTerminationProof (EQUIVALENT) || The following loops were found: || || ---------- Loop: ---------- || || f(g(0, 0)) -> f(g(0, 1)) with rule 0 -> 1 at position [0,1] and matcher [ ] || || f(g(0, 1)) -> f(s(0)) with rule g(0, 1) -> s(0) at position [0] and matcher [ ] || || f(s(0)) -> f(g(0, 0)) with rule f(s(%X)) -> f(g(%X, %X)) at position [] and matcher [%X / 0] || || Now an instance of the first term with Matcher [ ] occurs in the last term at position []. || || Context: [] || || || ---------------------------------------- || || (2) || NO || popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta