Metrics for Numeric.Integration.TanhSinh:simpson from integration-0.2.1

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 8 to 5 computations (37.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 0.0ms

ival-add: 0.0ms (0% of total)

ival-mult: 0.0ms (0% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample632.0ms (56.3%)

Results

411.0ms

8256×

valid

Precisions

Click to see histograms. Total time spent on operations: 148.0ms

ival-mult: 92.0ms (62% of total)

ival-add: 47.0ms (31.7% of total)

const: 7.0ms (4.7% of total)

backward-pass: 3.0ms (2% of total)

Bogosity

preprocess33.0ms (2.9%)

Algorithm

2×	egg-herbie

Rules

274×	`fnmsub-define`
274×	`fmsub-define`
262×	`fnmadd-define`
166×	`fmm-def`
156×	`fma-define`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	32
1	52	30
2	147	30
3	390	30
4	745	30
5	1120	30
6	1184	30
0	4	5
1	11	5
2	21	5
3	24	5
0	24	5

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* x (+ y y))

Outputs
(* x (+ y y))
(.f64 x (.f64 y #s(literal 2 binary64)))

Call 2

Inputs
(* x (+ y y))
(* (neg x) (+ y y))
(* x (+ (neg y) (neg y)))
(neg (* (neg x) (+ y y)))
(neg (* x (+ (neg y) (neg y))))
(* y (+ x x))

Outputs
(* x (+ y y))
(* (neg x) (+ y y))
(* x (* y -2))
(* x (+ (neg y) (neg y)))
(* x (* y -2))
(neg (* (neg x) (+ y y)))
(* x (+ y y))
(neg (* x (+ (neg y) (neg y))))
(* x (+ y y))
(* y (+ x x))
(* x (+ y y))

Symmetry

(negabs x)

(negabs y)

(sort x y)

explain69.0ms (6.2%)

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
1	-	-	`(*.f64 x (+.f64 y y))`
0	-	-	`x`
0	-	-	`y`
0	-	-	`(+.f64 y y)`

Results

51.0ms

512×

valid

Compiler

Compiled 33 to 14 computations (57.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 37.0ms

ival-add: 32.0ms (87.6% of total)

ival-mult: 4.0ms (10.9% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(*.f64 x (+.f64 y y))

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify4.0ms (0.4%)

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(+.f64 y y)
✓	cost-diff	0	(*.f64 x (+.f64 y y))

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
8×	`count-2`
6×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	11	10
2	21	10
3	24	10
0	24	10

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* x (+ y y))
x
(+ y y)
y

Outputs
(* x (+ y y))
(.f64 x (.f64 y #s(literal 2 binary64)))
x
(+ y y)
(*.f64 y #s(literal 2 binary64))
y

localize17.0ms (1.5%)

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(+.f64 y y)
✓	accuracy	99.6%	(*.f64 x (+.f64 y y))

Results

11.0ms

256×

valid

Compiler

Compiled 13 to 5 computations (61.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 4.0ms

ival-mult: 2.0ms (52% of total)

ival-add: 1.0ms (26% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series19.0ms (1.7%)

Counts

2 → 36

Calls

Call 1

Inputs
#<alt (* x (+ y y))>
#<alt (+ y y)>

Outputs
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>

Calls

9 calls:

Time	Variable		Point	Expression
15.0ms	x	@	inf	(* x (+ y y))
1.0ms	y	@	0	(* x (+ y y))
1.0ms	x	@	0	(* x (+ y y))
1.0ms	y	@	inf	(* x (+ y y))
0.0ms	y	@	inf	(+ y y)

rewrite45.0ms (4%)

Algorithm

1×	batch-egg-rewrite

Rules

56×	`-lowering-.f32`
56×	`-lowering-.f64`
38×	`/-lowering-/.f32`
38×	`/-lowering-/.f64`
32×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
1	20	8
0	141	8

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound

Counts

2 → 25

Calls

Call 1

Inputs
(* x (+ y y))
(+ y y)

Outputs
(+.f64 (.f64 x y) (.f64 x y))
(fma.f64 x y (*.f64 x y))
(fma.f64 y x (*.f64 x y))
(/.f64 (+.f64 (pow.f64 (.f64 x y) #s(literal 3 binary64)) (pow.f64 (.f64 x y) #s(literal 3 binary64))) (+.f64 (.f64 (.f64 x y) (.f64 x y)) (-.f64 (.f64 (.f64 x y) (.f64 x y)) (.f64 (.f64 x y) (*.f64 x y)))))
(/.f64 (-.f64 (.f64 (.f64 x y) (.f64 x y)) (.f64 (.f64 x y) (.f64 x y))) (-.f64 (.f64 x y) (.f64 x y)))
(/.f64 (.f64 x (.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (+.f64 (.f64 y y) #s(literal 0 binary64)))
(/.f64 (*.f64 x #s(literal 0 binary64)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) x) (+.f64 (.f64 y y) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64))
(*.f64 x (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(*.f64 y (+.f64 x x))
(*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) x)
(.f64 #s(literal 2 binary64) (.f64 x y))
(.f64 (.f64 x #s(literal 2 binary64)) y)
(+.f64 y y)
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(/.f64 (.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (+.f64 (*.f64 y y) #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (neg.f64 (.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (neg.f64 (+.f64 (*.f64 y y) #s(literal 0 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (.f64 (+.f64 (*.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))))
(*.f64 y #s(literal 2 binary64))
(.f64 (.f64 (+.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (.f64 y y) #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) y)

simplify6.0ms (0.5%)

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
10×	`*-commutative`
4×	`associate-r`
4×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	156
1	11	156
2	16	156
0	16	156

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)

Outputs
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 (* x y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)
(* 2 y)
(*.f64 #s(literal 2 binary64) y)

eval5.0ms (0.4%)

Compiler: Compiled 449 to 63 computations (86% saved)

prune5.0ms (0.4%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	60	1	61
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	61	1	62

Accuracy

100.0%

Counts

62 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

simplify4.0ms (0.3%)

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 x #s(literal 2 binary64))
✓	cost-diff	0	(.f64 (.f64 x #s(literal 2 binary64)) y)

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
1	9	11
2	16	11
3	18	11
0	18	11

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* (* x 2) y)
(* x 2)
x
2
y

Outputs
(* (* x 2) y)
(.f64 x (.f64 #s(literal 2 binary64) y))
(* x 2)
(*.f64 x #s(literal 2 binary64))
x
2
#s(literal 2 binary64)
y

localize22.0ms (2%)

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) y)
✓	accuracy	100.0%	(*.f64 x #s(literal 2 binary64))

Results

16.0ms

256×

valid

Compiler

Compiled 14 to 6 computations (57.1% saved)

Precisions

Click to see histograms. Total time spent on operations: 8.0ms

ival-mult: 7.0ms (89.9% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series2.0ms (0.2%)

Counts

2 → 36

Calls

Call 1

Inputs
#<alt (* (* x 2) y)>
#<alt (* x 2)>

Outputs
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	(* x 2)
0.0ms	x	@	-inf	(* x 2)
0.0ms	x	@	0	(* x 2)
0.0ms	x	@	0	(* (* x 2) y)
0.0ms	x	@	inf	(* (* x 2) y)

rewrite10.0ms (0.9%)

Algorithm

1×	batch-egg-rewrite

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 8

Calls

Call 1

Inputs
(* (* x 2) y)
(* x 2)

Outputs
(.f64 x (.f64 #s(literal 2 binary64) y))
(.f64 #s(literal 2 binary64) (.f64 x y))
(.f64 (.f64 x #s(literal 2 binary64)) y)
(.f64 y (.f64 x #s(literal 2 binary64)))
(.f64 (.f64 #s(literal 2 binary64) y) x)
(.f64 (.f64 x y) #s(literal 2 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 #s(literal 2 binary64) x)

simplify8.0ms (0.7%)

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	156
1	10	156
2	16	156
3	17	156
0	17	156

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)

Outputs
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 (* x y))
(.f64 x (.f64 #s(literal 2 binary64) y))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)

eval4.0ms (0.3%)

Compiler: Compiled 222 to 14 computations (93.7% saved)

prune2.0ms (0.2%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	44	0	44
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	44	1	45

Accuracy

100.0%

Counts

45 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) y)

Compiler

Compiled 19 to 12 computations (36.8% saved)

regimes8.0ms (0.7%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))
(.f64 (.f64 x #s(literal 2 binary64)) y)

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) y)

Calls

4 calls:

3.0ms	(*.f64 x (+.f64 y y))
1.0ms	x
1.0ms	(+.f64 y y)
1.0ms	y

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(*.f64 x (+.f64 y y))`
100.0%	1	`(+.f64 y y)`

Compiler

Compiled 18 to 11 computations (38.9% saved)

regimes5.0ms (0.5%)

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))

Outputs
(*.f64 x (+.f64 y y))

Calls

4 calls:

1.0ms	y
1.0ms	(+.f64 y y)
1.0ms	x
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
99.6%	1	`x`
99.6%	1	`y`
99.6%	1	`(*.f64 x (+.f64 y y))`
99.6%	1	`(+.f64 y y)`

Compiler

Compiled 18 to 11 computations (38.9% saved)

simplify8.0ms (0.7%)

Algorithm

1×	egg-herbie

Rules

6×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	10	10

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) y)
(*.f64 x (+.f64 y y))

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) y)
(*.f64 x (+.f64 y y))

soundness32.0ms (2.9%)

Rules

56×	`-lowering-.f32`
56×	`-lowering-.f64`
38×	`/-lowering-/.f32`
38×	`/-lowering-/.f64`
32×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
1	20	8
0	141	8

Stop Event

1×	done
1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound

Compiler

Compiled 19 to 12 computations (36.8% saved)

preprocess182.0ms (16.2%)

Remove: (negabs y)
Compiler: Compiled 178 to 122 computations (31.5% saved)

Numeric.Integration.TanhSinh:simpson from integration-0.2.1

analyze0.0ms (0%)

sample632.0ms (56.3%)

preprocess33.0ms (2.9%)

explain69.0ms (6.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.4%)

localize17.0ms (1.5%)

series19.0ms (1.7%)

rewrite45.0ms (4%)

simplify6.0ms (0.5%)

eval5.0ms (0.4%)

prune5.0ms (0.4%)

simplify4.0ms (0.3%)

localize22.0ms (2%)

series2.0ms (0.2%)

rewrite10.0ms (0.9%)

simplify8.0ms (0.7%)

eval4.0ms (0.3%)

prune2.0ms (0.2%)

regimes8.0ms (0.7%)

regimes5.0ms (0.5%)

simplify8.0ms (0.7%)

soundness32.0ms (2.9%)

preprocess182.0ms (16.2%)

end0.0ms (0%)

Profiling