details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.127912998199 seconds
cpu usage	0.067042373
max memory	3796992.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Standard