Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711268
details
property
value
status
complete
benchmark
fact-hard.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
8.89366698265 seconds
cpu usage
4.56676857
max memory
1.1472896E7
stage attributes
key
value
output-size
11608
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 y) (RULES *(x,0) -> 0 *(x,s(y)) -> +(*(x,y),x) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) -(s(x),s(y)) -> -(x,y) -(x,0) -> x fact(x) -> iffact(x,ge(x,s(s(0)))) ge(0,s(y)) -> false ge(s(x),s(y)) -> ge(x,y) ge(x,0) -> true iffact(x,false) -> s(0) iffact(x,true) -> *(x,fact(-(x,s(0)))) ) Problem 1: Innermost Equivalent Processor: -> Rules: *(x,0) -> 0 *(x,s(y)) -> +(*(x,y),x) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) -(s(x),s(y)) -> -(x,y) -(x,0) -> x fact(x) -> iffact(x,ge(x,s(s(0)))) ge(0,s(y)) -> false ge(s(x),s(y)) -> ge(x,y) ge(x,0) -> true iffact(x,false) -> s(0) iffact(x,true) -> *(x,fact(-(x,s(0)))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: *#(x,s(y)) -> *#(x,y) *#(x,s(y)) -> +#(*(x,y),x) +#(x,s(y)) -> +#(x,y) -#(s(x),s(y)) -> -#(x,y) FACT(x) -> GE(x,s(s(0))) FACT(x) -> IFFACT(x,ge(x,s(s(0)))) GE(s(x),s(y)) -> GE(x,y) IFFACT(x,true) -> *#(x,fact(-(x,s(0)))) IFFACT(x,true) -> -#(x,s(0)) IFFACT(x,true) -> FACT(-(x,s(0))) -> Rules: *(x,0) -> 0 *(x,s(y)) -> +(*(x,y),x) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) -(s(x),s(y)) -> -(x,y) -(x,0) -> x fact(x) -> iffact(x,ge(x,s(s(0)))) ge(0,s(y)) -> false ge(s(x),s(y)) -> ge(x,y) ge(x,0) -> true iffact(x,false) -> s(0) iffact(x,true) -> *(x,fact(-(x,s(0)))) Problem 1: SCC Processor: -> Pairs: *#(x,s(y)) -> *#(x,y) *#(x,s(y)) -> +#(*(x,y),x) +#(x,s(y)) -> +#(x,y) -#(s(x),s(y)) -> -#(x,y) FACT(x) -> GE(x,s(s(0))) FACT(x) -> IFFACT(x,ge(x,s(s(0)))) GE(s(x),s(y)) -> GE(x,y) IFFACT(x,true) -> *#(x,fact(-(x,s(0)))) IFFACT(x,true) -> -#(x,s(0)) IFFACT(x,true) -> FACT(-(x,s(0))) -> Rules: *(x,0) -> 0 *(x,s(y)) -> +(*(x,y),x) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) -(s(x),s(y)) -> -(x,y) -(x,0) -> x fact(x) -> iffact(x,ge(x,s(s(0)))) ge(0,s(y)) -> false ge(s(x),s(y)) -> ge(x,y) ge(x,0) -> true iffact(x,false) -> s(0) iffact(x,true) -> *(x,fact(-(x,s(0))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472