log(x)*20/log(10)

Time bar (total: 1.3s)

start0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%50.4%49.6%0%0%0%0
0%0%50.4%49.6%0%0%0%1
100%25.2%0%49.6%0%25.2%0%2
Compiler

Compiled 12 to 10 computations (16.7% saved)

sample996.0ms (75.4%)

Memory
13.1MiB live, 403.8MiB allocated
Samples
460.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 279.0ms
ival-log: 125.0ms (44.8% of total)
ival-mult: 65.0ms (23.3% of total)
ival-<=: 57.0ms (20.4% of total)
exact: 16.0ms (5.7% of total)
ival-and: 12.0ms (4.3% of total)
ival-assert: 3.0ms (1.1% of total)
Bogosity

explain99.0ms (7.5%)

Memory
-2.8MiB live, 64.1MiB allocated
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(*.f64 (log.f64 x) #s(literal 20 binary64))
00-0-(log.f64 x)
00-0-#s(literal 20 binary64)
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
24.0ms512×0valid
Compiler

Compiled 32 to 20 computations (37.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 12.0ms
ival-log: 7.0ms (56.3% of total)
ival-mult: 4.0ms (32.2% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess13.0ms (1%)

Memory
22.8MiB live, 22.8MiB allocated
Algorithm
egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0610
11810
22810
33510
44210
55110
66110
76510
044
064
174
074
Stop Event
iter limit
saturated
iter limit
saturated
Calls
Call 1
Inputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
Outputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
(*.f64 #s(literal 20 binary64) (log.f64 x))
Compiler

Compiled 4 to 4 computations (0% saved)

eval0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Compiler

Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory
1.1MiB live, 1.1MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.5%
(*.f64 (log.f64 x) #s(literal 20 binary64))
Compiler

Compiled 4 to 4 computations (0% saved)

simplify3.0ms (0.2%)

Memory
4.0MiB live, 4.0MiB allocated
Algorithm
egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(log.f64 x)
cost-diff0
(*.f64 (log.f64 x) #s(literal 20 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
068
178
078
Stop Event
iter limit
saturated
iter limit
Calls
Call 1
Inputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
(log.f64 x)
x
#s(literal 20 binary64)
Outputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
(*.f64 #s(literal 20 binary64) (log.f64 x))
(log.f64 x)
x
#s(literal 20 binary64)

localize75.0ms (5.7%)

Memory
-24.0MiB live, 28.4MiB allocated
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0
(log.f64 x)
accuracy0.30859375
(*.f64 (log.f64 x) #s(literal 20 binary64))
Samples
12.0ms256×0valid
Compiler

Compiled 18 to 10 computations (44.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-log: 4.0ms (66.5% of total)
ival-mult: 2.0ms (33.2% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series49.0ms (3.7%)

Memory
47.2MiB live, 47.2MiB allocated
Counts
2 → 24
Calls
Call 1
Inputs
#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())
#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())
Outputs
#s(alt (* 20 (log x)) (taylor 0 x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (log x)) (taylor 0 x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (log x)) (taylor 0 x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (log x)) (taylor 0 x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (* -20 (log (/ 1 x))) (taylor inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* -20 (log (/ 1 x))) (taylor inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* -20 (log (/ 1 x))) (taylor inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* -20 (log (/ 1 x))) (taylor inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (* 20 (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 20 (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 (log.f64 x) #s(literal 20 binary64)) (patch (*.f64 (log.f64 x) #s(literal 20 binary64)) #<representation binary64>) () ())) ())
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ())
Calls

3 calls:

TimeVariablePointExpression
24.0ms
x
@0
((* (log x) 20) (log x))
18.0ms
x
@-inf
((* (log x) 20) (log x))
6.0ms
x
@inf
((* (log x) 20) (log x))

simplify14.0ms (1%)

Memory
1.7MiB live, 1.7MiB allocated
Algorithm
egg-herbie
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
017120
134112
257112
398112
4139112
5174112
6227112
7276112
8348112
9395112
10422112
0422112
Stop Event
iter limit
saturated
Counts
24 → 24
Calls
Call 1
Inputs
(* 20 (log x))
(* 20 (log x))
(* 20 (log x))
(* 20 (log x))
(log x)
(log x)
(log x)
(log x)
(* -20 (log (/ 1 x)))
(* -20 (log (/ 1 x)))
(* -20 (log (/ 1 x)))
(* -20 (log (/ 1 x)))
(* -1 (log (/ 1 x)))
(* -1 (log (/ 1 x)))
(* -1 (log (/ 1 x)))
(* -1 (log (/ 1 x)))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(+ (log -1) (* -1 (log (/ -1 x))))
(+ (log -1) (* -1 (log (/ -1 x))))
(+ (log -1) (* -1 (log (/ -1 x))))
(+ (log -1) (* -1 (log (/ -1 x))))
Outputs
(* 20 (log x))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* 20 (log x))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* 20 (log x))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* 20 (log x))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(log x)
(log.f64 x)
(log x)
(log.f64 x)
(log x)
(log.f64 x)
(log x)
(log.f64 x)
(* -20 (log (/ 1 x)))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* -20 (log (/ 1 x)))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* -20 (log (/ 1 x)))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* -20 (log (/ 1 x)))
(*.f64 (log.f64 x) #s(literal 20 binary64))
(* -1 (log (/ 1 x)))
(log.f64 x)
(* -1 (log (/ 1 x)))
(log.f64 x)
(* -1 (log (/ 1 x)))
(log.f64 x)
(* -1 (log (/ 1 x)))
(log.f64 x)
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 (-.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)) (log.f64 #s(literal -1 binary64))) #s(literal -20 binary64))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 (-.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)) (log.f64 #s(literal -1 binary64))) #s(literal -20 binary64))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 (-.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)) (log.f64 #s(literal -1 binary64))) #s(literal -20 binary64))
(* 20 (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 (-.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)) (log.f64 #s(literal -1 binary64))) #s(literal -20 binary64))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))

rewrite13.0ms (1%)

Memory
5.2MiB live, 5.2MiB allocated
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
046
066
176
076
Stop Event
iter limit
saturated
iter limit
Counts
2 → 3
Calls
Call 1
Inputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
(log.f64 x)
Outputs
#<batchref>
#<batchref>
#<batchref>

eval2.0ms (0.2%)

Memory
2.2MiB live, 2.2MiB allocated
Compiler

Compiled 172 to 19 computations (89% saved)

prune2.0ms (0.2%)

Memory
2.6MiB live, 2.6MiB allocated
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New27027
Fresh000
Picked011
Done000
Total27128
Accuracy
99.5%
Counts
28 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.5%
(*.f64 (log.f64 x) #s(literal 20 binary64))
Compiler

Compiled 8 to 8 computations (0% saved)

simplify22.0ms (1.6%)

Memory
17.9MiB live, 17.9MiB allocated
Algorithm
egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
044
154
Stop Event
saturated
Calls
Call 1
Inputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
Outputs
(*.f64 (log.f64 x) #s(literal 20 binary64))
(*.f64 #s(literal 20 binary64) (log.f64 x))

soundness0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Stop Event
done
Compiler

Compiled 4 to 4 computations (0% saved)

preprocess31.0ms (2.4%)

Memory
-55.3MiB live, 21.0MiB allocated
Compiler

Compiled 16 to 16 computations (0% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...