details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.87961 seconds
cpu usage	12.9052
user time	11.7949
system time	1.11031
max virtual memory	3.6706656E7
max residence set size	2686788.0

stage attributes

key	value
starexec-result	NO

output

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