details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.77488 seconds
cpu usage	21.1911
user time	19.9444
system time	1.24665
max virtual memory	1.8540484E7
max residence set size	3663244.0

stage attributes

key	value
starexec-result	NO

output

21.10/6.06 NO 21.10/6.06 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 21.10/6.06 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.10/6.06 21.10/6.06 21.10/6.06 Outermost Termination of the given OTRS could be disproven: 21.10/6.06 21.10/6.06 (0) OTRS 21.10/6.06 (1) OutermostNonTerminationProof [COMPLETE, 2732 ms] 21.10/6.06 (2) NO 21.10/6.06 21.10/6.06 21.10/6.06 ---------------------------------------- 21.10/6.06 21.10/6.06 (0) 21.10/6.06 Obligation: 21.10/6.06 Term rewrite system R: 21.10/6.06 The TRS R consists of the following rules: 21.10/6.06 21.10/6.06 zeros -> cons(0, n__zeros) 21.10/6.06 U11(tt, L) -> U12(tt, activate(L)) 21.10/6.06 U12(tt, L) -> s(length(activate(L))) 21.10/6.06 U21(tt, IL, M, N) -> U22(tt, activate(IL), activate(M), activate(N)) 21.10/6.06 U22(tt, IL, M, N) -> U23(tt, activate(IL), activate(M), activate(N)) 21.10/6.06 U23(tt, IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) 21.10/6.06 length(nil) -> 0 21.10/6.06 length(cons(N, L)) -> U11(tt, activate(L)) 21.10/6.06 take(0, IL) -> nil 21.10/6.06 take(s(M), cons(N, IL)) -> U21(tt, activate(IL), M, N) 21.10/6.06 zeros -> n__zeros 21.10/6.06 take(X1, X2) -> n__take(X1, X2) 21.10/6.06 activate(n__zeros) -> zeros 21.10/6.06 activate(n__take(X1, X2)) -> take(X1, X2) 21.10/6.06 activate(X) -> X 21.10/6.06 21.10/6.06 21.10/6.06 21.10/6.06 Outermost Strategy. 21.10/6.06 21.10/6.06 ---------------------------------------- 21.10/6.06 21.10/6.06 (1) OutermostNonTerminationProof (COMPLETE) 21.10/6.06 Term rewrite system R: 21.10/6.06 The TRS R consists of the following rules: 21.10/6.06 21.10/6.06 zeros -> cons(0, n__zeros) 21.10/6.06 U11(tt, L) -> U12(tt, activate(L)) 21.10/6.06 U12(tt, L) -> s(length(activate(L))) 21.10/6.06 U21(tt, IL, M, N) -> U22(tt, activate(IL), activate(M), activate(N)) 21.10/6.06 U22(tt, IL, M, N) -> U23(tt, activate(IL), activate(M), activate(N)) 21.10/6.06 U23(tt, IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) 21.10/6.06 length(nil) -> 0 21.10/6.06 length(cons(N, L)) -> U11(tt, activate(L)) 21.10/6.06 take(0, IL) -> nil 21.10/6.06 take(s(M), cons(N, IL)) -> U21(tt, activate(IL), M, N) 21.10/6.06 zeros -> n__zeros 21.10/6.06 take(X1, X2) -> n__take(X1, X2) 21.10/6.06 activate(n__zeros) -> zeros 21.10/6.06 activate(n__take(X1, X2)) -> take(X1, X2) 21.10/6.06 activate(X) -> X 21.10/6.06 21.10/6.06 21.10/6.06 21.10/6.06 Outermost Strategy. 21.10/6.06 21.10/6.06 ---------- Loop: ---------- 21.10/6.06 21.10/6.06 U12(tt, activate(activate(n__zeros))) -> s(length(activate(activate(activate(n__zeros))))) with rule U12(tt, L) -> s(length(activate(L))) at position [] and matcher [L / activate(activate(n__zeros))] 21.10/6.06 21.10/6.06 s(length(activate(activate(activate(n__zeros))))) -> s(length(activate(activate(n__zeros)))) with rule activate(X) -> X at position [0,0] and matcher [X / activate(activate(n__zeros))] 21.10/6.06 21.10/6.06 s(length(activate(activate(n__zeros)))) -> s(length(activate(n__zeros))) with rule activate(X) -> X at position [0,0] and matcher [X / activate(n__zeros)] 21.10/6.06 21.10/6.06 s(length(activate(n__zeros))) -> s(length(zeros)) with rule activate(n__zeros) -> zeros at position [0,0] and matcher [ ] 21.10/6.06 21.10/6.06 s(length(zeros)) -> s(length(cons(0, n__zeros))) with rule zeros -> cons(0, n__zeros) at position [0,0] and matcher [ ] 21.10/6.06 21.10/6.06 s(length(cons(0, n__zeros))) -> s(U11(tt, activate(n__zeros))) with rule length(cons(N, L)) -> U11(tt, activate(L)) at position [0] and matcher [N / 0, L / n__zeros] 21.10/6.06 21.10/6.06 s(U11(tt, activate(n__zeros))) -> s(U12(tt, activate(activate(n__zeros)))) with rule U11(tt, L) -> U12(tt, activate(L)) at position [0] and matcher [L / activate(n__zeros)] 21.10/6.06 21.10/6.06 Now an instance of the first term with Matcher [ ] occurs in the last term at position [0]. 21.10/6.06 21.10/6.06 Context: s([]) 21.10/6.06 21.10/6.06 We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop. 21.10/6.06 ---------------------------------------- 21.10/6.06 21.10/6.06 (2) 21.10/6.06 NO 21.16/7.77 EOF 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