details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.148170948029 seconds
cpu usage	0.129852003
max memory	6205440.0

stage attributes

key	value
output-size	18425
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 X X1 X2 X3 Y) (RULES a__div(0,s(Y)) -> 0 a__div(s(X),s(Y)) -> a__if(a__geq(X,Y),s(div(minus(X,Y),s(Y))),0) a__div(X1,X2) -> div(X1,X2) a__geq(0,s(Y)) -> false a__geq(s(X),s(Y)) -> a__geq(X,Y) a__geq(X,0) -> true a__geq(X1,X2) -> geq(X1,X2) a__if(false,X,Y) -> mark(Y) a__if(true,X,Y) -> mark(X) a__if(X1,X2,X3) -> if(X1,X2,X3) a__minus(0,Y) -> 0 a__minus(s(X),s(Y)) -> a__minus(X,Y) a__minus(X1,X2) -> minus(X1,X2) mark(0) -> 0 mark(div(X1,X2)) -> a__div(mark(X1),X2) mark(false) -> false mark(geq(X1,X2)) -> a__geq(X1,X2) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(minus(X1,X2)) -> a__minus(X1,X2) mark(s(X)) -> s(mark(X)) mark(true) -> true ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__DIV(s(X),s(Y)) -> A__GEQ(X,Y) A__DIV(s(X),s(Y)) -> A__IF(a__geq(X,Y),s(div(minus(X,Y),s(Y))),0) A__GEQ(s(X),s(Y)) -> A__GEQ(X,Y) A__IF(false,X,Y) -> MARK(Y) A__IF(true,X,Y) -> MARK(X) A__MINUS(s(X),s(Y)) -> A__MINUS(X,Y) MARK(div(X1,X2)) -> A__DIV(mark(X1),X2) MARK(div(X1,X2)) -> MARK(X1) MARK(geq(X1,X2)) -> A__GEQ(X1,X2) MARK(if(X1,X2,X3)) -> A__IF(mark(X1),X2,X3) MARK(if(X1,X2,X3)) -> MARK(X1) MARK(minus(X1,X2)) -> A__MINUS(X1,X2) MARK(s(X)) -> MARK(X) -> Rules: a__div(0,s(Y)) -> 0 a__div(s(X),s(Y)) -> a__if(a__geq(X,Y),s(div(minus(X,Y),s(Y))),0) a__div(X1,X2) -> div(X1,X2) a__geq(0,s(Y)) -> false a__geq(s(X),s(Y)) -> a__geq(X,Y) a__geq(X,0) -> true a__geq(X1,X2) -> geq(X1,X2) a__if(false,X,Y) -> mark(Y) a__if(true,X,Y) -> mark(X) a__if(X1,X2,X3) -> if(X1,X2,X3) a__minus(0,Y) -> 0 a__minus(s(X),s(Y)) -> a__minus(X,Y) a__minus(X1,X2) -> minus(X1,X2) mark(0) -> 0 mark(div(X1,X2)) -> a__div(mark(X1),X2) mark(false) -> false mark(geq(X1,X2)) -> a__geq(X1,X2) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(minus(X1,X2)) -> a__minus(X1,X2) mark(s(X)) -> s(mark(X)) mark(true) -> true Problem 1: SCC Processor: -> Pairs: A__DIV(s(X),s(Y)) -> A__GEQ(X,Y) A__DIV(s(X),s(Y)) -> A__IF(a__geq(X,Y),s(div(minus(X,Y),s(Y))),0) A__GEQ(s(X),s(Y)) -> A__GEQ(X,Y) A__IF(false,X,Y) -> MARK(Y) A__IF(true,X,Y) -> MARK(X) A__MINUS(s(X),s(Y)) -> A__MINUS(X,Y) MARK(div(X1,X2)) -> A__DIV(mark(X1),X2) MARK(div(X1,X2)) -> MARK(X1) MARK(geq(X1,X2)) -> A__GEQ(X1,X2) MARK(if(X1,X2,X3)) -> A__IF(mark(X1),X2,X3) MARK(if(X1,X2,X3)) -> MARK(X1) MARK(minus(X1,X2)) -> A__MINUS(X1,X2) MARK(s(X)) -> MARK(X) -> Rules: a__div(0,s(Y)) -> 0 a__div(s(X),s(Y)) -> a__if(a__geq(X,Y),s(div(minus(X,Y),s(Y))),0) a__div(X1,X2) -> div(X1,X2) a__geq(0,s(Y)) -> false a__geq(s(X),s(Y)) -> a__geq(X,Y) a__geq(X,0) -> true popout

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

job log

popout

actions

all output return to TRS Inner 89993