Metrics for ReportTypes:explainFloat from gipeda-0.1.2.1

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze33.0ms (3.8%)

Memory

-34.6MiB live, 3.8MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample574.0ms (65.8%)

Memory

-4.7MiB live, 1 084.5MiB allocated

Samples

376.0ms

8 256×

valid

Precisions

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

ival-div: 88.0ms (46.3% of total)

ival-sub: 71.0ms (37.3% of total)

ival-mult: 18.0ms (9.5% of total)

ival-true: 5.0ms (2.6% of total)

exact: 4.0ms (2.1% of total)

ival-assert: 3.0ms (1.6% of total)

Bogosity

explain97.0ms (11.1%)

Memory

11.6MiB live, 89.7MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))`
-	-	`(-.f64 x x)`
-	-	`(/.f64 (-.f64 x x) x)`
-	-	`#s(literal 100 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

41.0ms

512×

valid

Compiler

Compiled 45 to 19 computations (57.8% saved)

Precisions

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

ival-sub: 3.0ms (38.7% of total)

ival-div: 3.0ms (38.7% of total)

ival-mult: 1.0ms (12.9% of total)

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

exact: 0.0ms (0% of total)

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

preprocess18.0ms (2%)

Memory

-3.4MiB live, 33.8MiB allocated

Algorithm

1×	egg-herbie

Rules

26×	`associate-/r*`
20×	`div-sub`
16×	`times-frac`
14×	`distribute-lft-neg-in`
14×	`sub-neg`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	8
1	30	2
2	78	2
3	117	2
4	141	2
5	148	2
6	154	2
7	156	2
8	160	2
0	5	7
0	8	3
1	15	1
2	28	1
3	31	1
4	33	1
5	35	1
6	39	1
7	44	1
0	44	1

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Outputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
#s(literal 0 binary64)

Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Compiler

Compiled 7 to 5 computations (28.6% saved)

simplify4.0ms (0.4%)

Memory

4.9MiB live, 4.9MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

New	Metric	Score
cost-diff	192	(-.f64 x x)
cost-diff	320	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
cost-diff	704	(/.f64 (-.f64 x x) x)

Rules

10×	`sub-neg`
8×	`lower-+.f64`
8×	`lower-+.f32`
6×	`lower--.f64`
6×	`lower--.f32`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	17
0	8	11
1	15	5
2	28	5
3	31	5
4	33	5
5	35	5
6	39	5
7	44	5
0	44	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
#s(literal 100 binary64)
(/.f64 (-.f64 x x) x)
(-.f64 x x)
x

Outputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
#s(literal 0 binary64)
#s(literal 100 binary64)
(/.f64 (-.f64 x x) x)
#s(literal 0 binary64)
(-.f64 x x)
#s(literal 0 binary64)
x

localize15.0ms (1.7%)

Memory

-12.2MiB live, 31.7MiB allocated

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0	(/.f64 (-.f64 x x) x)
accuracy	0	(-.f64 x x)
accuracy	0	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Samples

10.0ms

256×

valid

Compiler

Compiled 19 to 7 computations (63.2% saved)

Precisions

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

ival-div: 2.0ms (53.5% of total)

ival-sub: 1.0ms (26.7% of total)

ival-mult: 1.0ms (26.7% of total)

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

exact: 0.0ms (0% of total)

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

series1.0ms (0.1%)

Memory

1.4MiB live, 1.4MiB allocated

Counts

3 → 36

Calls

Call 1

Inputs
#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())
#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())
#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())

Inputs

#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())

#s(alt (*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())

#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())

Outputs
#s(alt 0 (taylor 0 x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (/.f64 (-.f64 x x) x) (patch (/.f64 (-.f64 x x) x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) (patch (.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ())

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((/ (- x x) x) (* 100 (/ (- x x) x)) (- x x))
0.0ms	x	@	0	((/ (- x x) x) (* 100 (/ (- x x) x)) (- x x))
0.0ms	x	@	inf	((/ (- x x) x) (* 100 (/ (- x x) x)) (- x x))

simplify3.0ms (0.3%)

Memory

4.4MiB live, 4.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	36
0	1	36

Stop Event

1×	saturated
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)

rewrite28.0ms (3.2%)

Memory

2.0MiB live, 40.8MiB allocated

Rules

34×	`lower-*.f64`
34×	`lower-*.f32`
30×	`lower-/.f64`
30×	`lower-/.f32`
28×	`lower-fma.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	8	9
1	33	3
0	158	3

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
(/.f64 (-.f64 x x) x)
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
(-.f64 x x)

Outputs
#s(literal 0 binary64)
#s(literal 0 binary64)
#s(literal 0 binary64)

eval3.0ms (0.3%)

Memory: 5.2MiB live, 5.2MiB allocated
Compiler: Compiled 153 to 12 computations (92.2% saved)

prune2.0ms (0.2%)

Memory

4.4MiB live, 4.4MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	38	1	39
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	39	1	40

Accuracy

100.0%

Counts

40 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Compiler

Compiled 2 to 3 computations (-50% saved)

simplify4.0ms (0.4%)

Memory

7.5MiB live, 7.5MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Rules

10×	`sub-neg`
8×	`lower-+.f64`
8×	`lower-+.f32`
6×	`lower--.f64`
6×	`lower--.f32`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	10
0	7	6
1	15	4
2	29	4
3	32	4
4	34	4
5	36	4
6	40	4
7	45	4
0	45	4

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))
#s(literal 0 binary64)

Outputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))
#s(literal 0 binary64)

localize13.0ms (1.4%)

Memory

-15.5MiB live, 23.8MiB allocated

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0	#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Samples

9.0ms

256×

valid

Compiler

Compiled 10 to 8 computations (20% saved)

Precisions

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

ival-sub: 1.0ms (26.8% of total)

ival-div: 1.0ms (26.8% of total)

ival-mult: 1.0ms (26.8% of total)

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated

Counts

1 → 12

Calls

Call 1

Inputs
#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())

Outputs
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) (patch #s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ())

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((* 100 (/ (- x x) x)))
0.0ms	x	@	inf	((* 100 (/ (- x x) x)))
0.0ms	x	@	-inf	((* 100 (/ (- x x) x)))

simplify3.0ms (0.3%)

Memory

5.7MiB live, 5.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	12
0	1	12

Stop Event

1×	saturated
1×	saturated

Counts

12 → 12

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)

rewrite21.0ms (2.4%)

Memory

-13.7MiB live, 23.9MiB allocated

Rules

34×	`lower-*.f64`
34×	`lower-*.f32`
30×	`lower-/.f64`
30×	`lower-/.f32`
28×	`lower-fma.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	9
0	7	5
1	33	3
0	158	3

Stop Event

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

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Outputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

eval1.0ms (0.1%)

Memory: 2.0MiB live, 2.0MiB allocated
Compiler: Compiled 26 to 3 computations (88.5% saved)

prune2.0ms (0.2%)

Memory

4.6MiB live, 4.6MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	13	1	14

Accuracy

100.0%

Counts

14 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Compiler

Compiled 11 to 10 computations (9.1% saved)

regimes4.0ms (0.4%)

Memory

10.0MiB live, 10.0MiB allocated

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Outputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
1.0ms	(/.f64 (-.f64 x x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))`
100.0%	1	`(/.f64 (-.f64 x x) x)`

Compiler

Compiled 13 to 9 computations (30.8% saved)

simplify24.0ms (2.8%)

Memory

4.2MiB live, 46.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	9

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

Outputs
#s(approx (* 100 (/ (- x x) x)) #s(literal 0 binary64))

soundness3.0ms (0.3%)

Memory

4.6MiB live, 4.6MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	36
0	1	36

Stop Event

1×	done
1×	saturated
1×	saturated

Compiler

Compiled 3 to 5 computations (-66.7% saved)

preprocess21.0ms (2.4%)

Memory: -22.9MiB live, 55.4MiB allocated
Compiler: Compiled 20 to 20 computations (0% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	7	8
1	30	2
2	78	2
3	117	2
4	141	2
5	148	2
6	154	2
7	156	2
8	160	2
0	5	7
0	8	3
1	15	1
2	28	1
3	31	1
4	33	1
5	35	1
6	39	1
7	44	1
0	44	1

Iter	Nodes	Cost
0	7	8
1	30	2
2	78	2
3	117	2
4	141	2
5	148	2
6	154	2
7	156	2
8	160	2
0	5	7
0	8	3
1	15	1
2	28	1
3	31	1
4	33	1
5	35	1
6	39	1
7	44	1
0	44	1

start0.0ms (0%)

analyze33.0ms (3.8%)

sample574.0ms (65.8%)

explain97.0ms (11.1%)

preprocess18.0ms (2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.4%)

localize15.0ms (1.7%)

series1.0ms (0.1%)

simplify3.0ms (0.3%)

rewrite28.0ms (3.2%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

simplify4.0ms (0.4%)

localize13.0ms (1.4%)

series0.0ms (0%)

simplify3.0ms (0.3%)

rewrite21.0ms (2.4%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

regimes4.0ms (0.4%)

simplify24.0ms (2.8%)

soundness3.0ms (0.3%)

preprocess21.0ms (2.4%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	7	8
1	30	2
2	78	2
3	117	2
4	141	2
5	148	2
6	154	2
7	156	2
8	160	2
0	5	7
0	8	3
1	15	1
2	28	1
3	31	1
4	33	1
5	35	1
6	39	1
7	44	1
0	44	1