Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516968796
details
property
value
status
complete
benchmark
z118.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n120.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
1.69966602325 seconds
cpu usage
1.461496672
max memory
6975488.0
stage attributes
key
value
output-size
6958
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 v_NonEmpty:S x1:S) (RULES a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(b(b(x1:S))) -> C(d(c(x1:S))) B(b(b(x1:S))) -> C(x1:S) B(b(x1:S)) -> A(g(g(x1:S))) B(b(x1:S)) -> G(g(x1:S)) B(b(x1:S)) -> G(x1:S) C(d(x1:S)) -> G(g(x1:S)) C(d(x1:S)) -> G(x1:S) G(g(g(x1:S))) -> B(b(x1:S)) G(g(g(x1:S))) -> B(x1:S) -> Rules: a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S)) Problem 1: SCC Processor: -> Pairs: B(b(b(x1:S))) -> C(d(c(x1:S))) B(b(b(x1:S))) -> C(x1:S) B(b(x1:S)) -> A(g(g(x1:S))) B(b(x1:S)) -> G(g(x1:S)) B(b(x1:S)) -> G(x1:S) C(d(x1:S)) -> G(g(x1:S)) C(d(x1:S)) -> G(x1:S) G(g(g(x1:S))) -> B(b(x1:S)) G(g(g(x1:S))) -> B(x1:S) -> Rules: a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(b(b(x1:S))) -> C(d(c(x1:S))) B(b(b(x1:S))) -> C(x1:S) B(b(x1:S)) -> G(g(x1:S)) B(b(x1:S)) -> G(x1:S) C(d(x1:S)) -> G(g(x1:S)) C(d(x1:S)) -> G(x1:S) G(g(g(x1:S))) -> B(b(x1:S)) G(g(g(x1:S))) -> B(x1:S) ->->-> Rules: a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: B(b(b(x1:S))) -> C(d(c(x1:S))) B(b(b(x1:S))) -> C(x1:S) B(b(x1:S)) -> G(g(x1:S)) B(b(x1:S)) -> G(x1:S) C(d(x1:S)) -> G(g(x1:S)) C(d(x1:S)) -> G(x1:S) G(g(g(x1:S))) -> B(b(x1:S)) G(g(g(x1:S))) -> B(x1:S) -> Rules: a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S)) -> Usable rules: a(x1:S) -> g(d(x1:S)) b(b(b(x1:S))) -> c(d(c(x1:S))) b(b(x1:S)) -> a(g(g(x1:S))) c(d(x1:S)) -> g(g(x1:S)) g(g(g(x1:S))) -> b(b(x1:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard