details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	13.5631999969 seconds
cpu usage	35.990176308
max memory	4.126941184E9

stage attributes

key	value
output-size	23426
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 7374 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__U101(tt, M, N) -> a__U102(a__isNatKind(M), M, N) a__U102(tt, M, N) -> a__U103(a__isNat(N), M, N) a__U103(tt, M, N) -> a__U104(a__isNatKind(N), M, N) a__U104(tt, M, N) -> a__plus(a__x(mark(N), mark(M)), mark(N)) a__U11(tt, V1, V2) -> a__U12(a__isNatKind(V1), V1, V2) a__U12(tt, V1, V2) -> a__U13(a__isNatKind(V2), V1, V2) a__U13(tt, V1, V2) -> a__U14(a__isNatKind(V2), V1, V2) a__U14(tt, V1, V2) -> a__U15(a__isNat(V1), V2) a__U15(tt, V2) -> a__U16(a__isNat(V2)) a__U16(tt) -> tt a__U21(tt, V1) -> a__U22(a__isNatKind(V1), V1) a__U22(tt, V1) -> a__U23(a__isNat(V1)) a__U23(tt) -> tt a__U31(tt, V1, V2) -> a__U32(a__isNatKind(V1), V1, V2) a__U32(tt, V1, V2) -> a__U33(a__isNatKind(V2), V1, V2) a__U33(tt, V1, V2) -> a__U34(a__isNatKind(V2), V1, V2) a__U34(tt, V1, V2) -> a__U35(a__isNat(V1), V2) a__U35(tt, V2) -> a__U36(a__isNat(V2)) a__U36(tt) -> tt a__U41(tt, V2) -> a__U42(a__isNatKind(V2)) a__U42(tt) -> tt a__U51(tt) -> tt a__U61(tt, V2) -> a__U62(a__isNatKind(V2)) a__U62(tt) -> tt a__U71(tt, N) -> a__U72(a__isNatKind(N), N) a__U72(tt, N) -> mark(N) a__U81(tt, M, N) -> a__U82(a__isNatKind(M), M, N) a__U82(tt, M, N) -> a__U83(a__isNat(N), M, N) a__U83(tt, M, N) -> a__U84(a__isNatKind(N), M, N) a__U84(tt, M, N) -> s(a__plus(mark(N), mark(M))) a__U91(tt, N) -> a__U92(a__isNatKind(N)) a__U92(tt) -> 0 a__isNat(0) -> tt a__isNat(plus(V1, V2)) -> a__U11(a__isNatKind(V1), V1, V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1), V1) a__isNat(x(V1, V2)) -> a__U31(a__isNatKind(V1), V1, V2) a__isNatKind(0) -> tt a__isNatKind(plus(V1, V2)) -> a__U41(a__isNatKind(V1), V2) a__isNatKind(s(V1)) -> a__U51(a__isNatKind(V1)) a__isNatKind(x(V1, V2)) -> a__U61(a__isNatKind(V1), V2) a__plus(N, 0) -> a__U71(a__isNat(N), N) a__plus(N, s(M)) -> a__U81(a__isNat(M), M, N) a__x(N, 0) -> a__U91(a__isNat(N), N) a__x(N, s(M)) -> a__U101(a__isNat(M), M, N) mark(U101(X1, X2, X3)) -> a__U101(mark(X1), X2, X3) mark(U102(X1, X2, X3)) -> a__U102(mark(X1), X2, X3) mark(isNatKind(X)) -> a__isNatKind(X) mark(U103(X1, X2, X3)) -> a__U103(mark(X1), X2, X3) mark(isNat(X)) -> a__isNat(X) mark(U104(X1, X2, X3)) -> a__U104(mark(X1), X2, X3) mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) mark(x(X1, X2)) -> a__x(mark(X1), mark(X2)) mark(U11(X1, X2, X3)) -> a__U11(mark(X1), X2, X3) mark(U12(X1, X2, X3)) -> a__U12(mark(X1), X2, X3) mark(U13(X1, X2, X3)) -> a__U13(mark(X1), X2, X3) mark(U14(X1, X2, X3)) -> a__U14(mark(X1), X2, X3) mark(U15(X1, X2)) -> a__U15(mark(X1), X2) mark(U16(X)) -> a__U16(mark(X)) mark(U21(X1, X2)) -> a__U21(mark(X1), X2) mark(U22(X1, X2)) -> a__U22(mark(X1), X2) mark(U23(X)) -> a__U23(mark(X)) mark(U31(X1, X2, X3)) -> a__U31(mark(X1), X2, X3) mark(U32(X1, X2, X3)) -> a__U32(mark(X1), X2, X3) mark(U33(X1, X2, X3)) -> a__U33(mark(X1), X2, X3) mark(U34(X1, X2, X3)) -> a__U34(mark(X1), X2, X3) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127