details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.604017 seconds
cpu usage	0.517884
user time	0.339797
system time	0.178087
max virtual memory	452872.0
max residence set size	5716.0

stage attributes

key	value
starexec-result	YES

output

0.41/0.60 YES 0.41/0.60 0.41/0.60 Problem 1: 0.41/0.60 0.41/0.60 (VAR v_NonEmpty:S x1:S) 0.41/0.60 (RULES 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 ) 0.41/0.60 0.41/0.60 Problem 1: 0.41/0.60 0.41/0.60 Dependency Pairs Processor: 0.41/0.60 -> Pairs: 0.41/0.60 A(d(x1:S)) -> B(x1:S) 0.41/0.60 A(x1:S) -> B(b(b(x1:S))) 0.41/0.60 A(x1:S) -> B(b(x1:S)) 0.41/0.60 A(x1:S) -> B(x1:S) 0.41/0.60 B(d(b(x1:S))) -> A(c(x1:S)) 0.41/0.60 B(d(b(x1:S))) -> C(x1:S) 0.41/0.60 -> Rules: 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 0.41/0.60 Problem 1: 0.41/0.60 0.41/0.60 SCC Processor: 0.41/0.60 -> Pairs: 0.41/0.60 A(d(x1:S)) -> B(x1:S) 0.41/0.60 A(x1:S) -> B(b(b(x1:S))) 0.41/0.60 A(x1:S) -> B(b(x1:S)) 0.41/0.60 A(x1:S) -> B(x1:S) 0.41/0.60 B(d(b(x1:S))) -> A(c(x1:S)) 0.41/0.60 B(d(b(x1:S))) -> C(x1:S) 0.41/0.60 -> Rules: 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 ->Strongly Connected Components: 0.41/0.60 ->->Cycle: 0.41/0.60 ->->-> Pairs: 0.41/0.60 A(d(x1:S)) -> B(x1:S) 0.41/0.60 A(x1:S) -> B(b(b(x1:S))) 0.41/0.60 A(x1:S) -> B(b(x1:S)) 0.41/0.60 A(x1:S) -> B(x1:S) 0.41/0.60 B(d(b(x1:S))) -> A(c(x1:S)) 0.41/0.60 ->->-> Rules: 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 0.41/0.60 Problem 1: 0.41/0.60 0.41/0.60 Reduction Pair Processor: 0.41/0.60 -> Pairs: 0.41/0.60 A(d(x1:S)) -> B(x1:S) 0.41/0.60 A(x1:S) -> B(b(b(x1:S))) 0.41/0.60 A(x1:S) -> B(b(x1:S)) 0.41/0.60 A(x1:S) -> B(x1:S) 0.41/0.60 B(d(b(x1:S))) -> A(c(x1:S)) 0.41/0.60 -> Rules: 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 -> Usable rules: 0.41/0.60 a(d(x1:S)) -> d(b(x1:S)) 0.41/0.60 a(x1:S) -> b(b(b(x1:S))) 0.41/0.60 b(d(b(x1:S))) -> a(c(x1:S)) 0.41/0.60 c(x1:S) -> d(x1:S) 0.41/0.60 ->Interpretation type: 0.41/0.60 Linear 0.41/0.60 ->Coefficients: 0.41/0.60 Natural Numbers 0.41/0.60 ->Dimension: 0.41/0.60 1 0.41/0.60 ->Bound: 0.41/0.60 2 0.41/0.60 ->Interpretation: 0.41/0.60 0.41/0.60 [a](X) = X 0.41/0.60 [b](X) = X 0.41/0.60 [c](X) = X + 2 0.41/0.60 [d](X) = X + 2 0.41/0.60 [A](X) = X + 1 0.41/0.60 [B](X) = X + 1 0.41/0.60 0.41/0.60 Problem 1: 0.41/0.60 0.41/0.60 SCC Processor: 0.41/0.60 -> Pairs: 0.41/0.60 A(x1:S) -> B(b(b(x1:S))) 0.41/0.60 A(x1:S) -> B(b(x1:S)) 0.41/0.60 A(x1:S) -> B(x1:S) popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29