details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.325438 seconds
cpu usage	0.26677
user time	0.154614
system time	0.112156
max virtual memory	113188.0
max residence set size	5016.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y) (THEORY (C gcd)) (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)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x ) Problem 1: Dependency Pairs Processor: -> FAxioms: GCD(x2,x3) = GCD(x3,x2) -> 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) LE(s(x),s(y)) -> LE(x,y) MINUS(x,s(y)) -> MINUS(x,y) MINUS(x,s(y)) -> PRED(minus(x,y)) -> EAxioms: gcd(x2,x3) = gcd(x3,x2) -> 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)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x -> SRules: Empty Problem 1: SCC Processor: -> FAxioms: GCD(x2,x3) = GCD(x3,x2) -> 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) LE(s(x),s(y)) -> LE(x,y) MINUS(x,s(y)) -> MINUS(x,y) MINUS(x,s(y)) -> PRED(minus(x,y)) -> EAxioms: gcd(x2,x3) = gcd(x3,x2) -> 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)) le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x -> SRules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(x,s(y)) -> MINUS(x,y) -> FAxioms: gcd(x2,x3) -> gcd(x3,x2) -> EAxioms: gcd(x2,x3) = gcd(x3,x2) ->->-> 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)) le(0,y) -> true le(s(x),0) -> false popout

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

job log

popout

actions

all output return to TRS Equational