Linear.Quaternion:$c/ from linear-1.19.1.3, D

Average Error: 12.8 → 0.0

Time: 4.5s

Precision: binary64

Cost: 6784

Math

\[\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z \]

↓

\[\mathsf{fma}\left(y, -z, y \cdot x\right) \]

FPCore

(FPCore (x y z)
 :precision binary64
 (- (+ (- (* x y) (* y y)) (* y y)) (* y z)))

↓

(FPCore (x y z) :precision binary64 (fma y (- z) (* y x)))

C

double code(double x, double y, double z) {
	return (((x * y) - (y * y)) + (y * y)) - (y * z);
}

↓

double code(double x, double y, double z) {
	return fma(y, -z, (y * x));
}

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(x * y) - Float64(y * y)) + Float64(y * y)) - Float64(y * z))
end

↓

function code(x, y, z)
	return fma(y, Float64(-z), Float64(y * x))
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(x * y), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(y * z), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(y * (-z) + N[(y * x), $MachinePrecision]), $MachinePrecision]

Target

Original	12.8
Target	0.0
Herbie	0.0

\[\left(x - z\right) \cdot y \]

Derivation

1. Initial program 12.8

   \[\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z \]

2. Simplified 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, -z, x \cdot y\right)} \]
   Proof

   [Start] 12.8	\[ \left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z \]
   sub-neg [=>] 12.8	\[ \color{blue}{\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) + \left(-y \cdot z\right)} \]
   +-commutative [=>] 12.8	\[ \color{blue}{\left(-y \cdot z\right) + \left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right)} \]
   associate-+l- [=>] 8.2	\[ \left(-y \cdot z\right) + \color{blue}{\left(x \cdot y - \left(y \cdot y - y \cdot y\right)\right)} \]
   associate-+r- [=>] 8.2	\[ \color{blue}{\left(\left(-y \cdot z\right) + x \cdot y\right) - \left(y \cdot y - y \cdot y\right)} \]
   +-inverses [=>] 0.0	\[ \left(\left(-y \cdot z\right) + x \cdot y\right) - \color{blue}{0} \]
   --rgt-identity [=>] 0.0	\[ \color{blue}{\left(-y \cdot z\right) + x \cdot y} \]
   distribute-rgt-neg-in [=>] 0.0	\[ \color{blue}{y \cdot \left(-z\right)} + x \cdot y \]
   fma-def [=>] 0.0	\[ \color{blue}{\mathsf{fma}\left(y, -z, x \cdot y\right)} \]

3. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, -z, y \cdot x\right) \]

Alternatives

Alternative 1
Error	16.4
Cost	521

\[\begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{+44} \lor \neg \left(z \leq 2.6 \cdot 10^{-97}\right):\\ \;\;\;\;-y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 2
Error	0.0
Cost	320

\[y \cdot \left(x - z\right) \]

Alternative 3
Error	30.2
Cost	192

\[y \cdot x \]

Reproduce

herbie shell --seed 2023031 
(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)))