details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.16902089119 seconds
cpu usage	4.178646399
max memory	2.72674816E8

stage attributes

key	value
output-size	2427
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, 221 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: ap(ap(f, x), x) -> ap(ap(x, ap(f, x)), ap(ap(cons, x), nil)) ap(ap(ap(foldr, g), h), nil) -> h ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: ap(ap(f, x), x) -> ap(ap(x, ap(f, x)), ap(ap(cons, x), nil)) ap(ap(ap(foldr, g), h), nil) -> h ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) Outermost Strategy. ---------- Loop: ---------- ap(ap(ap(f, foldr), foldr), ap(ap(ap(foldr, ap(f, foldr)), ap(ap(cons, foldr), nil)), nil)) -> ap(ap(ap(f, foldr), foldr), ap(ap(cons, foldr), nil)) with rule ap(ap(ap(foldr, g), h), nil) -> h at position [1] and matcher [g / ap(f, foldr), h / ap(ap(cons, foldr), nil)] ap(ap(ap(f, foldr), foldr), ap(ap(cons, foldr), nil)) -> ap(ap(ap(foldr, ap(f, foldr)), ap(ap(cons, foldr), nil)), ap(ap(cons, foldr), nil)) with rule ap(ap(f, x'), x') -> ap(ap(x', ap(f, x')), ap(ap(cons, x'), nil)) at position [0] and matcher [x' / foldr] ap(ap(ap(foldr, ap(f, foldr)), ap(ap(cons, foldr), nil)), ap(ap(cons, foldr), nil)) -> ap(ap(ap(f, foldr), foldr), ap(ap(ap(foldr, ap(f, foldr)), ap(ap(cons, foldr), nil)), nil)) with rule ap(ap(ap(foldr, g), h), ap(ap(cons, x), xs)) -> ap(ap(g, x), ap(ap(ap(foldr, g), h), xs)) at position [] and matcher [g / ap(f, foldr), h / ap(ap(cons, foldr), nil), x / foldr, xs / nil] Now an instance of the first term with Matcher [ ] occurs in the last term at position []. Context: [] 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