Average Error: 0.0 → 0.0
Time: 5.9s
Precision: binary64
\[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i\]
↓
\[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i\]
\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i
↓
\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((double) (((double) (((double) (((double) (x * y)) + ((double) (z * t)))) + ((double) (a * b)))) + ((double) (c * i))));
}
↓
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return ((double) (((double) (((double) (((double) (x * y)) + ((double) (z * t)))) + ((double) (a * b)))) + ((double) (c * i))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus i

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i\]

  2. Final simplification0.0

    \[\leadsto \left(\left(x \cdot y + z \cdot t\right) + a \cdot b\right) + c \cdot i\]

Reproduce

herbie shell --seed 2020150 
(FPCore (x y z t a b c i)
  :name "Linear.V4:$cdot from linear-1.19.1.3, C"
  :precision binary64
  (+ (+ (+ (* x y) (* z t)) (* a b)) (* c i)))