Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
\[x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)\]
↓
\[x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)\]
x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)
↓
x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)
double code(double x, double v, double v1, double dt) {
	return ((double) (x + ((double) (((double) (v + v1)) * ((double) (dt * 0.5))))));
}
↓
double code(double x, double v, double v1, double dt) {
	return ((double) (x + ((double) (((double) (v + v1)) * ((double) (dt * 0.5))))));
}

Error

Bits error versus x

Bits error versus v

Bits error versus v1

Bits error versus dt

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)\]

  2. Final simplification0.0

    \[\leadsto x + \left(v + v1\right) \cdot \left(dt \cdot 0.5\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x v v1 dt)
  :name "(+ x (* (+ v v1) (* dt 0.5)))"
  :precision binary64
  (+ x (* (+ v v1) (* dt 0.5))))