Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709933
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.140622854233 seconds
cpu usage
0.118484592
max memory
4460544.0
stage attributes
key
value
output-size
7658
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 cond1(true,x) -> cond2(even(x),x) cond2(false,x) -> cond1(neq(x,0),p(x)) cond2(true,x) -> cond1(neq(x,0),div2(x)) div2(0) -> 0 div2(s(0)) -> 0 div2(s(s(x))) -> s(div2(x)) even(0) -> true even(s(0)) -> false even(s(s(x))) -> even(x) neq(0,0) -> false neq(0,s(x)) -> true neq(s(x),0) -> true neq(s(x),s(y)) -> neq(x,y) p(0) -> 0 p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: cond1(true,x) -> cond2(even(x),x) cond2(false,x) -> cond1(neq(x,0),p(x)) cond2(true,x) -> cond1(neq(x,0),div2(x)) div2(0) -> 0 div2(s(0)) -> 0 div2(s(s(x))) -> s(div2(x)) even(0) -> true even(s(0)) -> false even(s(s(x))) -> even(x) neq(0,0) -> false neq(0,s(x)) -> true neq(s(x),0) -> true neq(s(x),s(y)) -> neq(x,y) 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: COND1(true,x) -> COND2(even(x),x) COND1(true,x) -> EVEN(x) COND2(false,x) -> COND1(neq(x,0),p(x)) COND2(false,x) -> NEQ(x,0) COND2(false,x) -> P(x) COND2(true,x) -> COND1(neq(x,0),div2(x)) COND2(true,x) -> DIV2(x) COND2(true,x) -> NEQ(x,0) DIV2(s(s(x))) -> DIV2(x) EVEN(s(s(x))) -> EVEN(x) -> Rules: cond1(true,x) -> cond2(even(x),x) cond2(false,x) -> cond1(neq(x,0),p(x)) cond2(true,x) -> cond1(neq(x,0),div2(x)) div2(0) -> 0 div2(s(0)) -> 0 div2(s(s(x))) -> s(div2(x)) even(0) -> true even(s(0)) -> false even(s(s(x))) -> even(x) neq(0,0) -> false neq(0,s(x)) -> true neq(s(x),0) -> true neq(s(x),s(y)) -> neq(x,y) p(0) -> 0 p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: COND1(true,x) -> COND2(even(x),x) COND1(true,x) -> EVEN(x) COND2(false,x) -> COND1(neq(x,0),p(x)) COND2(false,x) -> NEQ(x,0) COND2(false,x) -> P(x) COND2(true,x) -> COND1(neq(x,0),div2(x)) COND2(true,x) -> DIV2(x) COND2(true,x) -> NEQ(x,0) DIV2(s(s(x))) -> DIV2(x) EVEN(s(s(x))) -> EVEN(x) -> Rules: cond1(true,x) -> cond2(even(x),x) cond2(false,x) -> cond1(neq(x,0),p(x)) cond2(true,x) -> cond1(neq(x,0),div2(x))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472