details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	294.441 seconds
cpu usage	1156.28
user time	1146.0
system time	10.2819
max virtual memory	1.9546952E7
max residence set size	1.5003036E7

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), ?)

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 1232 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 1707 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: U11(tt, V1, V2) -> U12(isNat(activate(V1)), activate(V2)) U12(tt, V2) -> U13(isNat(activate(V2))) U13(tt) -> tt U21(tt, V1) -> U22(isNat(activate(V1))) U22(tt) -> tt U31(tt, V1, V2) -> U32(isNat(activate(V1)), activate(V2)) U32(tt, V2) -> U33(isNat(activate(V2))) U33(tt) -> tt U41(tt, N) -> activate(N) U51(tt, M, N) -> s(plus(activate(N), activate(M))) U61(tt) -> 0 U71(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1, V2)) -> U11(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), activate(V1), activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)), activate(V1)) isNat(n__x(V1, V2)) -> U31(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), activate(V1), activate(V2)) isNatKind(n__0) -> tt isNatKind(n__plus(V1, V2)) -> and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) isNatKind(n__x(V1, V2)) -> and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) plus(N, 0) -> U41(and(isNat(N), n__isNatKind(N)), N) plus(N, s(M)) -> U51(and(and(isNat(M), n__isNatKind(M)), n__and(isNat(N), n__isNatKind(N))), M, N) x(N, 0) -> U61(and(isNat(N), n__isNatKind(N))) x(N, s(M)) -> U71(and(and(isNat(M), n__isNatKind(M)), n__and(isNat(N), n__isNatKind(N))), M, N) 0 -> n__0 plus(X1, X2) -> n__plus(X1, X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) x(X1, X2) -> n__x(X1, X2) and(X1, X2) -> n__and(X1, X2) activate(n__0) -> 0 activate(n__plus(X1, X2)) -> plus(X1, X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__x(X1, X2)) -> x(X1, X2) activate(n__and(X1, X2)) -> and(X1, X2) activate(X) -> X S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(tt) -> tt encArg(n__0) -> n__0 encArg(n__plus(x_1, x_2)) -> n__plus(encArg(x_1), encArg(x_2)) encArg(n__isNatKind(x_1)) -> n__isNatKind(encArg(x_1)) encArg(n__s(x_1)) -> n__s(encArg(x_1)) encArg(n__x(x_1, x_2)) -> n__x(encArg(x_1), encArg(x_2)) encArg(n__and(x_1, x_2)) -> n__and(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1, x_2, x_3)) -> U11(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_U12(x_1, x_2)) -> U12(encArg(x_1), encArg(x_2)) encArg(cons_U13(x_1)) -> U13(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) encArg(cons_U31(x_1, x_2, x_3)) -> U31(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_U32(x_1, x_2)) -> U32(encArg(x_1), encArg(x_2)) encArg(cons_U33(x_1)) -> U33(encArg(x_1)) encArg(cons_U41(x_1, x_2)) -> U41(encArg(x_1), encArg(x_2)) encArg(cons_U51(x_1, x_2, x_3)) -> U51(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_U61(x_1)) -> U61(encArg(x_1)) encArg(cons_U71(x_1, x_2, x_3)) -> U71(encArg(x_1), encArg(x_2), encArg(x_3)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost