details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.123393 seconds
cpu usage	0.111064
user time	0.053121
system time	0.057943
max virtual memory	113176.0
max residence set size	5632.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.12 YES 0.00/0.12 0.00/0.12 Problem 1: 0.00/0.12 0.00/0.12 (VAR v_NonEmpty:S x1:S) 0.00/0.12 (RULES 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> x1:S 0.00/0.12 ) 0.00/0.12 0.00/0.12 Problem 1: 0.00/0.12 0.00/0.12 Dependency Pairs Processor: 0.00/0.12 -> Pairs: 0.00/0.12 A(s(x1:S)) -> B(p(p(s(s(x1:S))))) 0.00/0.12 A(s(x1:S)) -> P(p(s(s(x1:S)))) 0.00/0.12 A(s(x1:S)) -> P(s(b(p(p(s(s(x1:S))))))) 0.00/0.12 A(s(x1:S)) -> P(s(s(x1:S))) 0.00/0.12 B(s(x1:S)) -> C(p(s(p(s(x1:S))))) 0.00/0.12 B(s(x1:S)) -> P(p(s(s(c(p(s(p(s(x1:S))))))))) 0.00/0.12 B(s(x1:S)) -> P(s(p(s(x1:S)))) 0.00/0.12 B(s(x1:S)) -> P(s(s(c(p(s(p(s(x1:S)))))))) 0.00/0.12 B(s(x1:S)) -> P(s(x1:S)) 0.00/0.12 C(s(x1:S)) -> A(p(s(p(s(x1:S))))) 0.00/0.12 C(s(x1:S)) -> P(s(a(p(s(p(s(x1:S))))))) 0.00/0.12 C(s(x1:S)) -> P(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 C(s(x1:S)) -> P(s(p(s(x1:S)))) 0.00/0.12 C(s(x1:S)) -> P(s(x1:S)) 0.00/0.12 P(p(s(x1:S))) -> P(x1:S) 0.00/0.12 -> Rules: 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> x1:S 0.00/0.12 0.00/0.12 Problem 1: 0.00/0.12 0.00/0.12 SCC Processor: 0.00/0.12 -> Pairs: 0.00/0.12 A(s(x1:S)) -> B(p(p(s(s(x1:S))))) 0.00/0.12 A(s(x1:S)) -> P(p(s(s(x1:S)))) 0.00/0.12 A(s(x1:S)) -> P(s(b(p(p(s(s(x1:S))))))) 0.00/0.12 A(s(x1:S)) -> P(s(s(x1:S))) 0.00/0.12 B(s(x1:S)) -> C(p(s(p(s(x1:S))))) 0.00/0.12 B(s(x1:S)) -> P(p(s(s(c(p(s(p(s(x1:S))))))))) 0.00/0.12 B(s(x1:S)) -> P(s(p(s(x1:S)))) 0.00/0.12 B(s(x1:S)) -> P(s(s(c(p(s(p(s(x1:S)))))))) 0.00/0.12 B(s(x1:S)) -> P(s(x1:S)) 0.00/0.12 C(s(x1:S)) -> A(p(s(p(s(x1:S))))) 0.00/0.12 C(s(x1:S)) -> P(s(a(p(s(p(s(x1:S))))))) 0.00/0.12 C(s(x1:S)) -> P(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 C(s(x1:S)) -> P(s(p(s(x1:S)))) 0.00/0.12 C(s(x1:S)) -> P(s(x1:S)) 0.00/0.12 P(p(s(x1:S))) -> P(x1:S) 0.00/0.12 -> Rules: 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> x1:S 0.00/0.12 ->Strongly Connected Components: 0.00/0.12 ->->Cycle: 0.00/0.12 ->->-> Pairs: 0.00/0.12 P(p(s(x1:S))) -> P(x1:S) 0.00/0.12 ->->-> Rules: 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> x1:S 0.00/0.12 ->->Cycle: 0.00/0.12 ->->-> Pairs: 0.00/0.12 A(s(x1:S)) -> B(p(p(s(s(x1:S))))) 0.00/0.12 B(s(x1:S)) -> C(p(s(p(s(x1:S))))) 0.00/0.12 C(s(x1:S)) -> A(p(s(p(s(x1:S))))) 0.00/0.12 ->->-> Rules: 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> x1:S 0.00/0.12 0.00/0.12 0.00/0.12 The problem is decomposed in 2 subproblems. 0.00/0.12 0.00/0.12 Problem 1.1: 0.00/0.12 0.00/0.12 Subterm Processor: 0.00/0.12 -> Pairs: 0.00/0.12 P(p(s(x1:S))) -> P(x1:S) 0.00/0.12 -> Rules: 0.00/0.12 a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) 0.00/0.12 b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) 0.00/0.12 c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) 0.00/0.12 p(p(s(x1:S))) -> p(x1:S) 0.00/0.12 p(s(x1:S)) -> 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