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

Error

Bits error versus v0

Bits error versus t

Bits error versus v1

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[v0 + t \cdot \left(v1 - v0\right)\]

  2. Final simplification0.0

    \[\leadsto v0 + t \cdot \left(v1 - v0\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (v0 t v1)
  :name "(+ v0 (* t (- v1 v0)))"
  :precision binary64
  (+ v0 (* t (- v1 v0))))