Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903655
details
property
value
status
complete
benchmark
PEANO_complete_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
11.4447431564 seconds
cpu usage
36.12452966
max memory
4.159074304E9
stage attributes
key
value
output-size
80997
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 15 ms] (6) CdtProblem (7) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 157 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 49 ms] (16) CdtProblem (17) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (18) BOUNDS(1, 1) (19) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (20) TRS for Loop Detection (21) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (22) BEST (23) proven lower bound (24) LowerBoundPropagationProof [FINISHED, 0 ms] (25) BOUNDS(n^1, INF) (26) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(U11(tt, V1, V2)) -> mark(U12(isNatKind(V1), V1, V2)) active(U12(tt, V1, V2)) -> mark(U13(isNatKind(V2), V1, V2)) active(U13(tt, V1, V2)) -> mark(U14(isNatKind(V2), V1, V2)) active(U14(tt, V1, V2)) -> mark(U15(isNat(V1), V2)) active(U15(tt, V2)) -> mark(U16(isNat(V2))) active(U16(tt)) -> mark(tt) active(U21(tt, V1)) -> mark(U22(isNatKind(V1), V1)) active(U22(tt, V1)) -> mark(U23(isNat(V1))) active(U23(tt)) -> mark(tt) active(U31(tt, V2)) -> mark(U32(isNatKind(V2))) active(U32(tt)) -> mark(tt) active(U41(tt)) -> mark(tt) active(U51(tt, N)) -> mark(U52(isNatKind(N), N)) active(U52(tt, N)) -> mark(N) active(U61(tt, M, N)) -> mark(U62(isNatKind(M), M, N)) active(U62(tt, M, N)) -> mark(U63(isNat(N), M, N)) active(U63(tt, M, N)) -> mark(U64(isNatKind(N), M, N)) active(U64(tt, M, N)) -> mark(s(plus(N, M))) active(isNat(0)) -> mark(tt) active(isNat(plus(V1, V2))) -> mark(U11(isNatKind(V1), V1, V2)) active(isNat(s(V1))) -> mark(U21(isNatKind(V1), V1)) active(isNatKind(0)) -> mark(tt) active(isNatKind(plus(V1, V2))) -> mark(U31(isNatKind(V1), V2)) active(isNatKind(s(V1))) -> mark(U41(isNatKind(V1))) active(plus(N, 0)) -> mark(U51(isNat(N), N)) active(plus(N, s(M))) -> mark(U61(isNat(M), M, N)) active(U11(X1, X2, X3)) -> U11(active(X1), X2, X3) active(U12(X1, X2, X3)) -> U12(active(X1), X2, X3) active(U13(X1, X2, X3)) -> U13(active(X1), X2, X3) active(U14(X1, X2, X3)) -> U14(active(X1), X2, X3) active(U15(X1, X2)) -> U15(active(X1), X2) active(U16(X)) -> U16(active(X)) active(U21(X1, X2)) -> U21(active(X1), X2) active(U22(X1, X2)) -> U22(active(X1), X2) active(U23(X)) -> U23(active(X)) active(U31(X1, X2)) -> U31(active(X1), X2) active(U32(X)) -> U32(active(X)) active(U41(X)) -> U41(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X1, X2)) -> U52(active(X1), X2) active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) active(U62(X1, X2, X3)) -> U62(active(X1), X2, X3) active(U63(X1, X2, X3)) -> U63(active(X1), X2, X3) active(U64(X1, X2, X3)) -> U64(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)) U11(mark(X1), X2, X3) -> mark(U11(X1, X2, X3)) U12(mark(X1), X2, X3) -> mark(U12(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