Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487091016
details
property
value
status
complete
benchmark
aprove01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.753004 seconds
cpu usage
0.708045
user time
0.583921
system time
0.124124
max virtual memory
709572.0
max residence set size
6448.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES f(s(x1:S)) -> p(s(g(p(s(s(x1:S)))))) g(s(x1:S)) -> p(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) half(0(x1:S)) -> 0(s(s(half(p(s(p(s(x1:S)))))))) half(s(s(x1:S))) -> s(half(p(p(s(s(x1:S)))))) j(s(x1:S)) -> p(s(s(p(s(f(p(s(p(p(s(x1:S))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(p(x1:S)))) p(s(x1:S)) -> x1:S rd(0(x1:S)) -> 0(s(0(0(0(0(s(0(rd(x1:S))))))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(s(x1:S)) -> G(p(s(s(x1:S)))) F(s(x1:S)) -> P(s(g(p(s(s(x1:S)))))) F(s(x1:S)) -> P(s(s(x1:S))) G(s(x1:S)) -> J(s(p(s(p(s(x1:S)))))) G(s(x1:S)) -> P(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) G(s(x1:S)) -> P(s(p(s(x1:S)))) G(s(x1:S)) -> P(s(s(s(j(s(p(s(p(s(x1:S)))))))))) G(s(x1:S)) -> P(s(x1:S)) HALF(0(x1:S)) -> HALF(p(s(p(s(x1:S))))) HALF(0(x1:S)) -> P(s(p(s(x1:S)))) HALF(0(x1:S)) -> P(s(x1:S)) HALF(s(s(x1:S))) -> HALF(p(p(s(s(x1:S))))) HALF(s(s(x1:S))) -> P(p(s(s(x1:S)))) HALF(s(s(x1:S))) -> P(s(s(x1:S))) J(s(x1:S)) -> F(p(s(p(p(s(x1:S)))))) J(s(x1:S)) -> P(p(s(x1:S))) J(s(x1:S)) -> P(s(f(p(s(p(p(s(x1:S)))))))) J(s(x1:S)) -> P(s(p(p(s(x1:S))))) J(s(x1:S)) -> P(s(s(p(s(f(p(s(p(p(s(x1:S))))))))))) J(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) P(0(x1:S)) -> P(x1:S) RD(0(x1:S)) -> RD(x1:S) -> Rules: f(s(x1:S)) -> p(s(g(p(s(s(x1:S)))))) g(s(x1:S)) -> p(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) half(0(x1:S)) -> 0(s(s(half(p(s(p(s(x1:S)))))))) half(s(s(x1:S))) -> s(half(p(p(s(s(x1:S)))))) j(s(x1:S)) -> p(s(s(p(s(f(p(s(p(p(s(x1:S))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(p(x1:S)))) p(s(x1:S)) -> x1:S rd(0(x1:S)) -> 0(s(0(0(0(0(s(0(rd(x1:S))))))))) Problem 1: SCC Processor: -> Pairs: F(s(x1:S)) -> G(p(s(s(x1:S)))) F(s(x1:S)) -> P(s(g(p(s(s(x1:S)))))) F(s(x1:S)) -> P(s(s(x1:S))) G(s(x1:S)) -> J(s(p(s(p(s(x1:S)))))) G(s(x1:S)) -> P(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) G(s(x1:S)) -> P(s(p(s(x1:S)))) G(s(x1:S)) -> P(s(s(s(j(s(p(s(p(s(x1:S)))))))))) G(s(x1:S)) -> P(s(x1:S)) HALF(0(x1:S)) -> HALF(p(s(p(s(x1:S))))) HALF(0(x1:S)) -> P(s(p(s(x1:S)))) HALF(0(x1:S)) -> P(s(x1:S)) HALF(s(s(x1:S))) -> HALF(p(p(s(s(x1:S))))) HALF(s(s(x1:S))) -> P(p(s(s(x1:S)))) HALF(s(s(x1:S))) -> P(s(s(x1:S))) J(s(x1:S)) -> F(p(s(p(p(s(x1:S)))))) J(s(x1:S)) -> P(p(s(x1:S))) J(s(x1:S)) -> P(s(f(p(s(p(p(s(x1:S)))))))) J(s(x1:S)) -> P(s(p(p(s(x1:S))))) J(s(x1:S)) -> P(s(s(p(s(f(p(s(p(p(s(x1:S))))))))))) J(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) P(0(x1:S)) -> P(x1:S) RD(0(x1:S)) -> RD(x1:S) -> Rules: f(s(x1:S)) -> p(s(g(p(s(s(x1:S)))))) g(s(x1:S)) -> p(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) half(0(x1:S)) -> 0(s(s(half(p(s(p(s(x1:S)))))))) half(s(s(x1:S))) -> s(half(p(p(s(s(x1:S)))))) j(s(x1:S)) -> p(s(s(p(s(f(p(s(p(p(s(x1:S))))))))))) p(p(s(x1:S))) -> p(x1:S) p(0(x1:S)) -> 0(s(s(p(x1:S)))) p(s(x1:S)) -> x1:S rd(0(x1:S)) -> 0(s(0(0(0(0(s(0(rd(x1:S))))))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: RD(0(x1:S)) -> RD(x1:S) ->->-> Rules: f(s(x1:S)) -> p(s(g(p(s(s(x1:S)))))) g(s(x1:S)) -> p(p(s(s(s(j(s(p(s(p(s(x1:S))))))))))) half(0(x1:S)) -> 0(s(s(half(p(s(p(s(x1:S))))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard