Average Error: 0.1 → 0.1
Time: 1.5s
Precision: binary64
\[\left(\left(a \cdot t\right) \cdot t + s \cdot t\right) + p\]
\[p + t \cdot \left(a \cdot t + s\right)\]
\left(\left(a \cdot t\right) \cdot t + s \cdot t\right) + p
p + t \cdot \left(a \cdot t + s\right)
double code(double a, double t, double s, double p) {
	return ((double) (((double) (((double) (((double) (a * t)) * t)) + ((double) (s * t)))) + p));
}
double code(double a, double t, double s, double p) {
	return ((double) (p + ((double) (t * ((double) (((double) (a * t)) + s))))));
}

Error

Bits error versus a

Bits error versus t

Bits error versus s

Bits error versus p

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(\left(a \cdot t\right) \cdot t + s \cdot t\right) + p\]
  2. Simplified0.1

    \[\leadsto \color{blue}{p + t \cdot \left(a \cdot t + s\right)}\]
  3. Final simplification0.1

    \[\leadsto p + t \cdot \left(a \cdot t + s\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a t s p)
  :name "(+ (+ (* (* a t) t) (* s t)) p)"
  :precision binary64
  (+ (+ (* (* a t) t) (* s t)) p))