Main:bigenough2 from A

Average Accuracy: 100.0% → 100.0%

Time: 5.9s

Precision: binary64

Cost: 6720

Math

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

↓

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

FPCore

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

↓

(FPCore (x y z) :precision binary64 (fma y (+ x z) x))

C

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

↓

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

Julia

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 100.0%

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

2. Simplified 100.0%

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

   [Start] 100.0	\[ x + y \cdot \left(z + x\right) \]
   +-commutative [=>] 100.0	\[ \color{blue}{y \cdot \left(z + x\right) + x} \]
   fma-def [=>] 100.0	\[ \color{blue}{\mathsf{fma}\left(y, z + x, x\right)} \]
   +-commutative [=>] 100.0	\[ \mathsf{fma}\left(y, \color{blue}{x + z}, x\right) \]

3. Final simplification 100.0%

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

Alternatives

Alternative 1
Accuracy	62.3%
Cost	588

\[\begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{-36}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 9 \cdot 10^{-20}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{+55}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 2
Accuracy	79.7%
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{-36} \lor \neg \left(y \leq 4.5 \cdot 10^{-20}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3
Accuracy	80.1%
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -30000 \lor \neg \left(y \leq 29000\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \end{array} \]

Alternative 4
Accuracy	98.5%
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \]

Alternative 5
Accuracy	62.0%
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -0.038:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 6
Accuracy	100.0%
Cost	448

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

Alternative 7
Accuracy	44.9%
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023146 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))