Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718447
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
n072.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.855610847473 seconds
cpu usage
0.822638973
max memory
8482816.0
stage attributes
key
value
output-size
10591
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x1) (RULES f(s(x1)) -> p(s(g(p(s(s(x1)))))) g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1))))))))))) half(0(x1)) -> 0(s(s(half(p(s(p(s(x1)))))))) half(s(s(x1))) -> s(half(p(p(s(s(x1)))))) j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1))))))))))) p(p(s(x1))) -> p(x1) p(0(x1)) -> 0(s(s(p(x1)))) p(s(x1)) -> x1 rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1))))))))) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(s(x1)) -> G(p(s(s(x1)))) F(s(x1)) -> P(s(g(p(s(s(x1)))))) F(s(x1)) -> P(s(s(x1))) G(s(x1)) -> J(s(p(s(p(s(x1)))))) G(s(x1)) -> P(p(s(s(s(j(s(p(s(p(s(x1))))))))))) G(s(x1)) -> P(s(p(s(x1)))) G(s(x1)) -> P(s(s(s(j(s(p(s(p(s(x1)))))))))) G(s(x1)) -> P(s(x1)) HALF(0(x1)) -> HALF(p(s(p(s(x1))))) HALF(0(x1)) -> P(s(p(s(x1)))) HALF(0(x1)) -> P(s(x1)) HALF(s(s(x1))) -> HALF(p(p(s(s(x1))))) HALF(s(s(x1))) -> P(p(s(s(x1)))) HALF(s(s(x1))) -> P(s(s(x1))) J(s(x1)) -> F(p(s(p(p(s(x1)))))) J(s(x1)) -> P(p(s(x1))) J(s(x1)) -> P(s(f(p(s(p(p(s(x1)))))))) J(s(x1)) -> P(s(p(p(s(x1))))) J(s(x1)) -> P(s(s(p(s(f(p(s(p(p(s(x1))))))))))) J(s(x1)) -> P(s(x1)) P(p(s(x1))) -> P(x1) P(0(x1)) -> P(x1) RD(0(x1)) -> RD(x1) -> Rules: f(s(x1)) -> p(s(g(p(s(s(x1)))))) g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1))))))))))) half(0(x1)) -> 0(s(s(half(p(s(p(s(x1)))))))) half(s(s(x1))) -> s(half(p(p(s(s(x1)))))) j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1))))))))))) p(p(s(x1))) -> p(x1) p(0(x1)) -> 0(s(s(p(x1)))) p(s(x1)) -> x1 rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1))))))))) Problem 1: SCC Processor: -> Pairs: F(s(x1)) -> G(p(s(s(x1)))) F(s(x1)) -> P(s(g(p(s(s(x1)))))) F(s(x1)) -> P(s(s(x1))) G(s(x1)) -> J(s(p(s(p(s(x1)))))) G(s(x1)) -> P(p(s(s(s(j(s(p(s(p(s(x1))))))))))) G(s(x1)) -> P(s(p(s(x1)))) G(s(x1)) -> P(s(s(s(j(s(p(s(p(s(x1)))))))))) G(s(x1)) -> P(s(x1)) HALF(0(x1)) -> HALF(p(s(p(s(x1))))) HALF(0(x1)) -> P(s(p(s(x1)))) HALF(0(x1)) -> P(s(x1)) HALF(s(s(x1))) -> HALF(p(p(s(s(x1))))) HALF(s(s(x1))) -> P(p(s(s(x1)))) HALF(s(s(x1))) -> P(s(s(x1))) J(s(x1)) -> F(p(s(p(p(s(x1)))))) J(s(x1)) -> P(p(s(x1))) J(s(x1)) -> P(s(f(p(s(p(p(s(x1)))))))) J(s(x1)) -> P(s(p(p(s(x1))))) J(s(x1)) -> P(s(s(p(s(f(p(s(p(p(s(x1))))))))))) J(s(x1)) -> P(s(x1)) P(p(s(x1))) -> P(x1) P(0(x1)) -> P(x1) RD(0(x1)) -> RD(x1) -> Rules: f(s(x1)) -> p(s(g(p(s(s(x1)))))) g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1))))))))))) half(0(x1)) -> 0(s(s(half(p(s(p(s(x1)))))))) half(s(s(x1))) -> s(half(p(p(s(s(x1)))))) j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1))))))))))) p(p(s(x1))) -> p(x1) p(0(x1)) -> 0(s(s(p(x1)))) p(s(x1)) -> x1 rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1))))))))) ->Strongly Connected Components: ->->Cycle:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685