Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713188
details
property
value
status
complete
benchmark
revlist.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0473599433899 seconds
cpu usage
0.042454299
max memory
4268032.0
stage attributes
key
value
output-size
5528
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR L X Y) (RULES rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: REV(cons(X,L)) -> REV1(X,L) REV(cons(X,L)) -> REV2(X,L) REV1(X,cons(Y,L)) -> REV1(Y,L) REV2(X,cons(Y,L)) -> REV(rev2(Y,L)) REV2(X,cons(Y,L)) -> REV(cons(X,rev(rev2(Y,L)))) REV2(X,cons(Y,L)) -> REV2(Y,L) -> Rules: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil Problem 1: SCC Processor: -> Pairs: REV(cons(X,L)) -> REV1(X,L) REV(cons(X,L)) -> REV2(X,L) REV1(X,cons(Y,L)) -> REV1(Y,L) REV2(X,cons(Y,L)) -> REV(rev2(Y,L)) REV2(X,cons(Y,L)) -> REV(cons(X,rev(rev2(Y,L)))) REV2(X,cons(Y,L)) -> REV2(Y,L) -> Rules: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: REV1(X,cons(Y,L)) -> REV1(Y,L) ->->-> Rules: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil ->->Cycle: ->->-> Pairs: REV(cons(X,L)) -> REV2(X,L) REV2(X,cons(Y,L)) -> REV(rev2(Y,L)) REV2(X,cons(Y,L)) -> REV(cons(X,rev(rev2(Y,L)))) REV2(X,cons(Y,L)) -> REV2(Y,L) ->->-> Rules: rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev(nil) -> nil rev1(0,nil) -> 0 rev1(s(X),nil) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) rev2(X,nil) -> nil
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472