Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918191
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.24361801147 seconds
cpu usage
2.607400918
max memory
1.53522176E8
stage attributes
key
value
output-size
2095
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: U11(tt) -> U12(splitAt(N, XS)) U12(pair(YS, ZS)) -> pair(cons(X), ZS) and(tt) -> X tail(cons(N)) -> XS afterNth(N, XS) -> snd(splitAt(N, XS)) fst(pair(X, Y)) -> X head(cons(N)) -> N natsFrom(N) -> cons(N) sel(N, XS) -> head(afterNth(N, XS)) snd(pair(X, Y)) -> Y splitAt(0, XS) -> pair(nil, XS) splitAt(s(N), cons(X)) -> U11(tt) take(N, XS) -> fst(splitAt(N, XS)) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: U11(tt) -> U12(splitAt(N, XS)) U12(pair(YS, ZS)) -> pair(cons(X), ZS) and(tt) -> X tail(cons(N)) -> XS afterNth(N, XS) -> snd(splitAt(N, XS)) fst(pair(X, Y)) -> X head(cons(N)) -> N natsFrom(N) -> cons(N) sel(N, XS) -> head(afterNth(N, XS)) snd(pair(X, Y)) -> Y splitAt(0, XS) -> pair(nil, XS) splitAt(s(N), cons(X)) -> U11(tt) take(N, XS) -> fst(splitAt(N, XS)) Outermost Strategy. ---------- Loop: ---------- U11(tt) -> U12(splitAt(U11(tt), U11(tt))) with rule U11(tt) -> U12(splitAt(N, XS)) at position [] and matcher [N / U11(tt), XS / U11(tt)] Now an instance of the first term with Matcher [ ] occurs in the last term at position [0,0]. Context: U12(splitAt([], U11(tt))) 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