Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904064
details
property
value
status
complete
benchmark
#4.22.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
4.72019195557 seconds
cpu usage
15.279273466
max memory
4.256141312E9
stage attributes
key
value
output-size
7936
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (2) CdtProblem (3) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CdtProblem (5) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 29 ms] (8) CdtProblem (9) CdtKnowledgeProof [FINISHED, 0 ms] (10) BOUNDS(1, 1) (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxTRS (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (14) typed CpxTrs (15) OrderProof [LOWER BOUND(ID), 0 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 386 ms] (18) proven lower bound (19) LowerBoundPropagationProof [FINISHED, 0 ms] (20) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: quot(0, s(y), s(z)) -> 0 quot(s(x), s(y), z) -> quot(x, y, z) quot(x, 0, s(z)) -> s(quot(x, s(z), s(z))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: quot(0, s(z0), s(z1)) -> 0 quot(s(z0), s(z1), z2) -> quot(z0, z1, z2) quot(z0, 0, s(z1)) -> s(quot(z0, s(z1), s(z1))) Tuples: QUOT(0, s(z0), s(z1)) -> c QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) S tuples: QUOT(0, s(z0), s(z1)) -> c QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) K tuples:none Defined Rule Symbols: quot_3 Defined Pair Symbols: QUOT_3 Compound Symbols: c, c1_1, c2_1 ---------------------------------------- (3) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID)) Removed 1 trailing nodes: QUOT(0, s(z0), s(z1)) -> c ---------------------------------------- (4) Obligation: Complexity Dependency Tuples Problem Rules: quot(0, s(z0), s(z1)) -> 0 quot(s(z0), s(z1), z2) -> quot(z0, z1, z2) quot(z0, 0, s(z1)) -> s(quot(z0, s(z1), s(z1))) Tuples: QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807