details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.467334032059 seconds
cpu usage	0.461221218
max memory	9080832.0

stage attributes

key	value
output-size	110717
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 v_NonEmpty:S X:S X1:S X2:S X3:S Y:S) (RULES active(div(s(X:S),s(Y:S))) -> mark(if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0)) active(div(0,s(Y:S))) -> mark(0) active(geq(s(X:S),s(Y:S))) -> mark(geq(X:S,Y:S)) active(geq(0,s(Y:S))) -> mark(ffalse) active(geq(X:S,0)) -> mark(ttrue) active(if(ffalse,X:S,Y:S)) -> mark(Y:S) active(if(ttrue,X:S,Y:S)) -> mark(X:S) active(minus(s(X:S),s(Y:S))) -> mark(minus(X:S,Y:S)) active(minus(0,Y:S)) -> mark(0) div(active(X1:S),X2:S) -> div(X1:S,X2:S) div(mark(X1:S),X2:S) -> div(X1:S,X2:S) div(X1:S,active(X2:S)) -> div(X1:S,X2:S) div(X1:S,mark(X2:S)) -> div(X1:S,X2:S) geq(active(X1:S),X2:S) -> geq(X1:S,X2:S) geq(mark(X1:S),X2:S) -> geq(X1:S,X2:S) geq(X1:S,active(X2:S)) -> geq(X1:S,X2:S) geq(X1:S,mark(X2:S)) -> geq(X1:S,X2:S) if(active(X1:S),X2:S,X3:S) -> if(X1:S,X2:S,X3:S) if(mark(X1:S),X2:S,X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,active(X2:S),X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,mark(X2:S),X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,X2:S,active(X3:S)) -> if(X1:S,X2:S,X3:S) if(X1:S,X2:S,mark(X3:S)) -> if(X1:S,X2:S,X3:S) mark(div(X1:S,X2:S)) -> active(div(mark(X1:S),X2:S)) mark(geq(X1:S,X2:S)) -> active(geq(X1:S,X2:S)) mark(if(X1:S,X2:S,X3:S)) -> active(if(mark(X1:S),X2:S,X3:S)) mark(minus(X1:S,X2:S)) -> active(minus(X1:S,X2:S)) mark(s(X:S)) -> active(s(mark(X:S))) mark(0) -> active(0) mark(ffalse) -> active(ffalse) mark(ttrue) -> active(ttrue) minus(active(X1:S),X2:S) -> minus(X1:S,X2:S) minus(mark(X1:S),X2:S) -> minus(X1:S,X2:S) minus(X1:S,active(X2:S)) -> minus(X1:S,X2:S) minus(X1:S,mark(X2:S)) -> minus(X1:S,X2:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(div(s(X:S),s(Y:S))) -> DIV(minus(X:S,Y:S),s(Y:S)) ACTIVE(div(s(X:S),s(Y:S))) -> GEQ(X:S,Y:S) ACTIVE(div(s(X:S),s(Y:S))) -> IF(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) ACTIVE(div(s(X:S),s(Y:S))) -> MARK(if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0)) ACTIVE(div(s(X:S),s(Y:S))) -> MINUS(X:S,Y:S) ACTIVE(div(s(X:S),s(Y:S))) -> S(div(minus(X:S,Y:S),s(Y:S))) ACTIVE(div(0,s(Y:S))) -> MARK(0) ACTIVE(geq(s(X:S),s(Y:S))) -> GEQ(X:S,Y:S) ACTIVE(geq(s(X:S),s(Y:S))) -> MARK(geq(X:S,Y:S)) ACTIVE(geq(0,s(Y:S))) -> MARK(ffalse) ACTIVE(geq(X:S,0)) -> MARK(ttrue) ACTIVE(if(ffalse,X:S,Y:S)) -> MARK(Y:S) ACTIVE(if(ttrue,X:S,Y:S)) -> MARK(X:S) ACTIVE(minus(s(X:S),s(Y:S))) -> MARK(minus(X:S,Y:S)) ACTIVE(minus(s(X:S),s(Y:S))) -> MINUS(X:S,Y:S) ACTIVE(minus(0,Y:S)) -> MARK(0) DIV(active(X1:S),X2:S) -> DIV(X1:S,X2:S) DIV(mark(X1:S),X2:S) -> DIV(X1:S,X2:S) DIV(X1:S,active(X2:S)) -> DIV(X1:S,X2:S) DIV(X1:S,mark(X2:S)) -> DIV(X1:S,X2:S) GEQ(active(X1:S),X2:S) -> GEQ(X1:S,X2:S) GEQ(mark(X1:S),X2:S) -> GEQ(X1:S,X2:S) GEQ(X1:S,active(X2:S)) -> GEQ(X1:S,X2:S) GEQ(X1:S,mark(X2:S)) -> GEQ(X1:S,X2:S) IF(active(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) IF(mark(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) IF(X1:S,active(X2:S),X3:S) -> IF(X1:S,X2:S,X3:S) IF(X1:S,mark(X2:S),X3:S) -> IF(X1:S,X2:S,X3:S) IF(X1:S,X2:S,active(X3:S)) -> IF(X1:S,X2:S,X3:S) IF(X1:S,X2:S,mark(X3:S)) -> IF(X1:S,X2:S,X3:S) MARK(div(X1:S,X2:S)) -> ACTIVE(div(mark(X1:S),X2:S)) MARK(div(X1:S,X2:S)) -> DIV(mark(X1:S),X2:S) MARK(div(X1:S,X2:S)) -> MARK(X1:S) MARK(geq(X1:S,X2:S)) -> ACTIVE(geq(X1:S,X2:S)) MARK(if(X1:S,X2:S,X3:S)) -> ACTIVE(if(mark(X1:S),X2:S,X3:S)) MARK(if(X1:S,X2:S,X3:S)) -> IF(mark(X1:S),X2:S,X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(minus(X1:S,X2:S)) -> ACTIVE(minus(X1:S,X2:S)) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) MARK(s(X:S)) -> S(mark(X:S)) MINUS(active(X1:S),X2:S) -> MINUS(X1:S,X2:S) MINUS(mark(X1:S),X2:S) -> MINUS(X1:S,X2:S) MINUS(X1:S,active(X2:S)) -> MINUS(X1:S,X2:S) popout

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

job log

popout

actions

all output return to TRS Innermost