Metrics for Expanding a square

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.2MiB live, 0.2MiB 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 11 to 7 computations (36.4% saved)

sample1.1s (35.3%)

Memory

59.5MiB live, 649.0MiB allocated; 919ms collecting garbage

Samples

279.0ms	1 591×	2	valid
203.0ms	2 422×	1	valid
148.0ms	4 243×	0	valid

Precisions

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

adjust: 129.0ms (33.7% of total)

ival-mult: 96.0ms (25.1% of total)

ival-add: 81.0ms (21.1% of total)

ival-sub: 64.0ms (16.7% of total)

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

exact: 5.0ms (1.3% of total)

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

Bogosity

explain88.0ms (2.7%)

Memory

-10.3MiB live, 88.2MiB allocated; 16ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
123	-	-	`(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))`
0	-	-	`(+.f64 x #s(literal 1 binary64))`
0	-	-	`(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))`	cancellation	123	0

Confusion

	Predicted +	Predicted -
+	123	0
-	0	133

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	123	0	0
-	0	0	133

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	133
1	123

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

22.0ms	152×	1	valid
12.0ms	88×	2	valid
11.0ms	272×	0	valid

Compiler

Compiled 55 to 19 computations (65.5% saved)

Precisions

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

ival-sub: 13.0ms (41.4% of total)

adjust: 8.0ms (25.5% of total)

ival-add: 5.0ms (15.9% of total)

ival-mult: 5.0ms (15.9% of total)

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

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

exact: 0.0ms (0% of total)

preprocess164.0ms (5.1%)

Memory

9.9MiB live, 100.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	7	23
1	23	19
2	95	11
3	510	10
4	2062	10
0	5	9
0	8	9
1	24	7
2	88	5
3	409	5
4	1781	5
0	8239	5

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 9 to 5 computations (44.4% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	55.7%	(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))

Compiler

Compiled 9 to 5 computations (44.4% saved)

simplify150.0ms (4.7%)

Memory

-50.7MiB live, 66.0MiB allocated; 40ms collecting garbage

Localize:

Found 3 expressions of interest:

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

New

Metric

Score

Program

cost-diff

(+.f64 x #s(literal 1 binary64))

cost-diff

(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

cost-diff

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	21
0	8	21
1	24	19
2	88	17
3	409	17
4	1781	17
0	8239	16

Stop Event

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

Calls

Call 1

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

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

localize24.0ms (0.7%)

Memory

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

Localize:

Found 3 expressions of interest:

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

New

Metric

Score

Program

accuracy

0.0

(+.f64 x #s(literal 1 binary64))

accuracy

0.0078125

(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

accuracy

28.332959113774468

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

Samples

7.0ms	76×	1	valid
6.0ms	44×	2	valid
5.0ms	136×	0	valid

Compiler

Compiled 23 to 7 computations (69.6% saved)

Precisions

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

adjust: 4.0ms (35.9% of total)

ival-mult: 3.0ms (26.9% of total)

ival-add: 2.0ms (18% of total)

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

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

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

exact: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

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

Counts

3 → 14

Calls

Call 1

Inputs

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

(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

(+.f64 x #s(literal 1 binary64))

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

Calls

3 calls:

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

simplify156.0ms (4.8%)

Memory

-25.9MiB live, 65.6MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	160
1	100	152
2	305	140
3	1332	140
4	6540	140
0	8255	131

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

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

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

rewrite42.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	19
0	8	15
1	50	15
0	476	13

Stop Event

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

Counts

3 → 84

Calls

Call 1

Inputs

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

(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

(+.f64 x #s(literal 1 binary64))

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

eval30.0ms (0.9%)

Memory: -24.6MiB live, 27.1MiB allocated; 6ms collecting garbage
Compiler: Compiled 1 599 to 311 computations (80.6% saved)

prune5.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (5 fresh and 0 done)

	Pruned	Kept	Total
New	110	5	115
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	111	5	116

Accuracy

100.0%

Counts

116 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 (-.f64 x #s(literal -1 binary64)) x (+.f64 x #s(literal 0 binary64)))
▶	3.5%	(-.f64 #s(approx (* (+ x 1) (+ x 1)) #s(literal 1 binary64)) #s(literal 1 binary64))
▶	100.0%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
▶	53.6%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 x x))
▶	49.2%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 #s(literal 2 binary64) x))

Compiler

Compiled 120 to 74 computations (38.3% saved)

simplify114.0ms (3.5%)

Memory

14.4MiB live, 61.0MiB allocated; 2ms collecting garbage

Localize:

Found 12 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	98
0	30	95
1	59	81
2	201	81
3	837	81
4	4268	81
0	8771	79

Stop Event

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

Calls

Call 1

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

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

localize62.0ms (1.9%)

Memory

-37.5MiB live, 53.3MiB allocated; 6ms collecting garbage

Localize:

Found 12 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 x #s(literal -2 binary64))
accuracy	0.0	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
accuracy	0.01171875	(*.f64 (-.f64 x #s(literal -2 binary64)) x)
accuracy	0.0	(*.f64 x x)
accuracy	29.703338164879497	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 x x))
accuracy	0.0	(*.f64 #s(literal 2 binary64) x)
accuracy	32.53777428560715	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 #s(literal 2 binary64) x))
accuracy	28.332959113774468	(-.f64 #s(approx (* (+ x 1) (+ x 1)) #s(literal 1 binary64)) #s(literal 1 binary64))
accuracy	32.432820716443395	#s(approx (* (+ x 1) (+ x 1)) #s(literal 1 binary64))
accuracy	0.0	(fma.f64 (-.f64 x #s(literal -1 binary64)) x (+.f64 x #s(literal 0 binary64)))
accuracy	0.0	(-.f64 x #s(literal -1 binary64))
accuracy	0.0	(+.f64 x #s(literal 0 binary64))

Samples

23.0ms	76×	1	valid
13.0ms	136×	0	valid
13.0ms	44×	2	valid

Compiler

Compiled 83 to 19 computations (77.1% saved)

Precisions

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

ival-sub: 10.0ms (30.7% of total)

adjust: 9.0ms (27.6% of total)

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

ival-add: 4.0ms (12.3% of total)

exact: 1.0ms (3.1% of total)

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

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

series5.0ms (0.2%)

Memory

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

Counts

12 → 29

Calls

Call 1

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

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

Calls

3 calls:

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

Time

Variable

Point

Expression

2.0ms

-inf

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

1.0ms

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

1.0ms

inf

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

simplify117.0ms (3.6%)

Memory

-2.3MiB live, 89.3MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	63	289
1	140	261
2	540	261
3	3359	261
0	8602	252

Stop Event

1×	iter limit
1×	node limit

Counts

29 → 29

Calls

Call 1

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

Outputs
#s(approx (+ x 0) #s(hole binary64 x))
#s(approx (+ x 0) x)
#s(approx (+ (* (- x -1) x) (+ x 0)) #s(hole binary64 (* 2 x)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 #s(literal 2 binary64) x))
#s(approx (+ (* (- x -1) x) (+ x 0)) #s(hole binary64 (* x (+ 2 x))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(literal 1 binary64))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(hole binary64 (* 2 x)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(hole binary64 (* x (+ 2 x))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 1))
#s(approx (* (+ x 1) (+ x 1)) #s(literal 1 binary64))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 (+ 1 (* 2 x))))
#s(approx (* (+ x 1) (+ x 1)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 (+ 1 (* x (+ 2 x)))))
#s(approx (* (+ x 1) (+ x 1)) (fma.f64 (-.f64 x #s(literal -2 binary64)) 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) #s(hole binary64 (pow x 2)))
#s(approx (* x x) (*.f64 x x))
#s(approx (* (- x -2) x) #s(hole binary64 (* 2 x)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 #s(literal 2 binary64) x))
#s(approx (* (- x -2) x) #s(hole binary64 (* x (+ 2 x))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (- x -2) #s(hole binary64 2))
#s(approx (- x -2) #s(literal 2 binary64))
#s(approx (- x -2) #s(hole binary64 (+ 2 x)))
#s(approx (- x -2) (-.f64 x #s(literal -2 binary64)))
#s(approx (+ (* (- x -1) x) (+ x 0)) #s(hole binary64 (pow x 2)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 x x))
#s(approx (+ (* (- x -1) x) (+ x 0)) #s(hole binary64 (* (pow x 2) (+ 1 (* 2 (/ 1 x))))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) x)
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 x x))
#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(hole binary64 (* (pow x 2) (+ 1 (* 2 (/ 1 x))))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* (+ x 1) (+ x 1)) (*.f64 x x))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 (* (pow x 2) (+ 1 (* 2 (/ 1 x))))))
#s(approx (* (+ x 1) (+ x 1)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (* (+ x 1) (+ x 1)) #s(hole binary64 (* (pow x 2) (+ 1 (+ (* 2 (/ 1 x)) (/ 1 (pow x 2)))))))
#s(approx (* (+ x 1) (+ x 1)) (fma.f64 (-.f64 x #s(literal -2 binary64)) x #s(literal 1 binary64)))
#s(approx (* (- x -2) x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 x x))
#s(approx (* (- x -2) x) #s(hole binary64 (* (pow x 2) (+ 1 (* 2 (/ 1 x))))))
#s(approx (+ (* (- x -1) x) (+ x 0)) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
#s(approx (- x -2) #s(hole binary64 x))
#s(approx (- x -2) x)
#s(approx (- x -2) #s(hole binary64 (* x (+ 1 (* 2 (/ 1 x))))))
#s(approx (- x -2) (-.f64 x #s(literal -2 binary64)))

rewrite24.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	89
0	30	75
0	143	75

Stop Event

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

Counts

12 → 30

Calls

Call 1

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

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

eval23.0ms (0.7%)

Memory: -27.3MiB live, 14.1MiB allocated; 24ms collecting garbage
Compiler: Compiled 695 to 133 computations (80.9% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (2 fresh and 3 done)

	Pruned	Kept	Total
New	44	2	46
Fresh	0	0	0
Picked	2	3	5
Done	0	0	0
Total	46	5	51

Accuracy

100.0%

Counts

51 → 5

Alt Table

Click to see full alt table

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

Compiler

Compiled 62 to 37 computations (40.3% saved)

simplify114.0ms (3.5%)

Memory

35.5MiB live, 78.1MiB allocated; 12ms collecting garbage

Localize:

Found 5 expressions of interest:

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	37
0	17	33
1	38	29
2	142	29
3	659	29
4	3155	29
0	8216	29

Stop Event

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

Calls

Call 1

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

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

localize51.0ms (1.6%)

Memory

-31.7MiB live, 33.1MiB allocated; 9ms collecting garbage

Localize:

Found 5 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(approx (+ x 0) x))
accuracy	0.0	(-.f64 x #s(literal -1 binary64))
accuracy	0.0	#s(approx (+ x 0) x)
accuracy	0.0	(+.f64 x x)
accuracy	32.53777428560715	#s(approx (- (* (+ x 1) (+ x 1)) 1) (+.f64 x x))

Samples

24.0ms	44×	2	valid
10.0ms	76×	1	valid
9.0ms	136×	0	valid

Compiler

Compiled 32 to 14 computations (56.3% saved)

Precisions

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

adjust: 14.0ms (51.6% of total)

ival-add: 5.0ms (18.4% of total)

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

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

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

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

exact: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

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

Counts

5 → 14

Calls

Call 1

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

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

Calls

3 calls:

Time

Variable

Point

Expression

1.0ms

inf

((- (* (+ x 1) (+ x 1)) 1) (+ x x) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

1.0ms

-inf

((- (* (+ x 1) (+ x 1)) 1) (+ x x) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

0.0ms

((- (* (+ x 1) (+ x 1)) 1) (+ x x) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

simplify142.0ms (4.4%)

Memory

5.1MiB live, 52.7MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	38	146
1	92	114
2	322	114
3	1710	114
4	7742	114
0	8792	114

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

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

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

rewrite49.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	34
0	17	28
1	101	22
0	1153	22

Stop Event

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

Counts

5 → 45

Calls

Call 1

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

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

eval5.0ms (0.2%)

Memory: 3.9MiB live, 3.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 946 to 156 computations (83.5% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (2 fresh and 4 done)

	Pruned	Kept	Total
New	50	2	52
Fresh	0	0	0
Picked	0	2	2
Done	1	2	3
Total	51	6	57

Accuracy

100.0%

Counts

57 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(approx (+ x 0) x))
▶	59.8%	(fma.f64 #s(approx (- x -1) x) x #s(approx (+ x 0) x))
✓	49.2%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (+.f64 x x))
✓	100.0%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
✓	53.6%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 x x))
▶	3.5%	#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(literal 0 binary64))

Compiler

Compiled 74 to 45 computations (39.2% saved)

simplify160.0ms (5%)

Memory

-39.3MiB live, 54.6MiB allocated; 4ms collecting garbage

Localize:

Found 4 expressions of interest:

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	35
0	15	31
1	34	27
2	124	27
3	609	27
4	3040	27
0	8218	27

Stop Event

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

Calls

Call 1

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

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

localize34.0ms (1.1%)

Memory

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

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 #s(approx (- x -1) x) x #s(approx (+ x 0) x))
accuracy	0.0	#s(approx (+ x 0) x)
accuracy	30.32362627452048	#s(approx (- x -1) x)
accuracy	61.738477358517095	#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(literal 0 binary64))

Samples

10.0ms	76×	1	valid
9.0ms	44×	2	valid
8.0ms	136×	0	valid

Compiler

Compiled 28 to 13 computations (53.6% saved)

Precisions

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

adjust: 7.0ms (36.6% of total)

ival-add: 4.0ms (20.9% of total)

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

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

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

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

exact: 0.0ms (0% of total)

series2.0ms (0%)

Memory

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

Counts

4 → 13

Calls

Call 1

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

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

Calls

3 calls:

Time

Variable

Point

Expression

1.0ms

inf

((- (* (+ x 1) (+ x 1)) 1) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

0.0ms

-inf

((- (* (+ x 1) (+ x 1)) 1) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

0.0ms

((- (* (+ x 1) (+ x 1)) 1) (+ (* (- x -1) x) (+ x 0)) (- x -1) (+ x 0))

simplify161.0ms (5%)

Memory

4.5MiB live, 63.1MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	36	139
1	90	107
2	320	107
3	1711	107
4	7841	107
0	8080	107

Stop Event

1×	iter limit
1×	node limit

Counts

13 → 13

Calls

Call 1

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

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

rewrite46.0ms (1.4%)

Memory

-27.8MiB live, 19.1MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	33
0	15	27
1	92	25
0	977	25

Stop Event

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

Counts

4 → 17

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 541 to 70 computations (87.1% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	2	2
Done	0	4	4
Total	22	6	28

Accuracy

100.0%

Counts

28 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (-.f64 x #s(literal -1 binary64)) x #s(approx (+ x 0) x))
✓	59.8%	(fma.f64 #s(approx (- x -1) x) x #s(approx (+ x 0) x))
✓	49.2%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (+.f64 x x))
✓	100.0%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 (-.f64 x #s(literal -2 binary64)) x))
✓	53.6%	#s(approx (- (* (+ x 1) (+ x 1)) 1) (*.f64 x x))
✓	3.5%	#s(approx (- (* (+ x 1) (+ x 1)) 1) #s(literal 0 binary64))

Compiler

Compiled 189 to 81 computations (57.1% saved)

regimes11.0ms (0.4%)

Memory

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

Counts

10 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 20 to 13 computations (35% saved)

regimes11.0ms (0.3%)

Memory

-31.3MiB live, 15.5MiB allocated; 2ms collecting garbage

Counts

7 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 20 to 13 computations (35% saved)

regimes8.0ms (0.2%)

Memory

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

Counts

6 → 2

Calls

Call 1

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

Outputs
#s(approx (- (* (+ x 1) (+ x 1)) 1) (+.f64 x x))
(fma.f64 #s(approx (- x -1) x) x #s(approx (+ x 0) x))

Calls

4 calls:

2.0ms	x
2.0ms	(+.f64 x #s(literal 1 binary64))
2.0ms	(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
2.0ms	(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

Results

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

Compiler

Compiled 20 to 13 computations (35% saved)

regimes4.0ms (0.1%)

Memory

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

Counts

5 → 2

Calls

Call 1

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

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

Calls

2 calls:

2.0ms	(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
2.0ms	(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))

Results

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

Compiler

Compiled 16 to 9 computations (43.8% saved)

regimes6.0ms (0.2%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 20 to 13 computations (35% saved)

regimes4.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 20 to 13 computations (35% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	1.0774539635916742	2818254491582.0723

Compiler

Compiled 12 to 9 computations (25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	1.0774539635916742	2818254491582.0723

Compiler

Compiled 12 to 9 computations (25% saved)

simplify34.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	30	120
1	54	120
2	145	96
3	766	96
4	5395	96

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations198.0ms (6.2%)

Memory

-28.3MiB live, 69.6MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 124 to 32 computations (74.2% saved)

preprocess25.0ms (0.8%)

Memory: 17.5MiB live, 17.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 266 to 74 computations (72.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.1s (35.3%)

explain88.0ms (2.7%)

preprocess164.0ms (5.1%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify150.0ms (4.7%)

localize24.0ms (0.7%)

series2.0ms (0.1%)

simplify156.0ms (4.8%)

rewrite42.0ms (1.3%)

eval30.0ms (0.9%)

prune5.0ms (0.1%)

simplify114.0ms (3.5%)

localize62.0ms (1.9%)

series5.0ms (0.2%)

simplify117.0ms (3.6%)

rewrite24.0ms (0.7%)

eval23.0ms (0.7%)

prune3.0ms (0.1%)

simplify114.0ms (3.5%)

localize51.0ms (1.6%)

series2.0ms (0.1%)

simplify142.0ms (4.4%)

rewrite49.0ms (1.5%)

eval5.0ms (0.2%)

prune3.0ms (0.1%)

simplify160.0ms (5%)

localize34.0ms (1.1%)

series2.0ms (0%)

simplify161.0ms (5%)

rewrite46.0ms (1.4%)

eval2.0ms (0.1%)

prune3.0ms (0.1%)

regimes11.0ms (0.4%)

regimes11.0ms (0.3%)

regimes8.0ms (0.2%)

regimes4.0ms (0.1%)

regimes6.0ms (0.2%)

regimes4.0ms (0.1%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

simplify34.0ms (1.1%)

derivations198.0ms (6.2%)

preprocess25.0ms (0.8%)

end0.0ms (0%)

Profiling