Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962911
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
n094.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0474920272827 seconds
cpu usage
0.039527942
max memory
3346432.0
stage attributes
key
value
output-size
2787
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 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:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard