Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710774
details
property
value
status
complete
benchmark
7.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0555729866028 seconds
cpu usage
0.046891819
max memory
3702784.0
stage attributes
key
value
output-size
3229
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 x) (RULES cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(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: COND(true,x) -> COND(odd(x),p(p(p(x)))) COND(true,x) -> ODD(x) COND(true,x) -> P(p(p(x))) COND(true,x) -> P(p(x)) COND(true,x) -> P(x) ODD(s(s(x))) -> ODD(x) -> Rules: cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: COND(true,x) -> COND(odd(x),p(p(p(x)))) COND(true,x) -> ODD(x) COND(true,x) -> P(p(p(x))) COND(true,x) -> P(p(x)) COND(true,x) -> P(x) ODD(s(s(x))) -> ODD(x) -> Rules: cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ODD(s(s(x))) -> ODD(x) ->->-> Rules: cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(s(x)) -> x ->->Cycle: ->->-> Pairs: COND(true,x) -> COND(odd(x),p(p(p(x)))) ->->-> Rules: cond(true,x) -> cond(odd(x),p(p(p(x)))) odd(0) -> false odd(s(0)) -> true odd(s(s(x))) -> odd(x) p(0) -> 0 p(s(x)) -> x The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: ODD(s(s(x))) -> ODD(x) -> Rules: cond(true,x) -> cond(odd(x),p(p(p(x))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472