Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715906
details
property
value
status
complete
benchmark
Ex25_Luc06_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.063346862793 seconds
cpu usage
0.062036537
max memory
4104192.0
stage attributes
key
value
output-size
5054
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 X) (RULES activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) activate(X) -> X c(X) -> d(activate(X)) d(X) -> n__d(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) f(X) -> n__f(X) g(X) -> n__g(X) h(X) -> c(n__d(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__d(X)) -> D(X) ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__g(X)) -> G(X) C(X) -> ACTIVATE(X) C(X) -> D(activate(X)) F(f(X)) -> C(n__f(n__g(n__f(X)))) H(X) -> C(n__d(X)) -> Rules: activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) activate(X) -> X c(X) -> d(activate(X)) d(X) -> n__d(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) f(X) -> n__f(X) g(X) -> n__g(X) h(X) -> c(n__d(X)) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__d(X)) -> D(X) ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__g(X)) -> G(X) C(X) -> ACTIVATE(X) C(X) -> D(activate(X)) F(f(X)) -> C(n__f(n__g(n__f(X)))) H(X) -> C(n__d(X)) -> Rules: activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) activate(X) -> X c(X) -> d(activate(X)) d(X) -> n__d(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) f(X) -> n__f(X) g(X) -> n__g(X) h(X) -> c(n__d(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) C(X) -> ACTIVATE(X) F(f(X)) -> C(n__f(n__g(n__f(X)))) ->->-> Rules: activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) activate(X) -> X c(X) -> d(activate(X)) d(X) -> n__d(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) f(X) -> n__f(X) g(X) -> n__g(X) h(X) -> c(n__d(X)) Problem 1: Reduction Pair Processor: -> Pairs: ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) C(X) -> ACTIVATE(X) F(f(X)) -> C(n__f(n__g(n__f(X)))) -> Rules: activate(n__d(X)) -> d(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472