Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720832
details
property
value
status
complete
benchmark
z108.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
Zantema_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
6.76503896713 seconds
cpu usage
6.566558066
max memory
3.07765248E8
stage attributes
key
value
output-size
6432
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- rm: cannot remove ‘/tmp/muTerm2142757034116087764.in.dec’: Operation not permitted rm: cannot remove ‘/tmp/muTerm2142757034116087764.in.form’: Operation not permitted YES Problem 1: (VAR x1) (RULES a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(a(x1)) -> B(c(x1)) A(a(x1)) -> C(x1) B(b(x1)) -> C(d(x1)) B(b(x1)) -> D(x1) C(c(x1)) -> D(d(d(x1))) C(c(x1)) -> D(d(x1)) C(c(x1)) -> D(x1) D(d(d(x1))) -> A(c(x1)) D(d(d(x1))) -> C(x1) -> Rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) Problem 1: SCC Processor: -> Pairs: A(a(x1)) -> B(c(x1)) A(a(x1)) -> C(x1) B(b(x1)) -> C(d(x1)) B(b(x1)) -> D(x1) C(c(x1)) -> D(d(d(x1))) C(c(x1)) -> D(d(x1)) C(c(x1)) -> D(x1) D(d(d(x1))) -> A(c(x1)) D(d(d(x1))) -> C(x1) -> Rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(a(x1)) -> B(c(x1)) A(a(x1)) -> C(x1) B(b(x1)) -> C(d(x1)) B(b(x1)) -> D(x1) C(c(x1)) -> D(d(d(x1))) C(c(x1)) -> D(d(x1)) C(c(x1)) -> D(x1) D(d(d(x1))) -> A(c(x1)) D(d(d(x1))) -> C(x1) ->->-> Rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) Problem 1: Reduction Pair Processor: -> Pairs: A(a(x1)) -> B(c(x1)) A(a(x1)) -> C(x1) B(b(x1)) -> C(d(x1)) B(b(x1)) -> D(x1) C(c(x1)) -> D(d(d(x1))) C(c(x1)) -> D(d(x1)) C(c(x1)) -> D(x1) D(d(d(x1))) -> A(c(x1)) D(d(d(x1))) -> C(x1) -> Rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) -> Usable rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) d(d(d(x1))) -> a(c(x1)) ->Interpretation type: Linear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685