Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918057
details
property
value
status
complete
benchmark
OvConsOS_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.25021600723 seconds
cpu usage
2.832357517
max memory
1.96562944E8
stage attributes
key
value
output-size
2297
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, 49 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: zeros -> cons(0, n__zeros) and(tt, X) -> activate(X) length(nil) -> 0 length(cons(N, L)) -> s(length(activate(L))) take(0, IL) -> nil take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL))) zeros -> n__zeros take(X1, X2) -> n__take(X1, X2) activate(n__zeros) -> zeros activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(X) -> X Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: zeros -> cons(0, n__zeros) and(tt, X) -> activate(X) length(nil) -> 0 length(cons(N, L)) -> s(length(activate(L))) take(0, IL) -> nil take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL))) zeros -> n__zeros take(X1, X2) -> n__take(X1, X2) activate(n__zeros) -> zeros activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(X) -> X Outermost Strategy. ---------- Loop: ---------- length(activate(n__zeros)) -> length(zeros) with rule activate(n__zeros) -> zeros at position [0] and matcher [ ] length(zeros) -> length(cons(0, n__zeros)) with rule zeros -> cons(0, n__zeros) at position [0] and matcher [ ] length(cons(0, n__zeros)) -> s(length(activate(n__zeros))) with rule length(cons(N, L)) -> s(length(activate(L))) at position [] and matcher [N / 0, L / n__zeros] Now an instance of the first term with Matcher [ ] occurs in the last term at position [0]. Context: s([]) 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