details

property	value
status	complete
benchmark	Ex6_15_AEL02_Z.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	Strategy_outermost_added_08

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.75908 seconds
cpu usage	19.7149
user time	18.5452
system time	1.16972
max virtual memory	3.71168E7
max residence set size	3127752.0

stage attributes

key	value
starexec-result	NO

output

19.41/5.71 NO 19.41/5.71 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 19.41/5.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 19.41/5.71 19.41/5.71 19.41/5.71 Outermost Termination of the given OTRS could be disproven: 19.41/5.71 19.41/5.71 (0) OTRS 19.41/5.71 (1) OutermostNonTerminationProof [COMPLETE, 2402 ms] 19.41/5.71 (2) NO 19.41/5.71 19.41/5.71 19.41/5.71 ---------------------------------------- 19.41/5.71 19.41/5.71 (0) 19.41/5.71 Obligation: 19.41/5.71 Term rewrite system R: 19.41/5.71 The TRS R consists of the following rules: 19.41/5.71 19.41/5.71 sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) 19.41/5.71 sel(0, cons(X, Z)) -> X 19.41/5.71 first(0, Z) -> nil 19.41/5.71 first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) 19.41/5.71 from(X) -> cons(X, n__from(s(X))) 19.41/5.71 sel1(s(X), cons(Y, Z)) -> sel1(X, activate(Z)) 19.41/5.71 sel1(0, cons(X, Z)) -> quote(X) 19.41/5.71 first1(0, Z) -> nil1 19.41/5.71 first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, activate(Z))) 19.41/5.71 quote(n__0) -> 01 19.41/5.71 quote1(n__cons(X, Z)) -> cons1(quote(activate(X)), quote1(activate(Z))) 19.41/5.71 quote1(n__nil) -> nil1 19.41/5.71 quote(n__s(X)) -> s1(quote(activate(X))) 19.41/5.71 quote(n__sel(X, Z)) -> sel1(activate(X), activate(Z)) 19.41/5.71 quote1(n__first(X, Z)) -> first1(activate(X), activate(Z)) 19.41/5.71 unquote(01) -> 0 19.41/5.71 unquote(s1(X)) -> s(unquote(X)) 19.41/5.71 unquote1(nil1) -> nil 19.41/5.71 unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z)) 19.41/5.71 fcons(X, Z) -> cons(X, Z) 19.41/5.71 first(X1, X2) -> n__first(X1, X2) 19.41/5.71 from(X) -> n__from(X) 19.41/5.71 0 -> n__0 19.41/5.71 cons(X1, X2) -> n__cons(X1, X2) 19.41/5.71 nil -> n__nil 19.41/5.71 s(X) -> n__s(X) 19.41/5.71 sel(X1, X2) -> n__sel(X1, X2) 19.41/5.71 activate(n__first(X1, X2)) -> first(X1, X2) 19.41/5.71 activate(n__from(X)) -> from(X) 19.41/5.71 activate(n__0) -> 0 19.41/5.71 activate(n__cons(X1, X2)) -> cons(X1, X2) 19.41/5.71 activate(n__nil) -> nil 19.41/5.71 activate(n__s(X)) -> s(X) 19.41/5.71 activate(n__sel(X1, X2)) -> sel(X1, X2) 19.41/5.71 activate(X) -> X 19.41/5.71 19.41/5.71 19.41/5.71 19.41/5.71 Outermost Strategy. 19.41/5.71 19.41/5.71 ---------------------------------------- 19.41/5.71 19.41/5.71 (1) OutermostNonTerminationProof (COMPLETE) 19.41/5.71 Term rewrite system R: 19.41/5.71 The TRS R consists of the following rules: 19.41/5.71 19.41/5.71 sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) 19.41/5.71 sel(0, cons(X, Z)) -> X 19.41/5.71 first(0, Z) -> nil 19.41/5.71 first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) 19.41/5.71 from(X) -> cons(X, n__from(s(X))) 19.41/5.71 sel1(s(X), cons(Y, Z)) -> sel1(X, activate(Z)) 19.41/5.71 sel1(0, cons(X, Z)) -> quote(X) 19.41/5.71 first1(0, Z) -> nil1 19.41/5.71 first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, activate(Z))) 19.41/5.71 quote(n__0) -> 01 19.41/5.71 quote1(n__cons(X, Z)) -> cons1(quote(activate(X)), quote1(activate(Z))) 19.41/5.71 quote1(n__nil) -> nil1 19.41/5.71 quote(n__s(X)) -> s1(quote(activate(X))) 19.41/5.71 quote(n__sel(X, Z)) -> sel1(activate(X), activate(Z)) 19.41/5.71 quote1(n__first(X, Z)) -> first1(activate(X), activate(Z)) 19.41/5.71 unquote(01) -> 0 19.41/5.71 unquote(s1(X)) -> s(unquote(X)) 19.41/5.71 unquote1(nil1) -> nil 19.41/5.71 unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z)) 19.41/5.71 fcons(X, Z) -> cons(X, Z) 19.41/5.71 first(X1, X2) -> n__first(X1, X2) 19.41/5.71 from(X) -> n__from(X) 19.41/5.71 0 -> n__0 19.41/5.71 cons(X1, X2) -> n__cons(X1, X2) 19.41/5.71 nil -> n__nil 19.41/5.71 s(X) -> n__s(X) 19.41/5.71 sel(X1, X2) -> n__sel(X1, X2) 19.41/5.71 activate(n__first(X1, X2)) -> first(X1, X2) 19.41/5.71 activate(n__from(X)) -> from(X) 19.41/5.71 activate(n__0) -> 0 19.41/5.71 activate(n__cons(X1, X2)) -> cons(X1, X2) 19.41/5.71 activate(n__nil) -> nil 19.41/5.71 activate(n__s(X)) -> s(X) 19.41/5.71 activate(n__sel(X1, X2)) -> sel(X1, X2) 19.41/5.71 activate(X) -> X popout

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

job log

popout

actions

all output return to TRS_Outermost 2019-04-01 06.45