Potential Pitfalls from Successful History-Match Simulation of a Long-Running Clearwater-FM SAGD Well Pair
Bibliographic record
Abstract
Abstract Canada's oil sands deposits in northern Alberta contain more than 1.35 trillion barrels (~215 billion m3) of bitumen. Such a large resource base, even allowing for (relatively) low recovery factors, still constitutes the world's second largest oil reserves (behind only Saudi Arabia's). In-situ recovery technologies for these deposits, in view of the extremely viscous bitumen typically existing in them, commonly require thermal heating and/or solvent dilution to mobilize the bitumen and enable it to be produced. Steam-Assisted Gravity Drainage (SAGD) and Ccyclic-Steam Stimulation (CSS) are currently two technologies accounting for the bulk of in-situ bitumen production in Canada. This paper briefly reviews key developments of the SAGD process. It next analyzes the production performance of a long-running Clearwater-FM SAGD well pair, followed by the presentation of history-match simulation results for this SAGD well pair. Discussion of the results is given from the viewpoint of Level-I (matching rates, volumes, fluid ratios) and Level-II (matching steam chamber behaviour) history match. These results demonstrate clearly the challenges of history-match simulation for the SAGD process, as well as the utility (or lack of) of Level-I and Level-II matches. Discussion and conclusions are also offered of the potential pitfalls associated with interpretation of history-match simulation results for the SAGD process, and subsequent implications for SAGD reservoir management.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".