Average Error: 0.0 → 0.0
Time: 911.0ms
Precision: binary64
\[x \cdot \left(1 - t\right) + t \cdot y\]
↓
\[x \cdot \left(1 - t\right) + t \cdot y\]
x \cdot \left(1 - t\right) + t \cdot y
↓
x \cdot \left(1 - t\right) + t \cdot y
double code(double x, double t, double y) {
	return ((double) (((double) (x * ((double) (1.0 - t)))) + ((double) (t * y))));
}
↓
double code(double x, double t, double y) {
	return ((double) (((double) (x * ((double) (1.0 - t)))) + ((double) (t * y))));
}

Error

Bits error versus x

Bits error versus t

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot \left(1 - t\right) + t \cdot y\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(1 - t\right) + t \cdot y\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x t y)
  :name "(+ (* x (- 1 t)) (* t y))"
  :precision binary64
  (+ (* x (- 1.0 t)) (* t y)))