Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B

Average Accuracy: 100.0% → 100.0%

Time: 2.6s

Precision: binary64

Cost: 448

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * z
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (z * y) + (z * x)
end function

Java

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

↓

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

Python

def code(x, y, z):
	return (x + y) * z

↓

def code(x, y, z):
	return (z * y) + (z * x)

Julia

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

↓

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

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * z;
end

↓

function tmp = code(x, y, z)
	tmp = (z * y) + (z * x);
end

Wolfram

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

↓

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

Derivation

1. Initial program 100.0%

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

2. Applied egg-rr 100.0%

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

   [Start] 100.0	\[ \left(x + y\right) \cdot z \]
   *-commutative [=>] 100.0	\[ \color{blue}{z \cdot \left(x + y\right)} \]
   +-commutative [=>] 100.0	\[ z \cdot \color{blue}{\left(y + x\right)} \]
   distribute-lft-in [=>] 100.0	\[ \color{blue}{z \cdot y + z \cdot x} \]

3. Final simplification 100.0%

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

Alternatives

Alternative 1
Accuracy	64.4%
Cost	324

\[\begin{array}{l} \mathbf{if}\;y \leq 6.4 \cdot 10^{-79}:\\ \;\;\;\;z \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \]

Alternative 2
Accuracy	100.0%
Cost	320

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

Alternative 3
Accuracy	53.5%
Cost	192

\[z \cdot y \]

Reproduce

herbie shell --seed 2023138 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))