details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.102253913879 seconds
cpu usage	0.085199965
max memory	4956160.0

stage attributes

key	value
output-size	27650
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 M N X X1 X2) (RULES active(and(tt,X)) -> mark(X) active(and(X1,X2)) -> and(active(X1),X2) active(plus(N,s(M))) -> mark(s(plus(N,M))) active(plus(N,0)) -> mark(N) active(plus(X1,X2)) -> plus(active(X1),X2) active(plus(X1,X2)) -> plus(X1,active(X2)) active(s(X)) -> s(active(X)) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) plus(mark(X1),X2) -> mark(plus(X1,X2)) plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) plus(X1,mark(X2)) -> mark(plus(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) proper(tt) -> ok(tt) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(and(X1,X2)) -> ACTIVE(X1) ACTIVE(and(X1,X2)) -> AND(active(X1),X2) ACTIVE(plus(N,s(M))) -> PLUS(N,M) ACTIVE(plus(N,s(M))) -> S(plus(N,M)) ACTIVE(plus(X1,X2)) -> ACTIVE(X1) ACTIVE(plus(X1,X2)) -> ACTIVE(X2) ACTIVE(plus(X1,X2)) -> PLUS(active(X1),X2) ACTIVE(plus(X1,X2)) -> PLUS(X1,active(X2)) ACTIVE(s(X)) -> ACTIVE(X) ACTIVE(s(X)) -> S(active(X)) AND(mark(X1),X2) -> AND(X1,X2) AND(ok(X1),ok(X2)) -> AND(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(ok(X1),ok(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) PROPER(and(X1,X2)) -> AND(proper(X1),proper(X2)) PROPER(and(X1,X2)) -> PROPER(X1) PROPER(and(X1,X2)) -> PROPER(X2) PROPER(plus(X1,X2)) -> PLUS(proper(X1),proper(X2)) PROPER(plus(X1,X2)) -> PROPER(X1) PROPER(plus(X1,X2)) -> PROPER(X2) PROPER(s(X)) -> PROPER(X) PROPER(s(X)) -> S(proper(X)) S(mark(X)) -> S(X) S(ok(X)) -> S(X) TOP(mark(X)) -> PROPER(X) TOP(mark(X)) -> TOP(proper(X)) TOP(ok(X)) -> ACTIVE(X) TOP(ok(X)) -> TOP(active(X)) -> Rules: active(and(tt,X)) -> mark(X) active(and(X1,X2)) -> and(active(X1),X2) active(plus(N,s(M))) -> mark(s(plus(N,M))) active(plus(N,0)) -> mark(N) active(plus(X1,X2)) -> plus(active(X1),X2) active(plus(X1,X2)) -> plus(X1,active(X2)) active(s(X)) -> s(active(X)) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) plus(mark(X1),X2) -> mark(plus(X1,X2)) plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) plus(X1,mark(X2)) -> mark(plus(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) proper(tt) -> ok(tt) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Problem 1: SCC Processor: -> Pairs: ACTIVE(and(X1,X2)) -> ACTIVE(X1) ACTIVE(and(X1,X2)) -> AND(active(X1),X2) ACTIVE(plus(N,s(M))) -> PLUS(N,M) ACTIVE(plus(N,s(M))) -> S(plus(N,M)) ACTIVE(plus(X1,X2)) -> ACTIVE(X1) popout

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

job log

popout

actions

all output return to TRS Stand 20472