details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0707278251648 seconds
cpu usage	0.0511356
max memory	4235264.0

stage attributes

key	value
output-size	9198
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) (RULES a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__length(cons(X:S,Y:S)) -> s(a__length1(Y:S)) a__length(nil) -> 0 a__length(X:S) -> length(X:S) a__length1(X:S) -> a__length(X:S) a__length1(X:S) -> length1(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(length(X:S)) -> a__length(X:S) mark(length1(X:S)) -> a__length1(X:S) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__FROM(X:S) -> MARK(X:S) A__LENGTH(cons(X:S,Y:S)) -> A__LENGTH1(Y:S) A__LENGTH1(X:S) -> A__LENGTH(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(length(X:S)) -> A__LENGTH(X:S) MARK(length1(X:S)) -> A__LENGTH1(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__length(cons(X:S,Y:S)) -> s(a__length1(Y:S)) a__length(nil) -> 0 a__length(X:S) -> length(X:S) a__length1(X:S) -> a__length(X:S) a__length1(X:S) -> length1(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(length(X:S)) -> a__length(X:S) mark(length1(X:S)) -> a__length1(X:S) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__FROM(X:S) -> MARK(X:S) A__LENGTH(cons(X:S,Y:S)) -> A__LENGTH1(Y:S) A__LENGTH1(X:S) -> A__LENGTH(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(length(X:S)) -> A__LENGTH(X:S) MARK(length1(X:S)) -> A__LENGTH1(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__length(cons(X:S,Y:S)) -> s(a__length1(Y:S)) a__length(nil) -> 0 a__length(X:S) -> length(X:S) a__length1(X:S) -> a__length(X:S) a__length1(X:S) -> length1(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(length(X:S)) -> a__length(X:S) mark(length1(X:S)) -> a__length1(X:S) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__LENGTH(cons(X:S,Y:S)) -> A__LENGTH1(Y:S) A__LENGTH1(X:S) -> A__LENGTH(X:S) ->->-> Rules: a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__length(cons(X:S,Y:S)) -> s(a__length1(Y:S)) a__length(nil) -> 0 a__length(X:S) -> length(X:S) a__length1(X:S) -> a__length(X:S) a__length1(X:S) -> length1(X:S) mark(0) -> 0 popout

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

job log

popout

actions

all output return to TRS Innermost