details

property	value
status	complete
benchmark	Ex2_Luc03b_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.429710865021 seconds
cpu usage	0.398507766
max memory	6139904.0

stage attributes

key	value
output-size	39195
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 activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) add(0,X) -> X add(X1,X2) -> n__add(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) fst(0,Z) -> nil fst(X1,X2) -> n__fst(X1,X2) len(cons(X,Z)) -> s(n__len(activate(Z))) len(nil) -> 0 len(X) -> n__len(X) s(X) -> n__s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__add(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__add(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__add(X1,X2)) -> ADD(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__fst(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__fst(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__fst(X1,X2)) -> FST(activate(X1),activate(X2)) ACTIVATE(n__len(X)) -> ACTIVATE(X) ACTIVATE(n__len(X)) -> LEN(activate(X)) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ACTIVATE(X) ADD(s(X),Y) -> S(n__add(activate(X),Y)) FST(s(X),cons(Y,Z)) -> ACTIVATE(X) FST(s(X),cons(Y,Z)) -> ACTIVATE(Z) LEN(cons(X,Z)) -> ACTIVATE(Z) LEN(cons(X,Z)) -> S(n__len(activate(Z))) -> Rules: activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) add(0,X) -> X add(X1,X2) -> n__add(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) fst(0,Z) -> nil fst(X1,X2) -> n__fst(X1,X2) len(cons(X,Z)) -> s(n__len(activate(Z))) len(nil) -> 0 len(X) -> n__len(X) s(X) -> n__s(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__add(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__add(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__add(X1,X2)) -> ADD(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__fst(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__fst(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__fst(X1,X2)) -> FST(activate(X1),activate(X2)) ACTIVATE(n__len(X)) -> ACTIVATE(X) ACTIVATE(n__len(X)) -> LEN(activate(X)) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ACTIVATE(X) ADD(s(X),Y) -> S(n__add(activate(X),Y)) FST(s(X),cons(Y,Z)) -> ACTIVATE(X) FST(s(X),cons(Y,Z)) -> ACTIVATE(Z) LEN(cons(X,Z)) -> ACTIVATE(Z) LEN(cons(X,Z)) -> S(n__len(activate(Z))) -> Rules: activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(n__s(X)) -> s(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472