Average Error: 0.0 → 0.0
Time: 22.4s
Precision: binary64
\[x \cdot y + z \cdot t\]
↓
\[z \cdot t + x \cdot y\]
x \cdot y + z \cdot t
↓
z \cdot t + x \cdot y
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
↓
(FPCore (x y z t) :precision binary64 (+ (* z t) (* x y)))
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}
↓
double code(double x, double y, double z, double t) {
	return (z * t) + (x * y);
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]
  2. Using strategy rm

  3. Applied +-commutative_binary64_13720.0

    \[\leadsto \color{blue}{z \cdot t + x \cdot y}\]

  4. Final simplification0.0

    \[\leadsto z \cdot t + x \cdot y\]

Reproduce

herbie shell --seed 2021076 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))