TRS Stand 20472 pair #381715793

details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	1.67628002167 seconds
cpu usage	2.014786885
max memory	5.3215232E7

stage attributes

key	value
output-size	24720
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
Input TRS:
    1: active(from(X)) -> mark(cons(X,from(s(X))))
    2: active(2ndspos(0(),Z)) -> mark(rnil())
    3: active(2ndspos(s(N),cons(X,cons(Y,Z)))) -> mark(rcons(posrecip(Y),2ndsneg(N,Z)))
    4: active(2ndsneg(0(),Z)) -> mark(rnil())
    5: active(2ndsneg(s(N),cons(X,cons(Y,Z)))) -> mark(rcons(negrecip(Y),2ndspos(N,Z)))
    6: active(pi(X)) -> mark(2ndspos(X,from(0())))
    7: active(plus(0(),Y)) -> mark(Y)
    8: active(plus(s(X),Y)) -> mark(s(plus(X,Y)))
    9: active(times(0(),Y)) -> mark(0())
    10: active(times(s(X),Y)) -> mark(plus(Y,times(X,Y)))
    11: active(square(X)) -> mark(times(X,X))
    12: active(s(X)) -> s(active(X))
    13: active(posrecip(X)) -> posrecip(active(X))
    14: active(negrecip(X)) -> negrecip(active(X))
    15: active(cons(X1,X2)) -> cons(active(X1),X2)
    16: active(rcons(X1,X2)) -> rcons(active(X1),X2)
    17: active(rcons(X1,X2)) -> rcons(X1,active(X2))
    18: active(from(X)) -> from(active(X))
    19: active(2ndspos(X1,X2)) -> 2ndspos(active(X1),X2)
    20: active(2ndspos(X1,X2)) -> 2ndspos(X1,active(X2))
    21: active(2ndsneg(X1,X2)) -> 2ndsneg(active(X1),X2)
    22: active(2ndsneg(X1,X2)) -> 2ndsneg(X1,active(X2))
    23: active(pi(X)) -> pi(active(X))
    24: active(plus(X1,X2)) -> plus(active(X1),X2)
    25: active(plus(X1,X2)) -> plus(X1,active(X2))
    26: active(times(X1,X2)) -> times(active(X1),X2)
    27: active(times(X1,X2)) -> times(X1,active(X2))
    28: active(square(X)) -> square(active(X))
    29: s(mark(X)) -> mark(s(X))
    30: posrecip(mark(X)) -> mark(posrecip(X))
    31: negrecip(mark(X)) -> mark(negrecip(X))
    32: cons(mark(X1),X2) -> mark(cons(X1,X2))
    33: rcons(mark(X1),X2) -> mark(rcons(X1,X2))
    34: rcons(X1,mark(X2)) -> mark(rcons(X1,X2))
    35: from(mark(X)) -> mark(from(X))
    36: 2ndspos(mark(X1),X2) -> mark(2ndspos(X1,X2))
    37: 2ndspos(X1,mark(X2)) -> mark(2ndspos(X1,X2))
    38: 2ndsneg(mark(X1),X2) -> mark(2ndsneg(X1,X2))
    39: 2ndsneg(X1,mark(X2)) -> mark(2ndsneg(X1,X2))
    40: pi(mark(X)) -> mark(pi(X))
    41: plus(mark(X1),X2) -> mark(plus(X1,X2))
    42: plus(X1,mark(X2)) -> mark(plus(X1,X2))
    43: times(mark(X1),X2) -> mark(times(X1,X2))
    44: times(X1,mark(X2)) -> mark(times(X1,X2))
    45: square(mark(X)) -> mark(square(X))
    46: proper(0()) -> ok(0())
    47: proper(s(X)) -> s(proper(X))
    48: proper(posrecip(X)) -> posrecip(proper(X))
    49: proper(negrecip(X)) -> negrecip(proper(X))
    50: proper(nil()) -> ok(nil())
    51: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
    52: proper(rnil()) -> ok(rnil())
    53: proper(rcons(X1,X2)) -> rcons(proper(X1),proper(X2))
    54: proper(from(X)) -> from(proper(X))
    55: proper(2ndspos(X1,X2)) -> 2ndspos(proper(X1),proper(X2))
    56: proper(2ndsneg(X1,X2)) -> 2ndsneg(proper(X1),proper(X2))
    57: proper(pi(X)) -> pi(proper(X))
    58: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2))
    59: proper(times(X1,X2)) -> times(proper(X1),proper(X2))
    60: proper(square(X)) -> square(proper(X))
    61: s(ok(X)) -> ok(s(X))
    62: posrecip(ok(X)) -> ok(posrecip(X))
    63: negrecip(ok(X)) -> ok(negrecip(X))
    64: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
    65: rcons(ok(X1),ok(X2)) -> ok(rcons(X1,X2))
    66: from(ok(X)) -> ok(from(X))
    67: 2ndspos(ok(X1),ok(X2)) -> ok(2ndspos(X1,X2))
    68: 2ndsneg(ok(X1),ok(X2)) -> ok(2ndsneg(X1,X2))
    69: pi(ok(X)) -> ok(pi(X))
    70: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2))
    71: times(ok(X1),ok(X2)) -> ok(times(X1,X2))
    72: square(ok(X)) -> ok(square(X))
    73: top(mark(X)) -> top(proper(X))
    74: top(ok(X)) -> top(active(X))
Number of strict rules: 74
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #times(mark(X1),X2) -> #times(X1,X2)
   #2: #s(mark(X)) -> #s(X)
   #3: #from(mark(X)) -> #from(X)
   #4: #from(ok(X)) -> #from(X)
   #5: #plus(X1,mark(X2)) -> #plus(X1,X2)
   #6: #plus(mark(X1),X2) -> #plus(X1,X2)
   #7: #2ndspos(X1,mark(X2)) -> #2ndspos(X1,X2)
   #8: #top(mark(X)) -> #top(proper(X))
   #9: #top(mark(X)) -> #proper(X)
   #10: #proper(s(X)) -> #s(proper(X))
   #11: #proper(s(X)) -> #proper(X)
   #12: #proper(rcons(X1,X2)) -> #rcons(proper(X1),proper(X2))
   #13: #proper(rcons(X1,X2)) -> #proper(X1)
   #14: #proper(rcons(X1,X2)) -> #proper(X2)

popout

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

job log

popout

actions all output return to TRS Stand 20472