Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918045
details
property
value
status
complete
benchmark
Ex5_7_Luc97_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.25749111176 seconds
cpu usage
2.619132662
max memory
1.5255552E8
stage attributes
key
value
output-size
2006
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(0, cons) -> X sel(s, cons) -> sel(X, Z) dbl1(s) -> s1(s1(dbl1(X))) sel1(0, cons) -> X sel1(s, cons) -> sel1(X, Z) quote(s) -> s1(quote(X)) dbl(0) -> 0 dbl(s) -> s dbls(nil) -> nil dbls(cons) -> cons indx(nil) -> nil indx(cons) -> cons from -> cons dbl1(0) -> 01 quote(0) -> 01 quote(dbl(X)) -> dbl1(X) quote(sel(X, Y)) -> sel1(X, Y) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: sel(0, cons) -> X sel(s, cons) -> sel(X, Z) dbl1(s) -> s1(s1(dbl1(X))) sel1(0, cons) -> X sel1(s, cons) -> sel1(X, Z) quote(s) -> s1(quote(X)) dbl(0) -> 0 dbl(s) -> s dbls(nil) -> nil dbls(cons) -> cons indx(nil) -> nil indx(cons) -> cons from -> cons dbl1(0) -> 01 quote(0) -> 01 quote(dbl(X)) -> dbl1(X) quote(sel(X, Y)) -> sel1(X, Y) Outermost Strategy. ---------- Loop: ---------- sel(0, cons) -> sel(0, cons) with rule sel(0, cons) -> X at position [] and matcher [X / sel(0, cons)] 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