Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918071
details
property
value
status
complete
benchmark
Ex6_15_AEL02_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.20064806938 seconds
cpu usage
2.674788307
max memory
1.7700864E8
stage attributes
key
value
output-size
2475
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, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: sel(s(X), cons(Y)) -> sel(X, Z) sel1(s(X), cons(Y)) -> sel1(X, Z) first1(s(X), cons(Y)) -> cons1(quote, first1(X, Z)) quote -> sel1(X, Z) quote1 -> first1(X, Z) sel(0, cons(X)) -> X first(0, Z) -> nil first(s(X), cons(Y)) -> cons(Y) from(X) -> cons(X) sel1(0, cons(X)) -> quote first1(0, Z) -> nil1 quote -> 01 quote1 -> cons1(quote, quote1) quote1 -> nil1 quote -> s1(quote) 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) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: sel(s(X), cons(Y)) -> sel(X, Z) sel1(s(X), cons(Y)) -> sel1(X, Z) first1(s(X), cons(Y)) -> cons1(quote, first1(X, Z)) quote -> sel1(X, Z) quote1 -> first1(X, Z) sel(0, cons(X)) -> X first(0, Z) -> nil first(s(X), cons(Y)) -> cons(Y) from(X) -> cons(X) sel1(0, cons(X)) -> quote first1(0, Z) -> nil1 quote -> 01 quote1 -> cons1(quote, quote1) quote1 -> nil1 quote -> s1(quote) 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) Outermost Strategy. ---------- Loop: ---------- sel(s(X), cons(Y)) -> sel(X, sel(s(X), cons(Y))) with rule sel(s(X''), cons(Y'')) -> sel(X'', Z) at position [] and matcher [X'' / X, Y'' / Y, Z / sel(s(X), cons(Y))] Now an instance of the first term with Matcher [ ] occurs in the last term at position [1]. Context: sel(X, []) 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