Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733363
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
n084.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0611200332642 seconds
cpu usage
0.048315808
max memory
4145152.0
stage attributes
key
value
output-size
6455
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) (STRATEGY CONTEXTSENSITIVE (div 1) (geq) (if 1) (minus) (0) (false) (s 1) (true) ) (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 context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: 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) GEQ(s(X),s(Y)) -> GEQ(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X 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) -> Unhiding Rules: div(minus(X,Y),s(Y)) -> DIV(minus(X,Y),s(Y)) div(minus(X,Y),s(Y)) -> MINUS(X,Y) s(div(minus(X,Y),s(Y))) -> DIV(minus(X,Y),s(Y)) s(div(minus(X,Y),s(Y))) -> MINUS(X,Y) Problem 1: SCC Processor: -> Pairs: 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) GEQ(s(X),s(Y)) -> GEQ(X,Y) IF(false,X,Y) -> Y IF(true,X,Y) -> X 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) -> Unhiding rules: div(minus(X,Y),s(Y)) -> DIV(minus(X,Y),s(Y)) div(minus(X,Y),s(Y)) -> MINUS(X,Y) s(div(minus(X,Y),s(Y))) -> DIV(minus(X,Y),s(Y)) s(div(minus(X,Y),s(Y))) -> MINUS(X,Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651