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