Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710442
details
property
value
status
complete
benchmark
append-hard.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0664021968842 seconds
cpu usage
0.058103333
max memory
3674112.0
stage attributes
key
value
output-size
3413
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR l l1 l2 x) (RULES append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l ) Problem 1: Innermost Equivalent Processor: -> Rules: append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APPEND(l1,l2) -> IFAPPEND(l1,l2,is_empty(l1)) APPEND(l1,l2) -> IS_EMPTY(l1) IFAPPEND(l1,l2,false) -> APPEND(tl(l1),l2) IFAPPEND(l1,l2,false) -> HD(l1) IFAPPEND(l1,l2,false) -> TL(l1) -> Rules: append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l Problem 1: SCC Processor: -> Pairs: APPEND(l1,l2) -> IFAPPEND(l1,l2,is_empty(l1)) APPEND(l1,l2) -> IS_EMPTY(l1) IFAPPEND(l1,l2,false) -> APPEND(tl(l1),l2) IFAPPEND(l1,l2,false) -> HD(l1) IFAPPEND(l1,l2,false) -> TL(l1) -> Rules: append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APPEND(l1,l2) -> IFAPPEND(l1,l2,is_empty(l1)) IFAPPEND(l1,l2,false) -> APPEND(tl(l1),l2) ->->-> Rules: append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l Problem 1: Reduction Pairs Processor: -> Pairs: APPEND(l1,l2) -> IFAPPEND(l1,l2,is_empty(l1)) IFAPPEND(l1,l2,false) -> APPEND(tl(l1),l2) -> Rules: append(l1,l2) -> ifappend(l1,l2,is_empty(l1)) hd(cons(x,l)) -> x ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2)) ifappend(l1,l2,true) -> l2 is_empty(cons(x,l)) -> false is_empty(nil) -> true tl(cons(x,l)) -> l -> Usable rules: is_empty(cons(x,l)) -> false
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472