Expression 4, p15

Average Error: 0.0 → 0.0

Time: 3.7s

Precision: binary64

Cost: 704

\[\left(5 \leq a \land a \leq 10\right) \land \left(0 \leq b \land b \leq 0.001\right)\]

\[ \begin{array}{c}[a, b] = \mathsf{sort}([a, b])\\ \end{array} \]

Math

\[\left(a + b\right) \cdot \left(a + b\right) \]

↓

\[b \cdot \left(b + a \cdot 2\right) + a \cdot a \]

FPCore

(FPCore (a b) :precision binary64 (* (+ a b) (+ a b)))

↓

(FPCore (a b) :precision binary64 (+ (* b (+ b (* a 2.0))) (* a a)))

C

double code(double a, double b) {
	return (a + b) * (a + b);
}

↓

double code(double a, double b) {
	return (b * (b + (a * 2.0))) + (a * a);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a + b) * (a + b)
end function

↓

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (b * (b + (a * 2.0d0))) + (a * a)
end function

Java

public static double code(double a, double b) {
	return (a + b) * (a + b);
}

↓

public static double code(double a, double b) {
	return (b * (b + (a * 2.0))) + (a * a);
}

Python

def code(a, b):
	return (a + b) * (a + b)

↓

def code(a, b):
	return (b * (b + (a * 2.0))) + (a * a)

Julia

function code(a, b)
	return Float64(Float64(a + b) * Float64(a + b))
end

↓

function code(a, b)
	return Float64(Float64(b * Float64(b + Float64(a * 2.0))) + Float64(a * a))
end

MATLAB

function tmp = code(a, b)
	tmp = (a + b) * (a + b);
end

↓

function tmp = code(a, b)
	tmp = (b * (b + (a * 2.0))) + (a * a);
end

Wolfram

code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a + b), $MachinePrecision]), $MachinePrecision]

↓

code[a_, b_] := N[(N[(b * N[(b + N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * a), $MachinePrecision]), $MachinePrecision]

Target

Original	0.0
Target	0.0
Herbie	0.0

\[\left(\left(b \cdot a + b \cdot b\right) + b \cdot a\right) + a \cdot a \]

Derivation

1. Initial program 0.0

   \[\left(a + b\right) \cdot \left(a + b\right) \]

2. Applied egg-rr 0.0

   \[\leadsto \color{blue}{b \cdot \left(a + b\right) + a \cdot \left(a + b\right)} \]

3. Taylor expanded in b around 0 0.0

   \[\leadsto \color{blue}{2 \cdot \left(a \cdot b\right) + \left({b}^{2} + {a}^{2}\right)} \]

4. Simplified 0.0

   \[\leadsto \color{blue}{b \cdot \left(a \cdot 2 + b\right) + a \cdot a} \]
   Proof

   [Start] 0.0	\[ 2 \cdot \left(a \cdot b\right) + \left({b}^{2} + {a}^{2}\right) \]
   associate-+r+ [=>] 0.0	\[ \color{blue}{\left(2 \cdot \left(a \cdot b\right) + {b}^{2}\right) + {a}^{2}} \]
   unpow2 [=>] 0.0	\[ \left(2 \cdot \left(a \cdot b\right) + {b}^{2}\right) + \color{blue}{a \cdot a} \]
   associate-*r* [=>] 0.0	\[ \left(\color{blue}{\left(2 \cdot a\right) \cdot b} + {b}^{2}\right) + a \cdot a \]
   unpow2 [=>] 0.0	\[ \left(\left(2 \cdot a\right) \cdot b + \color{blue}{b \cdot b}\right) + a \cdot a \]
   distribute-rgt-out [=>] 0.0	\[ \color{blue}{b \cdot \left(2 \cdot a + b\right)} + a \cdot a \]
   *-commutative [=>] 0.0	\[ b \cdot \left(\color{blue}{a \cdot 2} + b\right) + a \cdot a \]

5. Final simplification 0.0

   \[\leadsto b \cdot \left(b + a \cdot 2\right) + a \cdot a \]

Alternatives

Alternative 1
Error	0.0
Cost	704

\[b \cdot \left(b + a\right) + a \cdot \left(b + a\right) \]

Alternative 2
Error	0.2
Cost	448

\[b \cdot \left(b + a \cdot 2\right) \]

Alternative 3
Error	0.0
Cost	448

\[\left(b + a\right) \cdot \left(b + a\right) \]

Alternative 4
Error	0.8
Cost	192

\[b \cdot b \]

Reproduce

herbie shell --seed 2023027 
(FPCore (a b)
  :name "Expression 4, p15"
  :precision binary64
  :pre (and (and (<= 5.0 a) (<= a 10.0)) (and (<= 0.0 b) (<= b 0.001)))

  :herbie-target
  (+ (+ (+ (* b a) (* b b)) (* b a)) (* a a))

  (* (+ a b) (+ a b)))