details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.19151115417 seconds
cpu usage	21.846621707
max memory	3.375783936E9

stage attributes

key	value
output-size	4409
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/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, 2766 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) sel(0, cons(X, Z)) -> X first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) from(X) -> cons(X, n__from(s(X))) sel1(s(X), cons(Y, Z)) -> sel1(X, activate(Z)) sel1(0, cons(X, Z)) -> quote(X) first1(0, Z) -> nil1 first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, activate(Z))) quote(n__0) -> 01 quote1(n__cons(X, Z)) -> cons1(quote(activate(X)), quote1(activate(Z))) quote1(n__nil) -> nil1 quote(n__s(X)) -> s1(quote(activate(X))) quote(n__sel(X, Z)) -> sel1(activate(X), activate(Z)) quote1(n__first(X, Z)) -> first1(activate(X), activate(Z)) unquote(01) -> 0 unquote(s1(X)) -> s(unquote(X)) unquote1(nil1) -> nil unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z)) fcons(X, Z) -> cons(X, Z) first(X1, X2) -> n__first(X1, X2) from(X) -> n__from(X) 0 -> n__0 cons(X1, X2) -> n__cons(X1, X2) nil -> n__nil s(X) -> n__s(X) sel(X1, X2) -> n__sel(X1, X2) activate(n__first(X1, X2)) -> first(X1, X2) activate(n__from(X)) -> from(X) activate(n__0) -> 0 activate(n__cons(X1, X2)) -> cons(X1, X2) activate(n__nil) -> nil activate(n__s(X)) -> s(X) activate(n__sel(X1, X2)) -> sel(X1, X2) activate(X) -> X Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) sel(0, cons(X, Z)) -> X first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) from(X) -> cons(X, n__from(s(X))) sel1(s(X), cons(Y, Z)) -> sel1(X, activate(Z)) sel1(0, cons(X, Z)) -> quote(X) first1(0, Z) -> nil1 first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, activate(Z))) quote(n__0) -> 01 quote1(n__cons(X, Z)) -> cons1(quote(activate(X)), quote1(activate(Z))) quote1(n__nil) -> nil1 quote(n__s(X)) -> s1(quote(activate(X))) quote(n__sel(X, Z)) -> sel1(activate(X), activate(Z)) quote1(n__first(X, Z)) -> first1(activate(X), activate(Z)) unquote(01) -> 0 unquote(s1(X)) -> s(unquote(X)) unquote1(nil1) -> nil unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z)) fcons(X, Z) -> cons(X, Z) first(X1, X2) -> n__first(X1, X2) from(X) -> n__from(X) 0 -> n__0 cons(X1, X2) -> n__cons(X1, X2) nil -> n__nil s(X) -> n__s(X) sel(X1, X2) -> n__sel(X1, X2) activate(n__first(X1, X2)) -> first(X1, X2) activate(n__from(X)) -> from(X) popout

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

job log

popout

actions

all output return to TRS Outer 67415