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)

sample756.0ms (75.2%)

Results

546.0ms

8256×

valid

Precisions

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

ival-add: 74.0ms (48% of total)

ival-mult: 69.0ms (44.8% of total)

const: 9.0ms (5.8% of total)

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

Bogosity

preprocess30.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)

explain53.0ms (5.2%)

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`y`
-	-	`(+.f64 y y)`
-	-	`(*.f64 x (+.f64 y y))`

Results

37.0ms

512×

valid

Compiler

Compiled 33 to 14 computations (57.6% saved)

Precisions

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

ival-add: 6.0ms (46.8% of total)

ival-mult: 6.0ms (46.8% of total)

const: 1.0ms (7.8% 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
▶	100.0%	(*.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

localize23.0ms (2.3%)

Localize:

Found 2 expressions of interest:

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

Results

18.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-add: 2.0ms (51.3% of total)

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

const: 0.0ms (0% of total)

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

series4.0ms (0.4%)

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
1.0ms	y	@	0	(* x (+ y y))
1.0ms	x	@	inf	(* x (+ y y))
1.0ms	x	@	0	(* x (+ y y))
0.0ms	y	@	inf	(* x (+ y y))
0.0ms	y	@	inf	(+ y y)

rewrite59.0ms (5.9%)

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	142	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.6%)

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)

eval8.0ms (0.8%)

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

prune4.0ms (0.4%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	61	0	61
Fresh	0	0	0
Picked	0	1	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 x (+.f64 y y))

Compiler

Compiled 14 to 8 computations (42.9% saved)

simplify7.0ms (0.7%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5
1	5	5

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Stop Event

1×

done

Compiler

Compiled 7 to 4 computations (42.9% saved)

preprocess50.0ms (5%)

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 112 to 64 computations (42.9% saved)

Numeric.Integration.TanhSinh:simpson from integration-0.2.1

analyze0.0ms (0%)

sample756.0ms (75.2%)

preprocess30.0ms (2.9%)

explain53.0ms (5.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.4%)

localize23.0ms (2.3%)

series4.0ms (0.4%)

rewrite59.0ms (5.9%)

simplify6.0ms (0.6%)

eval8.0ms (0.8%)

prune4.0ms (0.4%)

simplify7.0ms (0.7%)

soundness0.0ms (0%)

preprocess50.0ms (5%)

end0.0ms (0%)

Profiling