details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0713639259338 seconds
cpu usage	0.053078497
max memory	4087808.0

stage attributes

key	value
output-size	8216
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 v_NonEmpty:S X:S Y:S) (RULES gcd(0,Y:S) -> 0 gcd(s(X:S),0) -> s(X:S) gcd(s(X:S),s(Y:S)) -> if(le(Y:S,X:S),s(X:S),s(Y:S)) if(ffalse,s(X:S),s(Y:S)) -> gcd(minus(Y:S,X:S),s(X:S)) if(ttrue,s(X:S),s(Y:S)) -> gcd(minus(X:S,Y:S),s(Y:S)) le(0,Y:S) -> ttrue le(s(X:S),0) -> ffalse le(s(X:S),s(Y:S)) -> le(X:S,Y:S) minus(X:S,0) -> X:S minus(X:S,s(Y:S)) -> pred(minus(X:S,Y:S)) pred(s(X:S)) -> X:S ) Problem 1: Innermost Equivalent Processor: -> Rules: gcd(0,Y:S) -> 0 gcd(s(X:S),0) -> s(X:S) gcd(s(X:S),s(Y:S)) -> if(le(Y:S,X:S),s(X:S),s(Y:S)) if(ffalse,s(X:S),s(Y:S)) -> gcd(minus(Y:S,X:S),s(X:S)) if(ttrue,s(X:S),s(Y:S)) -> gcd(minus(X:S,Y:S),s(Y:S)) le(0,Y:S) -> ttrue le(s(X:S),0) -> ffalse le(s(X:S),s(Y:S)) -> le(X:S,Y:S) minus(X:S,0) -> X:S minus(X:S,s(Y:S)) -> pred(minus(X:S,Y:S)) pred(s(X:S)) -> X:S -> 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),s(Y:S)) -> IF(le(Y:S,X:S),s(X:S),s(Y:S)) GCD(s(X:S),s(Y:S)) -> LE(Y:S,X:S) IF(ffalse,s(X:S),s(Y:S)) -> GCD(minus(Y:S,X:S),s(X:S)) IF(ffalse,s(X:S),s(Y:S)) -> MINUS(Y:S,X:S) IF(ttrue,s(X:S),s(Y:S)) -> GCD(minus(X:S,Y:S),s(Y:S)) IF(ttrue,s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) LE(s(X:S),s(Y:S)) -> LE(X:S,Y:S) MINUS(X:S,s(Y:S)) -> MINUS(X:S,Y:S) MINUS(X:S,s(Y:S)) -> PRED(minus(X:S,Y:S)) -> Rules: gcd(0,Y:S) -> 0 gcd(s(X:S),0) -> s(X:S) gcd(s(X:S),s(Y:S)) -> if(le(Y:S,X:S),s(X:S),s(Y:S)) if(ffalse,s(X:S),s(Y:S)) -> gcd(minus(Y:S,X:S),s(X:S)) if(ttrue,s(X:S),s(Y:S)) -> gcd(minus(X:S,Y:S),s(Y:S)) le(0,Y:S) -> ttrue le(s(X:S),0) -> ffalse le(s(X:S),s(Y:S)) -> le(X:S,Y:S) minus(X:S,0) -> X:S minus(X:S,s(Y:S)) -> pred(minus(X:S,Y:S)) pred(s(X:S)) -> X:S Problem 1: SCC Processor: -> Pairs: GCD(s(X:S),s(Y:S)) -> IF(le(Y:S,X:S),s(X:S),s(Y:S)) GCD(s(X:S),s(Y:S)) -> LE(Y:S,X:S) IF(ffalse,s(X:S),s(Y:S)) -> GCD(minus(Y:S,X:S),s(X:S)) IF(ffalse,s(X:S),s(Y:S)) -> MINUS(Y:S,X:S) IF(ttrue,s(X:S),s(Y:S)) -> GCD(minus(X:S,Y:S),s(Y:S)) IF(ttrue,s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) LE(s(X:S),s(Y:S)) -> LE(X:S,Y:S) MINUS(X:S,s(Y:S)) -> MINUS(X:S,Y:S) MINUS(X:S,s(Y:S)) -> PRED(minus(X:S,Y:S)) -> Rules: gcd(0,Y:S) -> 0 gcd(s(X:S),0) -> s(X:S) gcd(s(X:S),s(Y:S)) -> if(le(Y:S,X:S),s(X:S),s(Y:S)) if(ffalse,s(X:S),s(Y:S)) -> gcd(minus(Y:S,X:S),s(X:S)) if(ttrue,s(X:S),s(Y:S)) -> gcd(minus(X:S,Y:S),s(Y:S)) le(0,Y:S) -> ttrue le(s(X:S),0) -> ffalse le(s(X:S),s(Y:S)) -> le(X:S,Y:S) minus(X:S,0) -> X:S minus(X:S,s(Y:S)) -> pred(minus(X:S,Y:S)) pred(s(X:S)) -> X:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(X:S,s(Y:S)) -> MINUS(X:S,Y:S) ->->-> Rules: gcd(0,Y:S) -> 0 popout

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

job log

popout

actions

all output return to TRS Standard