Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS Innermost pair #487108338
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
n149.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
292.765 seconds
cpu usage
1141.71
user time
1131.29
system time
10.421
max virtual memory
1.958276E7
max residence set size
1.506904E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/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), 709 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), 432 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 122 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 107 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 152 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 171 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 138 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 128 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 189 ms] (34) 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: active(U11(tt, V1, V2)) -> mark(U12(isNat(V1), V2)) active(U12(tt, V2)) -> mark(U13(isNat(V2))) active(U13(tt)) -> mark(tt) active(U21(tt, V1)) -> mark(U22(isNat(V1))) active(U22(tt)) -> mark(tt) active(U31(tt, N)) -> mark(N) active(U41(tt, M, N)) -> mark(s(plus(N, M))) active(and(tt, X)) -> mark(X) active(isNat(0)) -> mark(tt) active(isNat(plus(V1, V2))) -> mark(U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)) active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) active(isNatKind(0)) -> mark(tt) active(isNatKind(plus(V1, V2))) -> mark(and(isNatKind(V1), isNatKind(V2))) active(isNatKind(s(V1))) -> mark(isNatKind(V1)) active(plus(N, 0)) -> mark(U31(and(isNat(N), isNatKind(N)), N)) active(plus(N, s(M))) -> mark(U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)) active(U11(X1, X2, X3)) -> U11(active(X1), X2, X3) active(U12(X1, X2)) -> U12(active(X1), X2) active(U13(X)) -> U13(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X)) -> U22(active(X)) active(U31(X1, X2)) -> U31(active(X1), X2) active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) active(s(X)) -> s(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(and(X1, X2)) -> and(active(X1), X2) U11(mark(X1), X2, X3) -> mark(U11(X1, X2, X3)) U12(mark(X1), X2) -> mark(U12(X1, X2)) U13(mark(X)) -> mark(U13(X)) U21(mark(X1), X2) -> mark(U21(X1, X2)) U22(mark(X)) -> mark(U22(X)) U31(mark(X1), X2) -> mark(U31(X1, X2)) U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) s(mark(X)) -> mark(s(X)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) proper(U11(X1, X2, X3)) -> U11(proper(X1), proper(X2), proper(X3)) proper(tt) -> ok(tt) proper(U12(X1, X2)) -> U12(proper(X1), proper(X2)) proper(isNat(X)) -> isNat(proper(X)) proper(U13(X)) -> U13(proper(X)) proper(U21(X1, X2)) -> U21(proper(X1), proper(X2)) proper(U22(X)) -> U22(proper(X)) proper(U31(X1, X2)) -> U31(proper(X1), proper(X2)) proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS Innermost