TRS Standard pair #487069851

details

property	value
status	complete
benchmark	ExSec11_1_Luc02a_iGM.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n192.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.460092 seconds
cpu usage	0.166483
user time	0.108603
system time	0.05788
max virtual memory	113188.0
max residence set size	9272.0

stage attributes

key	value
starexec-result	YES

output

YES
Input TRS:
      1: active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N))))
      2: active(sqr(0())) -> mark(0())
      3: active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X))))
      4: active(dbl(0())) -> mark(0())
      5: active(dbl(s(X))) -> mark(s(s(dbl(X))))
      6: active(add(0(),X)) -> mark(X)
      7: active(add(s(X),Y)) -> mark(s(add(X,Y)))
      8: active(first(0(),X)) -> mark(nil())
      9: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z)))
      10: active(half(0())) -> mark(0())
      11: active(half(s(0()))) -> mark(0())
      12: active(half(s(s(X)))) -> mark(s(half(X)))
      13: active(half(dbl(X))) -> mark(X)
      14: mark(terms(X)) -> active(terms(mark(X)))
      15: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
      16: mark(recip(X)) -> active(recip(mark(X)))
      17: mark(sqr(X)) -> active(sqr(mark(X)))
      18: mark(s(X)) -> active(s(mark(X)))
      19: mark(0()) -> active(0())
      20: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
      21: mark(dbl(X)) -> active(dbl(mark(X)))
      22: mark(first(X1,X2)) -> active(first(mark(X1),mark(X2)))
      23: mark(nil()) -> active(nil())
      24: mark(half(X)) -> active(half(mark(X)))
      25: terms(mark(X)) -> terms(X)
      26: terms(active(X)) -> terms(X)
      27: cons(mark(X1),X2) -> cons(X1,X2)
      28: cons(X1,mark(X2)) -> cons(X1,X2)
      29: cons(active(X1),X2) -> cons(X1,X2)
      30: cons(X1,active(X2)) -> cons(X1,X2)
      31: recip(mark(X)) -> recip(X)
      32: recip(active(X)) -> recip(X)
      33: sqr(mark(X)) -> sqr(X)
      34: sqr(active(X)) -> sqr(X)
      35: s(mark(X)) -> s(X)
      36: s(active(X)) -> s(X)
      37: add(mark(X1),X2) -> add(X1,X2)
      38: add(X1,mark(X2)) -> add(X1,X2)
      39: add(active(X1),X2) -> add(X1,X2)
      40: add(X1,active(X2)) -> add(X1,X2)
      41: dbl(mark(X)) -> dbl(X)
      42: dbl(active(X)) -> dbl(X)
      43: first(mark(X1),X2) -> first(X1,X2)
      44: first(X1,mark(X2)) -> first(X1,X2)
      45: first(active(X1),X2) -> first(X1,X2)
      46: first(X1,active(X2)) -> first(X1,X2)
      47: half(mark(X)) -> half(X)
      48: half(active(X)) -> half(X)
Number of strict rules: 48
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #active(sqr(0())) -> #mark(0())
     #2: #first(mark(X1),X2) -> #first(X1,X2)
     #3: #cons(active(X1),X2) -> #cons(X1,X2)
     #4: #s(mark(X)) -> #s(X)
     #5: #first(X1,active(X2)) -> #first(X1,X2)
     #6: #dbl(active(X)) -> #dbl(X)
     #7: #dbl(mark(X)) -> #dbl(X)
     #8: #add(mark(X1),X2) -> #add(X1,X2)
     #9: #half(mark(X)) -> #half(X)
     #10: #half(active(X)) -> #half(X)
     #11: #add(X1,mark(X2)) -> #add(X1,X2)
     #12: #active(add(0(),X)) -> #mark(X)
     #13: #add(X1,active(X2)) -> #add(X1,X2)
     #14: #active(half(dbl(X))) -> #mark(X)
     #15: #active(first(s(X),cons(Y,Z))) -> #mark(cons(Y,first(X,Z)))
     #16: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z))
     #17: #active(first(s(X),cons(Y,Z))) -> #first(X,Z)
     #18: #active(half(s(0()))) -> #mark(0())
     #19: #mark(half(X)) -> #active(half(mark(X)))
     #20: #mark(half(X)) -> #half(mark(X))
     #21: #mark(half(X)) -> #mark(X)
     #22: #mark(nil()) -> #active(nil())
     #23: #first(active(X1),X2) -> #first(X1,X2)
     #24: #active(half(s(s(X)))) -> #mark(s(half(X)))
     #25: #active(half(s(s(X)))) -> #s(half(X))
     #26: #active(half(s(s(X)))) -> #half(X)
     #27: #recip(mark(X)) -> #recip(X)
     #28: #mark(terms(X)) -> #active(terms(mark(X)))
     #29: #mark(terms(X)) -> #terms(mark(X))
     #30: #mark(terms(X)) -> #mark(X)
     #31: #cons(X1,active(X2)) -> #cons(X1,X2)
     #32: #terms(mark(X)) -> #terms(X)
     #33: #mark(add(X1,X2)) -> #active(add(mark(X1),mark(X2)))
     #34: #mark(add(X1,X2)) -> #add(mark(X1),mark(X2))
     #35: #mark(add(X1,X2)) -> #mark(X1)
     #36: #mark(add(X1,X2)) -> #mark(X2)
     #37: #active(add(s(X),Y)) -> #mark(s(add(X,Y)))
     #38: #active(add(s(X),Y)) -> #s(add(X,Y))
     #39: #active(add(s(X),Y)) -> #add(X,Y)
     #40: #add(active(X1),X2) -> #add(X1,X2)
     #41: #active(half(0())) -> #mark(0())
     #42: #sqr(mark(X)) -> #sqr(X)
     #43: #active(dbl(s(X))) -> #mark(s(s(dbl(X))))
     #44: #active(dbl(s(X))) -> #s(s(dbl(X)))
     #45: #active(dbl(s(X))) -> #s(dbl(X))
     #46: #active(dbl(s(X))) -> #dbl(X)

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Standard