Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712660
details
property
value
status
complete
benchmark
Ex49_GM04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0796101093292 seconds
cpu usage
0.030216501
max memory
3465216.0
stage attributes
key
value
output-size
5354
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 Y) (RULES div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0) geq(0,s(Y)) -> false geq(s(X),s(Y)) -> geq(X,Y) geq(X,0) -> true if(false,X,Y) -> Y if(true,X,Y) -> X minus(0,Y) -> 0 minus(s(X),s(Y)) -> minus(X,Y) ) Problem 1: Innermost Equivalent Processor: -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0) geq(0,s(Y)) -> false geq(s(X),s(Y)) -> geq(X,Y) geq(X,0) -> true if(false,X,Y) -> Y if(true,X,Y) -> X minus(0,Y) -> 0 minus(s(X),s(Y)) -> minus(X,Y) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) DIV(s(X),s(Y)) -> GEQ(X,Y) DIV(s(X),s(Y)) -> IF(geq(X,Y),s(div(minus(X,Y),s(Y))),0) DIV(s(X),s(Y)) -> MINUS(X,Y) GEQ(s(X),s(Y)) -> GEQ(X,Y) MINUS(s(X),s(Y)) -> MINUS(X,Y) -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0) geq(0,s(Y)) -> false geq(s(X),s(Y)) -> geq(X,Y) geq(X,0) -> true if(false,X,Y) -> Y if(true,X,Y) -> X minus(0,Y) -> 0 minus(s(X),s(Y)) -> minus(X,Y) Problem 1: SCC Processor: -> Pairs: DIV(s(X),s(Y)) -> DIV(minus(X,Y),s(Y)) DIV(s(X),s(Y)) -> GEQ(X,Y) DIV(s(X),s(Y)) -> IF(geq(X,Y),s(div(minus(X,Y),s(Y))),0) DIV(s(X),s(Y)) -> MINUS(X,Y) GEQ(s(X),s(Y)) -> GEQ(X,Y) MINUS(s(X),s(Y)) -> MINUS(X,Y) -> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0) geq(0,s(Y)) -> false geq(s(X),s(Y)) -> geq(X,Y) geq(X,0) -> true if(false,X,Y) -> Y if(true,X,Y) -> X minus(0,Y) -> 0 minus(s(X),s(Y)) -> minus(X,Y) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(X),s(Y)) -> MINUS(X,Y) ->->-> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0) geq(0,s(Y)) -> false geq(s(X),s(Y)) -> geq(X,Y) geq(X,0) -> true if(false,X,Y) -> Y if(true,X,Y) -> X minus(0,Y) -> 0 minus(s(X),s(Y)) -> minus(X,Y) ->->Cycle: ->->-> Pairs: GEQ(s(X),s(Y)) -> GEQ(X,Y) ->->-> Rules: div(0,s(Y)) -> 0 div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472