SRS Standard pair #487091232

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.66285 seconds
cpu usage	4.23728
user time	3.1406
system time	1.09669
max virtual memory	708608.0
max residence set size	8004.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem 1: 

(VAR v_NonEmpty:S x1:S)
(RULES
a(a(x1:S)) -> d(c(x1:S))
a(b(x1:S)) -> c(c(c(x1:S)))
b(b(x1:S)) -> a(c(c(x1:S)))
c(c(x1:S)) -> b(x1:S)
c(d(x1:S)) -> a(a(x1:S))
d(d(x1:S)) -> b(a(c(x1:S)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(a(x1:S)) -> C(x1:S)
 A(a(x1:S)) -> D(c(x1:S))
 A(b(x1:S)) -> C(c(c(x1:S)))
 A(b(x1:S)) -> C(c(x1:S))
 A(b(x1:S)) -> C(x1:S)
 B(b(x1:S)) -> A(c(c(x1:S)))
 B(b(x1:S)) -> C(c(x1:S))
 B(b(x1:S)) -> C(x1:S)
 C(c(x1:S)) -> B(x1:S)
 C(d(x1:S)) -> A(a(x1:S))
 C(d(x1:S)) -> A(x1:S)
 D(d(x1:S)) -> A(c(x1:S))
 D(d(x1:S)) -> B(a(c(x1:S)))
 D(d(x1:S)) -> C(x1:S)
-> Rules:
 a(a(x1:S)) -> d(c(x1:S))
 a(b(x1:S)) -> c(c(c(x1:S)))
 b(b(x1:S)) -> a(c(c(x1:S)))
 c(c(x1:S)) -> b(x1:S)
 c(d(x1:S)) -> a(a(x1:S))
 d(d(x1:S)) -> b(a(c(x1:S)))

Problem 1: 

SCC Processor:
-> Pairs:
 A(a(x1:S)) -> C(x1:S)
 A(a(x1:S)) -> D(c(x1:S))
 A(b(x1:S)) -> C(c(c(x1:S)))
 A(b(x1:S)) -> C(c(x1:S))
 A(b(x1:S)) -> C(x1:S)
 B(b(x1:S)) -> A(c(c(x1:S)))
 B(b(x1:S)) -> C(c(x1:S))
 B(b(x1:S)) -> C(x1:S)
 C(c(x1:S)) -> B(x1:S)
 C(d(x1:S)) -> A(a(x1:S))
 C(d(x1:S)) -> A(x1:S)
 D(d(x1:S)) -> A(c(x1:S))
 D(d(x1:S)) -> B(a(c(x1:S)))
 D(d(x1:S)) -> C(x1:S)
-> Rules:
 a(a(x1:S)) -> d(c(x1:S))
 a(b(x1:S)) -> c(c(c(x1:S)))
 b(b(x1:S)) -> a(c(c(x1:S)))
 c(c(x1:S)) -> b(x1:S)
 c(d(x1:S)) -> a(a(x1:S))
 d(d(x1:S)) -> b(a(c(x1:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(a(x1:S)) -> C(x1:S)
 A(a(x1:S)) -> D(c(x1:S))
 A(b(x1:S)) -> C(c(c(x1:S)))
 A(b(x1:S)) -> C(c(x1:S))
 A(b(x1:S)) -> C(x1:S)
 B(b(x1:S)) -> A(c(c(x1:S)))
 B(b(x1:S)) -> C(c(x1:S))
 B(b(x1:S)) -> C(x1:S)
 C(c(x1:S)) -> B(x1:S)
 C(d(x1:S)) -> A(a(x1:S))
 C(d(x1:S)) -> A(x1:S)
 D(d(x1:S)) -> A(c(x1:S))
 D(d(x1:S)) -> B(a(c(x1:S)))
 D(d(x1:S)) -> C(x1:S)
->->-> Rules:
 a(a(x1:S)) -> d(c(x1:S))
 a(b(x1:S)) -> c(c(c(x1:S)))
 b(b(x1:S)) -> a(c(c(x1:S)))
 c(c(x1:S)) -> b(x1:S)
 c(d(x1:S)) -> a(a(x1:S))
 d(d(x1:S)) -> b(a(c(x1:S)))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 A(a(x1:S)) -> C(x1:S)
 A(a(x1:S)) -> D(c(x1:S))
 A(b(x1:S)) -> C(c(c(x1:S)))
 A(b(x1:S)) -> C(c(x1:S))
 A(b(x1:S)) -> C(x1:S)
 B(b(x1:S)) -> A(c(c(x1:S)))

popout

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

job log

popout

actions all output return to SRS Standard