TRS Standard pair #615299128

details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	8.91658496857 seconds
cpu usage	9.656370994
max memory	2.96566784E8

stage attributes

key	value
output-size	9796
starexec-result	"MAYBE"

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
Input TRS:
    1: active(U11(tt(),V2)) -> mark(U12(isNat(V2)))
    2: active(U12(tt())) -> mark(tt())
    3: active(U21(tt())) -> mark(tt())
    4: active(U31(tt(),N)) -> mark(N)
    5: active(U41(tt(),M,N)) -> mark(U42(isNat(N),M,N))
    6: active(U42(tt(),M,N)) -> mark(s(plus(N,M)))
    7: active(isNat(0())) -> mark(tt())
    8: active(isNat(plus(V1,V2))) -> mark(U11(isNat(V1),V2))
    9: active(isNat(s(V1))) -> mark(U21(isNat(V1)))
    10: active(plus(N,0())) -> mark(U31(isNat(N),N))
    11: active(plus(N,s(M))) -> mark(U41(isNat(M),M,N))
    12: active(U11(X1,X2)) -> U11(active(X1),X2)
    13: active(U12(X)) -> U12(active(X))
    14: active(U21(X)) -> U21(active(X))
    15: active(U31(X1,X2)) -> U31(active(X1),X2)
    16: active(U41(X1,X2,X3)) -> U41(active(X1),X2,X3)
    17: active(U42(X1,X2,X3)) -> U42(active(X1),X2,X3)
    18: active(s(X)) -> s(active(X))
    19: active(plus(X1,X2)) -> plus(active(X1),X2)
    20: active(plus(X1,X2)) -> plus(X1,active(X2))
    21: U11(mark(X1),X2) -> mark(U11(X1,X2))
    22: U12(mark(X)) -> mark(U12(X))
    23: U21(mark(X)) -> mark(U21(X))
    24: U31(mark(X1),X2) -> mark(U31(X1,X2))
    25: U41(mark(X1),X2,X3) -> mark(U41(X1,X2,X3))
    26: U42(mark(X1),X2,X3) -> mark(U42(X1,X2,X3))
    27: s(mark(X)) -> mark(s(X))
    28: plus(mark(X1),X2) -> mark(plus(X1,X2))
    29: plus(X1,mark(X2)) -> mark(plus(X1,X2))
    30: proper(U11(X1,X2)) -> U11(proper(X1),proper(X2))
    31: proper(tt()) -> ok(tt())
    32: proper(U12(X)) -> U12(proper(X))
    33: proper(isNat(X)) -> isNat(proper(X))
    34: proper(U21(X)) -> U21(proper(X))
    35: proper(U31(X1,X2)) -> U31(proper(X1),proper(X2))
    36: proper(U41(X1,X2,X3)) -> U41(proper(X1),proper(X2),proper(X3))
    37: proper(U42(X1,X2,X3)) -> U42(proper(X1),proper(X2),proper(X3))
    38: proper(s(X)) -> s(proper(X))
    39: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2))
    40: proper(0()) -> ok(0())
    41: U11(ok(X1),ok(X2)) -> ok(U11(X1,X2))
    42: U12(ok(X)) -> ok(U12(X))
    43: isNat(ok(X)) -> ok(isNat(X))
    44: U21(ok(X)) -> ok(U21(X))
    45: U31(ok(X1),ok(X2)) -> ok(U31(X1,X2))
    46: U41(ok(X1),ok(X2),ok(X3)) -> ok(U41(X1,X2,X3))
    47: U42(ok(X1),ok(X2),ok(X3)) -> ok(U42(X1,X2,X3))
    48: s(ok(X)) -> ok(s(X))
    49: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2))
    50: top(mark(X)) -> top(proper(X))
    51: top(ok(X)) -> top(active(X))
Number of strict rules: 51
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #isNat(ok(X)) -> #isNat(X)
   #2: #plus(X1,mark(X2)) -> #plus(X1,X2)
   #3: #proper(U31(X1,X2)) -> #U31(proper(X1),proper(X2))
   #4: #proper(U31(X1,X2)) -> #proper(X1)
   #5: #proper(U31(X1,X2)) -> #proper(X2)
   #6: #U41(ok(X1),ok(X2),ok(X3)) -> #U41(X1,X2,X3)
   #7: #U12(ok(X)) -> #U12(X)
   #8: #U11(ok(X1),ok(X2)) -> #U11(X1,X2)
   #9: #proper(U42(X1,X2,X3)) -> #U42(proper(X1),proper(X2),proper(X3))
   #10: #proper(U42(X1,X2,X3)) -> #proper(X1)
   #11: #proper(U42(X1,X2,X3)) -> #proper(X2)
   #12: #proper(U42(X1,X2,X3)) -> #proper(X3)
   #13: #U42(ok(X1),ok(X2),ok(X3)) -> #U42(X1,X2,X3)
   #14: #s(ok(X)) -> #s(X)
   #15: #proper(s(X)) -> #s(proper(X))
   #16: #proper(s(X)) -> #proper(X)
   #17: #active(U42(tt(),M,N)) -> #s(plus(N,M))
   #18: #active(U42(tt(),M,N)) -> #plus(N,M)
   #19: #top(ok(X)) -> #top(active(X))
   #20: #top(ok(X)) -> #active(X)
   #21: #active(U12(X)) -> #U12(active(X))
   #22: #active(U12(X)) -> #active(X)
   #23: #active(isNat(s(V1))) -> #U21(isNat(V1))
   #24: #active(isNat(s(V1))) -> #isNat(V1)
   #25: #active(plus(N,s(M))) -> #U41(isNat(M),M,N)
   #26: #active(plus(N,s(M))) -> #isNat(M)
   #27: #U31(mark(X1),X2) -> #U31(X1,X2)
   #28: #U21(mark(X)) -> #U21(X)
   #29: #U31(ok(X1),ok(X2)) -> #U31(X1,X2)
   #30: #active(U11(X1,X2)) -> #U11(active(X1),X2)
   #31: #active(U11(X1,X2)) -> #active(X1)
   #32: #active(U21(X)) -> #U21(active(X))
   #33: #active(U21(X)) -> #active(X)
   #34: #proper(U11(X1,X2)) -> #U11(proper(X1),proper(X2))
   #35: #proper(U11(X1,X2)) -> #proper(X1)
   #36: #proper(U11(X1,X2)) -> #proper(X2)
   #37: #plus(ok(X1),ok(X2)) -> #plus(X1,X2)

popout

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

job log

popout

actions all output return to TRS Standard