details

property	value
status	complete
benchmark	#3.6b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n050.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0679490566254 seconds
cpu usage	0.045510621
max memory	4321280.0

stage attributes

key	value
output-size	8275
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 y) (RULES gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) if_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) ) Problem 1: Innermost Equivalent Processor: -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) if_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: GCD(s(x),s(y)) -> IF_GCD(le(y,x),s(x),s(y)) GCD(s(x),s(y)) -> LE(y,x) IF_GCD(false,s(x),s(y)) -> GCD(minus(y,x),s(x)) IF_GCD(false,s(x),s(y)) -> MINUS(y,x) IF_GCD(true,s(x),s(y)) -> GCD(minus(x,y),s(y)) IF_GCD(true,s(x),s(y)) -> MINUS(x,y) IF_MINUS(false,s(x),y) -> MINUS(x,y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),y) -> IF_MINUS(le(s(x),y),s(x),y) MINUS(s(x),y) -> LE(s(x),y) -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) if_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) Problem 1: SCC Processor: -> Pairs: GCD(s(x),s(y)) -> IF_GCD(le(y,x),s(x),s(y)) GCD(s(x),s(y)) -> LE(y,x) IF_GCD(false,s(x),s(y)) -> GCD(minus(y,x),s(x)) IF_GCD(false,s(x),s(y)) -> MINUS(y,x) IF_GCD(true,s(x),s(y)) -> GCD(minus(x,y),s(y)) IF_GCD(true,s(x),s(y)) -> MINUS(x,y) IF_MINUS(false,s(x),y) -> MINUS(x,y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),y) -> IF_MINUS(le(s(x),y),s(x),y) MINUS(s(x),y) -> LE(s(x),y) -> Rules: gcd(0,y) -> y gcd(s(x),0) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) if_minus(false,s(x),y) -> s(minus(x,y)) if_minus(true,s(x),y) -> 0 le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(0,y) -> 0 minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) popout

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

job log

popout

actions

all output return to TRS Stand 20472