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	n086.star.cs.uiowa.edu
space	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.424459934235 seconds
cpu usage	0.429893505
max memory	9121792.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Inner 89993