Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313551
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
n121.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
4.63172 seconds
cpu usage
14.1193
user time
12.7412
system time
1.37813
max virtual memory
1.8610996E7
max residence set size
3952832.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
13.89/4.57 WORST_CASE(Omega(n^1), O(n^1)) 13.89/4.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 13.89/4.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.89/4.58 13.89/4.58 13.89/4.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 13.89/4.58 13.89/4.58 (0) CpxTRS 13.89/4.58 (1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] 13.89/4.58 (2) CdtProblem 13.89/4.58 (3) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 13.89/4.58 (4) CdtProblem 13.89/4.58 (5) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 1 ms] 13.89/4.58 (6) CdtProblem 13.89/4.58 (7) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 14 ms] 13.89/4.58 (8) CdtProblem 13.89/4.58 (9) CdtKnowledgeProof [FINISHED, 0 ms] 13.89/4.58 (10) BOUNDS(1, 1) 13.89/4.58 (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 13.89/4.58 (12) CpxTRS 13.89/4.58 (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 13.89/4.58 (14) typed CpxTrs 13.89/4.58 (15) OrderProof [LOWER BOUND(ID), 0 ms] 13.89/4.58 (16) typed CpxTrs 13.89/4.58 (17) RewriteLemmaProof [LOWER BOUND(ID), 496 ms] 13.89/4.58 (18) proven lower bound 13.89/4.58 (19) LowerBoundPropagationProof [FINISHED, 0 ms] 13.89/4.58 (20) BOUNDS(n^1, INF) 13.89/4.58 13.89/4.58 13.89/4.58 ---------------------------------------- 13.89/4.58 13.89/4.58 (0) 13.89/4.58 Obligation: 13.89/4.58 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 13.89/4.58 13.89/4.58 13.89/4.58 The TRS R consists of the following rules: 13.89/4.58 13.89/4.58 quot(0, s(y), s(z)) -> 0 13.89/4.58 quot(s(x), s(y), z) -> quot(x, y, z) 13.89/4.58 quot(x, 0, s(z)) -> s(quot(x, s(z), s(z))) 13.89/4.58 13.89/4.58 S is empty. 13.89/4.58 Rewrite Strategy: INNERMOST 13.89/4.58 ---------------------------------------- 13.89/4.58 13.89/4.58 (1) CpxTrsToCdtProof (UPPER BOUND(ID)) 13.89/4.58 Converted Cpx (relative) TRS to CDT 13.89/4.58 ---------------------------------------- 13.89/4.58 13.89/4.58 (2) 13.89/4.58 Obligation: 13.89/4.58 Complexity Dependency Tuples Problem 13.89/4.58 13.89/4.58 Rules: 13.89/4.58 quot(0, s(z0), s(z1)) -> 0 13.89/4.58 quot(s(z0), s(z1), z2) -> quot(z0, z1, z2) 13.89/4.58 quot(z0, 0, s(z1)) -> s(quot(z0, s(z1), s(z1))) 13.89/4.58 Tuples: 13.89/4.58 QUOT(0, s(z0), s(z1)) -> c 13.89/4.58 QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) 13.89/4.58 QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) 13.89/4.58 S tuples: 13.89/4.58 QUOT(0, s(z0), s(z1)) -> c 13.89/4.58 QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) 13.89/4.58 QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) 13.89/4.58 K tuples:none 13.89/4.58 Defined Rule Symbols: quot_3 13.89/4.58 13.89/4.58 Defined Pair Symbols: QUOT_3 13.89/4.58 13.89/4.58 Compound Symbols: c, c1_1, c2_1 13.89/4.58 13.89/4.58 13.89/4.58 ---------------------------------------- 13.89/4.58 13.89/4.58 (3) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID)) 13.89/4.58 Removed 1 trailing nodes: 13.89/4.58 QUOT(0, s(z0), s(z1)) -> c 13.89/4.58 13.89/4.58 ---------------------------------------- 13.89/4.58 13.89/4.58 (4) 13.89/4.58 Obligation: 13.89/4.58 Complexity Dependency Tuples Problem 13.89/4.58 13.89/4.58 Rules: 13.89/4.58 quot(0, s(z0), s(z1)) -> 0 13.89/4.58 quot(s(z0), s(z1), z2) -> quot(z0, z1, z2) 13.89/4.58 quot(z0, 0, s(z1)) -> s(quot(z0, s(z1), s(z1))) 13.89/4.58 Tuples: 13.89/4.58 QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) 13.89/4.58 QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) 13.89/4.58 S tuples: 13.89/4.58 QUOT(s(z0), s(z1), z2) -> c1(QUOT(z0, z1, z2)) 13.89/4.58 QUOT(z0, 0, s(z1)) -> c2(QUOT(z0, s(z1), s(z1))) 13.89/4.58 K tuples:none 13.89/4.58 Defined Rule Symbols: quot_3 13.89/4.58
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40