details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	7.9099009037 seconds
cpu usage	3.2407784
max memory	2.9310976E7

stage attributes

key	value
output-size	51871
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(div(X1:S,X2:S)) -> div(active(X1:S),X2: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(if(X1:S,X2:S,X3:S)) -> if(active(X1:S),X2:S,X3:S) active(minus(s(X:S),s(Y:S))) -> mark(minus(X:S,Y:S)) active(minus(0,Y:S)) -> mark(0) active(s(X:S)) -> s(active(X:S)) div(mark(X1:S),X2:S) -> mark(div(X1:S,X2:S)) div(ok(X1:S),ok(X2:S)) -> ok(div(X1:S,X2:S)) geq(ok(X1:S),ok(X2:S)) -> ok(geq(X1:S,X2:S)) if(mark(X1:S),X2:S,X3:S) -> mark(if(X1:S,X2:S,X3:S)) if(ok(X1:S),ok(X2:S),ok(X3:S)) -> ok(if(X1:S,X2:S,X3:S)) minus(ok(X1:S),ok(X2:S)) -> ok(minus(X1:S,X2:S)) proper(div(X1:S,X2:S)) -> div(proper(X1:S),proper(X2:S)) proper(geq(X1:S,X2:S)) -> geq(proper(X1:S),proper(X2:S)) proper(if(X1:S,X2:S,X3:S)) -> if(proper(X1:S),proper(X2:S),proper(X3:S)) proper(minus(X1:S,X2:S)) -> minus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(ffalse) -> ok(ffalse) proper(ttrue) -> ok(ttrue) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(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))) -> 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(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(div(X1:S,X2:S)) -> DIV(active(X1:S),X2:S) ACTIVE(geq(s(X:S),s(Y:S))) -> GEQ(X:S,Y:S) ACTIVE(if(X1:S,X2:S,X3:S)) -> ACTIVE(X1:S) ACTIVE(if(X1:S,X2:S,X3:S)) -> IF(active(X1:S),X2:S,X3:S) ACTIVE(minus(s(X:S),s(Y:S))) -> MINUS(X:S,Y:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) DIV(mark(X1:S),X2:S) -> DIV(X1:S,X2:S) DIV(ok(X1:S),ok(X2:S)) -> DIV(X1:S,X2:S) GEQ(ok(X1:S),ok(X2:S)) -> GEQ(X1:S,X2:S) IF(mark(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) IF(ok(X1:S),ok(X2:S),ok(X3:S)) -> IF(X1:S,X2:S,X3:S) MINUS(ok(X1:S),ok(X2:S)) -> MINUS(X1:S,X2:S) PROPER(div(X1:S,X2:S)) -> DIV(proper(X1:S),proper(X2:S)) PROPER(div(X1:S,X2:S)) -> PROPER(X1:S) PROPER(div(X1:S,X2:S)) -> PROPER(X2:S) PROPER(geq(X1:S,X2:S)) -> GEQ(proper(X1:S),proper(X2:S)) PROPER(geq(X1:S,X2:S)) -> PROPER(X1:S) PROPER(geq(X1:S,X2:S)) -> PROPER(X2:S) PROPER(if(X1:S,X2:S,X3:S)) -> IF(proper(X1:S),proper(X2:S),proper(X3:S)) PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X1:S) PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X2:S) PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X3:S) PROPER(minus(X1:S,X2:S)) -> MINUS(proper(X1:S),proper(X2:S)) PROPER(minus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(minus(X1:S,X2:S)) -> PROPER(X2:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X: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(div(X1:S,X2:S)) -> div(active(X1:S),X2: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(if(X1:S,X2:S,X3:S)) -> if(active(X1:S),X2:S,X3:S) active(minus(s(X:S),s(Y:S))) -> mark(minus(X:S,Y:S)) popout

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

job log

popout

actions

all output return to TRS Innermost