Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Condi 20667 pair #381732995
details
property
value
status
complete
benchmark
361.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
5.57118988037 seconds
cpu usage
4.701706528
max memory
6.397952E7
stage attributes
key
value
output-size
5741
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR q r x y) (RULES div(x,y) -> pair(0,y) | greater(y,x) -> true div(x,y) -> pair(s(q),r) | leq(y,x) -> true, div(m(x,y),y) -> pair(q,r) greater(s(x),0) -> true greater(s(x),s(y)) -> greater(x,y) leq(0,x) -> true leq(s(x),s(y)) -> leq(x,y) m(0,y) -> 0 m(s(x),s(y)) -> m(x,y) m(x,0) -> x ) Problem 1: Valid CTRS Processor: -> Rules: div(x,y) -> pair(0,y) | greater(y,x) -> true div(x,y) -> pair(s(q),r) | leq(y,x) -> true, div(m(x,y),y) -> pair(q,r) greater(s(x),0) -> true greater(s(x),s(y)) -> greater(x,y) leq(0,x) -> true leq(s(x),s(y)) -> leq(x,y) m(0,y) -> 0 m(s(x),s(y)) -> m(x,y) m(x,0) -> x -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: GREATER(s(x),s(y)) -> GREATER(x,y) LEQ(s(x),s(y)) -> LEQ(x,y) M(s(x),s(y)) -> M(x,y) -> QPairs: Empty -> Rules: div(x,y) -> pair(0,y) | greater(y,x) -> true div(x,y) -> pair(s(q),r) | leq(y,x) -> true, div(m(x,y),y) -> pair(q,r) greater(s(x),0) -> true greater(s(x),s(y)) -> greater(x,y) leq(0,x) -> true leq(s(x),s(y)) -> leq(x,y) m(0,y) -> 0 m(s(x),s(y)) -> m(x,y) m(x,0) -> x Conditional Termination Problem 2: -> Pairs: DIV(x,y) -> DIV(m(x,y),y) | leq(y,x) -> true DIV(x,y) -> GREATER(y,x) DIV(x,y) -> LEQ(y,x) DIV(x,y) -> M(x,y) | leq(y,x) -> true -> QPairs: GREATER(s(x),s(y)) -> GREATER(x,y) LEQ(s(x),s(y)) -> LEQ(x,y) M(s(x),s(y)) -> M(x,y) -> Rules: div(x,y) -> pair(0,y) | greater(y,x) -> true div(x,y) -> pair(s(q),r) | leq(y,x) -> true, div(m(x,y),y) -> pair(q,r) greater(s(x),0) -> true greater(s(x),s(y)) -> greater(x,y) leq(0,x) -> true leq(s(x),s(y)) -> leq(x,y) m(0,y) -> 0 m(s(x),s(y)) -> m(x,y) m(x,0) -> x Problem 1: SCC Processor: -> Pairs: DIV(x,y) -> DIV(m(x,y),y) | leq(y,x) -> true DIV(x,y) -> GREATER(y,x) DIV(x,y) -> LEQ(y,x) DIV(x,y) -> M(x,y) | leq(y,x) -> true -> QPairs: GREATER(s(x),s(y)) -> GREATER(x,y) LEQ(s(x),s(y)) -> LEQ(x,y) M(s(x),s(y)) -> M(x,y) -> Rules: div(x,y) -> pair(0,y) | greater(y,x) -> true div(x,y) -> pair(s(q),r) | leq(y,x) -> true, div(m(x,y),y) -> pair(q,r) greater(s(x),0) -> true greater(s(x),s(y)) -> greater(x,y) leq(0,x) -> true leq(s(x),s(y)) -> leq(x,y) m(0,y) -> 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Condi 20667