Average Error: 0.0 → 0.0
Time: 1.2s
Precision: binary64
\[\left({ax}^{2} + bx\right) + c\]
↓
\[\left({ax}^{2} + bx\right) + c\]
\left({ax}^{2} + bx\right) + c
↓
\left({ax}^{2} + bx\right) + c
double code(double ax, double bx, double c) {
	return ((double) (((double) (((double) pow(ax, 2.0)) + bx)) + c));
}
↓
double code(double ax, double bx, double c) {
	return ((double) (((double) (((double) pow(ax, 2.0)) + bx)) + c));
}

Error

Bits error versus ax

Bits error versus bx

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left({ax}^{2} + bx\right) + c\]

  2. Final simplification0.0

    \[\leadsto \left({ax}^{2} + bx\right) + c\]

Reproduce

herbie shell --seed 2020153 
(FPCore (ax bx c)
  :name "(+ (+ (pow ax 2) bx) c)"
  :precision binary64
  (+ (+ (pow ax 2.0) bx) c))