| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 448 |
\[\frac{f + n}{n - f}
\]

(FPCore (f n) :precision binary64 (/ (- (+ f n)) (- f n)))
(FPCore (f n) :precision binary64 (/ (+ f n) (- n f)))
double code(double f, double n) {
return -(f + n) / (f - n);
}
double code(double f, double n) {
return (f + n) / (n - f);
}
real(8) function code(f, n)
real(8), intent (in) :: f
real(8), intent (in) :: n
code = -(f + n) / (f - n)
end function
real(8) function code(f, n)
real(8), intent (in) :: f
real(8), intent (in) :: n
code = (f + n) / (n - f)
end function
public static double code(double f, double n) {
return -(f + n) / (f - n);
}
public static double code(double f, double n) {
return (f + n) / (n - f);
}
def code(f, n): return -(f + n) / (f - n)
def code(f, n): return (f + n) / (n - f)
function code(f, n) return Float64(Float64(-Float64(f + n)) / Float64(f - n)) end
function code(f, n) return Float64(Float64(f + n) / Float64(n - f)) end
function tmp = code(f, n) tmp = -(f + n) / (f - n); end
function tmp = code(f, n) tmp = (f + n) / (n - f); end
code[f_, n_] := N[((-N[(f + n), $MachinePrecision]) / N[(f - n), $MachinePrecision]), $MachinePrecision]
code[f_, n_] := N[(N[(f + n), $MachinePrecision] / N[(n - f), $MachinePrecision]), $MachinePrecision]
\frac{-\left(f + n\right)}{f - n}
\frac{f + n}{n - f}
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
Results
Initial program 100.0%
Simplified100.0%
[Start]100.0% | \[ \frac{-\left(f + n\right)}{f - n}
\] |
|---|---|
neg-mul-1 [=>]100.0% | \[ \frac{\color{blue}{-1 \cdot \left(f + n\right)}}{f - n}
\] |
*-commutative [=>]100.0% | \[ \frac{\color{blue}{\left(f + n\right) \cdot -1}}{f - n}
\] |
associate-/l* [=>]100.0% | \[ \color{blue}{\frac{f + n}{\frac{f - n}{-1}}}
\] |
div-sub [=>]100.0% | \[ \frac{f + n}{\color{blue}{\frac{f}{-1} - \frac{n}{-1}}}
\] |
metadata-eval [<=]100.0% | \[ \frac{f + n}{\frac{f}{\color{blue}{\frac{1}{-1}}} - \frac{n}{-1}}
\] |
metadata-eval [<=]100.0% | \[ \frac{f + n}{\frac{f}{\frac{\color{blue}{--1}}{-1}} - \frac{n}{-1}}
\] |
associate-/l* [<=]100.0% | \[ \frac{f + n}{\color{blue}{\frac{f \cdot -1}{--1}} - \frac{n}{-1}}
\] |
*-commutative [<=]100.0% | \[ \frac{f + n}{\frac{\color{blue}{-1 \cdot f}}{--1} - \frac{n}{-1}}
\] |
neg-mul-1 [<=]100.0% | \[ \frac{f + n}{\frac{\color{blue}{-f}}{--1} - \frac{n}{-1}}
\] |
metadata-eval [<=]100.0% | \[ \frac{f + n}{\frac{-f}{--1} - \frac{n}{\color{blue}{\frac{1}{-1}}}}
\] |
metadata-eval [<=]100.0% | \[ \frac{f + n}{\frac{-f}{--1} - \frac{n}{\frac{\color{blue}{--1}}{-1}}}
\] |
associate-/l* [<=]100.0% | \[ \frac{f + n}{\frac{-f}{--1} - \color{blue}{\frac{n \cdot -1}{--1}}}
\] |
*-commutative [=>]100.0% | \[ \frac{f + n}{\frac{-f}{--1} - \frac{\color{blue}{-1 \cdot n}}{--1}}
\] |
neg-mul-1 [<=]100.0% | \[ \frac{f + n}{\frac{-f}{--1} - \frac{\color{blue}{-n}}{--1}}
\] |
div-sub [<=]100.0% | \[ \frac{f + n}{\color{blue}{\frac{\left(-f\right) - \left(-n\right)}{--1}}}
\] |
unsub-neg [<=]100.0% | \[ \frac{f + n}{\frac{\color{blue}{\left(-f\right) + \left(-\left(-n\right)\right)}}{--1}}
\] |
remove-double-neg [=>]100.0% | \[ \frac{f + n}{\frac{\left(-f\right) + \color{blue}{n}}{--1}}
\] |
+-commutative [<=]100.0% | \[ \frac{f + n}{\frac{\color{blue}{n + \left(-f\right)}}{--1}}
\] |
sub-neg [<=]100.0% | \[ \frac{f + n}{\frac{\color{blue}{n - f}}{--1}}
\] |
metadata-eval [=>]100.0% | \[ \frac{f + n}{\frac{n - f}{\color{blue}{1}}}
\] |
/-rgt-identity [=>]100.0% | \[ \frac{f + n}{\color{blue}{n - f}}
\] |
Final simplification100.0%
| Alternative 1 | |
|---|---|
| Accuracy | 100.0% |
| Cost | 448 |
| Alternative 2 | |
|---|---|
| Accuracy | 74.0% |
| Cost | 585 |
| Alternative 3 | |
|---|---|
| Accuracy | 73.7% |
| Cost | 328 |
| Alternative 4 | |
|---|---|
| Accuracy | 49.6% |
| Cost | 64 |
herbie shell --seed 2023165
(FPCore (f n)
:name "subtraction fraction"
:precision binary64
(/ (- (+ f n)) (- f n)))