Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070979
details
property
value
status
complete
benchmark
Ex25_Luc06_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n180.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0522839 seconds
cpu usage
0.040048
user time
0.019706
system time
0.020342
max virtual memory
113188.0
max residence set size
5416.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S X:S) (RULES activate(n__d(X:S)) -> d(X:S) activate(n__f(X:S)) -> f(X:S) activate(X:S) -> X:S c(X:S) -> d(activate(X:S)) d(X:S) -> n__d(X:S) f(f(X:S)) -> c(n__f(g(n__f(X:S)))) f(X:S) -> n__f(X:S) h(X:S) -> c(n__d(X:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__d(X:S)) -> D(X:S) ACTIVATE(n__f(X:S)) -> F(X:S) C(X:S) -> ACTIVATE(X:S) C(X:S) -> D(activate(X:S)) F(f(X:S)) -> C(n__f(g(n__f(X:S)))) H(X:S) -> C(n__d(X:S)) -> Rules: activate(n__d(X:S)) -> d(X:S) activate(n__f(X:S)) -> f(X:S) activate(X:S) -> X:S c(X:S) -> d(activate(X:S)) d(X:S) -> n__d(X:S) f(f(X:S)) -> c(n__f(g(n__f(X:S)))) f(X:S) -> n__f(X:S) h(X:S) -> c(n__d(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__d(X:S)) -> D(X:S) ACTIVATE(n__f(X:S)) -> F(X:S) C(X:S) -> ACTIVATE(X:S) C(X:S) -> D(activate(X:S)) F(f(X:S)) -> C(n__f(g(n__f(X:S)))) H(X:S) -> C(n__d(X:S)) -> Rules: activate(n__d(X:S)) -> d(X:S) activate(n__f(X:S)) -> f(X:S) activate(X:S) -> X:S c(X:S) -> d(activate(X:S)) d(X:S) -> n__d(X:S) f(f(X:S)) -> c(n__f(g(n__f(X:S)))) f(X:S) -> n__f(X:S) h(X:S) -> c(n__d(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__f(X:S)) -> F(X:S) C(X:S) -> ACTIVATE(X:S) F(f(X:S)) -> C(n__f(g(n__f(X:S)))) ->->-> Rules: activate(n__d(X:S)) -> d(X:S) activate(n__f(X:S)) -> f(X:S) activate(X:S) -> X:S c(X:S) -> d(activate(X:S)) d(X:S) -> n__d(X:S) f(f(X:S)) -> c(n__f(g(n__f(X:S)))) f(X:S) -> n__f(X:S) h(X:S) -> c(n__d(X:S)) Problem 1: Reduction Pair Processor: -> Pairs: ACTIVATE(n__f(X:S)) -> F(X:S) C(X:S) -> ACTIVATE(X:S) F(f(X:S)) -> C(n__f(g(n__f(X:S)))) -> Rules: activate(n__d(X:S)) -> d(X:S) activate(n__f(X:S)) -> f(X:S) activate(X:S) -> X:S c(X:S) -> d(activate(X:S)) d(X:S) -> n__d(X:S) f(f(X:S)) -> c(n__f(g(n__f(X:S)))) f(X:S) -> n__f(X:S) h(X:S) -> c(n__d(X:S)) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = X + 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard