Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712303
details
property
value
status
complete
benchmark
z11.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.92045402527 seconds
cpu usage
1.850782351
max memory
1.1948032E7
stage attributes
key
value
output-size
4630
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 x) (RULES a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: A(d,a(s,x)) -> A(d,a(p,a(s,x))) A(d,a(s,x)) -> A(p,a(s,x)) A(d,a(s,x)) -> A(s,a(d,a(p,a(s,x)))) A(d,a(s,x)) -> A(s,a(s,a(d,a(p,a(s,x))))) A(f,a(s,x)) -> A(d,a(f,a(p,a(s,x)))) A(f,a(s,x)) -> A(f,a(p,a(s,x))) A(f,a(s,x)) -> A(p,a(s,x)) -> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x Problem 1: SCC Processor: -> Pairs: A(d,a(s,x)) -> A(d,a(p,a(s,x))) A(d,a(s,x)) -> A(p,a(s,x)) A(d,a(s,x)) -> A(s,a(d,a(p,a(s,x)))) A(d,a(s,x)) -> A(s,a(s,a(d,a(p,a(s,x))))) A(f,a(s,x)) -> A(d,a(f,a(p,a(s,x)))) A(f,a(s,x)) -> A(f,a(p,a(s,x))) A(f,a(s,x)) -> A(p,a(s,x)) -> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(d,a(s,x)) -> A(d,a(p,a(s,x))) ->->-> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x ->->Cycle: ->->-> Pairs: A(f,a(s,x)) -> A(f,a(p,a(s,x))) ->->-> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x The problem is decomposed in 2 subproblems. Problem 1.1: Narrowing Processor: -> Pairs: A(d,a(s,x)) -> A(d,a(p,a(s,x))) -> Rules: a(d,a(s,x)) -> a(s,a(s,a(d,a(p,a(s,x))))) a(d,0) -> 0 a(f,a(s,x)) -> a(d,a(f,a(p,a(s,x)))) a(f,0) -> a(s,0) a(p,a(s,x)) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472