details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0781099796295 seconds
cpu usage	0.079115037
max memory	4599808.0

stage attributes

key	value
output-size	9097
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 X1 X2 Y Z) (RULES a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(nil) -> nil mark(s(X)) -> s(mark(X)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__FIRST(s(X),cons(Y,Z)) -> MARK(Y) A__FROM(X) -> MARK(X) MARK(cons(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(s(X)) -> MARK(X) -> Rules: a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(nil) -> nil mark(s(X)) -> s(mark(X)) Problem 1: SCC Processor: -> Pairs: A__FIRST(s(X),cons(Y,Z)) -> MARK(Y) A__FROM(X) -> MARK(X) MARK(cons(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(s(X)) -> MARK(X) -> Rules: a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(nil) -> nil mark(s(X)) -> s(mark(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__FIRST(s(X),cons(Y,Z)) -> MARK(Y) A__FROM(X) -> MARK(X) MARK(cons(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(mark(X)) MARK(from(X)) -> MARK(X) MARK(s(X)) -> MARK(X) ->->-> Rules: a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(nil) -> nil popout

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

job log

popout

actions

all output return to TRS Inner 89993