Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 6.5s

Precision: binary64

Cost: 448

Math

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

↓

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

FPCore

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

↓

(FPCore (x y z) :precision binary64 (+ x (* y (+ 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 x + (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 + x))
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 = x + (y * (z + x))
end function

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	24.3
Cost	588

\[\begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{+214}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -1.15 \cdot 10^{-8}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 2
Error	12.4
Cost	584

\[\begin{array}{l} t_0 := y \cdot \left(z + x\right)\\ \mathbf{if}\;y \leq -1.22 \cdot 10^{-8}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 7.8 \cdot 10^{-21}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	12.4
Cost	584

\[\begin{array}{l} t_0 := y \cdot \left(z + x\right)\\ \mathbf{if}\;y \leq -21:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 45:\\ \;\;\;\;\left(1 + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	0.8
Cost	584

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

Alternative 5
Error	24.5
Cost	456

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

Alternative 6
Error	35.3
Cost	64

\[x \]

Reproduce

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