Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381717712
details
property
value
status
complete
benchmark
beans2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.114473819733 seconds
cpu usage
0.092453472
max memory
4034560.0
stage attributes
key
value
output-size
4953
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 L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) ) Problem 1: Dependency Pairs Processor: -> Pairs: L#(a(a(x1))) -> L#(a(b(c(x1)))) L#(a(a(x1))) -> B(c(x1)) L#(a(a(x1))) -> C(x1) B(a(a(x1))) -> B(c(x1)) B(a(a(x1))) -> C(x1) C(b(x1)) -> B(a(x1)) C(a(x1)) -> C(x1) -> Rules: L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) Problem 1: SCC Processor: -> Pairs: L#(a(a(x1))) -> L#(a(b(c(x1)))) L#(a(a(x1))) -> B(c(x1)) L#(a(a(x1))) -> C(x1) B(a(a(x1))) -> B(c(x1)) B(a(a(x1))) -> C(x1) C(b(x1)) -> B(a(x1)) C(a(x1)) -> C(x1) -> Rules: L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(a(a(x1))) -> B(c(x1)) B(a(a(x1))) -> C(x1) C(b(x1)) -> B(a(x1)) C(a(x1)) -> C(x1) ->->-> Rules: L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) ->->Cycle: ->->-> Pairs: L#(a(a(x1))) -> L#(a(b(c(x1)))) ->->-> Rules: L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: B(a(a(x1))) -> B(c(x1)) B(a(a(x1))) -> C(x1) C(b(x1)) -> B(a(x1)) C(a(x1)) -> C(x1) -> Rules: L(a(a(x1))) -> L(a(b(c(x1)))) b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) -> Usable rules: b(a(a(x1))) -> a(b(c(x1))) c(b(x1)) -> b(a(x1)) c(R(x1)) -> b(a(R(x1))) c(a(x1)) -> a(c(x1)) ->Interpretation type:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685