Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714230
details
property
value
status
complete
benchmark
z01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
29.9512071609 seconds
cpu usage
29.059902218
max memory
3.8375424E7
stage attributes
key
value
output-size
7975
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(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) ) Problem 1: Innermost Equivalent Processor: -> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,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(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) A(f,a(f,a(g,a(g,x)))) -> A(f,x) A(f,a(f,a(g,a(g,x)))) -> A(g,a(f,a(f,a(f,x)))) A(f,a(f,a(g,a(g,x)))) -> A(g,a(g,a(f,a(f,a(f,x))))) A(f,a(f,a(g,a(g,x)))) -> A(g,a(g,a(g,a(f,a(f,a(f,x)))))) -> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) Problem 1: SCC Processor: -> Pairs: A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) A(f,a(f,a(g,a(g,x)))) -> A(f,x) A(f,a(f,a(g,a(g,x)))) -> A(g,a(f,a(f,a(f,x)))) A(f,a(f,a(g,a(g,x)))) -> A(g,a(g,a(f,a(f,a(f,x))))) A(f,a(f,a(g,a(g,x)))) -> A(g,a(g,a(g,a(f,a(f,a(f,x)))))) -> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) A(f,a(f,a(g,a(g,x)))) -> A(f,x) ->->-> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) Problem 1: Forward Instantiation Processor: -> Pairs: A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) A(f,a(f,a(g,a(g,x)))) -> A(f,x) -> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) ->Instantiated Pairs: ->->Original Pair: A(f,a(f,a(g,a(g,x)))) -> A(f,x) ->-> Instantiated pairs: A(f,a(f,a(g,a(g,a(f,x4))))) -> A(f,a(f,x4)) A(f,a(f,a(g,a(g,a(f,x8))))) -> A(f,a(f,x8)) A(f,a(f,a(g,a(g,a(f,x12))))) -> A(f,a(f,x12)) Problem 1: SCC Processor: -> Pairs: A(f,a(f,a(g,a(g,a(f,x4))))) -> A(f,a(f,x4)) A(f,a(f,a(g,a(g,a(f,x8))))) -> A(f,a(f,x8)) A(f,a(f,a(g,a(g,a(f,x12))))) -> A(f,a(f,x12)) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) -> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(f,a(f,a(g,a(g,a(f,x4))))) -> A(f,a(f,x4)) A(f,a(f,a(g,a(g,a(f,x8))))) -> A(f,a(f,x8)) A(f,a(f,a(g,a(g,a(f,x12))))) -> A(f,a(f,x12)) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,a(f,x))) A(f,a(f,a(g,a(g,x)))) -> A(f,a(f,x)) ->->-> Rules: a(f,a(f,a(g,a(g,x)))) -> a(g,a(g,a(g,a(f,a(f,a(f,x)))))) Problem 1: Narrowing Processor: -> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472