details

property	value
status	complete
benchmark	Ex6_GM04_iGM.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n072.star.cs.uiowa.edu
space	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0208690166473 seconds
cpu usage	0.015491378
max memory	1630208.0

stage attributes

key	value
output-size	3628
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 active(f(g(X))) -> mark(g(X)) active(c) -> mark(f(g(c))) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(f(X)) -> active(f(X)) mark(g(X)) -> active(g(X)) mark(c) -> active(c) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(g(X))) -> MARK(g(X)) ACTIVE(c) -> MARK(f(g(c))) F(active(X)) -> F(X) F(mark(X)) -> F(X) G(active(X)) -> G(X) G(mark(X)) -> G(X) MARK(f(X)) -> ACTIVE(f(X)) MARK(g(X)) -> ACTIVE(g(X)) MARK(c) -> ACTIVE(c) -> Rules: active(f(g(X))) -> mark(g(X)) active(c) -> mark(f(g(c))) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(f(X)) -> active(f(X)) mark(g(X)) -> active(g(X)) mark(c) -> active(c) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(g(X))) -> MARK(g(X)) ACTIVE(c) -> MARK(f(g(c))) F(active(X)) -> F(X) F(mark(X)) -> F(X) G(active(X)) -> G(X) G(mark(X)) -> G(X) MARK(f(X)) -> ACTIVE(f(X)) MARK(g(X)) -> ACTIVE(g(X)) MARK(c) -> ACTIVE(c) -> Rules: active(f(g(X))) -> mark(g(X)) active(c) -> mark(f(g(c))) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(f(X)) -> active(f(X)) mark(g(X)) -> active(g(X)) mark(c) -> active(c) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(active(X)) -> G(X) G(mark(X)) -> G(X) ->->-> Rules: active(f(g(X))) -> mark(g(X)) active(c) -> mark(f(g(c))) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(f(X)) -> active(f(X)) mark(g(X)) -> active(g(X)) mark(c) -> active(c) ->->Cycle: ->->-> Pairs: F(active(X)) -> F(X) F(mark(X)) -> F(X) ->->-> Rules: active(f(g(X))) -> mark(g(X)) active(c) -> mark(f(g(c))) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(f(X)) -> active(f(X)) mark(g(X)) -> active(g(X)) mark(c) -> active(c) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Inner 89993