Metrics for Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

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

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample882.0ms (26.9%)

Memory

9.6MiB live, 1 119.0MiB allocated; 255ms collecting garbage

Samples

534.0ms

8 256×

valid

Precisions

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

ival-mult: 165.0ms (73% of total)

ival-sub: 41.0ms (18.1% of total)

exact: 9.0ms (4% of total)

ival-true: 6.0ms (2.7% of total)

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

adjust: 2.0ms (0.9% of total)

Bogosity

explain78.0ms (2.4%)

Memory

-11.7MiB live, 185.7MiB allocated; 23ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`#s(literal 1 binary64)`
-	-	`(.f64 (.f64 x x) #s(literal 2 binary64))`
-	-	`(*.f64 x x)`
-	-	`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

24.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

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

ival-mult: 9.0ms (70.3% of total)

ival-sub: 2.0ms (15.6% of total)

exact: 1.0ms (7.8% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess196.0ms (6%)

Memory

39.2MiB live, 260.4MiB allocated; 56ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	23	15
2	73	15
3	212	15
4	710	14
5	3488	14
0	6	7
0	9	7
1	19	7
2	56	7
3	202	7
4	660	7
5	4036	7
0	8535	6

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Outputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))

Symmetry

(abs x)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.2MiB live, 1.2MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

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

Compiler

Compiled 7 to 6 computations (14.3% saved)

simplify167.0ms (5.1%)

Memory

7.7MiB live, 150.7MiB allocated; 96ms collecting garbage

Localize:

Found 3 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	18
0	9	18
1	19	18
2	56	18
3	202	18
4	660	18
5	4036	18
0	8535	17

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
x
#s(literal 2 binary64)
#s(literal 1 binary64)

Outputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 #s(literal 2 binary64) (.f64 x x))
(*.f64 x x)
x
#s(literal 2 binary64)
#s(literal 1 binary64)

localize24.0ms (0.7%)

Memory

-13.2MiB live, 32.0MiB allocated; 16ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score
accuracy	0.0	(*.f64 x x)
accuracy	0.00390625	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
accuracy	0.0078125	(.f64 (.f64 x x) #s(literal 2 binary64))

Samples

19.0ms

256×

valid

Compiler

Compiled 20 to 8 computations (60% saved)

Precisions

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

ival-mult: 12.0ms (89.5% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

6.0MiB live, 6.0MiB allocated; 0ms collecting garbage

Counts

3 → 6

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)

Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Calls

3 calls:

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

simplify246.0ms (7.5%)

Memory

-12.6MiB live, 180.7MiB allocated; 92ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	74
1	34	74
2	106	74
3	344	74
4	1299	74
5	7036	74
0	8079	69

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (- (* (* x x) 2) 1) (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (* x x) 2) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (* x x) (*.f64 x x))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

rewrite50.0ms (1.5%)

Memory

8.9MiB live, 54.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
0	9	15
1	34	15
0	234	14

Stop Event

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

Counts

3 → 60

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)

Outputs
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 #s(literal 8 binary64) (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal -1 binary64))) (neg.f64 (+.f64 (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal 1 binary64)))
(/.f64 (fma.f64 #s(literal 8 binary64) (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal -1 binary64)) (+.f64 (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64))))
(fma.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal -1 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (.f64 (.f64 x x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 x (.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(-.f64 (/.f64 (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)) (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64))))
(-.f64 (/.f64 (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 3 binary64)) (+.f64 (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 (fma.f64 #s(literal 2 binary64) (.f64 x x) #s(literal 1 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 2 binary64)))))
(-.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal 1 binary64))
(+.f64 (.f64 #s(literal 2 binary64) (.f64 x x)) #s(literal -1 binary64))
(.f64 (.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x))
(.f64 (.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 #s(literal 2 binary64) x) x)
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 2 binary64)))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 2 binary64)))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) (*.f64 x x)))
(.f64 (.f64 #s(literal 2 binary64) (*.f64 x x)) #s(literal 1 binary64))
(.f64 #s(literal 2 binary64) (.f64 (*.f64 x x) #s(literal 1 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x x))
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 x (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))
(.f64 x (.f64 #s(literal 2 binary64) x))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) (*.f64 x x))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) x (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 #s(literal 1 binary64) (.f64 x x) (.f64 #s(literal 1 binary64) (*.f64 x x)))
(fma.f64 (.f64 x x) #s(literal 1 binary64) (.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 x x (*.f64 x x))
(+.f64 (.f64 #s(literal 1 binary64) (.f64 x x)) (.f64 #s(literal 1 binary64) (.f64 x x)))
(+.f64 (.f64 (.f64 x x) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal 1 binary64)))
(+.f64 (.f64 x x) (.f64 x x))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (pow.f64 x #s(literal 1 binary64)) x)
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))

eval7.0ms (0.2%)

Memory: 17.0MiB live, 17.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 706 to 169 computations (76.1% saved)

prune2.0ms (0.1%)

Memory

6.5MiB live, 6.5MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	63	3	66
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	64	3	67

Accuracy

100.0%

Counts

67 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
▶	52.4%	#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
▶	48.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 28 to 23 computations (17.9% saved)

simplify137.0ms (4.2%)

Memory

-7.8MiB live, 183.4MiB allocated; 35ms collecting garbage

Localize:

Found 6 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 #s(literal 2 binary64) x)
cost-diff	0	(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
cost-diff	0	(*.f64 x x)
cost-diff	0	(.f64 (.f64 x x) #s(literal 2 binary64))
cost-diff	0	#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
cost-diff	0	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	13	45
0	18	45
1	33	45
2	79	45
3	278	43
4	848	43
5	3815	43
0	8162	43

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
x
#s(literal 2 binary64)
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
#s(literal -1 binary64)

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
x
#s(literal 2 binary64)
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
#s(literal -1 binary64)

localize41.0ms (1.2%)

Memory

-8.9MiB live, 93.1MiB allocated; 10ms collecting garbage

Localize:

Found 6 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
accuracy	0.0	(*.f64 #s(literal 2 binary64) x)
accuracy	0.0	(*.f64 x x)
accuracy	0.0078125	(.f64 (.f64 x x) #s(literal 2 binary64))
accuracy	30.448329528599132	#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
accuracy	33.22723364818535	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Samples

18.0ms

256×

valid

Compiler

Compiled 40 to 12 computations (70% saved)

Precisions

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

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

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

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series3.0ms (0.1%)

Memory

9.9MiB live, 9.9MiB allocated; 0ms collecting garbage

Counts

6 → 11

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)

Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 -1))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))
1.0ms	x	@	inf	((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))
1.0ms	x	@	0	((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))

Time

Variable

Point

Expression

1.0ms

-inf

((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))

1.0ms

inf

((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))

1.0ms

((- (* (* x x) 2) 1) (- (* (* x x) 2) 1) (* (* x x) 2) (* x x) (+ (* (* 2 x) x) -1) (* 2 x))

simplify271.0ms (8.3%)

Memory

4.1MiB live, 381.4MiB allocated; 70ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	137
1	47	137
2	130	137
3	440	137
4	1516	137
5	7488	137
0	8475	127

Stop Event

1×	iter limit
1×	node limit

Counts

11 → 11

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 -1))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (- (* (* x x) 2) 1) (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (* x x) 2) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (* x x) (*.f64 x x))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (- (* (* x x) 2) 1) (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx (* 2 x) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (+ (* (* 2 x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

rewrite94.0ms (2.9%)

Memory

-1.3MiB live, 89.2MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	39
0	18	39
1	65	37
0	368	37

Stop Event

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

Counts

6 → 85

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(.f64 (.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(.f64 (.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x))
(.f64 (.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 (*.f64 x x) #s(literal -2 binary64)) #s(literal -1 binary64))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 2 binary64)))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 2 binary64)))
(.f64 (.f64 #s(literal 2 binary64) x) (*.f64 x #s(literal 1 binary64)))
(.f64 (.f64 #s(literal 2 binary64) x) x)
(.f64 (.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 #s(literal 1 binary64) (.f64 (*.f64 x x) #s(literal 2 binary64)))
(.f64 #s(literal 2 binary64) (.f64 (*.f64 x x) #s(literal 1 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x x))
(.f64 x (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))
(.f64 x (.f64 #s(literal 2 binary64) x))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) (*.f64 x x))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) x (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 (.f64 x x) #s(literal 1 binary64) (.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 #s(literal 1 binary64) (.f64 x x) (.f64 #s(literal 1 binary64) (*.f64 x x)))
(fma.f64 x x (*.f64 x x))
(+.f64 (.f64 #s(literal 1 binary64) (.f64 x x)) (.f64 #s(literal 1 binary64) (.f64 x x)))
(+.f64 (.f64 (.f64 x x) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal 1 binary64)))
(+.f64 (.f64 x x) (.f64 x x))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (pow.f64 x #s(literal 1 binary64)) x)
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))) (-.f64 #s(literal -1 binary64) (.f64 (.f64 x x) #s(literal 2 binary64))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64))) (neg.f64 (+.f64 (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64))) (neg.f64 (-.f64 (+.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64)) (.f64 (*.f64 x x) #s(literal -2 binary64)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64))))
(/.f64 (-.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64)) (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64)))
(/.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64)) (+.f64 #s(literal 1 binary64) (-.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) (.f64 (*.f64 x x) #s(literal -2 binary64)))))
(/.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64)) (+.f64 (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))))
(/.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64)) (-.f64 (+.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64)) (.f64 (*.f64 x x) #s(literal -2 binary64))))
(fma.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (.f64 (.f64 x x) #s(literal -2 binary64)) #s(literal -1 binary64) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) x) (.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(fma.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (.f64 (.f64 x x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(-.f64 (/.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64))))
(-.f64 (/.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 3 binary64)) (+.f64 (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 (fma.f64 (.f64 #s(literal 2 binary64) x) x #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)))))
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(-.f64 #s(literal -1 binary64) (.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) x))
(-.f64 #s(literal -1 binary64) (.f64 (neg.f64 (.f64 x x)) #s(literal 2 binary64)))
(-.f64 #s(literal -1 binary64) (.f64 #s(literal -2 binary64) (.f64 x x)))
(-.f64 #s(literal -1 binary64) (.f64 (neg.f64 x) (.f64 #s(literal 2 binary64) x)))
(+.f64 (/.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 3 binary64)) (-.f64 (+.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal -2 binary64)))) (/.f64 #s(literal -1 binary64) (-.f64 (+.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal -2 binary64)))))
(+.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (.f64 (.f64 x x) #s(literal 2 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 x x)

eval30.0ms (0.9%)

Memory: -19.9MiB live, 25.8MiB allocated; 6ms collecting garbage
Compiler: Compiled 1 275 to 228 computations (82.1% saved)

prune3.0ms (0.1%)

Memory

8.9MiB live, 8.9MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	89	1	90
Fresh	0	0	0
Picked	2	1	3
Done	0	0	0
Total	91	2	93

Accuracy

100.0%

Counts

93 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
✓	48.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 15 to 12 computations (20% saved)

simplify175.0ms (5.3%)

Memory

-4.7MiB live, 173.8MiB allocated; 49ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)
cost-diff	0	(fma.f64 (+.f64 x x) x #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	11
0	7	11
1	11	11
2	24	11
3	63	11
4	207	11
5	432	11
6	1509	11
7	4800	11
0	8147	11

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(+.f64 x x)
x
#s(literal -1 binary64)

Outputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal -1 binary64))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x
#s(literal -1 binary64)

localize15.0ms (0.4%)

Memory

33.1MiB live, 33.1MiB allocated; 0ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
accuracy	0.0	(+.f64 x x)

Samples

10.0ms

256×

valid

Compiler

Compiled 14 to 7 computations (50% saved)

Precisions

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

ival-add: 3.0ms (61.6% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series2.0ms (0%)

Memory

4.2MiB live, 4.2MiB allocated; 0ms collecting garbage

Counts

2 → 5

Calls

Call 1

Inputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(+.f64 x x)

Outputs
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 -1))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((+ (* (+ x x) x) -1) (+ x x))
1.0ms	x	@	inf	((+ (* (+ x x) x) -1) (+ x x))
0.0ms	x	@	0	((+ (* (+ x x) x) -1) (+ x x))

simplify192.0ms (5.9%)

Memory

-29.9MiB live, 157.9MiB allocated; 45ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	63
1	30	63
2	67	63
3	248	63
4	1109	63
5	6139	63
0	8479	58

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 -1))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))

Outputs
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 -1))
#s(approx (+ (* (+ x x) x) -1) #s(literal -1 binary64))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (+ (* (+ x x) x) -1) (fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* (+ x x) x) -1) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (+ (* (+ x x) x) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (+ (* (+ x x) x) -1) (.f64 (.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

rewrite51.0ms (1.6%)

Memory

8.5MiB live, 70.2MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	9
0	7	9
1	33	8
0	270	7

Stop Event

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

Counts

2 → 35

Calls

Call 1

Inputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(+.f64 x x)

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

eval4.0ms (0.1%)

Memory: 9.5MiB live, 9.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 462 to 107 computations (76.8% saved)

prune2.0ms (0.1%)

Memory

5.2MiB live, 5.2MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	39	1	40
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	39	3	42

Accuracy

100.0%

Counts

42 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
▶	50.9%	(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
✓	48.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 19 to 16 computations (15.8% saved)

simplify132.0ms (4%)

Memory

-16.6MiB live, 71.8MiB allocated; 17ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	7
0	6	7
1	10	7
2	25	7
3	59	7
4	144	7
5	535	7
6	2849	7
0	8090	7

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
x
#s(literal 2 binary64)
#s(literal -1 binary64)

Outputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
x
#s(literal 2 binary64)
#s(literal -1 binary64)

localize14.0ms (0.4%)

Memory

28.1MiB live, 28.1MiB allocated; 0ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Samples

9.0ms

256×

valid

Compiler

Compiled 10 to 7 computations (30% saved)

Precisions

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

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

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series1.0ms (0%)

Memory

2.1MiB live, 2.1MiB allocated; 0ms collecting garbage

Counts

1 → 5

Calls

Call 1

Inputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Outputs
#s(approx (+ (* x 2) -1) #s(hole binary64 -1))
#s(approx (+ (* x 2) -1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* 2 x)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((+ (* x 2) -1))
0.0ms	x	@	inf	((+ (* x 2) -1))
0.0ms	x	@	0	((+ (* x 2) -1))

simplify176.0ms (5.4%)

Memory

-8.5MiB live, 235.4MiB allocated; 40ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	49
1	32	49
2	68	49
3	133	49
4	509	49
5	2800	49
6	7327	49
0	8145	41

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (+ (* x 2) -1) #s(hole binary64 -1))
#s(approx (+ (* x 2) -1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* 2 x)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

Outputs
#s(approx (+ (* x 2) -1) #s(hole binary64 -1))
#s(approx (+ (* x 2) -1) #s(literal -1 binary64))
#s(approx (+ (* x 2) -1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ (* x 2) -1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* 2 x)))
#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (+ (* x 2) -1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (+ (* x 2) -1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
#s(approx (+ (* x 2) -1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))

rewrite66.0ms (2%)

Memory

-29.6MiB live, 69.2MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4
0	6	4
1	23	4
0	179	4

Stop Event

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

Counts

1 → 14

Calls

Call 1

Inputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

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

eval2.0ms (0.1%)

Memory: 8.0MiB live, 8.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 196 to 55 computations (71.9% saved)

prune2.0ms (0.1%)

Memory

8.6MiB live, 8.6MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	16	1	17
Fresh	0	0	0
Picked	1	0	1
Done	0	2	2
Total	17	3	20

Accuracy

100.0%

Counts

20 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
✓	48.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
	4.8%	#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))

Compiler

Compiled 78 to 43 computations (44.9% saved)

regimes12.0ms (0.4%)

Memory

-15.7MiB live, 30.0MiB allocated; 3ms collecting garbage

Counts

7 → 1

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 x x) #s(literal 2 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Outputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))

Calls

4 calls:

4.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
3.0ms	x
2.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
2.0ms	(*.f64 x x)

Results

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes6.0ms (0.2%)

Memory

18.1MiB live, 18.1MiB allocated; 0ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Outputs
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))

Calls

4 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
1.0ms	(*.f64 x x)
1.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
50.9%	1	`(*.f64 x x)`
50.9%	1	`(.f64 (.f64 x x) #s(literal 2 binary64))`
50.9%	1	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
50.9%	1	`x`

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes5.0ms (0.1%)

Memory

13.2MiB live, 13.2MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x))

Calls

4 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
1.0ms	(*.f64 x x)
1.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
51.3%	2	`(*.f64 x x)`
51.3%	2	`(.f64 (.f64 x x) #s(literal 2 binary64))`
51.3%	2	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
51.3%	2	`x`

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes6.0ms (0.2%)

Memory

-33.2MiB live, 12.8MiB allocated; 3ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Calls

4 calls:

3.0ms	x
1.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
1.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
1.0ms	(*.f64 x x)

Results

Accuracy	Segments	Branch
48.1%	1	`(*.f64 x x)`
48.1%	1	`(.f64 (.f64 x x) #s(literal 2 binary64))`
48.1%	1	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
48.1%	1	`x`

Compiler

Compiled 16 to 13 computations (18.8% saved)

bsearch12.0ms (0.4%)

Memory

31.3MiB live, 31.3MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
11.0ms	0.441337560598375	1678764.7643587661

Samples

6.0ms

144×

valid

Compiler

Compiled 172 to 172 computations (0% saved)

Precisions

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

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

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

simplify55.0ms (1.7%)

Memory

-24.6MiB live, 71.2MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	41
1	29	41
2	69	41
3	236	41
4	1207	41
5	5022	41

Stop Event

1×	node limit

Calls

Call 1

Inputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(if (<=.f64 x #s(literal 3242591731706757/4503599627370496 binary64)) #s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64)) #s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x)))
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Outputs
(fma.f64 (+.f64 x x) x #s(literal -1 binary64))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(if (<=.f64 x #s(literal 3242591731706757/4503599627370496 binary64)) #s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64)) #s(approx (+ (* x 2) -1) (*.f64 #s(literal 2 binary64) x)))
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

derivations84.0ms (2.6%)

Memory

-1.3MiB live, 87.0MiB allocated; 22ms collecting garbage

Stop Event

1×

fuel

Compiler

Compiled 41 to 20 computations (51.2% saved)

preprocess29.0ms (0.9%)

Memory: 7.3MiB live, 61.5MiB allocated; 14ms collecting garbage
Remove: (abs x)
Compiler: Compiled 108 to 60 computations (44.4% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample882.0ms (26.9%)

explain78.0ms (2.4%)

preprocess196.0ms (6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify167.0ms (5.1%)

localize24.0ms (0.7%)

series2.0ms (0.1%)

simplify246.0ms (7.5%)

rewrite50.0ms (1.5%)

eval7.0ms (0.2%)

prune2.0ms (0.1%)

simplify137.0ms (4.2%)

localize41.0ms (1.2%)

series3.0ms (0.1%)

simplify271.0ms (8.3%)

rewrite94.0ms (2.9%)

eval30.0ms (0.9%)

prune3.0ms (0.1%)

simplify175.0ms (5.3%)

localize15.0ms (0.4%)

series2.0ms (0%)

simplify192.0ms (5.9%)

rewrite51.0ms (1.6%)

eval4.0ms (0.1%)

prune2.0ms (0.1%)

simplify132.0ms (4%)

localize14.0ms (0.4%)

series1.0ms (0%)

simplify176.0ms (5.4%)

rewrite66.0ms (2%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

regimes12.0ms (0.4%)

regimes6.0ms (0.2%)

regimes5.0ms (0.1%)

regimes6.0ms (0.2%)

bsearch12.0ms (0.4%)

simplify55.0ms (1.7%)

derivations84.0ms (2.6%)

preprocess29.0ms (0.9%)

end0.0ms (0%)

Profiling