DinnerFor11 proves that OP(3,3,5) has no solution. Despite the result is well known in literature, there is no proof other than a self-referencing unpublished paper.
We quote the original source paper cited by most of the literature:
Of course, the ‘problem’ is to decide whether the above conjecture is true or false. (The first ‘exceptional case’, namely C(4,5)!=K(9), has been proven by several authors; in an unpublished paper [6] the author proved C(3,3,5)!=K(11) with the aid of a computer.)
[6] W.L. Piotrowski, Untersuchungen iiber das Oberwolfacher Problem, 1979, manuscript
Sourced from this paper
This repository is maintained by ALCO@Politecnico di Torino. TheObersolver is a pre-release software for solving the Oberwolfach Problem.
This software uses IBM CPLEX. Scholars are entitled to obtain a free license via the IBM Academic Initiative.
MIT Licensescholars
Copyright (c) 2018 ALCO@PoliTO
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.