Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487511275
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
n112.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.13715004921 seconds
cpu usage
0.099841723
max memory
3960832.0
stage attributes
key
value
output-size
5445
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: L#(a(a(x1:S))) -> L#(a(b(c(x1:S)))) L#(a(a(x1:S))) -> B(c(x1:S)) L#(a(a(x1:S))) -> C(x1:S) B(a(a(x1:S))) -> B(c(x1:S)) B(a(a(x1:S))) -> C(x1:S) C(b(x1:S)) -> B(a(x1:S)) C(a(x1:S)) -> C(x1:S) -> Rules: L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) Problem 1: SCC Processor: -> Pairs: L#(a(a(x1:S))) -> L#(a(b(c(x1:S)))) L#(a(a(x1:S))) -> B(c(x1:S)) L#(a(a(x1:S))) -> C(x1:S) B(a(a(x1:S))) -> B(c(x1:S)) B(a(a(x1:S))) -> C(x1:S) C(b(x1:S)) -> B(a(x1:S)) C(a(x1:S)) -> C(x1:S) -> Rules: L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(a(a(x1:S))) -> B(c(x1:S)) B(a(a(x1:S))) -> C(x1:S) C(b(x1:S)) -> B(a(x1:S)) C(a(x1:S)) -> C(x1:S) ->->-> Rules: L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) ->->Cycle: ->->-> Pairs: L#(a(a(x1:S))) -> L#(a(b(c(x1:S)))) ->->-> Rules: L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: B(a(a(x1:S))) -> B(c(x1:S)) B(a(a(x1:S))) -> C(x1:S) C(b(x1:S)) -> B(a(x1:S)) C(a(x1:S)) -> C(x1:S) -> Rules: L(a(a(x1:S))) -> L(a(b(c(x1:S)))) b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) -> Usable rules: b(a(a(x1:S))) -> a(b(c(x1:S))) c(b(x1:S)) -> b(a(x1:S)) c(R(x1:S)) -> b(a(R(x1:S))) c(a(x1:S)) -> a(c(x1:S)) ->Interpretation type:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard