details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.39682412148 seconds
cpu usage	0.099535247
max memory	3944448.0

stage attributes

key	value
output-size	10587
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 Y:S) (RULES 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S div(0,n__s(Y:S)) -> 0 div(s(X:S),n__s(Y:S)) -> if(geq(X:S,activate(Y:S)),n__s(div(minus(X:S,activate(Y:S)),n__s(activate(Y:S)))),n__0) geq(n__0,n__s(Y:S)) -> ffalse geq(n__s(X:S),n__s(Y:S)) -> geq(activate(X:S),activate(Y:S)) geq(X:S,n__0) -> ttrue if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) minus(n__0,Y:S) -> 0 minus(n__s(X:S),n__s(Y:S)) -> minus(activate(X:S),activate(Y:S)) s(X:S) -> n__s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__s(X:S)) -> S(X:S) DIV(s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) DIV(s(X:S),n__s(Y:S)) -> DIV(minus(X:S,activate(Y:S)),n__s(activate(Y:S))) DIV(s(X:S),n__s(Y:S)) -> GEQ(X:S,activate(Y:S)) DIV(s(X:S),n__s(Y:S)) -> IF(geq(X:S,activate(Y:S)),n__s(div(minus(X:S,activate(Y:S)),n__s(activate(Y:S)))),n__0) DIV(s(X:S),n__s(Y:S)) -> MINUS(X:S,activate(Y:S)) GEQ(n__s(X:S),n__s(Y:S)) -> ACTIVATE(X:S) GEQ(n__s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) GEQ(n__s(X:S),n__s(Y:S)) -> GEQ(activate(X:S),activate(Y:S)) IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S) IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S) MINUS(n__0,Y:S) -> 0# MINUS(n__s(X:S),n__s(Y:S)) -> ACTIVATE(X:S) MINUS(n__s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) MINUS(n__s(X:S),n__s(Y:S)) -> MINUS(activate(X:S),activate(Y:S)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S div(0,n__s(Y:S)) -> 0 div(s(X:S),n__s(Y:S)) -> if(geq(X:S,activate(Y:S)),n__s(div(minus(X:S,activate(Y:S)),n__s(activate(Y:S)))),n__0) geq(n__0,n__s(Y:S)) -> ffalse geq(n__s(X:S),n__s(Y:S)) -> geq(activate(X:S),activate(Y:S)) geq(X:S,n__0) -> ttrue if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) minus(n__0,Y:S) -> 0 minus(n__s(X:S),n__s(Y:S)) -> minus(activate(X:S),activate(Y:S)) s(X:S) -> n__s(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__0) -> 0# ACTIVATE(n__s(X:S)) -> S(X:S) DIV(s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) DIV(s(X:S),n__s(Y:S)) -> DIV(minus(X:S,activate(Y:S)),n__s(activate(Y:S))) DIV(s(X:S),n__s(Y:S)) -> GEQ(X:S,activate(Y:S)) DIV(s(X:S),n__s(Y:S)) -> IF(geq(X:S,activate(Y:S)),n__s(div(minus(X:S,activate(Y:S)),n__s(activate(Y:S)))),n__0) DIV(s(X:S),n__s(Y:S)) -> MINUS(X:S,activate(Y:S)) GEQ(n__s(X:S),n__s(Y:S)) -> ACTIVATE(X:S) GEQ(n__s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) GEQ(n__s(X:S),n__s(Y:S)) -> GEQ(activate(X:S),activate(Y:S)) IF(ffalse,X:S,Y:S) -> ACTIVATE(Y:S) IF(ttrue,X:S,Y:S) -> ACTIVATE(X:S) MINUS(n__0,Y:S) -> 0# MINUS(n__s(X:S),n__s(Y:S)) -> ACTIVATE(X:S) MINUS(n__s(X:S),n__s(Y:S)) -> ACTIVATE(Y:S) MINUS(n__s(X:S),n__s(Y:S)) -> MINUS(activate(X:S),activate(Y:S)) -> Rules: 0 -> n__0 activate(n__0) -> 0 activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S div(0,n__s(Y:S)) -> 0 div(s(X:S),n__s(Y:S)) -> if(geq(X:S,activate(Y:S)),n__s(div(minus(X:S,activate(Y:S)),n__s(activate(Y:S)))),n__0) geq(n__0,n__s(Y:S)) -> ffalse geq(n__s(X:S),n__s(Y:S)) -> geq(activate(X:S),activate(Y:S)) geq(X:S,n__0) -> ttrue if(ffalse,X:S,Y:S) -> activate(Y:S) if(ttrue,X:S,Y:S) -> activate(X:S) minus(n__0,Y:S) -> 0 minus(n__s(X:S),n__s(Y:S)) -> minus(activate(X:S),activate(Y:S)) s(X:S) -> n__s(X:S) ->Strongly Connected Components: popout

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

job log

popout

actions

all output return to TRS Standard