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

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 + t \cdot \left(y - x\right)\]

  2. Final simplification0.0

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

Reproduce

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