Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715516
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0540671348572 seconds
cpu usage
0.03083388
max memory
3203072.0
stage attributes
key
value
output-size
3906
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 X) (RULES 0 -> n__0 activate(n__0) -> 0 activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X) -> n__f(X) p(s(0)) -> 0 s(X) -> n__s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X) -> n__f(X) p(s(0)) -> 0 s(X) -> n__s(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X) -> n__f(X) p(s(0)) -> 0 s(X) -> n__s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(0)) -> F(p(s(0))) ->->-> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X) -> n__f(X) p(s(0)) -> 0 s(X) -> n__s(X) ->->Cycle: ->->-> Pairs: ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> ACTIVATE(X) ->->-> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X f(0) -> cons(0,n__f(n__s(n__0))) f(s(0)) -> f(p(s(0))) f(X) -> n__f(X) p(s(0)) -> 0 s(X) -> n__s(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472