Rosa's DopplerBench

Average Error: 18.2 → 1.6

Time: 8.5s

Precision: binary64

Cost: 832

Math

\[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]

↓

\[\frac{\frac{1}{-1 - \frac{u}{t1}}}{\frac{u + t1}{v}} \]

FPCore

(FPCore (u v t1) :precision binary64 (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))

↓

(FPCore (u v t1)
 :precision binary64
 (/ (/ 1.0 (- -1.0 (/ u t1))) (/ (+ u t1) v)))

C

double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

↓

double code(double u, double v, double t1) {
	return (1.0 / (-1.0 - (u / t1))) / ((u + t1) / v);
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = (-t1 * v) / ((t1 + u) * (t1 + u))
end function

↓

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = (1.0d0 / ((-1.0d0) - (u / t1))) / ((u + t1) / v)
end function

Java

public static double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

↓

public static double code(double u, double v, double t1) {
	return (1.0 / (-1.0 - (u / t1))) / ((u + t1) / v);
}

Python

def code(u, v, t1):
	return (-t1 * v) / ((t1 + u) * (t1 + u))

↓

def code(u, v, t1):
	return (1.0 / (-1.0 - (u / t1))) / ((u + t1) / v)

Julia

function code(u, v, t1)
	return Float64(Float64(Float64(-t1) * v) / Float64(Float64(t1 + u) * Float64(t1 + u)))
end

↓

function code(u, v, t1)
	return Float64(Float64(1.0 / Float64(-1.0 - Float64(u / t1))) / Float64(Float64(u + t1) / v))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = (-t1 * v) / ((t1 + u) * (t1 + u));
end

↓

function tmp = code(u, v, t1)
	tmp = (1.0 / (-1.0 - (u / t1))) / ((u + t1) / v);
end

Wolfram

code[u_, v_, t1_] := N[(N[((-t1) * v), $MachinePrecision] / N[(N[(t1 + u), $MachinePrecision] * N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[u_, v_, t1_] := N[(N[(1.0 / N[(-1.0 - N[(u / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(u + t1), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.2

   \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]

2. Simplified 1.4

   \[\leadsto \color{blue}{\frac{\frac{v}{t1 + u}}{-1 - \frac{u}{t1}}} \]
   Proof
   (/.f64 (/.f64 v (+.f64 t1 u)) (-.f64 -1 (/.f64 u t1))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (-.f64 (Rewrite<= metadata-eval (neg.f64 1)) (/.f64 u t1))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (-.f64 (neg.f64 (Rewrite<= *-inverses_binary64 (/.f64 t1 t1))) (/.f64 u t1))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (-.f64 (Rewrite<= distribute-frac-neg_binary64 (/.f64 (neg.f64 t1) t1)) (/.f64 u t1))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (Rewrite<= div-sub_binary64 (/.f64 (-.f64 (neg.f64 t1) u) t1))): 2 points increase in error, 1 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (Rewrite<= unsub-neg_binary64 (+.f64 (neg.f64 t1) (neg.f64 u))) t1)): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (Rewrite=> distribute-neg-out_binary64 (neg.f64 (+.f64 t1 u))) t1)): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (Rewrite=> neg-mul-1_binary64 (*.f64 -1 (+.f64 t1 u))) t1)): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (*.f64 -1 (+.f64 t1 u)) (Rewrite<= remove-double-neg_binary64 (neg.f64 (neg.f64 t1))))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (*.f64 -1 (+.f64 t1 u)) (Rewrite=> neg-mul-1_binary64 (*.f64 -1 (neg.f64 t1))))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (Rewrite=> times-frac_binary64 (*.f64 (/.f64 -1 -1) (/.f64 (+.f64 t1 u) (neg.f64 t1))))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (*.f64 (Rewrite=> metadata-eval 1) (/.f64 (+.f64 t1 u) (neg.f64 t1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (Rewrite=> *-lft-identity_binary64 (/.f64 (+.f64 t1 u) (neg.f64 t1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (+.f64 t1 u) (Rewrite=> neg-mul-1_binary64 (*.f64 -1 t1)))): 0 points increase in error, 0 points decrease in error
   (/.f64 (/.f64 v (+.f64 t1 u)) (Rewrite<= associate-/l/_binary64 (/.f64 (/.f64 (+.f64 t1 u) t1) -1))): 0 points increase in error, 0 points decrease in error
   (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (/.f64 v (+.f64 t1 u)) -1) (/.f64 (+.f64 t1 u) t1))): 0 points increase in error, 0 points decrease in error
   (Rewrite<= associate-*r/_binary64 (*.f64 (/.f64 v (+.f64 t1 u)) (/.f64 -1 (/.f64 (+.f64 t1 u) t1)))): 10 points increase in error, 6 points decrease in error
   (*.f64 (/.f64 v (+.f64 t1 u)) (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 -1 t1) (+.f64 t1 u)))): 3 points increase in error, 6 points decrease in error
   (*.f64 (/.f64 v (+.f64 t1 u)) (/.f64 (Rewrite<= neg-mul-1_binary64 (neg.f64 t1)) (+.f64 t1 u))): 0 points increase in error, 0 points decrease in error
   (Rewrite<= times-frac_binary64 (/.f64 (*.f64 v (neg.f64 t1)) (*.f64 (+.f64 t1 u) (+.f64 t1 u)))): 97 points increase in error, 13 points decrease in error
   (/.f64 (Rewrite<= *-commutative_binary64 (*.f64 (neg.f64 t1) v)) (*.f64 (+.f64 t1 u) (+.f64 t1 u))): 0 points increase in error, 0 points decrease in error

3. Applied egg-rr 1.8

   \[\leadsto \color{blue}{{\left(\left(-1 - \frac{u}{t1}\right) \cdot \frac{t1 + u}{v}\right)}^{-1}} \]

4. Applied egg-rr 1.6

   \[\leadsto \color{blue}{\frac{\frac{1}{-1 - \frac{u}{t1}}}{\frac{u + t1}{v}}} \]

5. Final simplification 1.6

   \[\leadsto \frac{\frac{1}{-1 - \frac{u}{t1}}}{\frac{u + t1}{v}} \]

Alternatives

Alternative 1
Error	15.1
Cost	1104

\[\begin{array}{l} t_1 := \frac{v}{u \cdot -2 - t1}\\ \mathbf{if}\;t1 \leq -4.6 \cdot 10^{-78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 2.8 \cdot 10^{-74}:\\ \;\;\;\;\frac{-1}{u} \cdot \frac{t1}{\frac{u}{v}}\\ \mathbf{elif}\;t1 \leq 3.3 \cdot 10^{-13}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 1.4 \cdot 10^{+74}:\\ \;\;\;\;\frac{\frac{v}{u}}{-1 - \frac{u}{t1}}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 2
Error	15.2
Cost	1040

\[\begin{array}{l} t_1 := \frac{-v}{u} \cdot \frac{t1}{u}\\ t_2 := \frac{v}{u \cdot -2 - t1}\\ \mathbf{if}\;t1 \leq -1.1 \cdot 10^{-77}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t1 \leq 1.7 \cdot 10^{-73}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 8 \cdot 10^{-17}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t1 \leq 1.55 \cdot 10^{+72}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]

Alternative 3
Error	15.1
Cost	1040

\[\begin{array}{l} t_1 := \frac{t1 \cdot \frac{v}{u}}{-u}\\ t_2 := \frac{v}{u \cdot -2 - t1}\\ \mathbf{if}\;t1 \leq -1.25 \cdot 10^{-77}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t1 \leq 9 \cdot 10^{-74}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 2 \cdot 10^{-14}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t1 \leq 2.55 \cdot 10^{+70}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]

Alternative 4
Error	15.2
Cost	1040

\[\begin{array}{l} t_1 := \frac{v}{u \cdot -2 - t1}\\ \mathbf{if}\;t1 \leq -1.25 \cdot 10^{-77}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 9.2 \cdot 10^{-80}:\\ \;\;\;\;\frac{-1}{u} \cdot \frac{t1}{\frac{u}{v}}\\ \mathbf{elif}\;t1 \leq 2.6 \cdot 10^{-17}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 3.7 \cdot 10^{+71}:\\ \;\;\;\;\frac{t1 \cdot \frac{v}{u}}{-u}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 5
Error	3.3
Cost	836

\[\begin{array}{l} \mathbf{if}\;u \leq 3.3 \cdot 10^{+151}:\\ \;\;\;\;\frac{v}{\left(-1 - \frac{u}{t1}\right) \cdot \left(u + t1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{-v}{u} \cdot \frac{t1}{u}\\ \end{array} \]

Alternative 6
Error	14.2
Cost	776

\[\begin{array}{l} t_1 := \frac{v}{u \cdot -2 - t1}\\ \mathbf{if}\;t1 \leq -1.5 \cdot 10^{-78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t1 \leq 1.5 \cdot 10^{-76}:\\ \;\;\;\;v \cdot \frac{\frac{-t1}{u}}{u}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 7
Error	20.5
Cost	712

\[\begin{array}{l} t_1 := t1 \cdot \frac{\frac{v}{u}}{u}\\ \mathbf{if}\;u \leq -5.2 \cdot 10^{+137}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;u \leq 6 \cdot 10^{+47}:\\ \;\;\;\;\frac{-v}{u + t1}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 8
Error	20.4
Cost	712

\[\begin{array}{l} t_1 := t1 \cdot \frac{v}{u \cdot u}\\ \mathbf{if}\;u \leq -1.55 \cdot 10^{+137}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;u \leq 6 \cdot 10^{+47}:\\ \;\;\;\;\frac{-v}{u + t1}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 9
Error	20.2
Cost	712

\[\begin{array}{l} t_1 := t1 \cdot \frac{v}{u \cdot u}\\ \mathbf{if}\;u \leq -3.6 \cdot 10^{+137}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;u \leq 1.8 \cdot 10^{+47}:\\ \;\;\;\;\frac{v}{u \cdot -2 - t1}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 10
Error	1.4
Cost	704

\[\frac{\frac{v}{u + t1}}{-1 - \frac{u}{t1}} \]

Alternative 11
Error	27.2
Cost	520

\[\begin{array}{l} t_1 := \frac{-v}{u}\\ \mathbf{if}\;u \leq -5.8 \cdot 10^{+134}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;u \leq 2.35 \cdot 10^{+148}:\\ \;\;\;\;\frac{-v}{t1}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 12
Error	24.7
Cost	384

\[\frac{-v}{u + t1} \]

Alternative 13
Error	30.5
Cost	256

\[\frac{-v}{t1} \]

Reproduce

herbie shell --seed 2022328 
(FPCore (u v t1)
  :name "Rosa's DopplerBench"
  :precision binary64
  (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))