Average Error: 6.6 → 6.6
Time: 1.9s
Precision: binary64
Cost: 576
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
↓
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
x + \frac{y \cdot \left(z - x\right)}{t}
↓
x + \frac{y \cdot \left(z - x\right)}{t}
(FPCore (x y z t) :precision binary64 (+ x (/ (* y (- z x)) t)))
↓
(FPCore (x y z t) :precision binary64 (+ x (/ (* y (- z x)) t)))
double code(double x, double y, double z, double t) {
	return x + ((y * (z - x)) / t);
}
↓
double code(double x, double y, double z, double t) {
	return x + ((y * (z - x)) / t);
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original6.6
Target2.2
Herbie6.6
\[x - \left(x \cdot \frac{y}{t} + \left(-z\right) \cdot \frac{y}{t}\right)\]

Derivation

  1. Initial program 6.6

    \[x + \frac{y \cdot \left(z - x\right)}{t}\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, D"
  :precision binary64

  :herbie-target
  (- x (+ (* x (/ y t)) (* (- z) (/ y t))))

  (+ x (/ (* y (- z x)) t)))