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	n049.star.cs.uiowa.edu
space	Mixed_C

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.397023 seconds
cpu usage	0.272866
user time	0.150667
system time	0.122199
max virtual memory	113176.0
max residence set size	5024.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.39 YES 0.00/0.39 0.00/0.39 Problem 1: 0.00/0.39 0.00/0.39 (VAR x y) 0.00/0.39 (THEORY 0.00/0.39 (C gcd)) 0.00/0.39 (RULES 0.00/0.39 gcd(0,y) -> y 0.00/0.39 gcd(s(x),0) -> s(x) 0.00/0.39 gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 0.00/0.39 if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) 0.00/0.39 if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) 0.00/0.39 le(0,y) -> true 0.00/0.39 le(s(x),0) -> false 0.00/0.39 le(s(x),s(y)) -> le(x,y) 0.00/0.39 minus(x,0) -> x 0.00/0.39 minus(x,s(y)) -> pred(minus(x,y)) 0.00/0.39 pred(s(x)) -> x 0.00/0.39 ) 0.00/0.39 0.00/0.39 Problem 1: 0.00/0.39 0.00/0.39 Dependency Pairs Processor: 0.00/0.39 -> FAxioms: 0.00/0.39 GCD(x2,x3) = GCD(x3,x2) 0.00/0.39 -> Pairs: 0.00/0.39 GCD(s(x),s(y)) -> IF_GCD(le(y,x),s(x),s(y)) 0.00/0.39 GCD(s(x),s(y)) -> LE(y,x) 0.00/0.39 IF_GCD(false,s(x),s(y)) -> GCD(minus(y,x),s(x)) 0.00/0.39 IF_GCD(false,s(x),s(y)) -> MINUS(y,x) 0.00/0.39 IF_GCD(true,s(x),s(y)) -> GCD(minus(x,y),s(y)) 0.00/0.39 IF_GCD(true,s(x),s(y)) -> MINUS(x,y) 0.00/0.39 LE(s(x),s(y)) -> LE(x,y) 0.00/0.39 MINUS(x,s(y)) -> MINUS(x,y) 0.00/0.39 MINUS(x,s(y)) -> PRED(minus(x,y)) 0.00/0.39 -> EAxioms: 0.00/0.39 gcd(x2,x3) = gcd(x3,x2) 0.00/0.39 -> Rules: 0.00/0.39 gcd(0,y) -> y 0.00/0.39 gcd(s(x),0) -> s(x) 0.00/0.39 gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 0.00/0.39 if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) 0.00/0.39 if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) 0.00/0.39 le(0,y) -> true 0.00/0.39 le(s(x),0) -> false 0.00/0.39 le(s(x),s(y)) -> le(x,y) 0.00/0.39 minus(x,0) -> x 0.00/0.39 minus(x,s(y)) -> pred(minus(x,y)) 0.00/0.39 pred(s(x)) -> x 0.00/0.39 -> SRules: 0.00/0.39 Empty 0.00/0.39 0.00/0.39 Problem 1: 0.00/0.39 0.00/0.39 SCC Processor: 0.00/0.39 -> FAxioms: 0.00/0.39 GCD(x2,x3) = GCD(x3,x2) 0.00/0.39 -> Pairs: 0.00/0.39 GCD(s(x),s(y)) -> IF_GCD(le(y,x),s(x),s(y)) 0.00/0.39 GCD(s(x),s(y)) -> LE(y,x) 0.00/0.39 IF_GCD(false,s(x),s(y)) -> GCD(minus(y,x),s(x)) 0.00/0.39 IF_GCD(false,s(x),s(y)) -> MINUS(y,x) 0.00/0.39 IF_GCD(true,s(x),s(y)) -> GCD(minus(x,y),s(y)) 0.00/0.39 IF_GCD(true,s(x),s(y)) -> MINUS(x,y) 0.00/0.39 LE(s(x),s(y)) -> LE(x,y) 0.00/0.39 MINUS(x,s(y)) -> MINUS(x,y) 0.00/0.39 MINUS(x,s(y)) -> PRED(minus(x,y)) 0.00/0.39 -> EAxioms: 0.00/0.39 gcd(x2,x3) = gcd(x3,x2) 0.00/0.39 -> Rules: 0.00/0.39 gcd(0,y) -> y 0.00/0.39 gcd(s(x),0) -> s(x) 0.00/0.39 gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 0.00/0.39 if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) 0.00/0.39 if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) 0.00/0.39 le(0,y) -> true 0.00/0.39 le(s(x),0) -> false 0.00/0.39 le(s(x),s(y)) -> le(x,y) 0.00/0.39 minus(x,0) -> x 0.00/0.39 minus(x,s(y)) -> pred(minus(x,y)) 0.00/0.39 pred(s(x)) -> x 0.00/0.39 -> SRules: 0.00/0.39 Empty 0.00/0.39 ->Strongly Connected Components: 0.00/0.39 ->->Cycle: 0.00/0.39 ->->-> Pairs: 0.00/0.39 MINUS(x,s(y)) -> MINUS(x,y) 0.00/0.39 -> FAxioms: 0.00/0.39 gcd(x2,x3) -> gcd(x3,x2) 0.00/0.39 -> EAxioms: 0.00/0.39 gcd(x2,x3) = gcd(x3,x2) 0.00/0.39 ->->-> Rules: 0.00/0.39 gcd(0,y) -> y 0.00/0.39 gcd(s(x),0) -> s(x) 0.00/0.39 gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 0.00/0.39 if_gcd(false,s(x),s(y)) -> gcd(minus(y,x),s(x)) 0.00/0.39 if_gcd(true,s(x),s(y)) -> gcd(minus(x,y),s(y)) 0.00/0.39 le(0,y) -> true 0.00/0.39 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 2019-03-21 05.09