Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713046
details
property
value
status
complete
benchmark
Ex23_Luc06_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.0176439285278 seconds
cpu usage
0.014659836
max memory
1466368.0
stage attributes
key
value
output-size
2327
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 a -> n__a activate(n__a) -> a activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) activate(X) -> X f(f(a)) -> c(n__f(n__g(n__f(n__a)))) f(X) -> n__f(X) g(X) -> n__g(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__a) -> A ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__g(X)) -> ACTIVATE(X) ACTIVATE(n__g(X)) -> G(activate(X)) -> Rules: a -> n__a activate(n__a) -> a activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) activate(X) -> X f(f(a)) -> c(n__f(n__g(n__f(n__a)))) f(X) -> n__f(X) g(X) -> n__g(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__a) -> A ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__f(X)) -> F(activate(X)) ACTIVATE(n__g(X)) -> ACTIVATE(X) ACTIVATE(n__g(X)) -> G(activate(X)) -> Rules: a -> n__a activate(n__a) -> a activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) activate(X) -> X f(f(a)) -> c(n__f(n__g(n__f(n__a)))) f(X) -> n__f(X) g(X) -> n__g(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__g(X)) -> ACTIVATE(X) ->->-> Rules: a -> n__a activate(n__a) -> a activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) activate(X) -> X f(f(a)) -> c(n__f(n__g(n__f(n__a)))) f(X) -> n__f(X) g(X) -> n__g(X) Problem 1: Subterm Processor: -> Pairs: ACTIVATE(n__f(X)) -> ACTIVATE(X) ACTIVATE(n__g(X)) -> ACTIVATE(X) -> Rules: a -> n__a activate(n__a) -> a activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) activate(X) -> X f(f(a)) -> c(n__f(n__g(n__f(n__a)))) f(X) -> n__f(X) g(X) -> n__g(X) ->Projection: pi(ACTIVATE) = 1 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: a -> n__a activate(n__a) -> a
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472