Metrics for exp neg sub

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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)

sample887.0ms (58.2%)

Memory

17.6MiB live, 656.1MiB allocated; 946ms collecting garbage

Samples

391.0ms

8 256×

valid

Precisions

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

ival-exp: 69.0ms (36% of total)

ival-mult!: 55.0ms (28.7% of total)

ival-neg: 46.0ms (24% of total)

ival-sub!: 20.0ms (10.4% of total)

adjust: 1.0ms (0.5% of total)

Bogosity

preprocess47.0ms (3.1%)

Memory

-24.7MiB live, 19.2MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
1	57	19
2	220	19
3	939	19

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 12 to 12 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

6 → 14

Calls

Call 1

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

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

Calls

3 calls:

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

Time

Variable

Point

Expression

1.0ms

inf

((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) (- 1 (* x x)) 1 (* x x) x)

1.0ms

((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) (- 1 (* x x)) 1 (* x x) x)

1.0ms

-inf

((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) (- 1 (* x x)) 1 (* x x) x)

rewrite283.0ms (18.6%)

Memory

-12.9MiB live, 195.8MiB allocated; 79ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	52	221
0	57	195
1	324	190
2	2311	190

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

20 → 15

Calls

Call 1

Inputs
(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
(neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)))
(-.f64 #s(literal 1 binary64) (*.f64 x x))
#s(literal 1 binary64)
(*.f64 x x)
x
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (exp -1)))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (exp -1)))))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (+ (exp -1) (* 1/2 (* (pow x 2) (exp -1))))))))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (+ (exp -1) (* (pow x 2) (+ (* 1/6 (* (pow x 2) (exp -1))) (* 1/2 (exp -1)))))))))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 -1))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- 1 (* x x)) #s(hole binary64 1))
#s(approx (- 1 (* x x)) #s(hole binary64 (+ 1 (* -1 (pow x 2)))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (exp (- (pow x 2) 1))))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (- 1 (* x x)) #s(hole binary64 (* -1 (pow x 2))))
#s(approx (- 1 (* x x)) #s(hole binary64 (* (pow x 2) (- (/ 1 (pow x 2)) 1))))

Outputs
(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
(neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)))
(-.f64 #s(literal 1 binary64) (*.f64 x x))
#s(literal 1 binary64)
(*.f64 x x)
x
#s(approx (neg (- 1 (* x x))) #s(literal -1 binary64))
#s(approx (neg (- 1 (* x x))) (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
#s(approx (- 1 (* x x)) #s(literal 1 binary64))
#s(approx (- 1 (* x x)) (-.f64 #s(literal 1 binary64) (*.f64 x x)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (exp (neg (- 1 (* x x)))) (exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)))))
#s(approx (neg (- 1 (* x x))) (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
#s(approx (- 1 (* x x)) (-.f64 #s(literal 1 binary64) (*.f64 x x)))

eval1.0ms (0%)

Memory: 1.5MiB live, 1.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 50 to 32 computations (36% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	6	1	7
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	6	2	8

Accuracy

100.0%

Counts

8 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
▶	50.0%	(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))

Compiler

Compiled 14 to 14 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 9

Calls

Call 1

Inputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))
#s(approx (neg (- 1 (* x x))) #s(literal -1 binary64))
#s(literal -1 binary64)

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) -1)
0.0ms	x	@	-inf	((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) -1)
0.0ms	x	@	0	((exp (neg (- 1 (* x x)))) (neg (- 1 (* x x))) -1)

rewrite211.0ms (13.8%)

Memory

39.2MiB live, 219.4MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	40	168
0	41	154
1	275	149
2	2085	149

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

12 → 4

Calls

Call 1

Inputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))
#s(approx (neg (- 1 (* x x))) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (exp -1)))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (exp -1)))))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (+ (exp -1) (* 1/2 (* (pow x 2) (exp -1))))))))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (+ (exp -1) (* (pow x 2) (+ (exp -1) (* (pow x 2) (+ (* 1/6 (* (pow x 2) (exp -1))) (* 1/2 (exp -1)))))))))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 -1))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (exp (neg (- 1 (* x x)))) #s(hole binary64 (exp (- (pow x 2) 1))))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 (pow x 2)))
#s(approx (neg (- 1 (* x x))) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Outputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))
#s(approx (neg (- 1 (* x x))) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (neg (- 1 (* x x))) #s(literal -1 binary64))

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	1	1
Total	2	2

Accuracy

100.0%

Counts

2 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))
✓	50.0%	(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))

Compiler

Compiled 27 to 27 computations (0% saved)

regimes27.0ms (1.8%)

Memory

-35.4MiB live, 10.2MiB allocated; 6ms collecting garbage

Counts

2 → 1

Calls

Call 1

Inputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))
(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))

Outputs
(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))

Calls

5 calls:

23.0ms	(neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)))
1.0ms	x
1.0ms	(*.f64 x x)
1.0ms	(-.f64 #s(literal 1 binary64) (*.f64 x x))
1.0ms	(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))

Results

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

Compiler

Compiled 18 to 18 computations (0% saved)

regimes5.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))

Outputs
(exp.f64 #s(approx (neg (- 1 (* x x))) #s(literal -1 binary64)))

Calls

5 calls:

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

Results

Accuracy	Segments	Branch
50.0%	1	`(*.f64 x x)`
50.0%	1	`(-.f64 #s(literal 1 binary64) (*.f64 x x))`
50.0%	1	`(neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)))`
50.0%	1	`(exp.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))))`
50.0%	1	`x`

Compiler

Compiled 18 to 18 computations (0% saved)

derivations12.0ms (0.8%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 13 to 13 computations (0% saved)

preprocess45.0ms (2.9%)

Memory: 5.7MiB live, 57.6MiB allocated; 20ms collecting garbage
Remove: (abs x)
Compiler: Compiled 47 to 47 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample887.0ms (58.2%)

preprocess47.0ms (3.1%)

series3.0ms (0.2%)

rewrite283.0ms (18.6%)

eval1.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite211.0ms (13.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes27.0ms (1.8%)

regimes5.0ms (0.3%)

derivations12.0ms (0.8%)

preprocess45.0ms (2.9%)

end0.0ms (0%)

Profiling