details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.1894299984 seconds
cpu usage	2.567670973
max memory	1.7885184E8

stage attributes

key	value
output-size	2080
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Outermost Termination of the given OTRS could be disproven: (0) OTRS (1) OutermostNonTerminationProof [COMPLETE, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: splitAt(s(N), cons(X)) -> u(splitAt(N, XS)) u(pair(YS, ZS)) -> pair(cons(X), ZS) tail(cons(N)) -> XS natsFrom(N) -> cons(N) fst(pair(XS, YS)) -> XS snd(pair(XS, YS)) -> YS splitAt(0, XS) -> pair(nil, XS) head(cons(N)) -> N sel(N, XS) -> head(afterNth(N, XS)) take(N, XS) -> fst(splitAt(N, XS)) afterNth(N, XS) -> snd(splitAt(N, XS)) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: splitAt(s(N), cons(X)) -> u(splitAt(N, XS)) u(pair(YS, ZS)) -> pair(cons(X), ZS) tail(cons(N)) -> XS natsFrom(N) -> cons(N) fst(pair(XS, YS)) -> XS snd(pair(XS, YS)) -> YS splitAt(0, XS) -> pair(nil, XS) head(cons(N)) -> N sel(N, XS) -> head(afterNth(N, XS)) take(N, XS) -> fst(splitAt(N, XS)) afterNth(N, XS) -> snd(splitAt(N, XS)) Outermost Strategy. ---------- Loop: ---------- splitAt(s(N), cons(X)) -> u(splitAt(N, splitAt(s(N), cons(X)))) with rule splitAt(s(N''), cons(X'')) -> u(splitAt(N'', XS)) at position [] and matcher [N'' / N, X'' / X, XS / splitAt(s(N), cons(X))] Now an instance of the first term with Matcher [ ] occurs in the last term at position [0,1]. Context: u(splitAt(N, [])) We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop. ---------------------------------------- (2) NO popout

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

job log

popout

actions

all output return to TRS Outer 67415