details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	28.8545320034 seconds
cpu usage	27.891467895
max memory	1.5732736E7

stage attributes

key	value
output-size	39469
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 M:S N:S X:S X1:S X2:S) (RULES a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) a__x(N:S,0) -> 0 a__x(N:S,s(M:S)) -> a__plus(a__x(mark(N:S),mark(M:S)),mark(N:S)) a__x(X1:S,X2:S) -> x(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt mark(x(X1:S,X2:S)) -> a__x(mark(X1:S),mark(X2:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__PLUS(N:S,0) -> MARK(N:S) A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) A__PLUS(N:S,s(M:S)) -> MARK(M:S) A__PLUS(N:S,s(M:S)) -> MARK(N:S) A__X(N:S,s(M:S)) -> A__PLUS(a__x(mark(N:S),mark(M:S)),mark(N:S)) A__X(N:S,s(M:S)) -> A__X(mark(N:S),mark(M:S)) A__X(N:S,s(M:S)) -> MARK(M:S) A__X(N:S,s(M:S)) -> MARK(N:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) MARK(x(X1:S,X2:S)) -> A__X(mark(X1:S),mark(X2:S)) MARK(x(X1:S,X2:S)) -> MARK(X1:S) MARK(x(X1:S,X2:S)) -> MARK(X2:S) -> Rules: a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) a__x(N:S,0) -> 0 a__x(N:S,s(M:S)) -> a__plus(a__x(mark(N:S),mark(M:S)),mark(N:S)) a__x(X1:S,X2:S) -> x(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt mark(x(X1:S,X2:S)) -> a__x(mark(X1:S),mark(X2:S)) Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__PLUS(N:S,0) -> MARK(N:S) A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) A__PLUS(N:S,s(M:S)) -> MARK(M:S) A__PLUS(N:S,s(M:S)) -> MARK(N:S) A__X(N:S,s(M:S)) -> A__PLUS(a__x(mark(N:S),mark(M:S)),mark(N:S)) A__X(N:S,s(M:S)) -> A__X(mark(N:S),mark(M:S)) A__X(N:S,s(M:S)) -> MARK(M:S) A__X(N:S,s(M:S)) -> MARK(N:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) MARK(x(X1:S,X2:S)) -> A__X(mark(X1:S),mark(X2:S)) MARK(x(X1:S,X2:S)) -> MARK(X1:S) MARK(x(X1:S,X2:S)) -> MARK(X2:S) -> Rules: a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) a__x(N:S,0) -> 0 a__x(N:S,s(M:S)) -> a__plus(a__x(mark(N:S),mark(M:S)),mark(N:S)) a__x(X1:S,X2:S) -> x(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) popout

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

job log

popout

actions

all output return to TRS Standard