SRS Standard pair #487083114

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.29944 seconds
cpu usage	0.302707
user time	0.162759
system time	0.139948
max virtual memory	113188.0
max residence set size	6840.0

stage attributes

key	value
starexec-result	YES

output

YES

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

popout

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

job log

popout

actions all output return to SRS Standard