Average Error: 13.0 → 0.0
Time: 3.7s
Precision: binary64
\[\]
\[\]
double code(double x, double y, double z) {
	return ((double) (((double) (((double) (((double) (x * y)) - ((double) (y * y)))) + ((double) (y * y)))) - ((double) (y * z))));
}
double code(double x, double y, double z) {
	return ((double) (((double) (y * x)) - ((double) (y * z))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original13.0
Target0.0
Herbie0.0
\[\]

Derivation

  1. Initial program 13.0

    \[\]
  2. Simplified0.0

    \[\leadsto \]
  3. Using strategy rm
  4. Applied sub-neg0.0

    \[\leadsto \]
  5. Applied distribute-lft-in0.0

    \[\leadsto \]
  6. Final simplification0.0

    \[\leadsto \]

Reproduce

herbie shell --seed 2020191 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, D"
  :precision binary64

  :herbie-target
  (* (- x z) y)

  (- (+ (- (* x y) (* y y)) (* y y)) (* y z)))