TRS Stand 20472 pair #381716933

details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	1.45799899101 seconds
cpu usage	1.484791849
max memory	3.3677312E7

stage attributes

key	value
output-size	22382
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(U11(tt(),V1,V2)) -> mark(U12(isNat(V1),V2))
    2: active(U12(tt(),V2)) -> mark(U13(isNat(V2)))
    3: active(U13(tt())) -> mark(tt())
    4: active(U21(tt(),V1)) -> mark(U22(isNat(V1)))
    5: active(U22(tt())) -> mark(tt())
    6: active(U31(tt(),N)) -> mark(N)
    7: active(U41(tt(),M,N)) -> mark(s(plus(N,M)))
    8: active(and(tt(),X)) -> mark(X)
    9: active(isNat(0())) -> mark(tt())
    10: active(isNat(plus(V1,V2))) -> mark(U11(and(isNatKind(V1),isNatKind(V2)),V1,V2))
    11: active(isNat(s(V1))) -> mark(U21(isNatKind(V1),V1))
    12: active(isNatKind(0())) -> mark(tt())
    13: active(isNatKind(plus(V1,V2))) -> mark(and(isNatKind(V1),isNatKind(V2)))
    14: active(isNatKind(s(V1))) -> mark(isNatKind(V1))
    15: active(plus(N,0())) -> mark(U31(and(isNat(N),isNatKind(N)),N))
    16: active(plus(N,s(M))) -> mark(U41(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N))
    17: active(U11(X1,X2,X3)) -> U11(active(X1),X2,X3)
    18: active(U12(X1,X2)) -> U12(active(X1),X2)
    19: active(U13(X)) -> U13(active(X))
    20: active(U21(X1,X2)) -> U21(active(X1),X2)
    21: active(U22(X)) -> U22(active(X))
    22: active(U31(X1,X2)) -> U31(active(X1),X2)
    23: active(U41(X1,X2,X3)) -> U41(active(X1),X2,X3)
    24: active(s(X)) -> s(active(X))
    25: active(plus(X1,X2)) -> plus(active(X1),X2)
    26: active(plus(X1,X2)) -> plus(X1,active(X2))
    27: active(and(X1,X2)) -> and(active(X1),X2)
    28: U11(mark(X1),X2,X3) -> mark(U11(X1,X2,X3))
    29: U12(mark(X1),X2) -> mark(U12(X1,X2))
    30: U13(mark(X)) -> mark(U13(X))
    31: U21(mark(X1),X2) -> mark(U21(X1,X2))
    32: U22(mark(X)) -> mark(U22(X))
    33: U31(mark(X1),X2) -> mark(U31(X1,X2))
    34: U41(mark(X1),X2,X3) -> mark(U41(X1,X2,X3))
    35: s(mark(X)) -> mark(s(X))
    36: plus(mark(X1),X2) -> mark(plus(X1,X2))
    37: plus(X1,mark(X2)) -> mark(plus(X1,X2))
    38: and(mark(X1),X2) -> mark(and(X1,X2))
    39: proper(U11(X1,X2,X3)) -> U11(proper(X1),proper(X2),proper(X3))
    40: proper(tt()) -> ok(tt())
    41: proper(U12(X1,X2)) -> U12(proper(X1),proper(X2))
    42: proper(isNat(X)) -> isNat(proper(X))
    43: proper(U13(X)) -> U13(proper(X))
    44: proper(U21(X1,X2)) -> U21(proper(X1),proper(X2))
    45: proper(U22(X)) -> U22(proper(X))
    46: proper(U31(X1,X2)) -> U31(proper(X1),proper(X2))
    47: proper(U41(X1,X2,X3)) -> U41(proper(X1),proper(X2),proper(X3))
    48: proper(s(X)) -> s(proper(X))
    49: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2))
    50: proper(and(X1,X2)) -> and(proper(X1),proper(X2))
    51: proper(0()) -> ok(0())
    52: proper(isNatKind(X)) -> isNatKind(proper(X))
    53: U11(ok(X1),ok(X2),ok(X3)) -> ok(U11(X1,X2,X3))
    54: U12(ok(X1),ok(X2)) -> ok(U12(X1,X2))
    55: isNat(ok(X)) -> ok(isNat(X))
    56: U13(ok(X)) -> ok(U13(X))
    57: U21(ok(X1),ok(X2)) -> ok(U21(X1,X2))
    58: U22(ok(X)) -> ok(U22(X))
    59: U31(ok(X1),ok(X2)) -> ok(U31(X1,X2))
    60: U41(ok(X1),ok(X2),ok(X3)) -> ok(U41(X1,X2,X3))
    61: s(ok(X)) -> ok(s(X))
    62: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2))
    63: and(ok(X1),ok(X2)) -> ok(and(X1,X2))
    64: isNatKind(ok(X)) -> ok(isNatKind(X))
    65: top(mark(X)) -> top(proper(X))
    66: top(ok(X)) -> top(active(X))
Number of strict rules: 66
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #active(U12(tt(),V2)) -> #U13(isNat(V2))
   #2: #active(U12(tt(),V2)) -> #isNat(V2)
   #3: #proper(U13(X)) -> #U13(proper(X))
   #4: #proper(U13(X)) -> #proper(X)
   #5: #U12(mark(X1),X2) -> #U12(X1,X2)
   #6: #s(mark(X)) -> #s(X)
   #7: #top(ok(X)) -> #top(active(X))
   #8: #top(ok(X)) -> #active(X)
   #9: #proper(U31(X1,X2)) -> #U31(proper(X1),proper(X2))
   #10: #proper(U31(X1,X2)) -> #proper(X1)
   #11: #proper(U31(X1,X2)) -> #proper(X2)
   #12: #proper(isNat(X)) -> #isNat(proper(X))
   #13: #proper(isNat(X)) -> #proper(X)
   #14: #proper(U12(X1,X2)) -> #U12(proper(X1),proper(X2))
   #15: #proper(U12(X1,X2)) -> #proper(X1)
   #16: #proper(U12(X1,X2)) -> #proper(X2)
   #17: #plus(X1,mark(X2)) -> #plus(X1,X2)
   #18: #proper(U41(X1,X2,X3)) -> #U41(proper(X1),proper(X2),proper(X3))
   #19: #proper(U41(X1,X2,X3)) -> #proper(X1)
   #20: #proper(U41(X1,X2,X3)) -> #proper(X2)
   #21: #proper(U41(X1,X2,X3)) -> #proper(X3)
   #22: #U11(ok(X1),ok(X2),ok(X3)) -> #U11(X1,X2,X3)

popout

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

job log

popout

actions all output return to TRS Stand 20472