details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.3739 seconds
cpu usage	14.4753
user time	13.3658
system time	1.10949
max virtual memory	1.8541216E7
max residence set size	2963008.0

stage attributes

key	value
starexec-result	NO

output

14.14/4.27 NO 14.14/4.29 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 14.14/4.29 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.14/4.29 14.14/4.29 14.14/4.29 Outermost Termination of the given OTRS could be disproven: 14.14/4.29 14.14/4.29 (0) OTRS 14.14/4.29 (1) OutermostNonTerminationProof [COMPLETE, 1293 ms] 14.14/4.29 (2) NO 14.14/4.29 14.14/4.29 14.14/4.29 ---------------------------------------- 14.14/4.29 14.14/4.29 (0) 14.14/4.29 Obligation: 14.14/4.29 Term rewrite system R: 14.14/4.29 The TRS R consists of the following rules: 14.14/4.29 14.14/4.29 and(tt, T) -> T 14.14/4.29 isNatIList(IL) -> isNatList(activate(IL)) 14.14/4.29 isNat(n__0) -> tt 14.14/4.29 isNat(n__s(N)) -> isNat(activate(N)) 14.14/4.29 isNat(n__length(L)) -> isNatList(activate(L)) 14.14/4.29 isNatIList(n__zeros) -> tt 14.14/4.29 isNatIList(n__cons(N, IL)) -> and(isNat(activate(N)), isNatIList(activate(IL))) 14.14/4.29 isNatList(n__nil) -> tt 14.14/4.29 isNatList(n__cons(N, L)) -> and(isNat(activate(N)), isNatList(activate(L))) 14.14/4.29 isNatList(n__take(N, IL)) -> and(isNat(activate(N)), isNatIList(activate(IL))) 14.14/4.29 zeros -> cons(0, n__zeros) 14.14/4.29 take(0, IL) -> uTake1(isNatIList(IL)) 14.14/4.29 uTake1(tt) -> nil 14.14/4.29 take(s(M), cons(N, IL)) -> uTake2(and(isNat(M), and(isNat(N), isNatIList(activate(IL)))), M, N, activate(IL)) 14.14/4.29 uTake2(tt, M, N, IL) -> cons(activate(N), n__take(activate(M), activate(IL))) 14.14/4.29 length(cons(N, L)) -> uLength(and(isNat(N), isNatList(activate(L))), activate(L)) 14.14/4.29 uLength(tt, L) -> s(length(activate(L))) 14.14/4.29 0 -> n__0 14.14/4.29 s(X) -> n__s(X) 14.14/4.29 length(X) -> n__length(X) 14.14/4.29 zeros -> n__zeros 14.14/4.29 cons(X1, X2) -> n__cons(X1, X2) 14.14/4.29 nil -> n__nil 14.14/4.29 take(X1, X2) -> n__take(X1, X2) 14.14/4.29 activate(n__0) -> 0 14.14/4.29 activate(n__s(X)) -> s(activate(X)) 14.14/4.29 activate(n__length(X)) -> length(activate(X)) 14.14/4.29 activate(n__zeros) -> zeros 14.14/4.29 activate(n__cons(X1, X2)) -> cons(activate(X1), X2) 14.14/4.29 activate(n__nil) -> nil 14.14/4.29 activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) 14.14/4.29 activate(X) -> X 14.14/4.29 14.14/4.29 14.14/4.29 14.14/4.29 Outermost Strategy. 14.14/4.29 14.14/4.29 ---------------------------------------- 14.14/4.29 14.14/4.29 (1) OutermostNonTerminationProof (COMPLETE) 14.14/4.29 Term rewrite system R: 14.14/4.29 The TRS R consists of the following rules: 14.14/4.29 14.14/4.29 and(tt, T) -> T 14.14/4.29 isNatIList(IL) -> isNatList(activate(IL)) 14.14/4.29 isNat(n__0) -> tt 14.14/4.29 isNat(n__s(N)) -> isNat(activate(N)) 14.14/4.29 isNat(n__length(L)) -> isNatList(activate(L)) 14.14/4.29 isNatIList(n__zeros) -> tt 14.14/4.29 isNatIList(n__cons(N, IL)) -> and(isNat(activate(N)), isNatIList(activate(IL))) 14.14/4.29 isNatList(n__nil) -> tt 14.14/4.29 isNatList(n__cons(N, L)) -> and(isNat(activate(N)), isNatList(activate(L))) 14.14/4.29 isNatList(n__take(N, IL)) -> and(isNat(activate(N)), isNatIList(activate(IL))) 14.14/4.29 zeros -> cons(0, n__zeros) 14.14/4.29 take(0, IL) -> uTake1(isNatIList(IL)) 14.14/4.29 uTake1(tt) -> nil 14.14/4.29 take(s(M), cons(N, IL)) -> uTake2(and(isNat(M), and(isNat(N), isNatIList(activate(IL)))), M, N, activate(IL)) 14.14/4.29 uTake2(tt, M, N, IL) -> cons(activate(N), n__take(activate(M), activate(IL))) 14.14/4.29 length(cons(N, L)) -> uLength(and(isNat(N), isNatList(activate(L))), activate(L)) 14.14/4.29 uLength(tt, L) -> s(length(activate(L))) 14.14/4.29 0 -> n__0 14.14/4.29 s(X) -> n__s(X) 14.14/4.29 length(X) -> n__length(X) 14.14/4.29 zeros -> n__zeros 14.14/4.29 cons(X1, X2) -> n__cons(X1, X2) 14.14/4.29 nil -> n__nil 14.14/4.29 take(X1, X2) -> n__take(X1, X2) 14.14/4.29 activate(n__0) -> 0 14.14/4.29 activate(n__s(X)) -> s(activate(X)) 14.14/4.29 activate(n__length(X)) -> length(activate(X)) 14.14/4.29 activate(n__zeros) -> zeros 14.14/4.29 activate(n__cons(X1, X2)) -> cons(activate(X1), X2) 14.14/4.29 activate(n__nil) -> nil 14.14/4.29 activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) 14.14/4.29 activate(X) -> X 14.14/4.29 14.14/4.29 14.14/4.29 14.14/4.29 Outermost Strategy. 14.14/4.29 14.14/4.29 ---------- Loop: ---------- 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